• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 67
  • 27
  • 7
  • 6
  • 3
  • 3
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 147
  • 42
  • 42
  • 29
  • 29
  • 27
  • 17
  • 13
  • 12
  • 11
  • 10
  • 10
  • 9
  • 8
  • 8
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
131

Supereulerian graphs, Hamiltonicity of graphes and several extremal problems in graphs / Graphes super-eulériens, problèmes hamiltonicité et extrémaux dans les graphes

Yang, Weihua 27 September 2013 (has links)
Dans cette thèse, nous concentrons sur les sujets suivants: super-eulérien graphe, hamiltonien ligne graphes, le tolerant aux pannes hamiltonien laceabilité de Cayley graphe généré par des transposition arbres et plusieurs problèmes extrémaux concernant la (minimum et/ou maximum) taille des graphes qui ont la même propriété.Cette thèse comprend six chapitres. Le premier chapitre introduit des définitions et indique la conclusion des resultants principaux de cette thèse, et dans le dernier chapitre, nous introduisons la recherche de furture de la thèse. Les travaux principaux sont montrés dans les chapitres 2-5 comme suit:Dans le chapitre 2, nous explorons les conditions pour qu'un graphe soit super-eulérien.Dans la section 1, nous caractérisons des graphes dont le dégrée minimum est au moins de 2 et le nombre de matching est au plus de 3. Dans la section 2, nous prouvons que si pour tous les arcs xy∈E(G), d(x)+d(y)≥n-1-p(n), alors G est collapsible sauf quelques bien définis graphes qui ont la propriété p(n)=0 quand n est impair et p(n)=1 quand n est pair.Dans la section 3 de la Chapitre 2, nous trouvons les conditions suffisantes pour que un graphe de 3-arcs connectés soit pliable.Dans le chapitre 3, nous considérons surtout l'hamiltonien de 3-connecté ligne graphe.Dans la première section de Chapitre 3, nous montrons que chaque 3-connecté, essentiellement11-connecté ligne graphe est hamiltonien-connecté. Cela renforce le résultat dans [91]. Dans la seconde section de Chapitre 3, nous montrons que chaque 3-connecté, essentiellement 10-connecté ligne graphe est hamiltonien-connecté.Dans la troisième section de Chapitre 3, nous montrons que 3-connecté, essentiellement 4-connecté ligne graphe venant d'un graphe qui comprend au plus 9 sommets de degré 3 est hamiltonien. Dans le chapitre 4, nous montrons d'abord que pour tous $F\subseteq E(Cay(B:S_{n}))$, si $|F|\leq n-3$ et $n\geq 4$, il existe un hamiltonien graphe dans $Cay(B:S_{n})-F$ entre tous les paires de sommets qui sont dans les différents partite ensembles. De plus, nous renforçons le résultat figurant ci-dessus dans la seconde section montrant que $Cay(S_n,B)-F$ est bipancyclique si $Cay(S_n,B)$ n'est pas un star graphe, $n\geq 4$ et $|F|\leq n-3$.Dans le chapitre 5, nous considérons plusieurs problems extrémaux concernant la taille des graphes.Dans la section 1 de Chapitre 5, nous bornons la taille de sous-graphe provoqué par $m$ sommets de hypercubes ($n$-cubes). Dans la section 2 de Chapitre 5, nous étudions partiellement la taille minimale d'un graphe savant son degré minimum et son degré d'arc. Dans la section 3 de Chapitre 5, nous considérons la taille minimale des graphes satisfaisants la Ore-condition. / In this thesis, we focus on the following topics: supereulerian graphs, hamiltonian line graphs, fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees, and several extremal problems on the (minimum and/or maximum) size of graphs under a given graph property. The thesis includes six chapters. The first one is to introduce definitions and summary the main results of the thesis, and in the last chapter we introduce the furture research of the thesis. The main studies in Chapters 2 - 5 are as follows. In Chapter 2, we explore conditions for a graph to be supereulerian.In Section 1 of Chapter 2, we characterize the graphs with minimum degree at least 2 and matching number at most 3. By using the characterization, we strengthen the result in [93] and we also address a conjecture in the paper.In Section 2 of Chapter 2, we prove that if $d(x)+d(y)\geq n-1-p(n)$ for any edge $xy\in E(G)$, then $G$ is collapsible except for several special graphs, where $p(n)=0$ for $n$ even and $p(n)=1$ for $n$ odd. As a corollary, a characterization for graphs satisfying $d(x)+d(y)\geq n-1-p(n)$ for any edge $xy\in E(G)$ to be supereulerian is obtained. This result extends the result in [21].In Section 3 of Chapter 2, we focus on a conjecture posed by Chen and Lai [Conjecture~8.6 of [33]] that every 3-edge connected and essentially 6-edge connected graph is collapsible. We find a kind of sufficient conditions for a 3-edge connected graph to be collapsible.In Chapter 3, we mainly consider the hamiltonicity of 3-connected line graphs.In the first section of Chapter 3, we give several conditions for a line graph to be hamiltonian, especially we show that every 3-connected, essentially 11-connected line graph is hamilton- connected which strengthens the result in [91].In the second section of Chapter 3, we show that every 3-connected, essentially 10-connected line graph is hamiltonian-connected.In the third section of Chapter 3, we show that 3-connected, essentially 4-connected line graph of a graph with at most 9 vertices of degree 3 is hamiltonian. Moreover, if $G$ has 10 vertices of degree 3 and its line graph is not hamiltonian, then $G$ can be contractible to the Petersen graph.In Chapter 4, we consider edge fault-tolerant hamiltonicity of Cayley graphs generated by transposition trees. We first show that for any $F\subseteq E(Cay(B:S_{n}))$, if $|F|\leq n-3$ and $n\geq4$, then there exists a hamiltonian path in $Cay(B:S_{n})-F$ between every pair of vertices which are in different partite sets. Furthermore, we strengthen the above result in the second section by showing that $Cay(S_n,B)-F$ is bipancyclic if $Cay(S_n,B)$ is not a star graph, $n\geq4$ and $|F|\leq n-3$.In Chapter 5, we consider several extremal problems on the size of graphs.In Section 1 of Chapter 5, we bounds the size of the subgraph induced by $m$ vertices of hypercubes. We show that a subgraph induced by $m$ (denote $m$ by $\sum\limits_{i=0}^ {s}2^{t_i}$, $t_0=[\log_2m]$ and $t_i= [\log_2({m-\sum\limits_{r=0}^{i-1}2 ^{t_r}})]$ for $i\geq1$) vertices of an $n$-cube (hypercube) has at most $\sum\limits_{i=0}^{s}t_i2^{t_i-1} +\sum\limits_{i=0}^{s} i\cdot2^{t_i}$ edges. As its applications, we determine the $m$-extra edge-connectivity of hypercubes for $m\leq2^{[\frac{n}2]}$ and $g$-extra edge-connectivity of the folded hypercube for $g\leq n$.In Section 2 of Chapter 5, we partially study the minimum size of graphs with a given minimum degree and a given edge degree. As an application, we characterize some kinds of minimumrestricted edge connected graphs.In Section 3 of Chapter 5, we consider the minimum size of graphs satisfying Ore-condition.
132

