Thematische Bibliographien / Quasi-Kernel

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Quasi-Kernel“

Autor: Grafiati

Veröffentlicht am 18. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Quasi-Kernel" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Quasi-Kernel"

Wang, Dongdong, und Pengjie Chen. „Quasi-convex reproducing kernel meshfree method“. Computational Mechanics 54, Nr. 3 (19.04.2014): 689–709. http://dx.doi.org/10.1007/s00466-014-1022-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yreux, Edouard, und Jiun-Shyan Chen. „A quasi-linear reproducing kernel particle method“. International Journal for Numerical Methods in Engineering 109, Nr. 7 (14.07.2016): 1045–64. http://dx.doi.org/10.1002/nme.5319.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ai, Jiangdong, Stefanie Gerke, Gregory Gutin, Anders Yeo und Yacong Zhou. „Results on the small quasi-kernel conjecture“. Discrete Mathematics 346, Nr. 7 (Juli 2023): 113435. http://dx.doi.org/10.1016/j.disc.2023.113435.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wegkamp, Marten H. „Quasi-universal bandwidth selection for kernel density estimators“. Canadian Journal of Statistics 27, Nr. 2 (Juni 1999): 409–20. http://dx.doi.org/10.2307/3315649.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Qinghui, Hu, Wei Shiwei, Li Zhiyuan und Liu Xiaogang. „Quasi-newton method for L multiple kernel learning“. Neurocomputing 194 (Juni 2016): 218–26. http://dx.doi.org/10.1016/j.neucom.2016.01.079.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Jiecheng, Yantong Liu und Jincai Chang. „An Improved Model for Kernel Density Estimation Based on Quadtree and Quasi-Interpolation“. Mathematics 10, Nr. 14 (08.07.2022): 2402. http://dx.doi.org/10.3390/math10142402.

Der volle Inhalt der Quelle

Annotation:

There are three main problems for classical kernel density estimation in its application: boundary problem, over-smoothing problem of high (low)-density region and low-efficiency problem of large samples. A new improved model of multivariate adaptive binned quasi-interpolation density estimation based on a quadtree algorithm and quasi-interpolation is proposed, which can avoid the deficiency in the classical kernel density estimation model and improve the precision of the model. The model is constructed in three steps. Firstly, the binned threshold is set from the three dimensions of sample number, width of bins and kurtosis, and the bounded domain is adaptively partitioned into several non-intersecting bins (intervals) by using the iteration idea from the quadtree algorithm. Then, based on the good properties of the quasi-interpolation, the kernel functions of the density estimation model are constructed by introducing the theory of quasi-interpolation. Finally, the binned coefficients of the density estimation model are constructed by using the idea of frequency replacing probability. Simulation of the Monte Carlo method shows that the proposed non-parametric model can effectively solve the three shortcomings of the classical kernel density estimation model and significantly improve the prediction accuracy and calculation efficiency of the density function for large samples.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mazzoni, Thomas, und Elmar Reucher. „Quasi-continuous maximum entropy distribution approximation with kernel density“. International Journal of Information and Decision Sciences 3, Nr. 4 (2011): 335. http://dx.doi.org/10.1504/ijids.2011.043026.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Winnewisser, Manfred, Brenda P. Winnewisser, Ivan R. Medvedev, Frank C. De Lucia, Stephen C. Ross und Larry M. Bates. „The hidden kernel of molecular quasi-linearity: Quantum monodromy“. Journal of Molecular Structure 798, Nr. 1-3 (Oktober 2006): 1–26. http://dx.doi.org/10.1016/j.molstruc.2006.06.036.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yam, Wun Kwan, Kin Long Fong, Juntao Wang, Siew Ann Cheong und K. Y. Michael Wong. „Intrinsic Quasi-Periodicity in Hong Kong Housing Price and Its Prediction“. New Mathematics and Natural Computation 16, Nr. 03 (November 2020): 645–55. http://dx.doi.org/10.1142/s1793005720500398.

Der volle Inhalt der Quelle

Annotation:

Housing price time series is worth studying as it is closely related to the well-being of society. In the Hong Kong housing market from 1992 to 2010, signs of quasi-periodicity in housing price and transaction volume can be observed. We find that there is an overall periodicity of approximately 30 months in housing price changes and a strong lead–lag relationship between housing price and transaction volume. Analysis of the cross-covariance of the housing price, transaction volume and prime lending rate reveals that this quasi-periodicity is potentially driven by prime lending rates. Incorporation of quasi-periodicity into the kernel of Gaussian processes further enables us to construct a predictive model of the Hong Kong housing price trends that outperforms other traditional kernel functions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Matsutani, Shigeki. „On Time Development of a Quasi-Quantum Particle in Quartic Potential (x2-a2)2/2g“. Reviews in Mathematical Physics 09, Nr. 08 (November 1997): 943–91. http://dx.doi.org/10.1142/s0129055x97000336.

Der volle Inhalt der Quelle

Annotation:

In this article, I have precisely considered the time development of a quantum particle (of excited states) in the quartic potential (x2-a2)2/2g by means of the semiclassical path integral method. Using the elliptic functions, I have evaluated the tunneling phenomena and the quasi-quantum fluctuation around the quasi-classical paths. I found that the quasi-quantum fluctuation is expressed by the Lamé equation and was exactly solved. Then I have shown that the obtained kernel function is in agreement with exact solutions of the linear potential and the quadratic potential under certain limits as no time-development kernel function of the quartic potential has ever been found which contains the exact solution of the linear and the quadratic potential. It is natural because the classical motion in the quartic potential becomes those of the linear and the quadratic potential under the limits. Thus the obtained time-development kernel function also consists of the energy representation of the Green function of the quartic potential in the semiclassical path integral method given by Carlitz and Nicole (Ann. Phys.164 (1985) 411), which agrees with that of the WKB method in the operator formalism.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Quasi-Kernel"

Eftekharzadeh, Ardeshir. „Self-force and noise-kernel in curved space-time using quasi-local expansion methods“. College Park, Md. : University of Maryland, 2007. http://hdl.handle.net/1903/6852.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph. D.) -- University of Maryland, College Park, 2007.
Thesis research directed by: Physics. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Collier, Nathaniel O. „The Quasi-Uniformity Condition and Three-Dimensional Geometry Representation as it Applies to the Reproducing Kernel Element Method“. Scholar Commons, 2009. https://scholarcommons.usf.edu/etd/1904.

Der volle Inhalt der Quelle

Annotation:

The Reproducing Kernel Element Method (RKEM) is a hybrid between finite elements and meshfree methods that provides shape functions of arbitrary order and continuity yet retains the Kronecker-delta property. To achieve these properties, the underlying mesh must meet certain regularity constraints, unique to RKEM. The aim of this dissertation is to develop a precise definition of these constraints, and a general algorithm for assessing a mesh is developed. This check is a critical step in the use of RKEM in any application. The general checking algorithm is made more specific to apply to two-dimensional triangular meshes with circular supports and to three-dimensional tetrahedral meshes with spherical supports. The checking algorithm features the output of the uncovered regions that are used to develop a mesh-mending technique for fixing offending meshes. The specific check is used in conjunction with standard quality meshing techniques to produce meshes suitable for use with RKEM. The RKEM quasi-uniformity definitions enable the use of RKEM in solving Galerkin weak forms as well as in general interpolation applications, such as the representation of geometries. A procedure for determining a RKEM representation of discrete point sets is presented with results for surfaces in three-dimensions. This capability is important to the analysis of geometries such as patient-specific organs or other biological objects.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Roy Chih Chung. „Adaptive Kernel Functions and Optimization Over a Space of Rank-One Decompositions“. Thesis, Université d'Ottawa / University of Ottawa, 2017. http://hdl.handle.net/10393/36975.

Der volle Inhalt der Quelle

Annotation:

The representer theorem from the reproducing kernel Hilbert space theory is the origin of many kernel-based machine learning and signal modelling techniques that are popular today. Most kernel functions used in practical applications behave in a homogeneous manner across the domain of the signal of interest, and they are called stationary kernels. One open problem in the literature is the specification of a non-stationary kernel that is computationally tractable. Some recent works solve large-scale optimization problems to obtain such kernels, and they often suffer from non-identifiability issues in their optimization problem formulation. Many practical problems can benefit from using application-specific prior knowledge on the signal of interest. For example, if one can adequately encode the prior assumption that edge contours are smooth, one does not need to learn a finite-dimensional dictionary from a database of sampled image patches that each contains a circular object in order to up-convert images that contain circular edges. In the first portion of this thesis, we present a novel method for constructing non-stationary kernels that incorporates prior knowledge. A theorem is presented that ensures the result of this construction yields a symmetric and positive-definite kernel function. This construction does not require one to solve any non-identifiable optimization problems. It does require one to manually design some portions of the kernel while deferring the specification of the remaining portions to when an observation of the signal is available. In this sense, the resultant kernel is adaptive to the data observed. We give two examples of this construction technique via the grayscale image up-conversion task where we chose to incorporate the prior assumption that edge contours are smooth. Both examples use a novel local analysis algorithm that summarizes the p-most dominant directions for a given grayscale image patch. The non-stationary properties of these two types of kernels are empirically demonstrated on the Kodak image database that is popular within the image processing research community. Tensors and tensor decomposition methods are gaining popularity in the signal processing and machine learning literature, and most of the recently proposed tensor decomposition methods are based on the tensor power and alternating least-squares algorithms, which were both originally devised over a decade ago. The algebraic approach for the canonical polyadic (CP) symmetric tensor decomposition problem is an exception. This approach exploits the bijective relationship between symmetric tensors and homogeneous polynomials. The solution of a CP symmetric tensor decomposition problem is a set of p rank-one tensors, where p is fixed. In this thesis, we refer to such a set of tensors as a rank-one decomposition with cardinality p. Existing works show that the CP symmetric tensor decomposition problem is non-unique in the general case, so there is no bijective mapping between a rank-one decomposition and a symmetric tensor. However, a proposition in this thesis shows that a particular space of rank-one decompositions, SE, is isomorphic to a space of moment matrices that are called quasi-Hankel matrices in the literature. Optimization over Riemannian manifolds is an area of optimization literature that is also gaining popularity within the signal processing and machine learning community. Under some settings, one can formulate optimization problems over differentiable manifolds where each point is an equivalence class. Such manifolds are called quotient manifolds. This type of formulation can reduce or eliminate some of the sources of non-identifiability issues for certain optimization problems. An example is the learning of a basis for a subspace by formulating the solution space as a type of quotient manifold called the Grassmann manifold, while the conventional formulation is to optimize over a space of full column rank matrices. The second portion of this thesis is about the development of a general-purpose numerical optimization framework over SE. A general-purpose numerical optimizer can solve different approximations or regularized versions of the CP decomposition problem, and they can be applied to tensor-related applications that do not use a tensor decomposition formulation. The proposed optimizer uses many concepts from the Riemannian optimization literature. We present a novel formulation of SE as an embedded differentiable submanifold of the space of real-valued matrices with full column rank, and as a quotient manifold. Riemannian manifold structures and tangent space projectors are derived as well. The CP symmetric tensor decomposition problem is used to empirically demonstrate that the proposed scheme is indeed a numerical optimization framework over SE. Future investigations will concentrate on extending the proposed optimization framework to handle decompositions that correspond to non-symmetric tensors.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Desrumaux, Pierre-François. „Méthodes statistiques pour l’estimation du rendement paramétrique des circuits intégrés analogiques et RF“. Thesis, Montpellier 2, 2013. http://www.theses.fr/2013MON20126/document.

