Robust level-set-based inverse lithography. Citation Optics Express, 2011, v. 19 n. 6, p
|
|
- Dominic Roberts
- 5 years ago
- Views:
Transcription
1 Title Robust level-set-based inverse lithography Author(s) Shen, Y; Jia, N; Wong, N; La, EY Citation Optics Express, 2011, v. 19 n. 6, p Issued Date 2011 URL Rights This work is licensed under a Creative Coons Attribution- NonCoercial-NoDerivatives 4.0 International License.; Optics Express. Copyright Optical Society of Aerica.; This paper was published in [Optics Express] and is ade available as an electronic reprint with the perission of OSA. The paper can be found at the following URL on the OSA website: [ Systeatic or ultiple reproduction or distribution to ultiple locations via electronic or other eans is prohibited and is subject to penalties under law.
2 Robust level-set-based inverse lithography Yijiang Shen, Ningning Jia, Ngai Wong and Edund Y. La Departent of Electrical and Electronic Engineering, The University of Hong Kong, Pokfula Road, Hong Kong Abstract: Level-set based inverse lithography technology (ILT) treats photoask design for icrolithography as an inverse atheatical proble, interpreted with a tie-dependent odel, and then solved as a partial differential equation with finite difference schees. This paper focuses on developing level-set based ILT for partially coherent systes, and upon that an expectation-orient optiization fraework weighting the cost function by rando process condition variables. These include defocus and aberration to enhance robustness of layout patterns against process variations. Results deonstrating the benefits of defocus-aberration-aware level-set based ILT are presented Optical Society of Aerica OCIS codes: ( ) Microlithography; ( ) Photolithography; ( ) Coputational iaging. References and links 1. A. K.-K. Wong, Resolution Enhanceent Techniques in Optical Lithography (SPIE Press, Bellingha, WA, 2001). 2. F. Schellenberg, Resolution enhanceent technology: the past, the present, and extensions for the future, Proc. SPIE 5377, 1 20 (2004). 3. O. W. Otto, J. G. Garofalo, K. K. Low, C.-M. Yuan, R. C. Henderson, C. Pierrat, R. L. Kostelak, S. Vaidya, and P. K. Vasudev, Autoated optical proxiity correction: a rules-based approach, Proc. SPIE 2197, (1994). 4. S. Shioiri and H. Tanabe, Fast optical proxiity correction: analytical ethod, Proc. SPIE 2440, (1995). 5. L. Pang, Y. Liu, and D. Abras, Inverse lithography technology (ILT): a natural solution for odel-based SRAF at 45n and 32n, Proc. SPIE 6607, (2007). 6. Y. Liu and A. Zakhor, Optial binary iage design for optical lithography, Proc. SPIE 1264, (1990). 7. Y. Liu and A. Zakhor, Binary and phase-shifting iage design for optical lithography, Proc. SPIE 1463, (1991). 8. S. Sherif, B. Saleh, and R. De Leone, Binary iage synthesis using ixed linear integer prograing, IEEE Trans. Iage Process. 4(9), (1995). 9. Y. C. Pati and T. Kailath, Phase-shifting asks for icrolithography: autoated design and ask requireents, J. Opt. Soc. A. A 11(9), (1994). 10. S. H. Chan, A. K. Wong, and E. Y. La, Initialization for robust inverse synthesis of phase-shifting asks in optical projection lithography, Opt. Express 16(19), (2008). 11. S. H. Chan and E. Y. La, Inverse iage proble of designing phase shifting asks in optical lithography, in Proceedings of IEEE International Conference on Iage Processing, pp (2008). 12. A. Poonawala and P. Milanfar, Prewarping techniques in iaging: applications in nanotechnology and biotechnology, Proc. SPIE 5674, (2005). 13. A. Poonawala and P. Milanfar, Mask design for optical icrolithography: an inverse iaging proble, IEEE Trans. Iage Process. 16(3), (2007). 14. S. H. Chan, A. K. Wong, and E. Y. La, Inverse synthesis of phase-shifting ask for optical lithography, in OSA Topical Meeting in Signal Recovery and Synthesis, p. SMD3 (2007). (C) 2011 OSA 14 March 2011 / Vol. 19, No. 6 / OPTICS EXPRESS 5511
3 15. V. Singh, B. Hu, K. Toh, S. Bollepalli, S. Wagner, and Y. Borodovsky, Making a trillion pixels dance, Proc. SPIE 6924, 69240S (2008). 16. A. Poonawala, Y. Borodovsky, and P. Milanfar, ILT for double exposure lithography with conventional and novel aterials, Proc. SPIE 6520, 65202Q (2007). 17. N. Jia, A. K. Wong, and E. Y. La, Regularization of inverse photoask synthesis to enhance anufacturability, Proc. SPIE 7520, (2009). 18. N. Jia, A. K. Wong, and E. Y. La, Robust photoask design with defocus variation using inverse synthesis, Proc. SPIE 7140, 71401W (2008). 19. S. Osher and R. P. Fedkiw, Level set ethods: an overview and soe recent results, J. Coput. Phys. 169(2), (2001). 20. J. A. Sethian and D. Adalsteinsson, An overview of level set ethods for etching, deposition, and lithography developent, IEEE Trans. Seicond. Manuf. 10, (1997). 21. S. Osher and N. Paragios, Geoetric Level Set Methods in Iaging, Vision, and Graphics (Springer Verlag New York, NJ, USA, 2003). 22. F. Santosa, A level-set approach for inverse probles involving obstacles, ESAIM Contröle Opti. Calc. Var. 1, (1996). 23. S. Osher and F. Santosa, Level set ethods for optiization probles involving geoetry and constraints I. Frequencies of a two-density inhoogeneous dru, J. Coput. Phys. 171(1), (2001). 24. A. Marquina and S. Osher, Explicit algoriths for a new tie dependent odel based on level set otion for nonlinear deblurring and noise reoval, SIAM J. Sci. Cop. 22, (2000). 25. L. Pang, G. Dai, T. Cecil, T. Da, Y. Cui, P. Hu, D. Chen, K. Baik, and D. Peng, Validation of inverse lithography technology (ILT) and its adaptive SRAF at advanced technology nodes, Proc. SPIE 6924, 69240T (2008). 26. Y. Shen, N. Wong, and E. Y. La, Level-set-based inverse lithography for photoask synthesis, Opt. Express 17(26), (2009). 27. E. Y. La and A. K. Wong, Coputation lithography: virtual reality and virtual virtuality, Opt. Express 17(15), (2009). 28. E. Y. La and A. K. Wong, Nebulous hotspot and algorith variability in coputation lithography, J. Micro/Nanolithogr. MEMS MOEMS 9(3), (2010). 29. N. Jia and E. Y. La, Machine learning for inverse lithography: Using stochastic gradient descent for robust photoask synthesis, J. Opt. 12(4), (2010). 30. Y. Shen, N. Wong, and E. Y. La, Aberration-aware robust ask design with level-set-based inverse lithography, Proc. of SPIE 7748, 77481U (2010). 31. M. Born and E. Wolf, Principles of Optics (Pergaon Press Oxford, 1980). 32. J. W. Goodan, Statistical Optics (Wiley-Interscience, New York, 2000). 33. H. H. Hopkins, On the diffraction theory of optical iages, Proc. of the Royal Soc. of London 217A(1130), (1953). 34. A. K.-K. Wong, Optical Iaging in Projection Microlithography (SPIE Press, Bellingha, WA, 2005). 35. B. E. A. Saleh and M. Rabbani, Siulation of partially coherent iagery in the space and frequency doains and by odal expansion, Appl. Opt. 21(15), (1982). 36. X. Ma and G. R. Arce, Pixel-based siultaneous source and ask optiization for resolution enhanceent in optical lithography, Opt. Express 17(7), (2009). 37. B. Nijboer, The diffraction theory of aberrations, Ph.D. thesis, Groningen University (1942). 38. R. J. Noll, Zernike polynoials and atospheric turbulence, J. Opt. Soc. A. A 66(3), (1976). 39. P. Dirksen, J. Braat, A. Janssen, and A. Leeuwestein, Aberration retrieval for high-na optical systes using the Extended Nijboer-Zernike theory, Proc. SPIE 5754, 263 (2005). 1. Introduction Optical projection lithography reains the predoinant icrolithography technology until the foreseeable future as shrinkage of integrated circuit device diension outpaces introduction of shorter-exposure wavelengths and higher-nuerical-aperture lenses extending to sub-0.35 k 1 regie and iniu design pitches to sub-100n. Due to the wave nature of light, as diensions approach sizes coparable to or saller than the wavelength of the light used in the photolithography process, the bandliited iaging syste introduces undesirable distortions and artifacts. Along the way, resolution enhanceent techniques (RET) [1, 2] are essential in optical lithography, which include odified illuination schees and optical proxiity correction (OPC). The latter predistorts the ask patterns such that printed patterns are as close to the desired shapes as possible. Rule-based OPC [3, 4], in which various geoetries are treated by different epirical rules, and odel-based OPC, which is ore coplex and involves the (C) 2011 OSA 14 March 2011 / Vol. 19, No. 6 / OPTICS EXPRESS 5512
4 coputation of a weighted su of pre-siulated results for siple edges and corners that are stored in a library, are two ain approaches to OPC. Moving beyond odel-based OPC, inverse lithography technology (ILT) is becoing a strong candidate for 32n and below low-k 1 regie. Inverse odel-based techniques invert the iaging odel and attept to directly synthesize the optiized ask pattern, and are not constrained by the topology of the original design [5]. Early works include branch and bound algorith [6] and the bacteria algorith [7] with very liited applicability due to their high coputation coplexity. Since the id-1990s, iterative ethods have been applied to generate binary asks [8] and phase shifting asks (PSMs) [9, 10, 11], treating the proble as an inverse proble and solving it by an optiization process. Meanwhile, Poonawala and Milanfar designed a odel-based OPC syste and developed a faster optiization algorith using steepest-descent [12, 13], which has been further iproved by Chan et al. using an active set ethod and conjugate gradient [11, 14]. Applications of ILT are also reported in pixelated ask technology [15], double exposure lithography [16], anufacturability enhanceent [17] and designs specifically taking into account robustness to variations, such as focal length [18]. Level-set ethod [19] offers a feasible alternative to inverse lithography. It has been applied in forward optical lithography [20] and inverse iaging probles [21] involving obstacles [22, 23], and in nonlinear deblurring and noise reoval [24]. Level set approaches for ILT has been explored in [5, 25], and in [26], Shen et al. presented systeatic level-set forulations and developed finite-difference schees to solve the with high fidelity and robustness for a coherent iaging syste. It should also be noted while the above-entioned algoriths enrich the weaponry for solving inverse lithography probles, the current perforance still falls short, and is not yet fully applicable to real-world anufacturing [27, 28]. One such concern is that they are ostly applied to calculate solutions under noinal conditions, without taking process variation into account. Consequently, various efforts have been ade to incorporate process conditions such as defocus and aberration variations into OPC algoriths for robust design of printed patterns [29, 30]. This paper focuses on the developent of algoriths for photoask synthesis using levelset based inverse lithography proble in partially coherent systes. A statistical ethod is proposed to incorporate process variations into the optiization fraework, which treats defocus and aberrations as rando variables, taking their statistical properties into account, and develops an optiization fraework which ais to iniize the pattern difference between the printed wafer upon various defocus and aberration conditions and the target pattern. A coplete set of level-set forulations of the optiization proble is provided with coputationally efficient solutions. 2. The Constrained level set tie-dependent odel forulation 2.1. Matheatical odel for partially coherent systes The projection lithography iaging process can be described as a forward odel I(x)=T {U(x)}, (1) where the boldface x denotes spatial coordinates (x, y), and T { } aps the input intensity function U(x) to the output intensity function I(x). Due to the lowpass nature of the optical lithography iaging syste, I(x) is typically a blurred version of U(x). Suppose the desired circuit pattern is I 0 (x). The objective of inverse lithography is to find a predistorted input intensity function Û(x) which iniizes its distance with the desired output, i.e., Û(x)=arg in d(i 0 (x),t {U(x)}), (2) U(x) (C) 2011 OSA 14 March 2011 / Vol. 19, No. 6 / OPTICS EXPRESS 5513
5 (a) (b) (c) Fig. 1. Coon illuination sources: (a) conventional, (b) annular, and (c) dipole. in which d(, ) is an appropriately defined distance etric, such as the l 2 nor. The lithography process T { } in Eq. (1) can be divided into two functional blocks, naely the projection optics effects (aerial iage foration) and resist effects. The resist effects can be approxiated using a logarithic sigoid function [13] sig(u(x)) = e a(u(x) t r), (3) with a being the steepness of the sigoid and t r being the threshold. The nonlinear nature of aerial iage foration in partially coherent systes has been understood since the early developent of optical coherence theory [31, 32], but the coplexity of the calculations involved has liited use of the theory for actual optical design. In partially coherent iaging, the ask is illuinated by light traveling in various directions. In [33], the concept of effective source is developed to help understand the echanis of partially coherent iaging. Radiation of partially coherent light has been shown to be an expansion of coherent odes added incoherently in the iage plane. The expansion uses a basis of orthogonal functions which are eigenfunctions of the utual coherence function [34], however, coputation of the eigenfunctions is a difficult process which leads to coplicated functions and expensive coputation coplexity in ters of both speed and eory requireent. Alternatively, the Fourier expansion odel [35, 36] is applied to decopose the partially coherent iaging systes as the su of coherent systes. According to the Hopkins diffraction odel, the light intensity distribution exposed on the wafer in partially coherent iaging is bilinear and can be described as I aerial (x)= U (x 1 )U(x 2 )γ(x 1 x 2 )H (x x 1 )H(x x 2 ) dx 1 dx 2, (4) where x =(x,y), x 1 =(x 1,y 1 ) and x 2 =(x 2,y 2 ). U(x) is the ask pattern, γ(x 1 x 2 ) is the coplex degree of coherence and H(x) represents the aplitude ipulse response of the optical syste, naely point spread function (PSF). The ter γ(x 1 x 2 ) is generally a coplex nuber, whose agnitude represents the extent of optical interaction between two spatial locations x 1 =(x 1,y 1 ) and x 2 =(x 2,y 2 ) of the light source. It is the inverse Fourier transfor of the iage of the illuination shape Γ(x) in the lens pupil. Coon illuination sources are shown in Fig. 1, which include conventional circular, annular, and dipole, all introducing partial coherence into illuination. If the object intensity vanishes outside a square area A defined by x [ G 2, G 2 ], for coputations involved in (4), the only values of γ(x) needed are those inside the square area A γ defined by x [ G,G]. We can expand γ(x) as a 2-D Fourier series of periodicity 2G in both the x and y directions, and therefore, γ(x) can be rewritten as γ(x)= Γ e jω0 x, (5) (C) 2011 OSA 14 March 2011 / Vol. 19, No. 6 / OPTICS EXPRESS 5514
6 and also Γ = 1 G 2 A γ γ(x)e jω 0 x dx, (6) where j = 1, ω 0 = π/g, =( x, y ), x and y being integers within the range of [ D,D], and x = x x + y y. Substituting (5) into (4), the light intensity on the wafer is given by I aerial (x)= Γ U(x) H (x) 2, (7) where H (x)=h(x)e jω0 x. (8) Cobining the aerial iage foration in (7) and the logarithic sigoid function in (3) describing resist effects, we have the iage foration equation for a partially coherent iaging syste as I(x)=sig( Γ U(x) H (x) 2 ). (9) It is observed fro (7) that the partially coherent iage is equal to the superposition of coherent systes. In what follows, we will drop the arguents x whenever there is no abiguity Tie-dependent odel forulation in partially coherent iaging Developent of the tie-dependent schee in partially coherent iaging is in principle siilar to that in coherent iaging [26]. The inverse lithography proble can be treated as an obstacle reconstruction proble [22, 23], which is an inverse proble involving obstacles where the desired unknown is a region consisting of several subregions. We give U a level set description by introducing an unknown function φ(x), which is related to U by defining { Uint for {x : φ(x) < 0} U(x)= U ext for {x : φ(x) > 0}, (10) where U int = 1 and U ext = 0 if we are dealing with binary asks. Now we can define the inverse lithography proble as finding φ(x) such that T (U) I 0. Solving this with a least squares fit to the approxiation is equivalent to seeking the iniizer of F(U)= 1 2 T (U) I 0 2. (11) The boundary of the subregions in U where U = U int is governed by the zero level set of φ, naely, φ(x)=0. If φ depends on both x and tie t such that the evolution of the subregions in U is associated with φ(x,t), following the steps in [26], we arrive at the tie-dependent odel with α(x,t) being defined as φ t = φ α(x,t), (12) α(x,t)= J(U) T (T (U) I 0 ) = 1 2 U (I I 0) 2 = 1 ( ) 2 2 U sig( Γ U H 2 ) I 0 { } = a Γ H [(I 0 I) I (1 I) (H U)], (13) (C) 2011 OSA 14 March 2011 / Vol. 19, No. 6 / OPTICS EXPRESS 5515
7 where J(U) is the Jacobian of T (U) at U and denotes eleent-by-eleent ultiplication. Eq. (12) is a partial differential equation (PDE). Once φ and α are defined at every grid point on the Cartesian grid, Eq. (12) can be solved using finite-difference ethods with first-order teporal and second-order spatial accuracy as suggested in [26]. It should be noted the inverse lithography proble is non-convex with ultiple local inia. Since we use finite-difference schees to solve the PDE, there is no guarantee of reaching the global iniu. However, ILT is an ill-posed proble and it is often not necessary to arrive at the global iniu. Any good local iniu (where goodness is defined using data-fidelity and user-defined properties) can suffice as an acceptable solution Aberration-aware statistical odel We have thus far assued noinal conditions where the iage always lies on the focal plane and the iage wavefronts is spherical. However, in optical lithography, the eerging wavefronts fro the pupil are in general aspherical [34], even if the lens surfaces are spherical. Deviation of wavefronts, also known as aberration, is studied extensively in the Nijboer-Zernike theory [37, 38, 39]. Aberration function Φ can be represented as Zernike polynoials [39], Φ(ρ,θ)= c n R n (ρ)cosθ, (14) n, where ρ,θ are the polar coordinates in the exit pupil function, and c n R n (ρ)cosθ is a polynoial of the Zernike set with c n being aberration coefficient. For exaple, one of the ost widely studied aberrations, defocus [34], or the focus error f between the iage plane and focal plane, can be expressed as f = c 0 2 ρ2 where c 0 2 is the aberration coefficient for defocus. As a reasonable assuption, the coefficients are odeled as independent, norally distributed rando variables with zero ean and identical non-zero variance. PSF in an ideal case where there exists no defocus and aberrations is taken as the inverse Fourier transfor of a disc function [34], denoted as H 0 in this paper. Aberration ters are incorporated into the PSF by ultiplying an exponential ter with aberration function as power in the frequency doain, i.e. [37] F (H)=F (H 0 ) e jφ, (15) where F denotes Fourier transfor. To enable the coputation of optiu ask patterns iniizing deviation of iages fro their targets not only at noinal but also over a range of aberrations, the objective function takes expectations of the difference under various aberration conditions to optiize the average perforance of layouts. The optiization proble we ai to solve becoes U optial = in E { I I 0 2 } 2, (16) U where 2 2 denotes the square of the l 2 nor and E denotes expectation. One should note this expectation-orient iniizing proble practically weights the cost function I I by the statistical probability of aberration ters appearing over a range. Previous efforts in [18, 29, 30] developed various algoriths to solve the inverse lithography proble in Eq.(16). Yet in the fraework of level-set-based ILT in partially coherent systes, a stable explicit tie-dependent odel can be applied, φ = φ α(x,t), (17) t (C) 2011 OSA 14 March 2011 / Vol. 19, No. 6 / OPTICS EXPRESS 5516
8 in which α(x,t) is coputed as α(x,t)= 1 2 U E { (I I 0 ) 2} { ( = 1 ) } 2 2 U E sig( Γ U H 2 ) I 0 { } = a E Γ H [(I 0 I) I (1 I) (H U)]. (18) One should notice that Eq. (17) takes the sae for as Eq. (12) with a different coputation of α(x,t), therefore Eq. (17) is also a PDE which could be solved by the proposed finite difference schees in [26]. The coputation stops after a certain nuber of iterations or when the value of the cost function has decreased below a certain threshold value. 3. Nuerical results We apply the inverse lithography technique outlined above to designing various circuit patterns for partially coherent systes. We use the sae iaging syste paraeters: λ = 193n, NA = 1.35, resolution Δx = 10n/pixel, steepness of the sigoid function a = 85, threshold t r = 0.3, and therefore the sae PSF H 0 (x) with the sae size as that of the target pattern which is for various experients. The optiization stops after 50 iterations. In this paper, we apply the proposed algoriths on binary asks. However, it should be noted the sae fraework can be readily applied to phase-shifting asks (PSMs) by applying different levels sets to corresponding phases in the PSMs. Figure. 2(a) shows the target pattern, and (b), (c) and (d) are the output patterns under circular, annular, and dipole source illuinations in Fig. 1(a), (b) and (c), respectively. Respective pattern errors are also given. In Fig. 3, input pattern derived using the proposed level-set based ILT in partially coherent iaging under noinal condition with circular, annular and dipole illuination are presented. The first colun denotes the input pattern, the second colun aerial iage and the third colun the output pattern. Cobining the data in Fig. 2 and Fig. 3, we can see that the input pattern developed using the proposed level-set based ILT greatly iproves pattern quality in partially coherent iaging systes under coonly used illuination sources. Another set of siulation is given in Fig. 4 applying the proposed statistical ethod to target pattern in Fig. 2(a) with circular source in Fig. 1(a) as an exaple to test its effectiveness against aberrations. It should be noted that the optial input ask pattern is coputed by averaging the output patterns under different aberration conditions weighted by the statistical probability of the aberration coefficient. Consequently, for any specific aberration, PSF H(x) should be coputed by degrading H 0 (x) with aberrations as in Eq. (15). For defocus aberration, conventionally, the relationship between the defocus coefficient c 0 2 and the real iage space coordinate z by paraxial approxiation can be described as [39] c 0 2 = 2 π ) (1 λ z (1 NA 2 ) z πna2 λ, (19) therefore, defocus ter is incorporated into the aplitude spread function H(x) by ultiplying (C) 2011 OSA 14 March 2011 / Vol. 19, No. 6 / OPTICS EXPRESS 5517
9 (a) (b) (c) (d) Fig. 2. (a) Target pattern of size (b) Output pattern under circular source, resulting in a pattern error of 45 pixels. (c) Output pattern under annular source, resulting in a pattern error of 116 pixels. (d) Output pattern under dipole source, resulting in a pattern error of 144 pixels. U(x) I aerial (x) I(x) (a) (b) (c) Fig. 3. Siulation of lithographic iaging with different ask patterns coputed using level-set based ILT. The first colun denotes the input U(x), the second colun I aerial (x), and the third colun I(x). Rows (a), (b) and (c) use the derived pattern under circular illuination, annular illuination, and dipole illuination as input, resulting in pattern errors of 5, 24, and 45 pixels respectively. an exponential ter with power, jc 0 2 ρ2 jπz NA2 λ ρ2 = jπz NA2 λ [ ( u λ ) 2 ( + v λ ) ] 2 NA NA = jπλz(u 2 + v 2 ) [ ( = jπλz 1 ) 2 ( + n 1 ) ] 2 NΔx NΔx = jπλz 2 + n 2 (NΔx) 2, (20) in which N is the iage size and (u,v) and (,n) are the frequency coordinates and noral- (C) 2011 OSA 14 March 2011 / Vol. 19, No. 6 / OPTICS EXPRESS 5518
10 (a) (b) algorith under noinal condition statistical ethod against defocus 80 pixel error focus error in n (c) algorith under noinal condition statistical ethod against coa 60 pixel error Aberration coefficient for coa c 3 (d) Fig. 4. Perforances of the proposed level-set based statistical ethod with aberration variations. (a) focus-aware input ask pattern coputed using the statistical ethod. (b) coa-aware input ask pattern coputed using the statistical ethod. (c) Coparison of pixel errors under different focus errors. (d) Coparison of pixel errors under different coa. (C) 2011 OSA 14 March 2011 / Vol. 19, No. 6 / OPTICS EXPRESS 5519
11 ized frequency coordinates corresponding to spatial coordinates (x, y) respectively, in the frequency doain of the noinal PSF H 0 (x). We first construct the optial input ask pattern with defocus variation using the statistical ethod described in Section 2.3 and then copare the generated results with that of the optial input ask pattern constructed under noinal conditions presented in U(x) of Fig. 3(a). The optial input ask pattern with defocus variation is presented in Fig. 4(a). It should be noted that since we are not introducing large aberration paraeters and sall weights accopany large aberration paraeters, big difference in ask patterns obtained under noinal condition and using the statistical ethod in Fig. 4(a) is not expected. Figure. 4(c) plots the perforance of the statistical ethod versus optiization only under noinal conditions with a defocus range of (-90n, 90n). It is observed that while under noinal conditions, the optial input ask pattern under noinal condition outperfors the input ask coputed using the statistical ethod, which is not a surprise since the forer is intended specifically for noinal conditions and the latter is not, the input ask coputed with statistical variability accounted for iproves pattern fidelity with focus variation, obtaining fewer pattern errors than the optial input ask pattern coputed under the noinal condition. This is because the expectation operation tends to copensate the distortion brought by different defocus conditions on the input pattern ask. In Fig. 4(b), the input ask coputed with statistical identity of coa variation accounted for is presented. The Zernike polynoial for coa is given as c 1 3 (3ρ3 2ρ)cosθ, and coa ter can be incorporated into the PSF H(x) by ultiplying noinal PSF H 0 (x) with an exponential ter with power, jc 1 3(3ρ 3 2ρ)cosθ = jc 1 3 ( 3 u λ ) 2 ( + v λ ) 2 NA NA 3 ( 2 u λ NA ) 2 ( + v λ ) 2 cosθ NA = jc 1 3 [3 λ 3 ( u 2 NA 3 + v 2) λ ( u 2 + v 2) ] 1 2 cosθ NA [ = jc 1 λ 3 ( (NΔxNA) 3 + n 2) 3 2 λ ( n 2) ] 1 2 cosθ. (21) N xna Figure. 4(d) plots the perforance of the statistical ethod versus optiization only under noinal conditions with a coa range c 1 3 of (-0.08, 0.08). Likewise, we observe siilar results in Fig. 4(d) as that in Fig. 4(c). These observations justify the proposed statistical algorith in producing aberration-aware input ask pattern for critical structures. It should be noted that when two or ore aberrations are present, the root ean square deforation of the cobined aberration ΔΦ rs = n, c n 2 becoes a chi-square distributed rando variable with degree of freedo equal to the nuber of Zernike polynoials in the cobined aberration. Incorporating aberration ters in the ASF siilarly as in Eq. (20) and Eq. (21), the proposed algorith can produce aberration-aware input asks against this cobined aberration using the proposed level-set-based statistical ethod. 4. Conclusion In this paper, we investigate level-set forulations for photoask design in optical icrolithography for partially coherent systes with coputationally efficient solutions. The inverse lithography proble is described as a constrained tie-dependent odel with the for of a partial differential equation which is solved by available finite-difference schees. The proposed level-set-based ILT enables coputation of optiu ask patterns to iniize deviations of (C) 2011 OSA 14 March 2011 / Vol. 19, No. 6 / OPTICS EXPRESS 5520
12 iages fro their targets not only at noinal but also over a range of aberrations. The statistical optiization fraework proposed in this paper offers algorithic insights of how the cost functions are weighted by statistical probability of aberration coefficients to optiize average layout perforance which shows great robustness against aberrations. Acknowledgent This work was supported in part by the Research Grants Council of the Hong Kong Special Adinistrative Region, China, under Projects HKU 7139/06E, 7174/07E and 7134/08E, and by the UGC Areas of Excellence project Theory, Modeling, and Siulation of Eerging Electronics. (C) 2011 OSA 14 March 2011 / Vol. 19, No. 6 / OPTICS EXPRESS 5521
Chapter 6 Aberrations
EE90F Chapter 6 Aberrations As we have seen, spherical lenses only obey Gaussian lens law in the paraxial approxiation. Deviations fro this ideal are called aberrations. F Rays toward the edge of the pupil
More informationImproving Ground Based Telescope Focus through Joint Parameter Estimation. Maj J. Chris Zingarelli USAF AFIT/ENG
Iproving Ground Based Telescope Focus through Joint Paraeter Estiation Maj J Chris Zingarelli USAF AFIT/ENG Lt Col Travis Blake DARPA/TTO - Space Systes Dr Stephen Cain USAF AFIT/ENG Abstract-- Space Surveillance
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationSharp Time Data Tradeoffs for Linear Inverse Problems
Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics
ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents
More informationData-Driven Imaging in Anisotropic Media
18 th World Conference on Non destructive Testing, 16- April 1, Durban, South Africa Data-Driven Iaging in Anisotropic Media Arno VOLKER 1 and Alan HUNTER 1 TNO Stieltjesweg 1, 6 AD, Delft, The Netherlands
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationInspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information
Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub
More informationŞtefan ŞTEFĂNESCU * is the minimum global value for the function h (x)
7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not
More informationRecovering Data from Underdetermined Quadratic Measurements (CS 229a Project: Final Writeup)
Recovering Data fro Underdeterined Quadratic Measureents (CS 229a Project: Final Writeup) Mahdi Soltanolkotabi Deceber 16, 2011 1 Introduction Data that arises fro engineering applications often contains
More informationEMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS
EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS Jochen Till, Sebastian Engell, Sebastian Panek, and Olaf Stursberg Process Control Lab (CT-AST), University of Dortund,
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical
IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul
More informationComplexity reduction in low-delay Farrowstructure-based. filters utilizing linear-phase subfilters
Coplexity reduction in low-delay Farrowstructure-based variable fractional delay FIR filters utilizing linear-phase subfilters Air Eghbali and Håkan Johansson Linköping University Post Print N.B.: When
More informationBoosting with log-loss
Boosting with log-loss Marco Cusuano-Towner Septeber 2, 202 The proble Suppose we have data exaples {x i, y i ) i =... } for a two-class proble with y i {, }. Let F x) be the predictor function with the
More informationExtension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels
Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique
More informationOptimal Resource Allocation in Multicast Device-to-Device Communications Underlaying LTE Networks
1 Optial Resource Allocation in Multicast Device-to-Device Counications Underlaying LTE Networks Hadi Meshgi 1, Dongei Zhao 1 and Rong Zheng 2 1 Departent of Electrical and Coputer Engineering, McMaster
More informationUsing a De-Convolution Window for Operating Modal Analysis
Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis
More informationNonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy
Storage Capacity and Dynaics of Nononotonic Networks Bruno Crespi a and Ignazio Lazzizzera b a. IRST, I-38050 Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I-38050 Povo (Trento) Italy INFN Gruppo
More informationRECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE
Proceedings of ICIPE rd International Conference on Inverse Probles in Engineering: Theory and Practice June -8, 999, Port Ludlow, Washington, USA : RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS
More informationEfficient Filter Banks And Interpolators
Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical
More informationThe Methods of Solution for Constrained Nonlinear Programming
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained
More informationMulti-Scale/Multi-Resolution: Wavelet Transform
Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationSoft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis
Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationNUMERICAL MODELLING OF THE TYRE/ROAD CONTACT
NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT PACS REFERENCE: 43.5.LJ Krister Larsson Departent of Applied Acoustics Chalers University of Technology SE-412 96 Sweden Tel: +46 ()31 772 22 Fax: +46 ()31
More informationStochastic Subgradient Methods
Stochastic Subgradient Methods Lingjie Weng Yutian Chen Bren School of Inforation and Coputer Science University of California, Irvine {wengl, yutianc}@ics.uci.edu Abstract Stochastic subgradient ethods
More informationStatistical clustering and Mineral Spectral Unmixing in Aviris Hyperspectral Image of Cuprite, NV
CS229 REPORT, DECEMBER 05 1 Statistical clustering and Mineral Spectral Unixing in Aviris Hyperspectral Iage of Cuprite, NV Mario Parente, Argyris Zynis I. INTRODUCTION Hyperspectral Iaging is a technique
More informationStructured signal recovery from quadratic measurements: Breaking sample complexity barriers via nonconvex optimization
Structured signal recovery fro quadratic easureents: Breaking saple coplexity barriers via nonconvex optiization Mahdi Soltanolkotabi Ming Hsieh Departent of Electrical Engineering University of Southern
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More informationHIGH RESOLUTION NEAR-FIELD MULTIPLE TARGET DETECTION AND LOCALIZATION USING SUPPORT VECTOR MACHINES
ICONIC 2007 St. Louis, O, USA June 27-29, 2007 HIGH RESOLUTION NEAR-FIELD ULTIPLE TARGET DETECTION AND LOCALIZATION USING SUPPORT VECTOR ACHINES A. Randazzo,. A. Abou-Khousa 2,.Pastorino, and R. Zoughi
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationGrafting: Fast, Incremental Feature Selection by Gradient Descent in Function Space
Journal of Machine Learning Research 3 (2003) 1333-1356 Subitted 5/02; Published 3/03 Grafting: Fast, Increental Feature Selection by Gradient Descent in Function Space Sion Perkins Space and Reote Sensing
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationExperimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis
City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna
More informationGraphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes
Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109
More informationEE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng
EE59 Spring Parallel LSI AD Algoriths Lecture I interconnect odeling ethods Zhuo Feng. Z. Feng MTU EE59 So far we ve considered only tie doain analyses We ll soon see that it is soeties preferable to odel
More informationIN modern society that various systems have become more
Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016 Lessons 7 14 Dec 2016 Outline Artificial Neural networks Notation...2 1. Introduction...3... 3 The Artificial
More informationMeasuring orbital angular momentum superpositions of light by mode transformation
CHAPTER 7 Measuring orbital angular oentu superpositions of light by ode transforation In chapter 6 we reported on a ethod for easuring orbital angular oentu (OAM) states of light based on the transforation
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationPattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition
More informationAn improved self-adaptive harmony search algorithm for joint replenishment problems
An iproved self-adaptive harony search algorith for joint replenishent probles Lin Wang School of Manageent, Huazhong University of Science & Technology zhoulearner@gail.co Xiaojian Zhou School of Manageent,
More informationThe linear sampling method and the MUSIC algorithm
INSTITUTE OF PHYSICS PUBLISHING INVERSE PROBLEMS Inverse Probles 17 (2001) 591 595 www.iop.org/journals/ip PII: S0266-5611(01)16989-3 The linear sapling ethod and the MUSIC algorith Margaret Cheney Departent
More informationA New Algorithm for Reactive Electric Power Measurement
A. Abiyev, GAU J. Soc. & Appl. Sci., 2(4), 7-25, 27 A ew Algorith for Reactive Electric Power Measureent Adalet Abiyev Girne Aerican University, Departernt of Electrical Electronics Engineering, Mersin,
More informationFourier Series Summary (From Salivahanan et al, 2002)
Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t
More informationStatistical Logic Cell Delay Analysis Using a Current-based Model
Statistical Logic Cell Delay Analysis Using a Current-based Model Hanif Fatei Shahin Nazarian Massoud Pedra Dept. of EE-Systes, University of Southern California, Los Angeles, CA 90089 {fatei, shahin,
More informationUpper bound on false alarm rate for landmine detection and classification using syntactic pattern recognition
Upper bound on false alar rate for landine detection and classification using syntactic pattern recognition Ahed O. Nasif, Brian L. Mark, Kenneth J. Hintz, and Nathalia Peixoto Dept. of Electrical and
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationProc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES
Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co
More informationRemoval of Intensity Bias in Magnitude Spin-Echo MRI Images by Nonlinear Diffusion Filtering
Reoval of Intensity Bias in Magnitude Spin-Echo MRI Iages by Nonlinear Diffusion Filtering Alexei A. Sasonov *, Chris R. Johnson Scientific Coputing and Iaging Institute, University of Utah, 50 S Central
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October
More informationNumerical Solution of the MRLW Equation Using Finite Difference Method. 1 Introduction
ISSN 1749-3889 print, 1749-3897 online International Journal of Nonlinear Science Vol.1401 No.3,pp.355-361 Nuerical Solution of the MRLW Equation Using Finite Difference Method Pınar Keskin, Dursun Irk
More informationConvexity-Based Optimization for Power-Delay Tradeoff using Transistor Sizing
Convexity-Based Optiization for Power-Delay Tradeoff using Transistor Sizing Mahesh Ketkar, and Sachin S. Sapatnekar Departent of Electrical and Coputer Engineering University of Minnesota, Minneapolis,
More informationarxiv: v3 [physics.optics] 1 Nov 2016
Super-resolution iaging using the spatial-frequency filtered intensity fluctuation correlation Jane Sprigg 1,*, Tao Peng 1, and Yanhua Shih 1 arxiv:1409.134v3 [physics.optics] 1 Nov 016 1 University of
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More informationREDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION
ISSN 139 14X INFORMATION TECHNOLOGY AND CONTROL, 008, Vol.37, No.3 REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION Riantas Barauskas, Vidantas Riavičius Departent of Syste Analysis, Kaunas
More informationANALYTICAL INVESTIGATION AND PARAMETRIC STUDY OF LATERAL IMPACT BEHAVIOR OF PRESSURIZED PIPELINES AND INFLUENCE OF INTERNAL PRESSURE
DRAFT Proceedings of the ASME 014 International Mechanical Engineering Congress & Exposition IMECE014 Noveber 14-0, 014, Montreal, Quebec, Canada IMECE014-36371 ANALYTICAL INVESTIGATION AND PARAMETRIC
More informationEnvelope frequency Response Function Analysis of Mechanical Structures with Uncertain Modal Damping Characteristics
Copyright c 2007 Tech Science Press CMES, vol.22, no.2, pp.129-149, 2007 Envelope frequency Response Function Analysis of Mechanical Structures with Uncertain Modal Daping Characteristics D. Moens 1, M.
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016/2017 Lessons 9 11 Jan 2017 Outline Artificial Neural networks Notation...2 Convolutional Neural Networks...3
More informationConvex Programming for Scheduling Unrelated Parallel Machines
Convex Prograing for Scheduling Unrelated Parallel Machines Yossi Azar Air Epstein Abstract We consider the classical proble of scheduling parallel unrelated achines. Each job is to be processed by exactly
More informationReducing Vibration and Providing Robustness with Multi-Input Shapers
29 Aerican Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June -2, 29 WeA6.4 Reducing Vibration and Providing Robustness with Multi-Input Shapers Joshua Vaughan and Willia Singhose Abstract
More informationA Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)
1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu
More informationMODIFICATION OF AN ANALYTICAL MODEL FOR CONTAINER LOADING PROBLEMS
MODIFICATIO OF A AALYTICAL MODEL FOR COTAIER LOADIG PROBLEMS Reception date: DEC.99 otification to authors: 04 MAR. 2001 Cevriye GECER Departent of Industrial Engineering, University of Gazi 06570 Maltepe,
More informationLow complexity bit parallel multiplier for GF(2 m ) generated by equally-spaced trinomials
Inforation Processing Letters 107 008 11 15 www.elsevier.co/locate/ipl Low coplexity bit parallel ultiplier for GF generated by equally-spaced trinoials Haibin Shen a,, Yier Jin a,b a Institute of VLSI
More informationDepartment of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China
6th International Conference on Machinery, Materials, Environent, Biotechnology and Coputer (MMEBC 06) Solving Multi-Sensor Multi-Target Assignent Proble Based on Copositive Cobat Efficiency and QPSO Algorith
More informationarxiv: v1 [math.na] 10 Oct 2016
GREEDY GAUSS-NEWTON ALGORITHM FOR FINDING SPARSE SOLUTIONS TO NONLINEAR UNDERDETERMINED SYSTEMS OF EQUATIONS MÅRTEN GULLIKSSON AND ANNA OLEYNIK arxiv:6.395v [ath.na] Oct 26 Abstract. We consider the proble
More informationComparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations
International Journal of Applied Science and Technology Vol. 7, No. 3, Septeber 217 Coparison of Stability of Selected Nuerical Methods for Solving Stiff Sei- Linear Differential Equations Kwaku Darkwah
More informationNumerical Studies of a Nonlinear Heat Equation with Square Root Reaction Term
Nuerical Studies of a Nonlinear Heat Equation with Square Root Reaction Ter Ron Bucire, 1 Karl McMurtry, 1 Ronald E. Micens 2 1 Matheatics Departent, Occidental College, Los Angeles, California 90041 2
More informationRandomized Accuracy-Aware Program Transformations For Efficient Approximate Computations
Randoized Accuracy-Aware Progra Transforations For Efficient Approxiate Coputations Zeyuan Allen Zhu Sasa Misailovic Jonathan A. Kelner Martin Rinard MIT CSAIL zeyuan@csail.it.edu isailo@it.edu kelner@it.edu
More informationpaper prepared for the 1996 PTRC Conference, September 2-6, Brunel University, UK ON THE CALIBRATION OF THE GRAVITY MODEL
paper prepared for the 1996 PTRC Conference, Septeber 2-6, Brunel University, UK ON THE CALIBRATION OF THE GRAVITY MODEL Nanne J. van der Zijpp 1 Transportation and Traffic Engineering Section Delft University
More informationHybrid System Identification: An SDP Approach
49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The
More informationOptical Properties of Plasmas of High-Z Elements
Forschungszentru Karlsruhe Techni und Uwelt Wissenschaftlishe Berichte FZK Optical Properties of Plasas of High-Z Eleents V.Tolach 1, G.Miloshevsy 1, H.Würz Project Kernfusion 1 Heat and Mass Transfer
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationUNCERTAINTIES IN THE APPLICATION OF ATMOSPHERIC AND ALTITUDE CORRECTIONS AS RECOMMENDED IN IEC STANDARDS
Paper Published on the16th International Syposiu on High Voltage Engineering, Cape Town, South Africa, 2009 UNCERTAINTIES IN THE APPLICATION OF ATMOSPHERIC AND ALTITUDE CORRECTIONS AS RECOMMENDED IN IEC
More informationGary J. Balas Aerospace Engineering and Mechanics, University of Minnesota, Minneapolis, MN USA
μ-synthesis Gary J. Balas Aerospace Engineering and Mechanics, University of Minnesota, Minneapolis, MN 55455 USA Keywords: Robust control, ultivariable control, linear fractional transforation (LFT),
More informationA Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay
A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer
More informationP016 Toward Gauss-Newton and Exact Newton Optimization for Full Waveform Inversion
P016 Toward Gauss-Newton and Exact Newton Optiization for Full Wavefor Inversion L. Métivier* ISTerre, R. Brossier ISTerre, J. Virieux ISTerre & S. Operto Géoazur SUMMARY Full Wavefor Inversion FWI applications
More informationComparison of Charged Particle Tracking Methods for Non-Uniform Magnetic Fields. Hann-Shin Mao and Richard E. Wirz
42nd AIAA Plasadynaics and Lasers Conferencein conjunction with the8th Internati 27-30 June 20, Honolulu, Hawaii AIAA 20-3739 Coparison of Charged Particle Tracking Methods for Non-Unifor Magnetic
More informationDESIGN OF THE DIE PROFILE FOR THE INCREMENTAL RADIAL FORGING PROCESS *
IJST, Transactions of Mechanical Engineering, Vol. 39, No. M1, pp 89-100 Printed in The Islaic Republic of Iran, 2015 Shira University DESIGN OF THE DIE PROFILE FOR THE INCREMENTAL RADIAL FORGING PROCESS
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationGeneralized Rayleigh Wave Dispersion in a Covered Half-space Made of Viscoelastic Materials
Copyright 7 Tech Science Press CMC vol.53 no.4 pp.37-34 7 Generalized Rayleigh Wave Dispersion in a Covered Half-space Made of Viscoelastic Materials S.D. Akbarov and M. Negin 3 Abstract: Dispersion of
More informationAn Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period
An Approxiate Model for the Theoretical Prediction of the Velocity... 77 Central European Journal of Energetic Materials, 205, 2(), 77-88 ISSN 2353-843 An Approxiate Model for the Theoretical Prediction
More information3D acoustic wave modeling with a time-space domain dispersion-relation-based Finite-difference scheme
P-8 3D acoustic wave odeling with a tie-space doain dispersion-relation-based Finite-difference schee Yang Liu * and rinal K. Sen State Key Laboratory of Petroleu Resource and Prospecting (China University
More informationbe the original image. Let be the Gaussian white noise with zero mean and variance σ. g ( x, denotes the motion blurred image with noise.
3rd International Conference on Multiedia echnology(icm 3) Estiation Forula for Noise Variance of Motion Blurred Iages He Weiguo Abstract. he ey proble in restoration of otion blurred iages is how to get
More informationConvolutional Codes. Lecture Notes 8: Trellis Codes. Example: K=3,M=2, rate 1/2 code. Figure 95: Convolutional Encoder
Convolutional Codes Lecture Notes 8: Trellis Codes In this lecture we discuss construction of signals via a trellis. That is, signals are constructed by labeling the branches of an infinite trellis with
More informationSpine Fin Efficiency A Three Sided Pyramidal Fin of Equilateral Triangular Cross-Sectional Area
Proceedings of the 006 WSEAS/IASME International Conference on Heat and Mass Transfer, Miai, Florida, USA, January 18-0, 006 (pp13-18) Spine Fin Efficiency A Three Sided Pyraidal Fin of Equilateral Triangular
More informationPh 20.3 Numerical Solution of Ordinary Differential Equations
Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing
More information