Aspects of Interface between Information Theory and Signal Processing with Applications to Wireless Communications

Park, Sang Woo 14 March 2013 (has links)
This dissertation studies several aspects of the interface between information theory and signal processing. Several new and existing results in information theory are researched from the perspective of signal processing. Similarly, some fundamental results in signal processing and statistics are studied from the information theoretic viewpoint. The first part of this dissertation focuses on illustrating the equivalence between Stein's identity and De Bruijn's identity, and providing two extensions of De Bruijn's identity. First, it is shown that Stein's identity is equivalent to De Bruijn's identity in additive noise channels with specific conditions. Second, for arbitrary but fixed input and noise distributions, and an additive noise channel model, the first derivative of the differential entropy is expressed as a function of the posterior mean, and the second derivative of the differential entropy is expressed in terms of a function of Fisher information. Several applications over a number of fields, such as statistical estimation theory, signal processing and information theory, are presented to support the usefulness of the results developed in Section 2. The second part of this dissertation focuses on three contributions. First, a connection between the result, proposed by Stoica and Babu, and the recent information theoretic results, the worst additive noise lemma and the isoperimetric inequality for entropies, is illustrated. Second, information theoretic and estimation theoretic justifications for the fact that the Gaussian assumption leads to the largest Cramer-Rao lower bound (CRLB) is presented. Third, a slight extension of this result to the more general framework of correlated observations is shown. The third part of this dissertation concentrates on deriving an alternative proof for an extremal entropy inequality (EEI), originally proposed by Liu and Viswanath. Compared with the proofs, presented by Liu and Viswanath, the proposed alternative proof is simpler, more direct, and more information-theoretic. An additional application for the extremal inequality is also provided. Moreover, this section illustrates not only the usefulness of the EEI but also a novel method to approach applications such as the capacity of the vector Gaussian broadcast channel, the lower bound of the achievable rate for distributed source coding with a single quadratic distortion constraint, and the secrecy capacity of the Gaussian wire-tap channel. Finally, a unifying variational and novel approach for proving fundamental information theoretic inequalities is proposed. Fundamental information theory results such as the maximization of differential entropy, minimization of Fisher information (Cramer-Rao inequality), worst additive noise lemma, entropy power inequality (EPI), and EEI are interpreted as functional problems and proved within the framework of calculus of variations. Several extensions and applications of the proposed results are briefly mentioned.
133