Der volle Inhalt der Quelle

Annotation:

De nombreuses sources de variabilité impactent la fabrication des circuits intégrés analogiques et RF et peuvent conduire à une dégradation du rendement. Il est donc nécessaire de mesurer leur influence le plus tôt possible dans le processus de fabrications. Les méthodes de simulation statistiques permettent ainsi d'estimer le rendement paramétrique des circuits durant la phase de conception. Cependant, les méthodes traditionnelles telles que la méthode de Monte Carlo ne sont pas assez précises lorsqu'un faible nombre de circuits est simulé. Par conséquent, il est nécessaire de créer un estimateur précis du rendement paramétrique basé sur un faible nombre de simulations. Dans cette thèse, les méthodes statistiques existantes provenant à la fois de publications en électroniques et non-Électroniques sont d'abord décrites et leurs limites sont mises en avant. Ensuite, trois nouveaux estimateurs de rendement sont proposés: une méthode de type quasi-Monte Carlo avec tri automatique des dimensions, une méthode des variables de contrôle basée sur l'estimation par noyau, et une méthode par tirage d'importance. Les trois méthodes reposent sur un modèle mathématique de la métrique de performance du circuit qui est construit à partir d'un développement de Taylor à l'ordre un. Les résultats théoriques et expérimentaux obtenus démontrent la supériorité des méthodes proposées par rapport aux méthodes existantes, à la fois en terme de précision de l'estimateur et en terme de réduction du nombre de simulations de circuits
Semiconductor device fabrication is a complex process which is subject to various sources of variability. These variations can impact the functionality and performance of analog integrated circuits, which leads to yield loss, potential chip modifications, delayed time to market and reduced profit. Statistical circuit simulation methods enable to estimate the parametric yield of the circuit early in the design stage so that corrections can be done before manufacturing. However, traditional methods such as Monte Carlo method and corner simulation have limitations. Therefore an accurate analog yield estimate based on a small number of circuit simulations is needed. In this thesis, existing statistical methods from electronics and non-Electronics publications are first described. However, these methods suffer from sever drawbacks such as the need of initial time-Consuming circuit simulations, or a poor scaling with the number of random variables. Second, three novel statistical methods are proposed to accurately estimate the parametric yield of analog/RF integrated circuits based on a moderate number of circuit simulations: An automatically sorted quasi-Monte Carlo method, a kernel-Based control variates method and an importance sampling method. The three methods rely on a mathematical model of the circuit performance metric which is constructed based on a truncated first-Order Taylor expansion. This modeling technique is selected as it requires a minimal number of SPICE-Like circuit simulations. Both theoretical and simulation results show that the proposed methods lead to significant speedup or improvement in accuracy compared to other existing methods

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Maffray, Frédéric. „Une étude structurelle des graphes parfaits : [thèse soutenue sur un ensemble de travaux]“. Grenoble 1, 1992. http://www.theses.fr/1992GRE10158.

Der volle Inhalt der Quelle

Annotation:

Nous introduisons de nouvelles classes de graphes parfaits; établissons les relations d'inclusion entre elles; et, dans plusieurs cas, donnons des algorithmes polynomiaux qui résolvent les problèmes classiques associés à ces classes. Nous considérons tout d'abord le problème de l'existence d'un noyau dans un graphe parfait muni d'une orientation dite normale. Ensuite nous nous intéressons aux graphes de quasi-parité, et montrons que certaines classes de graphes parfaits récemment introduites en font partie. Nous présentons de nouvelles propriétés des chemins à quatre sommets d'un graphe qui entraînent l'ordonnabilité parfaite. Nous introduisons la notion de prédomination entre les sommets d'un graphe, et explorons ses implications dans la théorie des graphes parfaits. En particulier, une nouvelle caractérisation des graphes parfaits en est déduite. Finalement, nous étudions les relations entre certaines fonctions booléennes et les graphes parfaits

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bailera, Martín Ivan. „Hadamard, quasi-Hadamard, and generalized Hadamard full propelinear codes“. Doctoral thesis, TDX (Tesis Doctorals en Xarxa), 2020. http://hdl.handle.net/10803/670384.

Der volle Inhalt der Quelle

Annotation:

Aquesta tesi pertany als camps de la combinatòria algebraica i de la teoria matemàtica de la informació. Motivada per l’avantatge computacional de l’estructura full propelinear, estudiem diferents tipus de codis correctors d’errors dotats d’aquesta estructura. Com que un codi full propelinear és també un grup, és possible generar el codi a partir de les paraules associades als generadors com a grup, fins i tot si el codi és no lineal. Això ofereix els beneficis d’emmagatzematge d’un codi lineal. Rifà i Suárez van definir els codis full propelinear sobre matrius Hadamard binàries (HFP-codis) i van provar una equivalència amb els grups Hadamard. L’existència de matrius Hadamard d’ordres múltiple de quatre segueix sent un problema obert. Per tant, l’estudi de nous codis Hadamard pot contribuir a abordar la conjectura de Hadamard. Un codi amb una estructura full propelinear està compost per dos conjunts; paraules i permutacions. Definim el grup associat d’un HFP-codi com el grup format per les permutacions. Primerament, estudiem els HFP-codis amb un grup associat fixat. El següent pas és generalitzar a cossos finits els HFP-codis binaris. Després vam provar que l’existència de codis Hadamard full propelinear generalitzats és equivalent a l’existència de conjunts de diferències relatius amb paràmetres (v,w,v,v/w). A més, construïm famílies infinites de codis Hadamard full propelinear generalitzats no lineals. Finalment, definim el concepte de codi quasi-Hadamard full propelinear. També donem una equivalència entre els grups quasi-Hadamard i els codis quasi-Hadamard full propelinear. En tots els codis estudiats, analitzem el rang i la dimensió del nucli. Dos paràmetres que proporcionen informació sobre la linealitat d’un codi i sobre la noequivalència de codis.
Esta tesis pertenece a los campos de la combinatoria algebraica y de la teoría matemática de la información. Motivada por la ventaja computacional de la estructura full propelinear, estudiamos diferentes tipos de códigos correctores de errores dotados de dicha estructura. Como un código full propelinear es también un grupo, es posible generar el código a partir de las palabras asociadas a los generadores como grupo, incluso si el código es no lineal. Esto ofrece los beneficios de almacenamiento de un código lineal. Rifà y Suárez definieron los códigos full propelinear sobre matrices Hadamard binarias (HFP-códigos) y probaron una equivalencia con los grupos Hadamard. La existencia de matrices Hadamard de órdenes múltiplo de cuatro sigue siendo un problema abierto. Por tanto, el estudio de nuevos códigos Hadamard puede contribuir a abordar la conjetura de Hadamard. Un código con una estructura full propelinear está compuesto por dos conjuntos; palabras y permutaciones. Definimos el grupo asociado de un HFP-código como el grupo formado por las permutaciones. Primeramente, estudiamos los HFP-códigos con un grupo asociado fijado. El siguiente paso es generalizar a cuerpos finitos los HFP-códigos binarios. Después probamos que la existencia de códigos Hadamard full propelinear generalizados es equivalente a la existencia de conjuntos de diferencias relativos con parámetros (v,w,v,v/w). Además, construimos familias infinitas de códigos Hadamard full propelinear generalizados no lineales. Finalmente, definimos el concepto de código quasi-Hadamard full propelinear. También damos una equivalencia entre los grupos quasi-Hadamard y los códigos quasi-Hadamard full propelinear. En todos los códigos estudiados, analizamos el rango y la dimensión del núcleo. Dos parámetros que proporcionan información sobre la linealidad de un código y sobre la no equivalencia de códigos.
This thesis belongs to the fields of algebraic combinatorics and mathematical information theory. Motivated by the computational advantage of the full propelinear structure, we study different kinds of error-correcting codes endowed with this structure. Since a full propelinear code is also a group, it is possible to generate the code from the codewords associated to the generators as a group, even if the code is nonlinear. This offers the data storage benefits of a linear code. Rifà and Suárez introduced full propelinear codes based on binary Hadamard matrices (HFP-codes) and they proved an equivalence with Hadamard groups. The existence of Hadamard matrices of orders a multiple of four remains an open problem. Therefore, the study of new Hadamard codes may contribute to address the Hadamard conjecture. A code with a full propelinear structure is composed of two sets, i.e., codewords and permutations. We define the associated group of an HFP-code as the group comprised of the permutations. Firstly, we study the HFP-codes with a fixed associated group. The next step is to generalize the binary HFP-codes to finite fields. Subsequently, we prove that the existence of generalized Hadamard full propelinear codes is equivalent to the existence of central relative (v,w,v,v/w)-difference sets. Furthermore, we build infinite families of nonlinear generalized Hadamard full propelinear codes. Finally, we introduce the concept of quasi-Hadamard full propelinear code. We also give an equivalence between quasi-Hadamard groups and quasi-Hadamard full propelinear codes. In all codes studied, we analyze the rank and the dimension of the kernel. Two parameters that provide information about the linearity of a code, and also about the nonequivalence of codes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chen, Li. „Quasi transformées de Riesz, espaces de Hardy et estimations sous-gaussiennes du noyau de la chaleur“. Phd thesis, Université Paris Sud - Paris XI, 2014. http://tel.archives-ouvertes.fr/tel-01001868.

Der volle Inhalt der Quelle

Annotation:

Dans cette thèse nous étudions les transformées de Riesz et les espaces de Hardy associés à un opérateur sur un espace métrique mesuré. Ces deux sujets sont en lien avec des estimations du noyau de la chaleur associé à cet opérateur. Dans les Chapitres 1, 2 et 4, on étudie les transformées quasi de Riesz sur les variétés riemannienne et sur les graphes. Dans le Chapitre 1, on prouve que les quasi transformées de Riesz sont bornées dans Lp pour 1

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ahmed, Mohamed Salem. „Contribution à la statistique spatiale et l'analyse de données fonctionnelles“. Thesis, Lille 3, 2017. http://www.theses.fr/2017LIL30047/document.

Der volle Inhalt der Quelle

Annotation:

Ce mémoire de thèse porte sur la statistique inférentielle des données spatiales et/ou fonctionnelles. En effet, nous nous sommes intéressés à l’estimation de paramètres inconnus de certains modèles à partir d’échantillons obtenus par un processus d’échantillonnage aléatoire ou non (stratifié), composés de variables indépendantes ou spatialement dépendantes.La spécificité des méthodes proposées réside dans le fait qu’elles tiennent compte de la nature de l’échantillon étudié (échantillon stratifié ou composé de données spatiales dépendantes).Tout d’abord, nous étudions des données à valeurs dans un espace de dimension infinie ou dites ”données fonctionnelles”. Dans un premier temps, nous étudions les modèles de choix binaires fonctionnels dans un contexte d’échantillonnage par stratification endogène (échantillonnage Cas-Témoin ou échantillonnage basé sur le choix). La spécificité de cette étude réside sur le fait que la méthode proposée prend en considération le schéma d’échantillonnage. Nous décrivons une fonction de vraisemblance conditionnelle sous l’échantillonnage considérée et une stratégie de réduction de dimension afin d’introduire une estimation du modèle par vraisemblance conditionnelle. Nous étudions les propriétés asymptotiques des estimateurs proposées ainsi que leurs applications à des données simulées et réelles. Nous nous sommes ensuite intéressés à un modèle linéaire fonctionnel spatial auto-régressif. La particularité du modèle réside dans la nature fonctionnelle de la variable explicative et la structure de la dépendance spatiale des variables de l’échantillon considéré. La procédure d’estimation que nous proposons consiste à réduire la dimension infinie de la variable explicative fonctionnelle et à maximiser une quasi-vraisemblance associée au modèle. Nous établissons la consistance, la normalité asymptotique et les performances numériques des estimateurs proposés.Dans la deuxième partie du mémoire, nous abordons des problèmes de régression et prédiction de variables dépendantes à valeurs réelles. Nous commençons par généraliser la méthode de k-plus proches voisins (k-nearest neighbors; k-NN) afin de prédire un processus spatial en des sites non-observés, en présence de co-variables spatiaux. La spécificité du prédicteur proposé est qu’il tient compte d’une hétérogénéité au niveau de la co-variable utilisée. Nous établissons la convergence presque complète avec vitesse du prédicteur et donnons des résultats numériques à l’aide de données simulées et environnementales.Nous généralisons ensuite le modèle probit partiellement linéaire pour données indépendantes à des données spatiales. Nous utilisons un processus spatial linéaire pour modéliser les perturbations du processus considéré, permettant ainsi plus de flexibilité et d’englober plusieurs types de dépendances spatiales. Nous proposons une approche d’estimation semi paramétrique basée sur une vraisemblance pondérée et la méthode des moments généralisées et en étudions les propriétés asymptotiques et performances numériques. Une étude sur la détection des facteurs de risque de cancer VADS (voies aéro-digestives supérieures)dans la région Nord de France à l’aide de modèles spatiaux à choix binaire termine notre contribution
This thesis is about statistical inference for spatial and/or functional data. Indeed, weare interested in estimation of unknown parameters of some models from random or nonrandom(stratified) samples composed of independent or spatially dependent variables.The specificity of the proposed methods lies in the fact that they take into considerationthe considered sample nature (stratified or spatial sample).We begin by studying data valued in a space of infinite dimension or so-called ”functionaldata”. First, we study a functional binary choice model explored in a case-controlor choice-based sample design context. The specificity of this study is that the proposedmethod takes into account the sampling scheme. We describe a conditional likelihoodfunction under the sampling distribution and a reduction of dimension strategy to definea feasible conditional maximum likelihood estimator of the model. Asymptotic propertiesof the proposed estimates as well as their application to simulated and real data are given.Secondly, we explore a functional linear autoregressive spatial model whose particularityis on the functional nature of the explanatory variable and the structure of the spatialdependence. The estimation procedure consists of reducing the infinite dimension of thefunctional variable and maximizing a quasi-likelihood function. We establish the consistencyand asymptotic normality of the estimator. The usefulness of the methodology isillustrated via simulations and an application to some real data.In the second part of the thesis, we address some estimation and prediction problemsof real random spatial variables. We start by generalizing the k-nearest neighbors method,namely k-NN, to predict a spatial process at non-observed locations using some covariates.The specificity of the proposed k-NN predictor lies in the fact that it is flexible and allowsa number of heterogeneity in the covariate. We establish the almost complete convergencewith rates of the spatial predictor whose performance is ensured by an application oversimulated and environmental data. In addition, we generalize the partially linear probitmodel of independent data to the spatial case. We use a linear process for disturbancesallowing various spatial dependencies and propose a semiparametric estimation approachbased on weighted likelihood and generalized method of moments methods. We establishthe consistency and asymptotic distribution of the proposed estimators and investigate thefinite sample performance of the estimators on simulated data. We end by an applicationof spatial binary choice models to identify UADT (Upper aerodigestive tract) cancer riskfactors in the north region of France which displays the highest rates of such cancerincidence and mortality of the country

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lesage, Véronique. „Contribution à la validation fonctionnelle du gène majeur contrôlant la dureté / tendreté de l'albumen du grain de blé par l'étude de lignées quasi-isogéniques“. Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2011. http://tel.archives-ouvertes.fr/tel-00697012.

