(12) United States Patent Ogawa et al.

Size: px
Start display at page:

Download "(12) United States Patent Ogawa et al."

Transcription

1 US B1 (12) Unted States Patent Ogawa et al. (o) Patent No.: (45) Date of Patent: US 7,151,027 Bl Dec. 19, 2006 (54) METHOD AND DEVICE FOR REDUCING INTERFACE AREA OF A MEMORY DEVICE (75) Inventors: Hroyuk Ogawa, Sunnyvale, CA (US); Yder Wu, Campbell, CA (US); Kuo-Tung Chang, Saratoga, CA (US); Yu Sun, Saratoga, CA (US) (73) Assgnee: Spanson LLC, Sunnyvale, CA (US) (*) Notce: Subject to any dsclamer, the term of ths patent s extended or adjusted under 35 U.S.C. 154(b) by 29 days. (21) Appl. No.: 10/859,369 (22) Fled: Jun. 1, 2004 (51) Int. CI. H01L 21/336 ( ) (52) U.S. CI 438/257; 438/238; 438/381; 257/E21; 257/613; 257/694; 257/645 (58) Feld of Classfcaton Search 438/257, 438/258, 238, 381, 647, 657, 734, 735, 954 See applcaton fle for complete search hstory. (56) References Cted U.S. PATENT DOCUMENTS 5,303,185 A * 4/1994 Hazan 365/ ,666,307 A * 9/1997 Chang 365/ ,953,254 A * 9/1999 Pourkeramat 365/ ,037,222 A * 3/2000 Huang et al 438/257 6,808,985 Bl * 10/2004 Lee et al 438/ / Al* 6/2005 MokWes et al 257/315 * cted by examner Prmary Examner Davd Nhu (57) ABSTRACT A method and devce for reducng nterface area of a memory devce. A poly-2 layer s formed above a substrate at an nterface between a memory array and a perphery of the memory devce. The poly-2 layer s etched proxmate to the memory array. The poly-2 layer s etched proxmate to the perphery such that a porton of the poly-2 layer remans at the nterface. 14 Clams, 6 Drawng Sheets

2 U.S. Patent Dec. 19,2006 Sheet 1 of 6 US 7,151,027 Bl 100 Fgure 1 (Pror Art)

3 U.S. Patent Dec. 19,2006 Sheet 2 of 6 US 7,151,027 Bl 200 Perphery Components 210 Memory Array 220 Fgure 2

4 U.S. Patent Dec. 19,2006 Sheet 3 of 6 US 7,151,027 Bl core nterface perphery 31 oa 1 310b Q5, 300 p-302 Faure 3A ~ core ' <. 315 V /' 31 oa I I ' 31 Ob I perphery 4- > I core ' <+ I 7 s* 3 oa l 305 l 1 Faure 3B 312 / / Fgure 3C perphery I >

5 U.S. Patent Dec. 19,2006 Sheet 4 of 6 US 7,151,027 Bl perphery Fgure 3D core ** perphery > l_r Fgure 3E core < Interface Structure perphery > 31 oa U 300 Fgure 3 F

6 U.S. Patent Dec. 19,2006 Sheet 5 of 6 US 7,151,027 Bl Fgure 3G

7 U.S. Patent Dec. 19,2006 Sheet 6 of 6 US 7,151,027 Bl Form a poly-1 layer on a substrate n an nterface area between a memory array and a perphery of a memory devce 420 Apply a delectrc layer over the poly-1 layer I 430 Form a poly-1 layer over the delectrc layer 440 Etch the poly-1 layer and poly-2 layer proxmate to the memory array 450 Etch the poy-2 layer proxmate to the perphery 460 Form spacers proxmate to the memory array and to the perphery Fgure 4