Topics in finite graph Ramsey theory

Borgersen, Robert David 18 January 2008 (has links)
For a positive integer $r$ and graphs $F$, $G$, and $H$, the graph Ramsey arrow notation $F \longrightarrow (G)^H_r$ means that for every $r$-colouring of the subgraphs of $F$ isomorphic to $H$, there exists a subgraph $G'$ of $F$ isomorphic to $G$ such that all the subgraphs of $G'$ isomorphic to $H$ are coloured the same. Graph Ramsey theory is the study of the graph Ramsey arrow and related arrow notations for other kinds of ``graphs" (\emph{e.g.}, ordered graphs, or hypergraphs). This thesis surveys finite graph Ramsey theory, that is, when all structures are finite. One aspect surveyed here is determining for which $G$, $H$, and $r$, there exists an $F$ such that $F \longrightarrow (G)^H_r$. The existence of such an $F$ is guaranteed when $H$ is complete, whether ``subgraph" means weak or induced, and existence results are also surveyed when $H$ is non-complete. When such an $F$ exists, other aspects are surveyed, such as determining the order of the smallest such $F$, finding such an $F$ in some restricted family of graphs, and describing the set of minimal such $F$'s. / February 2008
134

Brown-Resnick Processes: Analysis, Inference and Generalizations

Engelke, Sebastian 14 December 2012 (has links)
No description available.
135

Topics in finite graph Ramsey theory

Borgersen, Robert David 18 January 2008 (has links)
For a positive integer $r$ and graphs $F$, $G$, and $H$, the graph Ramsey arrow notation $F \longrightarrow (G)^H_r$ means that for every $r$-colouring of the subgraphs of $F$ isomorphic to $H$, there exists a subgraph $G'$ of $F$ isomorphic to $G$ such that all the subgraphs of $G'$ isomorphic to $H$ are coloured the same. Graph Ramsey theory is the study of the graph Ramsey arrow and related arrow notations for other kinds of ``graphs" (\emph{e.g.}, ordered graphs, or hypergraphs). This thesis surveys finite graph Ramsey theory, that is, when all structures are finite. One aspect surveyed here is determining for which $G$, $H$, and $r$, there exists an $F$ such that $F \longrightarrow (G)^H_r$. The existence of such an $F$ is guaranteed when $H$ is complete, whether ``subgraph" means weak or induced, and existence results are also surveyed when $H$ is non-complete. When such an $F$ exists, other aspects are surveyed, such as determining the order of the smallest such $F$, finding such an $F$ in some restricted family of graphs, and describing the set of minimal such $F$'s.
136

Topics in finite graph Ramsey theory