Der volle Inhalt der Quelle

Annotation:

La dureté du grain de blé est un des paramètres fondamentaux de la texture de l'albumen. Ce caractère, essentiel pour la valeur d'utilisation des farines, est fortement lié à l'absence ou à la modification des puroindolines. Afin de mieux comprendre la fonction biologique de ces protéines dans le grain de blé (Triticum aestivum L.), nous avons étudié à quatre stades de développement du grain la localisation subcellulaire des puroindolines par immunocytochimie et les protéomes dans deux lignées de blé quasi-isogéniques pour la dureté. Dès la fin de la cellularisation de l'albumen, les puroindolines sont localisées sur la face interne des membranes vésiculaires et dans les corps protéiques en formation, structures dans lesquelles s'accumulent les protéines de réserve du grain. L'analyse par AFFFF (Asymmetrical Flow Field-Flow Fractionation) des deux lignées Hard et Soft, qui diffèrent essentiellement par l'absence du gène Pina dans la lignée Hard, a montré une corrélation entre la dureté et la taille des polymères de protéines de réserve. L'analyse protéomique des fractions albumines/globulines et amphiphiles des grains en développement a révélé une augmentation des protéines de la machinerie de repliement et de réponse au stress dans la lignée Hard, par rapport à la lignée Soft. Les deux approches méthodologiques utilisées semblent également mettre en évidence une cinétique de développement du grain raccourcie dans la lignée Hard. Ces observations suggèrent que les puroindolines interagissent avec les protéines de réserve du grain et suivent le même routage cellulaire. Elles pourraient être impliquées dans les mécanismes de repliement et d'assemblage des prolamines.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nguyen, Quoc-Hung. „THÉORIE NON LINÉAIRE DU POTENTIEL ET ÉQUATIONS QUASILINÉAIRES AVEC DONNÉES MESURES“. Phd thesis, Université François Rabelais - Tours, 2014. http://tel.archives-ouvertes.fr/tel-01063365.

Der volle Inhalt der Quelle

Annotation:

Cette thése concerne l'existence et la régularité de solutions d'équations non-linéaires elliptiques, d'équations paraboliques et d'équations de Hesse avec mesures, et les critéres de l'existence de solutions grandes d'équations elliptiques et paraboliques non-linéaires. \textbf{Liste de publications} \begin{description} \item[1.] Avec M. F. Bidaut-Véron, L. Véron; {\em Quasilinear Lane-Emden equations with absorption and measure data,} Journal des Mathématiques Pures et Appliquées,~{\bf 102}, 315-337 (2014). \item[2] Avec L. Véron; {\em Quasilinear and Hessian type equations with exponential reaction and measure data,} Archive for Rational Mechanics and Analysis, {\bf 214}, 235-267 (2014). \item[3] Avec L. Véron; {\em Wiener criteria for existence of large solutions of quasilinear elliptic equations with absorption,} 17 pages, soumis, arXiv:1308.2956. \item[4] Avec M. F. Bidaut-Véron; {\em Stability properties for quasilinear parabolic equations with measure data,} 29 pages, á apparaître dans Journal of European Mathematical Society, arXiv:1409.1518. \item[5] Avec M. F. Bidaut-Véron; {\em Evolution equations of $p$-Laplace type with absorption or source terms and measure data}, 21 pages, á apparaître dans Communications in Contemporary Mathematics, arXiv:1409.1520. \item[6] {\em Potential estimates and quasilinear parabolic equations with measure data,} 118 pages, arXiv:1405.2587v1. \item[7] Avec L. Véron; {\em Wiener criteria for existence of large solutions of nonlinear parabolic equations with absorption in a non-cylindrical domain,} 29 pages, soumis,\\ arXiv:1406.3850. \item[8] Avec M. F. Bidaut-Véron; {Pointwise estimates and existence of solutions of porous medium and $p$-Laplace evolution equations with absorption and measure data,\em } 27 pages, soumis, arXiv:1407.2218. \end{description}\begin{description} \item[1.] Avec M. F. Bidaut-Véron, L. Véron; {\em Quasilinear Lane-Emden equations with absorption and measure data,} Journal des Mathématiques Pures et Appliquées,~{\bf 102}, 315-337 (2014). \item[2] Avec L. Véron; {\em Quasilinear and Hessian type equations with exponential reaction and measure data,} Archive for Rational Mechanics and Analysis, {\bf 214}, 235-267 (2014). \item[3] Avec L. Véron; {\em Wiener criteria for existence of large solutions of quasilinear elliptic equations with absorption,} 17 pages, soumis, arXiv:1308.2956. \item[4] Avec M. F. Bidaut-Véron; {\em Stability properties for quasilinear parabolic equations with measure data,} 29 pages, á apparaître dans Journal of European Mathematical Society, arXiv:1409.1518. \item[5] Avec M. F. Bidaut-Véron; {\em Evolution equations of $p$-Laplace type with absorption or source terms and measure data}, 21 pages, á apparaître dans Communications in Contemporary Mathematics, arXiv:1409.1520. \item[6] {\em Potential estimates and quasilinear parabolic equations with measure data,} 118 pages, arXiv:1405.2587v1. \item[7] Avec L. Véron; {\em Wiener criteria for existence of large solutions of nonlinear parabolic equations with absorption in a non-cylindrical domain,} 29 pages, soumis,\\ arXiv:1406.3850. \item[8] Avec M. F. Bidaut-Véron; {Pointwise estimates and existence of solutions of porous medium and $p$-Laplace evolution equations with absorption and measure data,\em } 27 pages, soumis, arXiv:1407.2218. \end{description}

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Quasi-Kernel"