8 US 7,151,027 Bl METHOD AND DEVICE FOR REDUCING INTERFACE AREA OF A MEMORY DEVICE TECHNICAL FIELD The present nventon relates to the feld of floatng gate devces. Specfcally, the present nventon relates to reducng the nterface area between a memory array and a perphery of a memory devce. BACKGROUND ART A modem ntegrated crcut (IC), for example a flash memory devce, may have mllons to hundreds of mllons of devces made up of complex, mult-layered structures that 15 are fabrcated through hundreds of processng steps. Those structures are formed by repeated deposton and patternng of thn flms on a slcon substrate, also known as a wafer. One mportant goal of the semconductor ndustry s to reduce the sze of memory devces. In reducng the sze of 20 operatonal components (e.g., a memory array) and perphery components, an mportant consderaton s the nterface between the operatonal components and perphery components. Current fabrcaton processes for formng memory devces typcally form the operatonal components and the 25 perphery components usng separate processes. For example, when the perphery components are formed only the perphery s etched, and when the memory array s formed, only the memory array s etched. By formng the perphery components and the memory array usng dfferent 30 processes, a number of steps n the nterface area are created. A step exsts where two adjacent structures have a dfferent heght, as shown n FIG. 1. FIG. 1 s a dagram of a sde vew of a porton of an nterface area of an exemplary memory devce 100, n 35 accordance wth the pror art. By usng dfferent processes to form the memory array and the perphery components, respectvely, steps are created. Substrate 110 has been etched wheren two structures 115 and 120 reman. As can be seen, structure 120 s hgher than structure 115. In partcular, the 40 heght of the step s hard to control because the dfferent heghts are created usng dfferent processes. Sdewall spacers are commonly formed after the ndvdual transstors of the memory array have been formed. When the sdewall spacers are formed, strnger spacers (e.g., 45 strnger spacers 130 of FIG. 1) are formed n the nterface area at the steps. A strnger spacer s a small component that s easly peeled or removed from the memory devce. If removed, the debrs may be dsplaced to the memory array or perphery componentry. Ths debrs may result n a yeld 50 loss of performance by the memory array. Furthermore, because t s dffcult to control the heght of the steps, t s also hard to control the heght of the strnger spacers. In order to elmnate the rsks caused by strnger spacer debrs, current memory devces nclude a salcde block 55 fabrcated over the nterface area (e.g., salcde layer 140 of FIG. 1). After transstor formaton, a salcde block s formed over the nterface, requrng an addtonal mask, addng costs to the fabrcaton process. Moreover, the salcde block requres addtonal area of the nterface. In partcular, the 60 area requred by the salcde block consderably lmts the ablty to reduce the sze of the nterface area. DISCLOSURE OF INVENTION Varous embodments of the present nventon, a method and devce for reducng nterface area of a memory devce, 65 are descrbed. In one embodment, a memory devce s fabrcated, n whch a poly-2 layer s formed above a substrate at an nterface between a memory array and a perphery of the memory devce. The poly-2 layer s etched proxmate to the memory array. The poly-2 layer s etched proxmate to the perphery such that a porton of the poly-2 layer remans at the nterface. In one embodment, the porton of the poly-2 layer remanng at the nterface s the same heght as the memory array proxmate to the memory array and the same heght as the perphery proxmate to the perphery, such that step sze s smoothed out reducng the occurrence of strngers from spacer etchng. BRIEF DESCRIPTION OF DRAWINGS The accompanyng drawngs, whch are ncorporated n and form a part of ths specfcaton, llustrate embodments of the nventon and, together wth the descrpton, serve to explan the prncples of the nventon. FIG. 1 s a dagram of a sde vew of a porton of an nterface area of an exemplary memory devce, n accordance wth the pror art. FIG. 2 s a block dagram of a memory devce n accordance wth an embodment of the present nventon. FIGS. 3 A through 3G are dagrams of the sde vew of an exemplary nterface area of a memory devce llustratng steps n a process for formng an nterface structure, n accordance wth an embodment of the present nventon. FIG. 4 s a flowchart llustratng steps n a process for fabrcatng a memory devce, n accordance wth an embodment of the present nventon. The drawngs referred to n ths descrpton should be understood as not beng drawn to scale except f specfcally noted. MODE(S) FOR CARRYING OUT THE INVENTION Reference wll now be made n detal to embodments of the nventon, examples of whch are llustrated n the accompanyng drawngs. Whle the nventon wll be descrbed n conjuncton wth the descrbed embodments, t wll be understood that they are not ntended to lmt the nventon to these embodments. On the contrary, the nventon s ntended to cover alternatves, modfcatons and equvalents, whch may be ncluded wthn the sprt and scope of the nventon as defned by the appended clams. Furthermore, n the followng detaled descrpton of the present nventon, numerous specfc detals are set forth n order to provde a thorough understandng of the present nventon. However, the present nventon may be practced wthout these specfc detals. In other nstances, well-known methods, procedures, components, and crcuts have not been descrbed n detal as not to unnecessarly obscure aspects of the present nventon. The present nventon provdes a method and structure for reducng nterface area between the memory array and the perphery of a memory devce. In one embodment, the boundares of the varous masks used to form a polyslcon layer are adjusted such that a polyslcon nterface structure remans n the nterface. The polyslcon nterface structure s operable to smooth out any steps caused by the etchng. In partcular, the heght of the polyslcon nterface structure s easy to control, elmnatng the creaton of strnger spacers. Furthermore, embodments of the present nventon do not requre a salcde layer, thereby reducng the number of