Borgersen, Robert David 18 January 2008 (has links)
For a positive integer $r$ and graphs $F$, $G$, and $H$, the graph Ramsey arrow notation $F \longrightarrow (G)^H_r$ means that for every $r$-colouring of the subgraphs of $F$ isomorphic to $H$, there exists a subgraph $G'$ of $F$ isomorphic to $G$ such that all the subgraphs of $G'$ isomorphic to $H$ are coloured the same. Graph Ramsey theory is the study of the graph Ramsey arrow and related arrow notations for other kinds of ``graphs" (\emph{e.g.}, ordered graphs, or hypergraphs). This thesis surveys finite graph Ramsey theory, that is, when all structures are finite. One aspect surveyed here is determining for which $G$, $H$, and $r$, there exists an $F$ such that $F \longrightarrow (G)^H_r$. The existence of such an $F$ is guaranteed when $H$ is complete, whether ``subgraph" means weak or induced, and existence results are also surveyed when $H$ is non-complete. When such an $F$ exists, other aspects are surveyed, such as determining the order of the smallest such $F$, finding such an $F$ in some restricted family of graphs, and describing the set of minimal such $F$'s.
137

多語言的場景文字偵測 / Multilingual Scene Text Detection

梁苡萱, Liang, Yi Hsuan Unknown Date (has links)
影像中的文字訊息,通常包含著與場景內容相關的重要資訊,如地點、名稱、指示、警告等,因此如何有效地在影像中擷取文字區塊,進而解讀其意義,成為近來電腦視覺領域中相當受矚目的議題。然而在眾多的場景文字偵測方法裡,絕大多數是以英文為偵測目標語言,中文方面的研究相當稀少,而且辨識率遠不及英文。因此,本論文提出以中文和英文為偵測目標語言的方法,分成以下四個主要程序:一、前處理,利用雙邊濾波器(Bilateral filter)使文字區域更加穩定;二、候選文字資訊擷取,考慮文字特徵,選用Canny 邊緣偵測和最大穩定極值區域(Maximally Stable Extremal Region),分別提取文字邊緣和區域特徵,並結合兩者來優化擷取的資訊;三、文字連結,依中文字結構和直式、橫式兩種書寫方向,設置幾何條件連結候選文字字串;四、候選字串分類,以SVM加入影像中文字的特徵,分類文字字串和非文字字串。使得此方法可以偵測中文和英文兩種語言,並且達到不錯的辨識效果。 / Text messages in an image usually contain useful information related to the scene, such as location, name, direction and warning. As such, robust and efficient scene text detection has gained increasing attention in the area of computer vision recently. However, most existing scene text detection methods are devised to process Latin-based languages. For the few researches that reported the investigation of Chinese text, the detection rate was inferior to the result for English. In this thesis, we propose a multilingual scene text detection algorithm for both Chinese and English. The method comprises of four stages: 1. Preprocessing by bilateral filter to make the text region more stable. 2. Extracting candidate text edge and region using Canny edge detector and Maximally Stable Extremal Region (MSER) respectively. Then combine these two features to achieve more robust results. 3. Linking candidate characters: considering both horizontal and vertical direction, character candidates are clustered into text candidates by using geometrical constraints. 4. Classifying candidate texts using support vector machine (SVM), the text and non-text areas are separated. Experimental results show that the proposed method detects both Chinese and English texts, and achieve satisfactory performance compared to those approaches designed only for English detection.
138

"Resultados analíticos para as distribuições estatísticas relacionadas à caminhada determinista do turista sem memória: efeito da dimensionalidade do sistema e modelos de campo médio". / Analytical results for the statistical distribution related to a memoryless deterministic walk: Dimensionality effect and mean-field models