Freund, Roland W. Quasi-kernal polynomials and convergance results for quasi-minimal residual iterations. [Moffett Field, Calif.]: Research Institute for Advanced Computer Science, NASA Ames Research Center, 1992.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Research Institute for Advanced Computer Science (U.S.), Hrsg. Quasi-kernal polynomials and convergance results for quasi-minimal residual iterations. [Moffett Field, Calif.]: Research Institute for Advanced Computer Science, NASA Ames Research Center, 1992.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Quasi-kernal polynomials and convergance results for quasi-minimal residual iterations. [Moffett Field, Calif.]: Research Institute for Advanced Computer Science, NASA Ames Research Center, 1992.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Quasi-Kernel"

Freund, Roland W. „Quasi-Kernel Polynomials and Convergence Results for Quasi-Minimal Residual Iterations“. In Numerical Methods in Approximation Theory, Vol. 9, 77–95. Basel: Birkhäuser Basel, 1992. http://dx.doi.org/10.1007/978-3-0348-8619-2_5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Charikar, Moses, Michael Kapralov und Erik Waingarten. „A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations“. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 5118–44. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2024. http://dx.doi.org/10.1137/1.9781611977912.184.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Breger, Anna, Martin Ehler und Manuel Gräf. „Quasi Monte Carlo Integration and Kernel-Based Function Approximation on Grassmannians“. In Frames and Other Bases in Abstract and Function Spaces, 333–53. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55550-8_14.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Leobacher, Gunther, und Friedrich Pillichshammer. „QMC Integration in Reproducing Kernel Hilbert Spaces“. In Introduction to Quasi-Monte Carlo Integration and Applications, 55–72. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-03425-6_3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fasshauer, Gregory E., und Qi Ye. „A Kernel-Based Collocation Method for Elliptic Partial Differential Equations With Random Coefficients“. In Monte Carlo and Quasi-Monte Carlo Methods 2012, 331–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41095-6_14.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Alzghool, Raed. „ARCH and GARCH Models: Quasi-Likelihood and Asymptotic Quasi-Likelihood Approaches“. In Linear and Non-Linear Financial Econometrics -Theory and Practice [Working Title]. IntechOpen, 2020. http://dx.doi.org/10.5772/intechopen.93726.

Der volle Inhalt der Quelle

Annotation:

This chapter considers estimation of autoregressive conditional heteroscedasticity (ARCH) and the generalized autoregressive conditional heteroscedasticity (GARCH) models using quasi-likelihood (QL) and asymptotic quasi-likelihood (AQL) approaches. The QL and AQL estimation methods for the estimation of unknown parameters in ARCH and GARCH models are developed. Distribution assumptions are not required of ARCH and GARCH processes by QL method. Nevertheless, the QL technique assumes knowing the first two moments of the process. However, the AQL estimation procedure is suggested when the conditional variance of process is unknown. The AQL estimation substitutes the variance and covariance by kernel estimation in QL. Reports of simulation outcomes, numerical cases, and applications of the methods to daily exchange rate series and weekly prices’ changes of crude oil are presented.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Marius, Arghirescu. „A Preonic Model of Quarks and Particles, Based on a Cold Genesis Theory“. In Redefining Standard Model Particle Physics [Working Title]. IntechOpen, 2023. http://dx.doi.org/10.5772/intechopen.109123.

Der volle Inhalt der Quelle

Annotation:

The theoretic model explains the generating of heavy quarks and of heavy particles using the known quark s(strange) and two semi-light quarks: λ±(435 MeV) and v±(∼574 MeV) resulting from a cold genesis theory1 of astro-particles’ forming, (CGT), the masses of the quarks c• (charm) and b• (bottom) of the Standard Model but also the values used by de Souza: c = 1.7 GeV and b = 5 GeV, being re-obtained as tri-quark clusters in the form: [(qq¯)q]], by a simple de-excitation reaction, with the emission of a preonic boson obtained in CGT: z0 = 34me, respective: z2 = 4z0 and zμ = 6z0- for the quarks b• and b. A similar de-excitation reaction, with emission of a preonic boson zk = n⋅z0, (n = 1÷7), representing less than 2.7% from the particle’s mass, explains the experimentally obtained masses of heavy baryons and mesons and of some multi-quark particles, with discrepancy <1% generally. The heavy current quarks result by lighter current quarks with quasi-crystalline internal structure, with trigonal/hexagonal symmetry of preonic kernels of two preonic bosons: z2 = 4z0; zπ = 7z0, the top-quark resulting as: t = 17(bb¯) + b = (7x5)⋅m(b), with a kernel of regular hexagonal polyhedron form, given by kernels of b-quarks. The model is compatible with the generation model and explains the quarks pairs forming from relativist e−- e+ jets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