9 US 7,151,027 Bl masks needed to fabrcate the memory devce and to allow for a reducton n nterface area. FIG. 2 s a block dagram of a memory devce n accordance wth an embodment of the present nventon. Memory devce 200 ncludes a perphery components por- 5 ton 210 and a memory array porton 220. In one embodment, memory devce 200 s a flash memory devce. Although only one memory array 220 s shown n memory devce 200, t s completely vable for there to be more than one memory array 220 beng formed on memory devce In one embodment, memory array 220 s manufactured n a flash memory process that s well known n the art. Included n the manufacture of memory array 220 may be source-dran portons, poly one and poly-2 layers, tunnel oxde, slcon, feld oxde, and the lke. In addton, nterface 15 area 230 of FIG. 2, whch s better llustrated n FIGS. 3A through 3G, ncludes poly-1 and poly-2 layers. FIGS. 3A through 3G are dagrams of the sde vew of an exemplary nterface area of a memory devce llustratng steps n a process for formng an nterface structure (FIG. 3G), n accordance wth an embodment of the present nventon. Specfcally, FIGS. 3A, 3B, 3C, 3D, 3E, 3F and 3G llustrate a process for fabrcatng an nterface structure 360 accordng to one embodment of the present nventon. In one embodment, nterface structure 360 ncludes poly- 25 slcon. In one such embodment, nterface structure 360 ncludes a poly-1 layer and a poly-2 layer. It s understood that FIGS. 3A through 3G are not drawn to scale and that only portons of the substrate 300 and other layers are shown. For smplcty of dscusson and llustra- 30 ton, the process s descrbed for a sngle nterface structure 360, although n actualty multple nterface structures may be formed. Furthermore, although the devce beng formed s referred to as a an nterface structure, t s apprecated that FIGS. 3A 35 through 3G only show an nterface structure n the process of beng formed, and not necessarly a completely formed nterface structure. It s apprecated that other processes and steps assocated wth the fabrcaton of an nterface structure may be performed along wth the process llustrated by 40 FIGS. 3A through 3G; that s, there may be a number of process steps before and after the steps shown and descrbed by FIGS. 3A through 3G. Importantly, embodments of the present nventon can be mplemented n conjuncton wth these other (conventonal) processes and steps wthout sg- 45 nfcantly perturbng them. Generally speakng, the varous embodments of the present nventon can replace a conventonal process wthout sgnfcantly affectng the perpheral processes and steps. Referrng frst to FIG. 3A, n the present embodment, 50 substrate 300, solaton area 305 (e.g., a shallow trenched area), and gate polyslcon ("poly-1") 310a and 3106 are shown n cross secton. In one embodment, solaton area 305 s flled wth S0 2. Lne 302 ndcates the approxmate border between the memory array (e.g., care) and the 55 nterface area. Smlarly, lne 304 ndcates the approxmate border between the nterface area and the perphery. The porton of substrate 300 of the memory array s typcally doped wth n-type and p-type materals to form a number of regons n the memory array. For example, n an n-channel 60 transstor n partcular, n a hgh voltage n-channel transstor the substrate 300 may nclude slcon doped wth a p-type materal, a deep n-well, a hgh voltage p-well, and hgh voltage n-wells. It should be apprecated that the porton of poly that resdes n the nterface and 65 perphery regons may not be needed to form actve transstors, and s therefore optonal. Referrng now to FIG. 3B, n the present embodment, a flm of delectrc materal 315 s appled over substrate 300 and poly-1 310a and 3106, essentally coatng the exposed (upper) surfaces of substrate 300 and poly-1 310a and Dfferent delectrc materals may be used; n one embodment, the delectrc materal ncludes S0 2, and n another embodment the delectrc materal ncludes S 3 N 4. In one embodment a oxde-ntrde-oxde (ONO) delectrc layer s appled. Referrng next to FIG. 3C, n the present embodment, a known process (such as an etch back process) s used to remove selectvely the delectrc materal 315 and poly Sgnfcantly, a porton of the delectrc materal 315 overlyng poly and a porton of substrate 300 s deposted and then selectvely removed. In one embodment, the deposton and removal s necessary for the fabrcaton of transstors of the memory array. In one embodment, notch 312 s etched nto solaton area 305. It should be apprecated that notch 312 s a small trench that s etched as a result of the process used to remove delectrc materal 315 and poly Wth reference to FIG. 3D, n the present embodment, a second polyslcon layer (poly-2) 320 s deposted above delectrc materal 315 and substrate 300. In one embodment, poly-2 layer 320 s used to form a word lne for use n the actve transstor of the memory array. Wth reference next to FIG. 3E, n the present embodment, a known process (such as a stacked gate etch) s used to etch a porton of poly-1 310a, delectrc materal 315, and poly proxmate to the memory array. The etch s used to form ndvdual transstors of from the polyslcon layers. In one embodment, the stacked gate edge uses a stacked gate mask above the nterface regon and the perphery. The etch creates a dstnct boundary between the memory array and the nterface regon. By locatng the stacked gate mask close to the core regon, poly-1 310a and poly reman n the nterface regon. Wth reference next to FIG. 3F, n the present embodment, a known process (such as a second gate etch) s used to etch a porton of poly proxmate to the perphery. The etch s used to form nterface structure 360. In one embodment, the second gate edge uses a second gate mask above the nterface regon and the memory array. The second gate etch creates a dstnct boundary between the memory array and the nterface regon. By locatng the second gate etch close to the perphery regon, only part of the poly n the nterface regon s etched, keepng nterface structure 360, ncludng poly-1 310a and poly-2 320, n the nterface regon. In one embodment, nterface structure 360 s the same heght as the memory array proxmate to the memory array and the same heght as the perphery proxmate to the perphery, such that step sze s smoothed out reducng the occurrence of strngers from spacer etchng. Referrng now to FIG. 3G, the memory devce now ncludes nterface structure 360 as well as transstor 330 and perphery poly It should be apprecated that transstor 330 s the last actve transstor of the memory array next to the nterface area. A flm of delectrc materal 345 s appled over substrate 300, nterface structure 360, transstor 330 and perphery poly-2 340, essentally coatng the exposed (upper) surfaces of substrate nterface structure 360, transstor 330 and perphery poly Dfferent delectrc materals may be used; n one embodment, the delectrc materal ncludes S0 2, and n another embodment the delectrc materal ncludes S 3 N4. A known process (such as an etch back process) s used to remove selectvely the