Terçariol, César Augusto Sangaletti 21 December 2004 (has links)
Considere um meio caracterizado por $N$ pontos cujas coordenadas são geradas aleatoriamente de maneira uniforme nas arestas unitárias de um hipercubo $d$-dimensional. Um caminhante parte de cada ponto deste meio desordenado e se movimenta obedecendo à regra determinista de ir para o ponto mais próximo que não tenha sido visitado nos últimos $mu$ passos. Este processo foi denominado de caminhada determinista do turista. Cada trajetória gerada por esta dinâmica possui uma parte inicial não-periódica de $t$ passos (transiente) e uma parte final periódica de $p$ passos (atrator). As probabilidades de vizinhança são expressas através da fórmula de Cox, que é parametrizada pela função beta incompleta normalizada $I_d = I_{1/4}[1/2,(d+1)/2]$. Enfati-zamos aqui que a distribuição relevante é $S_{mu,d}^{(N)}(t,p)$, a distribuição conjunta de $t$ e $p$, que tem como casos particulares as distribuições marginais, previamente estudadas. O objetivo deste estudo é obter analiticamente estas distribuições para a caminhada determinista do turista sem memória no espaço euclideano, no modelo de distâncias aleatórias (que corresponde ao limite $d ightarrow infty$) e no modelo de mapeamento aleatório (que é um caso limite das redes de Kauffman). As distribuições analíticas obtidas foram validadas através de experimentos numéricos. A distribuição conjunta de tempos de transiente e período de atratores, no limite termodinâmico para uma dimensionalidade arbitrária vale: $S_{1,d}^{(infty)}(t,p) = [Gamma(1+I_d^{-1}) cdot (t+I_d^{-1})/Gamma(t+p+I_d^{-1})] cdot delta_{p,2}$, onde $t=0,1,2,ldots,infty$; $Gamma(z)$ é a função gama e $delta_{i,j}$ é o delta de Kronecker. A caminhada determinista do turista sem memória no modelo de mapeamento aleatório produz uma distribuição de períodos não-trivial ($S_{0,rm}^{(N)}(p) propto p^{-1}$), que é obtida de $S_{0,rm}^{(N)}(t,p) = Gamma(N)/{Gamma[N+1-(t+p)]N^{t+p}}$, onde enfatizamos que o número de pontos explorados $n_e=t+p$ é a grandeza fundamental nos problemas considerados. / Consider a medium characterized by $N$ points whose coordinates are randomly generated by a uniform distribution along the unitary edges of a $d$-dimensional hypercube. A walker leaves from each point of this disordered medium and moves according to the deterministic rule to go the nearest point which has not been visited in the preceding $mu$ steps. This process has been called the deterministic tourist walk. Each trajectory generated by this dynamics has an initial non-periodic part of $t$ steps (transient) and a final periodic part of $p$ steps (attractor). The neighborhood probabilities are given by the Cox formula, which is parameterized by the normalized incomplete beta function $I_d = I_{1/4}[1/2,(d+1)/2]$. Here we stress that the relevant distribution is the joint $t$ and $p$ distribution $S_{mu,d}^{(N)}(t,p)$, which has as particular cases, the marginal distributions previously studied. The objective of this study is to obtain analytically these distributions for the memoryless deterministic tourist walk in the euclidean space, random link model (which corresponds to $d ightarrow infty$ limit) and random map model (which is a limiting case of the Kauffman model). The obtained distributions have been validated by numerical experiments. The joint transient time and attractor period distribution in the thermodynamic limit for an arbitrary dimensionality is: $S_{1,d}^{(infty)}(t,p) = [Gamma(1+I_d^{-1}) cdot (t+I_d^{-1})/Gamma(t+p+I_d^{-1})] cdot delta_{p,2}$, where $t=0,1,2,ldots,infty$; $Gamma(z)$ is the gamma function and $delta_{i,j}$ is the Kronecker's delta. The memoryless deterministic tourist walk in the random map leads to a non-trivial cycle distribution ($S_{0,rm}^{(N)}(p) propto p^{-1}$), which is obtained from $S_{0,rm}^{(N)}(t,p) = Gamma(N)/{Gamma[N+1-(t+p)]N^{t+p}}$, where we stress that the number of explored points $n_e=t+p$ is the fundamental quantity in the considered problems.
139

Transformation de Aluthge et vecteurs extrémaux / Aluthge Transform and Extremal Vectors

