A Perfect Recipe to maintain SAS programs Shiva Srinivasan, PJM Interconnection LLC, Norristown, PA Shailaja P Ramesh, Supreme Tech Solutions LLC, VA
|
|
- Loren Barker
- 5 years ago
- Views:
Transcription
1 A Perfet Reipe to mintin SAS progrms Shiv Srinivsn, PJM Interonnetion LLC, Norristown, PA Shilj P Rmesh, Supreme Teh Solutions LLC, VA ABSTRACT The gol of this pper is to identify the essentil ingredients in writing, mintining nd deugging SAS ode. The stndrds nd guidelines presented herein will ssist softwre developers nd progrmmers to develop ler, effiient nd esily mintinle SAS ode regrdless of the environments. INTRODUCTION The SAS progrmming lnguge while roust provides flexiility. It llows progrmmers to write vlid SAS progrms in severl different wys nd yet hieve the sme result. It hs een oserved tht SAS progrms written refully dhering to ertin priniples nd guidelines re muh esier to mintin. The guidelines mentioned in this pper do not pply to SAS ode generted vi pplition tools suh s SAS Enterprise Guide or ny other third prty tool. SOFTWARE DEVELOPMENT LIFE CYCLE It is reommended to dpt the Softwre Development Life Cyle to fully utilize the potentil of implementing SAS stndrds.. Requirements. Anlysis. Design d. Coding e. Testing f. Integrtion g. Aeptne h. Implementtion i. Mintenne The steps re s follows. Colleting User requirements: This is to identify the prolem definition. This is sttement of need from the user s perspetive. These requirements re usully n Verl desription of wht the progrm should do (lerly explining the lultions nd nlysis involved in dt olletion terminology). Anlysis nd Plnning: This involves generting the high level progrm speifitions nd doumenttion of sttements ontining the funtionl speifitions, fesiility of the projet, proposed timeline, the resoures required nd onsidertion of lterntive solutions.. Design: The Developer retes progrm speifitions tht tke the requirements nd trnsltes them into dtse nd progrmming terminology. This phse determines how
2 the system or progrm will get the work done. A development work pln nd vlidtion protool re doumented during this phse. d. Coding: Progrmming tivities re now performed using the requirements, the speifitions, nd the vlidtion protool s referenes. Progrms re developed using forml progrmming guidelines whih re gered towrds produing redle nd mintinle ode. e. Testing: Progrms re then tested for ll possile ugs y the developer while ensuring miniml reline on the vlidtor to identify errors. Regression testing is lso performed to ensure tht the funtionlity of the progrm hs not een ffeted due to modifitions. f. Integrtion: This phse involves integrting the progrm to new/existing systems/progrms nd verifition of overll integrity. g. Aeptne: The solution must e presented to the user for his eptne nd sign-off. h. Implementtion: Any hnges to vlidted progrm must follow well-defined Chnge Mngement proess. In this phse, doumenttion regrding why hnge is needed (is it ug fix or progrm enhnement) is performed. One the hnge is mde, the progrm must e revlidted through extensive testing efore it is put k in prodution. i. Mintenne: A hnge in the usiness logi or n enhnement to n existing one would lmost for ertin need progrm modifitions or new ones need to e developed. All mintenne tivities should gin follow the steps g of the Softwre development life yle. The ove mentioned steps n e ompressed to only those relted to speifi tsk or projet. Regrdless of the numer of steps involved in projet, doumenttion nd testing re indispensle stges required to ensure desired outomes.. STANDARDS AND GUIDELINES Essentils 1. Clrity 2. Consisteny 3. Mintinility 4. Reusility 5. Trnsfer Cpility (i.e. ross environments) 6. Trnsfer Cpility (i.e. ross vrious memers) 7. Not just redle ut understndle Ctegories 1. Nming Conventions 2. Comptiility 3. Doumenttion 4. Apperne 5. Effiieny 6. Mintinility 2
3 1. Nming Conventions Use pproprite, meningful nd unmiguous nmes for lirries, progrm files, dtsets, mros, dtsets, vriles, formts nd mro vriles. Following re some of the stndrds pertining to nming. Nme Convention Exmples XYZ1.ss, XYZ2.ss Cn e nmed sequentilly 1 Progrms dev_rep.ss, dev_formt.ss Cn e nmed logilly Should e nmed logilly mroli 2 Lirries Should inlude some kind of li_mro identifier 3 Dtsets Depend on the pplition nd fility stndrd Should e logil Vriles Should e speified for speifi pplition needs or deprtment guidelines 4 Trunte long nmes rther thn revite Input i_vrnme Vriles Output o_vrnme Vriles Arry Vriles _rrynme _rrynme IN = Nmes 5 Formt Should inlude some kind of identifier Cse 1: When pplied to one vrile MERGE X(IN=INX) Y(IN=INY) FORMAT NAMETYPE NAMEFMT FORMAT NAMETYPE FMT_NAME Cse 2: When pplied to tegory FORMAT DATETYPE DATEFMT FORMAT DATETYPE DATEFMT FORMAT DATETYPE FMT_DATE 6 Mro Use self doumenting nmes for mro nmes nd mro prmeters %mro totl_qty(dsn=,strtdte=); 3
4 7 Nmes to void Nmes tht too losely resemle one nother Amiguous nmes suh s FLAG1, COUNT Insted use IS_FOUND, nonnormlurveflg, errount, iter_ount 8 Generl Nming Nmes should e short, desriptive nd unique In se longer nmes re needed, use undersores to seprte words Sequentil progrms should hve the sme nme-prefix ut lso hve numeril suffixes to indite their ple in the sequene pro_not_exeed, seson_prmeter, log_of_sles 2. Comptiility Comptiility dels with the flexiility of SAS ode to e trnsported to other pltforms. Following stndrd for omptiility helps hieve the trnsfer with reltive ese. Comptiility generlly involves the following. Filittes trnsfer of progrms to other pltforms. Generlize the ode suh tht speil fetures of one system n e esily trnslted to work on nother system. Follow onsisteny so tht progrms n e shred ross memers of group d. Progrms must e written keeping in mind tht it would e used severl times or reused severl times under different irumstnes Some of the stndrds pertining to omptiility re s follows Environment Vriles: The following sttements n e stored seprtely so tht they n e %INCLUDE-ed in ll pplition progrms %let sspth = %sysget(appl_sas); %let mropth = %sysget(appl_macrolib); %let formtpth = %sysget(appl_formatlib); %let dtpth = %sysget(appl_data); %let logpth = %sysget(appl_log); %let outpth = %sysget(appl_output); Log nd Output Rediret log nd output files (lst files) to seprte diretories or lirries using stndrd pth/lirry nmes 4
5 PROC PRINTTO LOG = &logpth/xyz1.log; PROC PRINTTO LOG = &outpth/xyz1.lst; Options Options relting to printer suh s LINESIZE nd PAGESIZE should not e hrdoded 3. Doumenttion For mintenne nd deugging purposes dd numerous explntory omments with the SAS progrm explining detils out:. Module Desription. Conditionl nd Susetting Logi. Explntion of Clultions, dtse queries nd logi pertining to the module Some of the stndrds pertining to Doumenttion re s follows Nme Desription Exmple A progrm heder should See Prologue Setion Progrm e the strt of ny Heder Dtset Lels Vrile Lels progrm A lel should e used when sving permnent SAS dtset Vrile lels must e inluded while sving SAS permnent dtsets DATA MYLIB.Y123(Lel= "File 123 of Customer Dt for Yer 2004"); DATA MYLIB.Y123(Lel= "File 123 of Customer Dt for Yer 2004"); SET Y; LABEL V_NAME1 = 'Vrile 1' V_NAME2 = 'Vrile 2'; 4 Comments d DATA step nd PROC step sttements must lwys e ommented Identify the tion eing performed (explin omplex lultions, explin non stndrd logi) Use Inline omments to more fully identify nmes whose required revity osures their mening Identify the funtionlity of omments DATA AREA; SET RADIUS; AREA = 3.14 * (RADIUS**2); /* Cl Are */ /*smll point*/ /***More Importnt***/ /********** Minor Brek **********/ /***********************************/ /*** Signifint Susetion ***/ /***********************************/ 5
6 5 Output Alwys speify titles when generting outputs PROC PRINT DATA = orig_dt; TITLE 'ORIGINAL DATA'; A prologue desries wht the progrm ws intended to omplish, its uthor, nd the resons for its development (suh s, wht, why, for whom, y whom nd when); the prologue should lso inlude hnge mngement ontrol log, whih desries the susequent modifitions mde to the progrm. A stndrd prologue should ontin the following ut my lso ontin ny other informtion pertining to the projet requirements. Prologue * ************ ******************** ************ ************ * * PROGRAM NAME : * * DESCRIPTION : * * * * DEPENDENCIES * * CALLED BY : * * CALLS TO : * * * * PROGRAMMER : * * DATE ORIGINAL : * * ************ ******************** ************ ************ * * INPUT FILES/LIBRARIES : * * OUTPUT FILES/LIBRARIES : * * ************ ******************** ************ ************ * * MODIFICATIONS * * DATE : * * CHANGE # : * * PROGRAMMER : * * DESCRIPTION : * * ************ ******************** ************ ************ * 4. Apperne nd Redility Progrms should e written in mnner whih is redle nd esy to mintin.. Progrms should look net nd orderly. The visul pperne of the progrm should mirror its logil flow Apperne is very losely relted to style nd vries etween users, ut the reommendtion is to dhere to n pproprite style nd mintin it ross SAS progrms. Some of the guidelines for writing SAS progrms tht re esy to mintin nd understndle re s follows 6
7 Nme Desription Exmple 1 # of sttements Use one sttement per line 2 Blnk Lines Skip line efore every DATA nd PROC sttements Seprte loks of ode to mke progrms redle DATA X; sttements.; run; PROC pronme; sttements.; run; 3 Alignment nd Indenttion d Left justify DATA, PROC, OPTIONS sttements. Indent ll sttements within. Indent sttements within DO loop. Align END with DO Indent sttements within n IF lok. Align END with IF nd ELSE Align mro prmeters in seprte lines to improve redility e Align relted elements The inverted 'C' look is the est wy to follow logi. It lerly indites tht there is mthing END for eh DO nd IF sttements %mro new ( vr1=, vr2=, vr3= ) ity street zipode zip. f Line up the ses in SELECT sttement selet (ity); when (phl) do; odes; end; when (hl) do; odes; end; otherwise do; odes; end; end; 7
8 4 Plement of Sttements Inside Progrm 1. OPTIONS sttement first 2. %LET sttements 3. FILENAME, LIBNAME sttements 4. PROC FORMAT 5. Mro Defn 6. Input Steps 7. Clultions/ Opertions/Ativities 8. Output 5 Pge Option 6 Upperse Inside DATA step Use the ompiler PAGE option t the eginning of eh routine. This ensures pge ejet when ompiling listing in doumenttion inder ensuring fst ess to the routine you re looking for Use upperse for seleted elements to enhne redility 1. All non exeutle sttements first(length, KEEP) 2. All exeutle sttements next pge; ll vriles Constnts sttement lels omments tle nmes prmeters dt set nmes mro keywords ****new routine**** 7 Reports 8 Column # 9 Complexity 10 Titles 11 Prentheses Mke sure tht titles nd footnotes used in printed reports urtely reflet the informtion eing presented Try not to extend ny sttement eyond olumn 72 Brek omplex sttements into numer of simpler sttements If title sttements help explin wht the progrm does, put them ner the eginning of the progrm so they'll e esy to find. Put title sttements for step t the eginning of the step If prentheses would lrify the order of evlution of n expression, go hed nd use them even if the syntx rules don't require them 8
9 5. Effiieny Adpt liner nd modulr style of progrmming. This redues the deugging time, updting or modifying time for the progrmmer. Some of the guidelines pertining to effiieny re s follows 1 Nme Desription Exmple When extrting dt from soures suh s flt file, input only the vriles needed Use KEEP=/DROP= nd DATA test(keep= Vr1 Vr2); KEEP/ DROP Input sttements when inputting Vriles SAS dtsets. Reommend to use KEEP insted of DROP whih improves redility. It is lso reommended to use the KEEP=/DROP= dtset option rther thn KEEP/DROP euse in this wy SAS retes spe only for the vriles used in the PDV (Progrm dt vetor) rther thn loding the entire vrile set nd then dropping or keeping vriles. DROP intermedite vriles used in lultions DATA my_loop; DROP j k temp; DO j=1 to 3; DO k=1 to 5; temp=j; new=temp*k; END; END; 2 Where ond Use WHERE rther thn IF while susetting SAS dtsets, sine WHERE susets the dt efore entering into the Progrm Dt Vetor, while IF susets the dt fter inputting the entire dtset DATA SCHOOL_YEAR; set sh_yr(where=(yr gt 85); insted of DATA SCHOOL_YEAR; SET sh_yr; IF YR gt 85; 3 IF/ELSE onstruts Chek the most prole ondition first when stepping through IF onstrut Use IF/ELSE for mutully exlusive onditions Use IF/THEN/ELSE insted of multiple IF sttements if ode = 1 then stte = NY ; else if ode = 2 then stte = MO ; 9
10 else if ode = 3 then stte = MI ; 4 Sorting When sorting permnent dtsets sort it into nother dtset, sine sorting into permnent dtset tkes more I/O, nd sorting lrge files requires more spe PROC SORT DATA=TEST.NEW(KEEP A); OUT=NEWSORT; Use CLASS sttement to void unneessry sorts PROC MEANS NOPRINT NWAY DATA=TEST; CLASS YEAR; VAR COST; OUTPUT OUT=MEANS MEAN=; 5 Ctegoril Vriles 6 DATA steps Use hrter vlues for tegoril vriles or flgs insted of numeri vlues This tion sves spe sine hrter '1' uses one yte wheres numeri 1 uses 8 ytes. However there needs to e hrter to numeri onversion if Boolen logi needs to e used whih outputs NOTE nd lso onsumes more CPU time. Use DATA _NULL_ when you need to perform lultions on dtsets or generte reports Use MY_FLAG='1'; insted of MY_FLAG=1; DATA _NULL_; FILE PRINT; SET OLD; 7 LENGTH Ple most of the nonexeutle sttements efore the exeutle sttements with exeption of DROP nd KEEP sttements Use LENGTH sttement to ensure the length of the entered vrile DATA Short; LENGTH height weight 4; INPUT ID $ ($1.) 10
11 Sves spe nd lso progrms re muh more height weight 3.; DATALINES; ; 8 PROC DATASETS Used to opy, renme nd delete SAS dtsets. Used to renme vriles, hnge or dd formt nd lels, nd ppend dt sets to other dt sets. LIBNAME liref 'MY_DATA_LIBRARY'; PROC DATASETS LIBRARY=liref; MODIFY OLD; RENAME X=NEWX Y=NEWY; LABEL HT='Height of Sujet'; FORMAT DOB MMDDYY8.; 9 RETAIN Use RETAIN to initilize onstnts 10 Ending End every DATA nd PROC sttements with End every Pro SQL sttement with QUIT; RETAIN tolerne 0.1 ftor 20; DATA TEMP; ; PROC SORT DATA = COUNTRY; BY STATE; PROC SQL; SELECT * FROM SASHELP.AIR; QUIT; Use 11 Redue numer of times dt is red Minimize the numer of psses through the dt Minimize the numer of DATA steps Red nd store only the dt tht re needed Sort the dt only when it is solutely neessry. Pro Sort Dt = Cities Out = new_ities By Stte; run; Insted of Pro Sort Dt = Cities; y Stte; run; Dt sorted_ities; Set Cities; Run; 12 Reding externl files Use pointer ontrols, informts, INPUT sttement, to red only the dt needed 11
12 13 DELETE 14 Conversion 15 INDEX 16 Arrys Minimize workspe usge y using DELETE sttement in PROC DATASETS step, to eliminte temporry dtsets tht re no longer needed y the progrm While onversions re very useful to onvert numeri to hrters nd vie vers, extensive onversions in lrge dt set n ost time. If lrge sorted dtset is eing used multiple times then it is worth reting n index Whenever there re group of vriles to e proessed in the dt step, it is enefiil to onsider rrys to omplish the sme tsk. Arrys help redue redundny in ode, lookups Dt Without_Arry; Set ontents; if x1 = 999 then x1 =.; if x2 = 999 then x2 =.; if x100 = 999 then x100 =.; if A = 999 then A =.; if B = 999 then B =.;... if E = 999 then E =.; run; Dt With_Arry(drop=i); Set ontents; Arry _ontents[105] x1-x100 A B C D E; Do i = 1 to 105; If _ontents[i] = 999 then _ontents[i] =.; End; run; 6. Mintinility Write progrms keeping in mind tht they n e reused sometime in the future. A generl pproh is very useful. Some of the guidelines for mintenne re s follows Nme Desription Exmple 1 Constnts Use %LET sttements to define onstnts rther thn hrd oding them into progrms 2 Brnhing Do not use GOTO/RETURN sttements (These mke the progrms diffiult to tre) %LET WK_START=1 %LET WK_STOP=20 DO I = &WK_START to &WK_STOP; 12
13 3 Nested Clls Do not rnh to nother progrm from within progrm. Use the min progrm to ontrol ll progrms Do not use more thn 2-3 nested mro lls 4 Output Formulte n effiient method to tegorize output dtsets suh tht the progrm does not rete permnent dtsets whih re overwritten while testing. 5 Notes/ Wrnings 6 Mros Autoll 7 Progrm Flow 8 Dependenies Avoid unneessry NOTES/WARNING messges in the log. Use mros if the routine is lled more thn one The routine depends upon the vlue of vrile The routine requires progrmming logi whih nnot e inluded in dtstep Dt=permli.x; set x; run; The routine is used y more thn one progrm The routine hnges often Progrms should flow linerly ProgA=>ProgB=>ProgC d e If there re mny progrms in system then hve min progrm ll eh one rther thn hving progrm to ll the next Listing the dependenies inreses the mintinility of the progrm Some of the dependenies inlude Reord input files Vrile nmes, types nd other required hrteristis of the SAS input dtset Limittions on the vlues of input dt Memory requirements when neessry Informts nd Formts stored in formt lirry Use n OPTIONS sttement t the eginning of the progrm to expliitly set ny required system options Use LENGTH sttement to delre nd set the length of hrter vrile 13
14 CONCLUSION Consistent use of good progrmming stndrds helps improve redility, effiieny nd redues mintenne. Adpting new stndrd definitely inreses development time, ut not dpting good stndrds osts more in terms of deugging, mintenne nd in most ses results in re-oding. Hene spending some extr time initilly helps sve onsiderle time lter. REFERENCES Lor D. Delwihe., Susn J. Slughter, (1996) The Little SAS Book, A Primer, Seond Edition Pul Gill, (1997) The Next Step Integrting the Softwre Life Cyle with SAS progrmming Rih Aster, (2002) Professionl SAS Progrmming Shortuts, Alie M. Cheng., Pfizer In., (1999), Roust progrmming tehniques in the SAS System, NESUG, Cly Mrtin., Lori Mrtin., Mrtin Consulting, (2000), Clen-up, Comments nd Code Mking it Mintinle, NESUG Vness Hyden, Poliy Anlysis In., (2000), Bulletproofing Your SAS Results, NESUG ACKNOWLEDGEMENTS I would lso like to thnk Hether Forsythe, Fin Roinson nd Roert Jones of PJM Interonnetion LLC for their ontinuous support nd motivtion throughout the entire ourse of the pper. Shilj nd I would like to express our sinere thnks to fmily nd friends for their onstnt enourgement nd well wishes. CONTACT INFORMATION Your omments nd questions re vlued nd enourged. Contt the uthor t: Author Nme: Shiv Srinivsn Compny: PJM Interonnetion LLC Address: 955 Jefferson Ave City Stte ZIP: Norristown, PA Work Phone: Fx: Emil: srinis@pjm.om, shiv_wvu@yhoo.om Seondry Author Nme: Shilj Rmesh Compny: Supreme Teh Solutions LLC Address: 125 Brookview Dr City Stte ZIP: Pottstown, PA Work Phone: Emil: shilj_shiv@yhoo.om SAS nd ll other SAS Institute In. produt or servie nmes re registered trdemrks of SAS Institute In. in the USA nd other ountries. indites USA registrtion. Other rnd nd produt nmes re trdemrks of their respetive ompnies. 14
CS 241 Week 4 Tutorial Solutions
CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it
More informationError Numbers of the Standard Function Block
A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution
More informationOUTPUT DELIVERY SYSTEM
Differences in ODS formtting for HTML with Proc Print nd Proc Report Lur L. M. Thornton, USDA-ARS, Animl Improvement Progrms Lortory, Beltsville, MD ABSTRACT While Proc Print is terrific tool for dt checking
More informationMcAfee Web Gateway
Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This
More informationMidterm Exam CSC October 2001
Midterm Exm CSC 173 23 Otoer 2001 Diretions This exm hs 8 questions, severl of whih hve suprts. Eh question indites its point vlue. The totl is 100 points. Questions 5() nd 6() re optionl; they re not
More informationParadigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms
Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History
More informationPattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions
Pttern Mthing Pttern Mthing Some of these leture slides hve een dpted from: lgorithms in C, Roert Sedgewik. Gol. Generlize string serhing to inompletely speified ptterns. pplitions. Test if string or its
More informationTo access your mailbox from inside your organization. For assistance, call:
2001 Ative Voie, In. All rights reserved. First edition 2001. Proteted y one or more of the following United Sttes ptents:,070,2;,3,90;,88,0;,33,102;,8,0;,81,0;,2,7;,1,0;,90,88;,01,11. Additionl U.S. nd
More informationLesson 4.4. Euler Circuits and Paths. Explore This
Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different
More informationDistributed Systems Principles and Paradigms
Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,
More informationINTEGRATED WORKFLOW ART DIRECTOR
ART DIRECTOR Progrm Resoures INTEGRATED WORKFLOW PROGRAM PLANNING PHASE In this workflow phse proess, you ollorte with the Progrm Mnger, the Projet Mnger, nd the Art Speilist/ Imge Led to updte the resoures
More informationDistributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems
Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted
More informationIntroduction to Algebra
INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh
More informationEnterprise Digital Signage Create a New Sign
Enterprise Digitl Signge Crete New Sign Intended Audiene: Content dministrtors of Enterprise Digitl Signge inluding stff with remote ess to sign.pitt.edu nd the Content Mnger softwre pplition for their
More informationRegistering as a HPE Reseller. Quick Reference Guide for new Partners in Asia Pacific
Registering s HPE Reseller Quick Reference Guide for new Prtners in Asi Pcific Registering s new Reseller prtner There re five min steps to e new Reseller prtner. Crete your Appliction Copyright 2017 Hewlett
More informationUTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS
UTMC APPLICATION NOTE UT1553B BCRT TO 80186 INTERFACE INTRODUCTION The UTMC UT1553B BCRT is monolithi CMOS integrte iruit tht provies omprehensive Bus Controller n Remote Terminl funtions for MIL-STD-
More informationDuality in linear interval equations
Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny
More informationSoftware Configuration Management
Softwre Configurtion Mngement Leture: Introdution SCM Chpters: 1, 2 nd 3 René Krikhr Niels Veermn Leture Objetives Lern bout SCM nd history of SCM Lern the reltion between SCM nd Softwre development proess
More informationRegistering as an HPE Reseller
Registering s n HPE Reseller Quick Reference Guide for new Prtners Mrch 2019 Registering s new Reseller prtner There re four min steps to register on the Prtner Redy Portl s new Reseller prtner: Appliction
More informationLecture 12 : Topological Spaces
Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More informationV = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)
Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from
More informationInternet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.
omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to
More informationTroubleshooting. Verify the Cisco Prime Collaboration Provisioning Installation (for Advanced or Standard Mode), page
Trouleshooting This setion explins the following: Verify the Ciso Prime Collortion Provisioning Instlltion (for Advned or Stndrd Mode), pge 1 Upgrde the Ciso Prime Collortion Provisioning from Smll to
More informationCMPUT101 Introduction to Computing - Summer 2002
CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,
More informationMcAfee Data Loss Prevention Prevent
Quik Strt Guide Revision B MAfee Dt Loss Prevention Prevent version 10.x This quik strt guide provides high-level instrutions for setting up MAfee Dt Loss Prevention Prevent (MAfee DLP Prevent) hrdwre
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationClass Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414
Introution to Dt Mngement CSE 44 Unit 6: Coneptul Design E/R Digrms Integrity Constrints BCNF Introution to Dt Mngement CSE 44 E/R Digrms ( letures) CSE 44 Autumn 08 Clss Overview Dtse Design Unit : Intro
More informationLINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION
Overview LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION 4.4.1.0 Due to the omplex nture of this updte, plese fmilirize yourself with these instrutions nd then ontt RGB Spetrum Tehnil
More informationCS453 INTRODUCTION TO DATAFLOW ANALYSIS
CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register
More informationParallelization Optimization of System-Level Specification
Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion
More informationFrom Dependencies to Evaluation Strategies
From Dependencies to Evlution Strtegies Possile strtegies: 1 let the user define the evlution order 2 utomtic strtegy sed on the dependencies: use locl dependencies to determine which ttriutes to compute
More information[SYLWAN., 158(6)]. ISI
The proposl of Improved Inext Isomorphi Grph Algorithm to Detet Design Ptterns Afnn Slem B-Brhem, M. Rizwn Jmeel Qureshi Fulty of Computing nd Informtion Tehnology, King Adulziz University, Jeddh, SAUDI
More informationCICS Application Design
CICS Applition Design In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the
More informationMcAfee Network Security Platform
NS3x00 Quik Strt Guide Revision B MAfee Network Seurity Pltform This quik strt guide explins how to quikly set up nd tivte your MAfee Network Seurity Pltform NS3100 nd NS3200 Sensors in inline mode. These
More informationOutline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP
ARCH This work ws supported y: The Europen Reserh Counil, The Isreli Centers of Reserh Exellene, The Neptune Consortium, nd Ntionl Siene Foundtion wrd CNS-119748 Outline Motivtion Bkground Regulr Expression
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More informationType Checking. Roadmap (Where are we?) Last lecture Context-sensitive analysis. This lecture Type checking. Symbol tables
Type Cheking Rodmp (Where re we?) Lst leture Contet-sensitie nlysis Motition Attriute grmmrs Ad ho Synt-direted trnsltion This leture Type heking Type systems Using synt direted trnsltion Symol tles Leil
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationthe machine and check the components AC Power Cord Carrier Sheet/ Plastic Card Carrier Sheet DVD-ROM
Quik Setup Guide Strt Here ADS-2100 Plese red the Produt Sfety Guide first efore you set up your mhine. Then, plese red this Quik Setup Guide for the orret setup nd instlltion. WARNING WARNING indites
More informationDistance vector protocol
istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers
More informationExample: 2:1 Multiplexer
Exmple: 2:1 Multiplexer Exmple #1 reg ; lwys @( or or s) egin if (s == 1') egin = ; else egin = ; 1 s B. Bs 114 Exmple: 2:1 Multiplexer Exmple #2 Normlly lwys include egin nd sttements even though they
More informationReducing a DFA to a Minimal DFA
Lexicl Anlysis - Prt 4 Reducing DFA to Miniml DFA Input: DFA IN Assume DFA IN never gets stuck (dd ded stte if necessry) Output: DFA MIN An equivlent DFA with the minimum numer of sttes. Hrry H. Porter,
More informationCOSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview
COSC 6374 Prllel Computtion Non-loking Colletive Opertions Edgr Griel Fll 2014 Overview Impt of olletive ommunition opertions Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition
More informationCompiling a Parallel DSL to GPU
Compiling Prllel DSL to GPU Rmesh Nrynswmy Bdri Gopln Synopsys In. Synopsys 2012 1 Agend Overview of Verilog Simultion Prllel Verilog Simultion Algorithms Prllel Simultion Trdeoffs on GPU Chllenges Synopsys
More informationCS553 Lecture Introduction to Data-flow Analysis 1
! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow
More informationA Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards
A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin
More informationFinal Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book
inl xm Review 06 M 236 e sure to loo over ll of your tests, s well s over the tivities you did in the tivity oo 1 1. ind the mesures of the numered ngles nd justify your wor. Line j is prllel to line.
More informationFASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE 1 M.JothiLkshmi, M.S., M.Phil. 2 C.Theeendr, M.S., M.Phil. 3 M.K.Pvithr,
More informationThe Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline
CPSC 852 Internetworking The Network Lyer: Routing in the Internet Mihele Weigle Deprtment of Computer Siene Clemson University mweigle@s.lemson.edu http://www.s.lemson.edu/~mweigle/ourses/ps852 1 The
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationCSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011
CSCI 3130: Forml Lnguges nd utomt Theory Lecture 12 The Chinese University of Hong Kong, Fll 2011 ndrej Bogdnov In progrmming lnguges, uilding prse trees is significnt tsk ecuse prse trees tell us the
More informationChapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.
Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml
More informationStack Manipulation. Other Issues. How about larger constants? Frame Pointer. PowerPC. Alternative Architectures
Other Issues Stck Mnipultion support for procedures (Refer to section 3.6), stcks, frmes, recursion mnipulting strings nd pointers linkers, loders, memory lyout Interrupts, exceptions, system clls nd conventions
More informationYOU ARE: AND THIS IS:
YOU ARE: AND THIS IS: SoHE CMS Mnul As edited August 4, 015 TABLE OF CONTENTS 3 Logging in 4 Pge types within the dshord 5-6 Exploring the toolr 7-8 Adding pge 9 Editing pge 10 Pge templtes: Met Templte
More informationPackage Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation
A Division of Ciso Systems, In. Pkge Contents Wireless-G USB Network Adpter with SpeedBooster USB Cle Setup CD-ROM with User Guide (English only) Quik Instlltion 2,4 GHz 802.11g Wireless Model No. Model
More information[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116
[Prksh* et l 58: ugust 6] ISSN: 77-9655 I Vlue: Impt Ftor: 6 IJESRT INTERNTIONL JOURNL OF ENGINEERING SIENES & RESERH TEHNOLOGY SOME PROPERTIES ND THEOREM ON FUZZY SU-TRIDENT DISTNE Prveen Prksh* M Geeth
More informationbox Boxes and Arrows 3 true 7.59 'X' An object is drawn as a box that contains its data members, for example:
Boxes nd Arrows There re two kinds of vriles in Jv: those tht store primitive vlues nd those tht store references. Primitive vlues re vlues of type long, int, short, chr, yte, oolen, doule, nd flot. References
More informationGreedy Algorithm. Algorithm Fall Semester
Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion
More information6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.
6045J/18400J: Automt, Computbility nd Complexity Mrh 30, 2005 Quiz 2: Solutions Prof Nny Lynh Vinod Vikuntnthn Plese write your nme in the upper orner of eh pge Problem Sore 1 2 3 4 5 6 Totl Q2-1 Problem
More informationLexical Analysis. Amitabha Sanyal. (www.cse.iitb.ac.in/ as) Department of Computer Science and Engineering, Indian Institute of Technology, Bombay
Lexicl Anlysis Amith Snyl (www.cse.iit.c.in/ s) Deprtment of Computer Science nd Engineering, Indin Institute of Technology, Bomy Septemer 27 College of Engineering, Pune Lexicl Anlysis: 2/6 Recp The input
More informationImplementing Automata. CSc 453. Compilers and Systems Software. 4 : Lexical Analysis II. Department of Computer Science University of Arizona
Implementing utomt Sc 5 ompilers nd Systems Softwre : Lexicl nlysis II Deprtment of omputer Science University of rizon collerg@gmil.com opyright c 009 hristin ollerg NFs nd DFs cn e hrd-coded using this
More information10.2 Graph Terminology and Special Types of Graphs
10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the
More informationCOSC 6374 Parallel Computation. Communication Performance Modeling (II) Edgar Gabriel Fall Overview. Impact of communication costs on Speedup
COSC 6374 Prllel Computtion Communition Performne Modeling (II) Edgr Griel Fll 2015 Overview Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition Impt of olletive ommunition
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationArchitecture and Data Flows Reference Guide
Arhiteture nd Dt Flows Referene Guide BES12 Version 12.5 Pulished: 2016-06-29 SWD-20160620150844487 Contents Aout this guide... 5 Arhiteture: BES12 EMM solution... 6 BES12 omponents...8 Components used
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More informationCOMPUTER EDUCATION TECHNIQUES, INC. (XML ) SA:
In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following
More informationMidterm 2 Sample solution
Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the
More informationSimrad ES80. Software Release Note Introduction
Simrd ES80 Softwre Relese 1.3.0 Introduction This document descries the chnges introduced with the new softwre version. Product: ES80 Softwre version: 1.3.0 This softwre controls ll functionlity in the
More informationCOMP108 Algorithmic Foundations
Grph Theory Prudene Wong http://www.s.liv..uk/~pwong/tehing/omp108/201617 How to Mesure 4L? 3L 5L 3L ontiner & 5L ontiner (without mrk) infinite supply of wter You n pour wter from one ontiner to nother
More informationWhat are suffix trees?
Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl
More informationShared Memory Architectures. Programming and Synchronization. Today s Outline. Page 1. Message passing review Cosmic Cube discussion
Tody s Outline Arhitetures Progrmming nd Synhroniztion Disuss pper on Cosmi Cube (messge pssing) Messge pssing review Cosmi Cube disussion > Messge pssing mhine Shred memory model > Communition > Synhroniztion
More informationIncremental Design Debugging in a Logic Synthesis Environment
Inrementl Design Deugging in Logi Synthesis Environment Andres Veneris Jing Brndon Liu University of Toronto Freesle Semiondutors Dept ECE nd CS High Performne Tools Group Toronto, ON M5S 3G4 Austin, TX
More informationAllocator Basics. Dynamic Memory Allocation in the Heap (malloc and free) Allocator Goals: malloc/free. Internal Fragmentation
Alloctor Bsics Dynmic Memory Alloction in the Hep (mlloc nd free) Pges too corse-grined for llocting individul objects. Insted: flexible-sized, word-ligned blocks. Allocted block (4 words) Free block (3
More informationContainers: Queue and List
Continers: Queue n List Queue A ontiner in whih insertion is one t one en (the til) n eletion is one t the other en (the he). Also lle FIFO (First-In, First-Out) Jori Cortell n Jori Petit Deprtment of
More informationInter-domain Routing
COMP 631: NETWORKED & DISTRIBUTED SYSTEMS Inter-domin Routing Jsleen Kur Fll 2016 1 Internet-sle Routing: Approhes DV nd link-stte protools do not sle to glol Internet How to mke routing slle? Exploit
More informationSOFTWARE-BUG LOCALIZATION WITH GRAPH MINING
Chpter 17 SOFTWARE-BUG LOCALIZATION WITH GRAPH MINING Frnk Eihinger Institute for Progrm Strutures nd Dt Orgniztion (IPD) Universit-t Krlsruhe (TH), Germny eihinger@ipd.uk.de Klemens B-ohm Institute for
More informationPhotovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink
hotovolti nel Modelling Using Stohsti Approh in MATLAB &Simulink KAREL ZALATILEK, JAN LEUCHTER eprtment of Eletril Engineering University of efene Kouniov 65, 61 City of Brno CZECH REUBLIC krelzpltilek@unoz,
More informationGENG2140 Modelling and Computer Analysis for Engineers
GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points
More informationLists in Lisp and Scheme
Lists in Lisp nd Scheme Lists in Lisp nd Scheme Lists re Lisp s fundmentl dt structures, ut there re others Arrys, chrcters, strings, etc. Common Lisp hs moved on from eing merely LISt Processor However,
More informationRolling Back Remote Provisioning Changes. Dell Command Integration for System Center
Rolling Bk Remote Provisioning Chnges Dell Commn Integrtion for System Center Notes, utions, n wrnings NOTE: A NOTE inites importnt informtion tht helps you mke etter use of your prout. CAUTION: A CAUTION
More informationCS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.
CS 340, Fll 2016 Sep 29th Exm 1 Nme: Note: in ll questions, the speil symol ɛ (epsilon) is used to indite the empty string. Question 1. [10 points] Speify regulr expression tht genertes the lnguge over
More informationcisc1110 fall 2010 lecture VI.2 call by value function parameters another call by value example:
cisc1110 fll 2010 lecture VI.2 cll y vlue function prmeters more on functions more on cll y vlue nd cll y reference pssing strings to functions returning strings from functions vrile scope glol vriles
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationCS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal
CS 55 Computer Grphis Hidden Surfe Removl Hidden Surfe Elimintion Ojet preision lgorithms: determine whih ojets re in front of others Uses the Pinter s lgorithm drw visile surfes from k (frthest) to front
More informationAgilent Mass Hunter Software
Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationCSc 453. Compilers and Systems Software. 4 : Lexical Analysis II. Department of Computer Science University of Arizona
CSc 453 Compilers nd Systems Softwre 4 : Lexicl Anlysis II Deprtment of Computer Science University of Arizon collerg@gmil.com Copyright c 2009 Christin Collerg Implementing Automt NFAs nd DFAs cn e hrd-coded
More informationc s ha2 c s Half Adder Figure 2: Full Adder Block Diagram
Adder Tk: Implement 2-it dder uing 1-it full dder nd 1-it hlf dder omponent (Figure 1) tht re onneted together in top-level module. Derie oth omponent in VHDL. Prepre two implementtion where VHDL omponent
More informationMinimal Memory Abstractions
Miniml Memory Astrtions (As implemented for BioWre Corp ) Nthn Sturtevnt University of Alert GAMES Group Ferury, 7 Tlk Overview Prt I: Building Astrtions Minimizing memory requirements Performnes mesures
More informationFault tree conversion to binary decision diagrams
Loughorough University Institutionl Repository Fult tree onversion to inry deision digrms This item ws sumitted to Loughorough University's Institutionl Repository y the/n uthor. Cittion: ANDREWS, J.D.
More informationDistributed Systems Principles and Paradigms
Distriuted Systems Principles nd Prdigms Chpter 11 (version April 7, 2008) Mrten vn Steen Vrije Universiteit Amsterdm, Fculty of Science Dept. Mthemtics nd Computer Science Room R4.20. Tel: (020) 598 7784
More informationMcAfee Network Security Platform
Pssive Fil-Open Kit Quik Strt Guide Revision D MAfee Network Seurity Pltform MAfee Network Seurity Pltform IPS Sensors, when deployed in-line, route ll inoming trffi through designted port pir. However,
More informationthis grammar generates the following language: Because this symbol will also be used in a later step, it receives the
LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.
More informationUNIT 11. Query Optimization
UNIT Query Optimiztion Contents Introduction to Query Optimiztion 2 The Optimiztion Process: An Overview 3 Optimiztion in System R 4 Optimiztion in INGRES 5 Implementing the Join Opertors Wei-Png Yng,
More informationHow to Design REST API? Written Date : March 23, 2015
Visul Prdigm How Design REST API? Turil How Design REST API? Written Dte : Mrch 23, 2015 REpresenttionl Stte Trnsfer, n rchitecturl style tht cn be used in building networked pplictions, is becoming incresingly
More informationArchitecture and Data Flows Reference Guide
Arhiteture nd Dt Flows Referene Guide BlkBerry UEM Version 12.7 Pulished: 2017-07-12 SWD-20170627140413745 Contents Aout this guide... 5 Arhiteture: BlkBerry UEM solution... 6 BlkBerry UEM omponents...
More informationGeometrical reasoning 1
MODULE 5 Geometril resoning 1 OBJECTIVES This module is for study y n individul teher or group of tehers. It: looks t pprohes to developing pupils visulistion nd geometril resoning skills; onsiders progression
More information