10 delectrc materal to form a frst set of spacers 350 along the sde walls of nterface structure 360, transstor 330 and perphery poly In one embodment, a second set of spacers are formed adjacent to the frst spacers 350. FIG. 4 s a flowchart llustratng steps n a process 400 for fabrcatng a memory devce, n accordance wth an embodment of the present nventon. Although specfc steps are dsclosed n process 400, such steps are exemplary. That s, the present nventon s well suted to performng varous other steps or varatons of the steps rected n process 400. US 7,151,027 Bl At step 410, a frst polyslcon layer (e.g., poly-1) s formed on a substrate n an nterface area between a memory array and a perphery of the memory devce. In one embodment, a gate oxde s grown on the substrate. At step 420, n 15 one embodment, a delectrc layer s appled over the frst polyslcon layer. In one embodment, the delectrc layer s an ONO layer. At step 430, a second polyslcon layer (e.g., poly-2) s formed over the delectrc layer. In one embodment, a gate or gate poly s formed over the gate oxde). At step 440, the poly-1 layer and the poly-2 layer are etched proxmate to the memory array. In one embodment, the etchng s accomplshed by performng a stacked gate etch. At step 450, the poly-2 layer s etched proxmate to the 25 perphery, such that an nterface structure ncludng a porton of the poly-1 layer and a porton of the poly-2 layer remans at the nterface. In one embodment, the etchng s accomplshed by performng a second gate etch. Thus, accordng to the varous embodments of the 30 present nventon, the nterface structure s the same heght as the memory array proxmate to the memory array and the same heght as the perphery proxmate to the perphery, such that step sze s smoothed out reducng the occurrence of strngers from spacer etchng. At step 460, spacers are 35 formed proxmate to the memory array and proxmate to the perphery. In one embodment, the spacers are ntrde spacers. To summarze, the descrbed embodments provde a 40 method and structure for reducng nterface area between the memory array and the perphery of a memory devce. In one embodment, the boundares of the varous masks used to form a polyslcon layer are adjusted such that a polyslcon nterface structure remans n the nterface. The polyslcon 45 nterface structure s operable to smooth out any steps caused by the etchng. In partcular, the heght of the polyslcon nterface structure s easy to control, elmnatng the creaton of strnger spacers. Furthermore, embodments of the present nventon do not requre a salcde layer, thereby reducng the number of masks needed to fabrcate the memory devce and to allow for a reducton n nterface area. The foregong descrptons of specfc embodments of the 55 present nventon have been presented for purposes of llustraton and descrpton. They are not ntended to be exhaustve or to lmt the nventon to the precse forms dsclosed, and obvously many modfcatons and varatons are possble n lght of the above teachng. The embodments 60 were chosen and descrbed n order to best explan the prncples of the nventon and ts practcal applcaton, to thereby enable others sklled n the art to best utlze the nventon and varous embodments wth varous modfcatons as are suted to the partcular use contemplated. It s 65 ntended that the scope of the nventon be defned by the Clams appended hereto and ther equvalents What s clamed s: 1. A method for fabrcatng a memory devce, sad method comprsng: formng a poly-2 layer above a substrate at an nterface between a memory array and a perphery of sad memory devce; etchng sad poly-2 layer proxmate to sad memory array; and etchng sad poly-2 layer proxmate to sad perphery such that a porton of sad poly-2 layer remans at sad nterface. 2. The method as rected n clam 1 further comprsng: formng a poly-1 layer above sad substrate at sad nterface, such that sad poly-1 layer s above sad substrate and beneath sad poly-2 layer; etchng sad poly-1 layer proxmate to sad memory array; and etchng sad poly-1 layer proxmate to sad perphery such that a porton of sad poly-1 layer remans at sad nterface. 3. The method as rected n clam 1 wheren sad etchng sad poly-2 layer proxmate to sad memory array s accomplshed by performng a stacked gate etch. 4. The method as rected n clam 1 wheren sad etchng sad poly-2 layer proxmate to sad perphery s accomplshed by performng a second gate etch. 5. The method as rected n clam 1 further comprsng: formng spacers proxmate to sad memory array; and formng spacers proxmate to sad perphery. 6. The method as rected n clam 2 further comprsng formng an ONO layer above sad poly-1 layer such that sad ONO layer s above sad poly-1 layer and beneath sad poly-2 layer. 7. The method as rected n clam 1 wheren sad porton of sad poly-2 layer remanng at sad nterface s a same heght as sad memory array proxmate to sad memory array a same heght as sad perphery proxmate to sad perphery, such that step sze s smoothed out reducng an occurrence of strngers from spacer etchng. 8. A method for fabrcatng a memory devce, sad method comprsng: formng a poly-1 layer above a substrate at an nterface between a memory array and a perphery of sad memory devce; formng a poly-2 layer above sad poly-1 layer at sad nterface; etchng sad poly-1 layer and sad poly-2 layer proxmate to sad memory array; and etchng sad poly-2 layer proxmate to sad perphery, such that an nterface structure ncludng a porton of sad poly-1 layer and a porton of sad poly-2 layer remans at sad nterface. 9. The method as rected n clam 8 wheren sad etchng sad poly-1 layer and sad poly-2 layer proxmate to sad memory array s accomplshed by performng a stacked gate etch. 10. The method as rected n clam 8 wheren sad etchng sad poly-2 layer proxmate to sad perphery s accomplshed by performng a second gate etch. 11. The method as rected n clam 8 further comprsng: formng spacers proxmate to sad memory array; and formng spacers proxmate to sad perphery. 12. The method as rected n clam 11 wheren sad spacers are ntrde spacers.