Verliat, Jérôme 21 December 2010 (has links)
Cette thèse s'articule autour de deux thèmes : une transformation de B(H) introduite par Aluthge et la méthode d'Ansari-Enflo. La première partie fait l'objet de l'étude de la transformation d’Aluthge qui a eu un impact important ces dernières années en théorie des opérateurs. Des résultats optimaux sur la stabilité d'un certain nombre de classes d'opérateurs, telles que la classe des isométries partielles et les classes associées au comportement asymptotique d'un opérateur, sont fournis. Nous étudions également l'évolution d'invariants opératoriels, tels que le polynôme minimal, la fonction minimum, l'ascente et la descente, sous l'action de la transformation ; nous comparons plus précisément les suites des noyaux et images relatives aux itérés d'un opérateur et de sa transformée de Aluthge. La deuxième partie est l'occasion d'étudier la théorie d'Ansari-Enflo, qui a permis de gros progrès pour le problème du sous-espace hyper-invariant. Nous développons plus particulièrement la notion fondatrice de la méthode, celle de vecteur extrémal. La localisation et une nouvelle caractérisation de ces vecteurs sont données. Leur régularité et leur robustesse, au regard de différents paramètres, sont éprouvées. Enfin, nous comparons les vecteurs extrémaux d'un shift à poids et ceux associés à sa transformée d’Aluthge. Cette étude aboutit à la construction d'une suite de vecteurs extrémaux associés aux itérés de la transformation d’Aluthge, pour laquelle certaines propriétés sont mises en évidence. / This thesis is based on two topics : a transformation of B(H) introduced by Aluthge and the Ansari-Enflo method. In the first part, we study the Aluthge transformation which really had an impact on operator theory in the past ten years. Some optimal results about stability for several operators classes, such as isometries class and classes of operators defined by their asymptotic behaviour, are given. We also study changes generated by Aluthge transform about some usual tools in operator theory like minimum polynomial, minimum function, ascent and descent ; precisely, we compare iterated kernels and iterated ranges sequences related to an operator and to its Aluthge transform. The second part is devoted to the study of the Ansari-Enflo theory, which allowed to make progress in the hyper-invariant subspace problem. We develop the notion of extremal vectors which is the fundamental point of the theory. We clarify their spatial localization and a new caracterisation for these vectors is given. Regularity and robustness with regard to different parameters are tried and tested. Finally, we compare extremal vectors associated with weighted shifts and the one corresponding to their Aluthge transform. This study leads to build a sequence of extremal vectors associated with the iterated Aluthge transform, for which we highlight several properties.
140

評估極值相依組合信用風險之有效演算法 / Efficient Algorithms for Evaluating Portfolio Credit Risk with Extremal Dependence

施明儒, Shih,Ming Ju Unknown Date (has links)
蒙地卡羅模擬是在組合信用風險的管理上相當實用的計算工具。衡量組合信用風險時,必須以適當的模型描述資產間的相依性。常態關聯結構是目前最廣為使用的模型,但實證研究認為 t 關聯結構更適合用於配適金融市場的資料。在本文中,我們採用 Bassamboo et al. (2008) 提出的極值相依模型建立 t 關聯結構用以捕捉資產之間的相關性。同時,為增進蒙地卡羅法之收斂速度,我們以 Chiang et al. (2007) 的重要性取樣法為基礎,將其拓展到極值相依模型下,並提出兩階段的重要性取樣技巧確保使用此方法估計一籃子信用違約時,所有模擬路徑均會發生信用事件。數值結果顯示,所提出的演算法皆達變異數縮減。而在模型自由度較低或是資產池較大的情況下,兩階段的重要性取樣法將會有更佳的估計效率。我們也以同樣的思路,提出用以估計投資組合損失機率的演算法。雖然所提出的演算法經過重要性取樣的技巧後仍無法使得欲估計的事件在所有模擬路徑下都會發生,但數值結果仍顯示所提出的方法估計效率遠遠優於傳統蒙地卡羅法。 / Monte Carlo simulation is a useful tool on portfolio credit risk management. When measuring portfolio credit risk, one should choose an appropriate model to characterize the dependence among all assets. Normal copula is the most widely used mechanism to capture this dependence structure, however, some emperical studies suggest that $t$-copula provides a better fit to market data than normal copula does. In this article, we use extremal depence model proposed by Bassamboo et al. (2008) to construct $t$-copula. We also extend the importance sampling (IS) procedure proposed by Chiang et al. (2007) to evaluate basket credit default swaps (BDS) with extremal dependence and introduce a two-step IS algorithm which ensures credit events always take place for every simulation path. Numerical results show that the proposed methods achieve variance reduction. If the model has lower degree of freedom, or the portfolio size is larger, the two-step IS method is more efficient. Following the same idea, we also propose algorithms to estimate the probability of portfolio losses. Althought the desired events may not occur for some simulations, even if the IS technique is applied, numerical results still show that the proposed method is much better than crude Monte Carlo.

Page generated in 0.0627 seconds