He, Sailing, Staffan Strom und Vaughan H. Weston. „Wave-Splittings Combined With Optimization Techniques“. In Time Domain Wave-Splittings and Inverse Problems, 185–228. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198565499.003.0005.

Der volle Inhalt der Quelle

Annotation:

Abstract Recent developments and applications of various optimization methods have provided efficient tools for obtaining numerical solutions to various types of inverse problems (see, e.g. Frank and Balanis (1987), Kleinman and van den Berg (1990), Chew and Otto (1992), He and Kabanikhin (1995)). Optimization methods can be grouped into two types, namely, global search methods and gradient search methods. Global search methods include simulated annealing (see, e.g. Gamero et al. (1991)), neural network methods (see, e.g. Lu and Berryman (1990)), and genetic algorithms (see, e.g. Weile and Michielssen (1997)). A global search method is based on a stochastic algorithm, and its convergence can be very slow. A gradient search method is usually based on a deterministic algorithm, and it converges rapidly (though it may converge to a local minimum). In this chapter, wave-splittings are combined with gradient search optimization techniques. The procedure of deriving an explicit expression for the gradient of an objective functional through dual functions is described. The conjugate gradient method is used to reconstruct the line parameters, or spatial source distributions on a non-uniform line. The time domain inverse problem of reconstructing the temporal behaviours of a bi-isotropic slab is also considered, and a matrix formalism is introduced to derive an explicit expression for the gradient. A multi-dimensional acoustic inverse problem is also considered, and numerical reconstruction of a two-dimensional density profile is given. The Newton-Kantorovich procedure with a wave-splitting process is applied to a time domain inverse problem for a quasi-linear acoustic wave equation. Finally, a measurement system is described and the measurement data are used to reconstruct the susceptibility kernel of a polar liquid (1-buthanol).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Quasi-Kernel"

Laird, Brent, und Trac Tran. „Quasi-norm Kernel-based Emitter Localization“. In 2021 55th Asilomar Conference on Signals, Systems, and Computers. IEEE, 2021. http://dx.doi.org/10.1109/ieeeconf53345.2021.9723416.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhu, Huilin, und Jinglu Hu. „Air Quality Forecasting Using SVR with Quasi-Linear Kernel“. In 2019 International Conference on Computer, Information and Telecommunication Systems (CITS). IEEE, 2019. http://dx.doi.org/10.1109/cits.2019.8862114.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cheng, Yu, und Jinglu Hu. „Nonlinear system identification based on SVR with quasi-linear kernel“. In 2012 International Joint Conference on Neural Networks (IJCNN 2012 - Brisbane). IEEE, 2012. http://dx.doi.org/10.1109/ijcnn.2012.6252694.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Li, Weite, und Jinglu Hu. „Geometric approach of quasi-linear kernel composition for support vector machine“. In 2015 International Joint Conference on Neural Networks (IJCNN). IEEE, 2015. http://dx.doi.org/10.1109/ijcnn.2015.7280384.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Li, Weite, Jinglu Hu und Benhui Chen. „A deep quasi-linear kernel composition method for support vector machines“. In 2016 International Joint Conference on Neural Networks (IJCNN). IEEE, 2016. http://dx.doi.org/10.1109/ijcnn.2016.7727394.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhang, Wenpu, Yingying Guo, Jin Zhou, Hui Jiang und Rongrong Wang. „A novel Kernel Clustering with Quasi-Monte Carlo Random Feature Map“. In 2020 7th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS). IEEE, 2020. http://dx.doi.org/10.1109/iccss52145.2020.9336844.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Liang, Peifeng, Weite Li, Donghang Liu und Jinglu Hu. „Large-scale image classification using fast SVM with deep quasi-linear kernel“. In 2017 International Joint Conference on Neural Networks (IJCNN). IEEE, 2017. http://dx.doi.org/10.1109/ijcnn.2017.7965970.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lin, Yuling, Yong Fu und Jinglu Hu. „Support vector machine with SOM-based quasi-linear kernel for nonlinear classification“. In 2014 International Joint Conference on Neural Networks (IJCNN). IEEE, 2014. http://dx.doi.org/10.1109/ijcnn.2014.6889654.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhang, Wenpu, Yingying Guo, Rongrong Wang, Jin Zhou, Hui Jiang, Shiyuan Han, Lin Wang, Tao Du und Ke Ji. „Kernel Fuzzy Clustering based on Quasi-Monte Carlo Feature Map with Neighbor Affinity Constraint“. In 2022 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2022. http://dx.doi.org/10.1109/fuzz-ieee55066.2022.9882644.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhou, Bo, Di Fu, Chao Dong und Jinglu Hu. „A Transductive SVM with quasi-linear kernel based on cluster assumption for semi-supervised classification“. In 2015 International Joint Conference on Neural Networks (IJCNN). IEEE, 2015. http://dx.doi.org/10.1109/ijcnn.2015.7280485.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Quasi-Kernel"

Smith, Richard J., und Paulo Parente. Quasi-maximum likelihood and the kernel block bootstrap for nonlinear dynamic models. The IFS, Oktober 2019. http://dx.doi.org/10.1920/wp.cem.2019.6019.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!