11 13. The method as rected n clam 8 further comprsng formng an ONO layer above sad poly-1 layer such that sad ONO layer s above sad poly-1 layer and beneath sad poly-2 layer. 14. The method as rected n clam 8 wheren sad nterface structure s a same heght as sad memory array US 7,151,027 Bl 8 proxmate to sad memory array and a same heght as sad perphery proxmate to sad perphery, such that step sze s smoothed out reducng an occurrence of strngers from spacer etchng.

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

(10) Patent No.: (45) Date of Patent:

(10) Patent No.: (45) Date of Patent: (12) Unted States Patent Maher et al. 111111111111111111111111111111111111111111111111111111111111111111111111111 US006301603Bl (10) Patent No.: (45) Date of Patent: US 6,301,603 Bl Oct. 9,2001 (54) SCALABLE

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

(12) United States Patent (10) Patent No.: US 9,373,057 B1

(12) United States Patent (10) Patent No.: US 9,373,057 B1 US009373057B1 (12) Unted States Patent () Patent No.: Erhan et al. (45) Date of Patent: Jun. 21, 2016 (54) TRAINING A NEURAL NETWORK TO 6,934,415 B2 * 8/2005 Stentford... GO6K 9,4671 DETECT OBJECTS IN

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Notes on Organizing Java Code: Packages, Visibility, and Scope

Notes on Organizing Java Code: Packages, Visibility, and Scope Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL) Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,

More information

11. HARMS How To: CSV Import

11. HARMS How To: CSV Import and Rsk System 11. How To: CSV Import Preparng the spreadsheet for CSV Import Refer to the spreadsheet template to ad algnng spreadsheet columns wth Data Felds. The spreadsheet s shown n the Appendx, an

More information

The example below contains two doors and no floor level obstacles. Your panel calculator should now look something like this: 2,400

The example below contains two doors and no floor level obstacles. Your panel calculator should now look something like this: 2,400 Step 1: A r c h t e c t u r a l H e a t n g o begn wth you must prepare a smple drawng for each room n whch you wsh to nstall our Heat Profle Skrtng Heatng System. You certanly don't need to be Pcasso,

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

Intro. Iterators. 1. Access

Intro. Iterators. 1. Access Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy

More information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying Acoustic Transient Signals Using Artificial Intelligence Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)

More information

mon computer security problem. Some Trojans modify the Related U.S. Application Data

mon computer security problem. Some Trojans modify the Related U.S. Application Data USOO8266295B2 (12) Unted States Patent Klen et al. () Patent No.: (45) Date of Patent: US 8.266,295 B2 Sep. 11, 2012 (54) (75) (73) (*) (21) (22) (86) (87) (65) () (51) (52) SYSTEMAND METHOD FOR DETECTING

More information

FIBARO WALL PLUG OPERATING MANUAL FGBWHWPE-102/FGBWHWPF-102 CONTENTS

FIBARO WALL PLUG OPERATING MANUAL FGBWHWPE-102/FGBWHWPF-102 CONTENTS OPERATING MANUAL EN FIBARO WALL PLUG FGBWHWPE-102/FGBWHWPF-102 CONTENTS #1: Descrpton and features 3 #2: Parng the accessory 4 #3: Reset 5 #4: Functonalty 6 v1.0 #5: W-F 8 #6: Confgurable parameters 9

More information

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING James Moscola, Young H. Cho, John W. Lockwood Dept. of Computer Scence and Engneerng Washngton Unversty, St. Lous, MO {jmm5,

More information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

Wireless Temperature Monitoring Overview

Wireless Temperature Monitoring Overview Wreless Temperature Montorng Overvew Wreless Temperature Montorng and Alerts. Your Dashboard gves you advanced montorng, alerts (SMS or Emals), graphng and PDF reports from anywhere n the world. Product

More information

with Optic65 and Optic25 Cameras FOR OUTDOOR TRACKING ONLY unless used in conjunction with the Indoor Tracking Accessory.

with Optic65 and Optic25 Cameras FOR OUTDOOR TRACKING ONLY unless used in conjunction with the Indoor Tracking Accessory. wth Optc6 and Optc Cameras Quck Start Gude FOR OUTDOOR TRACKING ONLY unless used n conjuncton wth the Indoor Trackng Accessory. CONGRATULATIONS ON SCORING YOUR SOLOSHOT Our category-creatng lne of personal

More information

UNIT 2 : INEQUALITIES AND CONVEX SETS

UNIT 2 : INEQUALITIES AND CONVEX SETS UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning

Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning Parallel Inverse Halftonng by Look-Up Table (LUT) Parttonng Umar F. Sddq and Sadq M. Sat umar@ccse.kfupm.edu.sa, sadq@kfupm.edu.sa KFUPM Box: Department of Computer Engneerng, Kng Fahd Unversty of Petroleum

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

On the Exact Analysis of Bluetooth Scheduling Algorithms

On the Exact Analysis of Bluetooth Scheduling Algorithms On the Exact Analyss of Bluetooth Schedulng Algorth Gl Zussman Dept. of Electrcal Engneerng Technon IIT Hafa 3000, Israel glz@tx.technon.ac.l Ur Yechal Dept. of Statstcs and Operatons Research School of

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

US 6,658,576 Bl Dec. 2, 2003

US 6,658,576 Bl Dec. 2, 2003 (12) Unted States Patent Lee 1111111111111111 11111 lllll lllll lllll lllll 111111111111111 1111111111 11111111 US006658576Bl (10) Patent No.: (45) Date of Patent: US 6,658,576 Bl Dec. 2, 2003 (54) ENERGY-CONSERVNG

More information

CHAPTER 2 DECOMPOSITION OF GRAPHS

CHAPTER 2 DECOMPOSITION OF GRAPHS CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng

More information

Cell Count Method on a Network with SANET

Cell Count Method on a Network with SANET CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

Product documentation. Issue:

Product documentation. Issue: Product documentaton Issue: 02.05.2017 Table of Contents Product documentaton 1 enet SMART HOME system... 5 1.1 System requrements... 5 1.2 Commssonng va... 5 1.3 Operaton va enet SMART HOME app... 7 2

More information

Design of Structure Optimization with APDL

Design of Structure Optimization with APDL Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

arxiv: v3 [cs.ds] 7 Feb 2017

arxiv: v3 [cs.ds] 7 Feb 2017 : A Two-stage Sketch for Data Streams Tong Yang 1, Lngtong Lu 2, Ybo Yan 1, Muhammad Shahzad 3, Yulong Shen 2 Xaomng L 1, Bn Cu 1, Gaogang Xe 4 1 Pekng Unversty, Chna. 2 Xdan Unversty, Chna. 3 North Carolna

More information

ETAtouch RESTful Webservices

ETAtouch RESTful Webservices ETAtouch RESTful Webservces Verson 1.1 November 8, 2012 Contents 1 Introducton 3 2 The resource /user/ap 6 2.1 HTTP GET................................... 6 2.2 HTTP POST..................................

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information

Connection-information-based connection rerouting for connection-oriented mobile communication networks

Connection-information-based connection rerouting for connection-oriented mobile communication networks Dstrb. Syst. Engng 5 (1998) 47 65. Prnted n the UK PII: S0967-1846(98)90513-7 Connecton-nformaton-based connecton reroutng for connecton-orented moble communcaton networks Mnho Song, Yanghee Cho and Chongsang

More information

User Manual SAPERION Web Client 7.1

User Manual SAPERION Web Client 7.1 User Manual SAPERION Web Clent 7.1 Copyrght 2016 Lexmark. All rghts reserved. Lexmark s a trademark of Lexmark Internatonal, Inc., regstered n the U.S. and/or other countres. All other trademarks are the

More information

MATHEMATICS FORM ONE SCHEME OF WORK 2004

MATHEMATICS FORM ONE SCHEME OF WORK 2004 MATHEMATICS FORM ONE SCHEME OF WORK 2004 WEEK TOPICS/SUBTOPICS LEARNING OBJECTIVES LEARNING OUTCOMES VALUES CREATIVE & CRITICAL THINKING 1 WHOLE NUMBER Students wll be able to: GENERICS 1 1.1 Concept of

More information

Detection of an Object by using Principal Component Analysis

Detection of an Object by using Principal Component Analysis Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,

More information

Backpropagation: In Search of Performance Parameters

Backpropagation: In Search of Performance Parameters Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,

More information

High level vs Low Level. What is a Computer Program? What does gcc do for you? Program = Instructions + Data. Basic Computer Organization

High level vs Low Level. What is a Computer Program? What does gcc do for you? Program = Instructions + Data. Basic Computer Organization What s a Computer Program? Descrpton of algorthms and data structures to acheve a specfc ojectve Could e done n any language, even a natural language lke Englsh Programmng language: A Standard notaton

More information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems S. J and D. Shn: An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems 2355 An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems Seunggu J and Dongkun Shn, Member,

More information

LINE ARRAYS CONCEPTS AND MODELING TOOLS. Jeff Berryman May 29, 2010 / Rev. 1

LINE ARRAYS CONCEPTS AND MODELING TOOLS. Jeff Berryman May 29, 2010 / Rev. 1 LINE ARRAYS CONCEPTS AND MODELING TOOLS Jeff Berryman May 29, 2010 / Rev. 1 A lne array s a stack of loudspeaker systems n a sngle lne. The lne s usually curved. Uncurved lnes do not have desrable drectonal

More information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

Application Specification Miniature Spring Socket Contacts 03 MAY 11 Rev C

Application Specification Miniature Spring Socket Contacts 03 MAY 11 Rev C Applcaton Specfcaton Mnature Sprng 114-13152 Socket Contacts 03 MAY 11 Rev C All numercal values are n metrc unts [wth U.S. customary unts n brackets]. Dmensons are n mllmeters [and nches]. Unless otherwse

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Multi-view 3D Position Estimation of Sports Players

Multi-view 3D Position Estimation of Sports Players Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem

More information

Sensor-aware Adaptive Pull-Push Query Processing for Sensor Networks

Sensor-aware Adaptive Pull-Push Query Processing for Sensor Networks Sensor-aware Adaptve Pull-Push Query Processng for Sensor Networks Raja Bose Unversty of Florda Ganesvlle, FL 326 U.S.A. rbose@cse.ufl.edu Abdelsalam Helal Unversty of Florda Ganesvlle, FL 326 U.S.A. helal@cse.ufl.edu

More information

DLK Pro the all-rounder for mobile data downloading. Tailor-made for various requirements.

DLK Pro the all-rounder for mobile data downloading. Tailor-made for various requirements. DLK Pro the all-rounder for moble data downloadng Talor-made for varous requrements www.dtco.vdo.com Smply brllant, brllantly smple Always the rght soluton The DLK Pro s the VDO product famly, whch sets

More information

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

THE THEORY OF REGIONALIZED VARIABLES

THE THEORY OF REGIONALIZED VARIABLES CHAPTER 4 THE THEORY OF REGIONALIZED VARIABLES 4.1 Introducton It s ponted out by Armstrong (1998 : 16) that Matheron (1963b), realzng the sgnfcance of the spatal aspect of geostatstcal data, coned the

More information

THE PULL-PUSH ALGORITHM REVISITED

THE PULL-PUSH ALGORITHM REVISITED THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748

More information

MRKOMNO. kéï=~ë=çñw= pfabufp=ud. aáöáí~ä=o~çáçöê~éüó. nìáåâ=êéñéêéååé=öìáçé==== båöäáëü

MRKOMNO. kéï=~ë=çñw= pfabufp=ud. aáöáí~ä=o~çáçöê~éüó. nìáåâ=êéñéêéååé=öìáçé==== båöäáëü kéï=~ë=çñw= MRKOMNO pfabufp=ud aáöáí~ä=o~çáçöê~éüó nìáåâ=êéñéêéååé=öìáçé==== båöäáëü 0123 Ths product bears the CE markng n accordance wth the provsons of the Councl Drectve 93/42/EEC of June 14, 1993

More information

CHAPTER 4 PARALLEL PREFIX ADDER

CHAPTER 4 PARALLEL PREFIX ADDER 93 CHAPTER 4 PARALLEL PREFIX ADDER 4.1 INTRODUCTION VLSI Integer adders fnd applcatons n Arthmetc and Logc Unts (ALUs), mcroprocessors and memory addressng unts. Speed of the adder often decdes the mnmum

More information

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

More information

Classification Based Mode Decisions for Video over Networks

Classification Based Mode Decisions for Video over Networks Classfcaton Based Mode Decsons for Vdeo over Networks Deepak S. Turaga and Tsuhan Chen Advanced Multmeda Processng Lab Tranng data for Inter-Intra Decson Inter-Intra Decson Regons pdf 6 5 6 5 Energy 4

More information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

Assembler. Building a Modern Computer From First Principles.

Assembler. Building a Modern Computer From First Principles. Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought

More information

Design of a Real Time FPGA-based Three Dimensional Positioning Algorithm

Design of a Real Time FPGA-based Three Dimensional Positioning Algorithm Desgn of a Real Tme FPGA-based Three Dmensonal Postonng Algorthm Nathan G. Johnson-Wllams, Student Member IEEE, Robert S. Myaoka, Member IEEE, Xaol L, Student Member IEEE, Tom K. Lewellen, Fellow IEEE,

More information

CACHE MEMORY DESIGN FOR INTERNET PROCESSORS

CACHE MEMORY DESIGN FOR INTERNET PROCESSORS CACHE MEMORY DESIGN FOR INTERNET PROCESSORS WE EVALUATE A SERIES OF THREE PROGRESSIVELY MORE AGGRESSIVE ROUTING-TABLE CACHE DESIGNS AND DEMONSTRATE THAT THE INCORPORATION OF HARDWARE CACHES INTO INTERNET

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water. Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent

More information

Solution Brief: Creating a Secure Base in a Virtual World

Solution Brief: Creating a Secure Base in a Virtual World Soluton Bref: Creatng a Secure Base n a Vrtual World Soluton Bref: Creatng a Secure Base n a Vrtual World Abstract The adopton rate of Vrtual Machnes has exploded at most organzatons, drven by the mproved

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Math Homotopy Theory Additional notes

Math Homotopy Theory Additional notes Math 527 - Homotopy Theory Addtonal notes Martn Frankland February 4, 2013 The category Top s not Cartesan closed. problem. In these notes, we explan how to remedy that 1 Compactly generated spaces Ths

More information

Design and Analysis of Algorithms

Design and Analysis of Algorithms Desgn and Analyss of Algorthms Heaps and Heapsort Reference: CLRS Chapter 6 Topcs: Heaps Heapsort Prorty queue Huo Hongwe Recap and overvew The story so far... Inserton sort runnng tme of Θ(n 2 ); sorts

More information

Lecture 3: Computer Arithmetic: Multiplication and Division

Lecture 3: Computer Arithmetic: Multiplication and Division 8-447 Lecture 3: Computer Arthmetc: Multplcaton and Dvson James C. Hoe Dept of ECE, CMU January 26, 29 S 9 L3- Announcements: Handout survey due Lab partner?? Read P&H Ch 3 Read IEEE 754-985 Handouts:

More information

user journey: a series of steps (typically 4-12) which represent a scenario in which a user might interact with the thing you are designing.

user journey: a series of steps (typically 4-12) which represent a scenario in which a user might interact with the thing you are designing. Topc Dscovery user journey: a seres of steps (typcally 4-12) whch represent a scenaro n whch a user mght nteract wth the thng you are desgnng. Two (2) man uses: 1. demonstratng the way users currently

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information