The Screen Control Language (SCl) in Version 6 SAS/Ar: and SAS/FSp Software Chris Bailey, Yao Chen SAS Institute Inc., Cary, NC
|
|
- Coral Booker
- 5 years ago
- Views:
Transcription
1 The Sceen Contol Language (SCl) in Vesion 6 SAS/A: and SAS/FSp Softwae Chis Bailey, Yao Chen SAS Institute Inc., Cay, NC Abstact Explanations and examples povide the basis of this tutoial that explains the new sceen contol language available in Vesion 6 SAS! AF and SASjFSP softwae. The sceen contol language povides the ability to develop inteactive applications. The functions available in the Sel povide the basis fo developing convesational systems fo end uses. Examples will be used to demonstate how the language woks. Diffeences in Sel usage in SAS/FSP applications and SAS/AF applications will also be demonstated though examples. Similaities and diffeences between the SAS Data Step and the sceen contol language will also be emphasized. Contents 1. Requiement analysis 2. Design 3. Compaison vs Data Step Language 4. Pogamming Constucts and featues 5. Pogamming Concepts 6. SAS Data Set Inteface 7. Examples 8. Futue Requiements Analysis Fo SAS/FSP softwae, one item of moe functionality equested on the SASWARE ballot is coss-field validation in PROC FSEO IT. We win show you how this is done with vesion 6 and povide examples. In addition to PROC FSEDIT, we will achieve the same functionality with vesion 6 SAS/AF, now integated with the sceen contol language (SCL), eliminating the estictions of the Vesion 5 symbolic language(## and ###). We will also cove estictions of the data step and how much of this is cicumvented in vesion 6. tn addition to functionality vesion 5 lacked, vesion 6 also had a few of its own poblems: namely unning on a much smalle and much slowe machine. Thee must be good keystoke esponse duing execution. The Execution State (unning compiled code, moe on this late) must be potable to all machines (not even an issue in vesion 5) Design The design algoithm used to achieve the speed and size necessay to un well as well as incopoation of much moe extended and extendable functionality: Rst, PROC FSEDIT and AF wok like the pogammable data step, whee each time the use changes the sceen, this is a new tansaction ecod to be pocessed, and contol is given to the use to pocess the data. Second, the manne in which the use pocesses the data is though the pogamming language SCL Thid, the use's SCl statements ae handled in two diffeent phases: 1. The compile phase duing PRCe BUILD o PRCe FSEDIT sceen modifica tion, 2. the execution phase duing AF (which was PROC DIS PLAY in vesion 5) and data set editing in vesion 6. This diffeentiation of compile-time and execution-time enables AF and PROC FSEDIT to move much of the pocessing to set-up o compile-time so execution just pefoms tasks equested with as little ovehead as possible. Making execution time come at any numbe of abitay points late entails saving and poting com~ piled code which is done in vesion 6. Compaison vs Data Step In compaison to the data step, a tansaction ecod is the sceen afte the use stikes an attention key, whee in the data step a tansaction ecod is the next line of input fom a file o the next obsevation fom a setfo anothe data set. Vaiables ae impiicn itly etained in SCl, whee they ae not etained unless explicitly equested in the data step. Moe timing contol is given to the SCl pogamme though eseved labels, which ae stated at pedefined times. labels that contol the Sel monito timing, and thei paallel in the Data Step: sel FSEINIT: INIT: MAIN: TERM: FSETERM: Data Step Data Step stated Any obsevation stated Cuent obsevation modified Finish the cuent obsevation Data step finished The syntax is the same as the data step, using constucts and featues like declaation statements, assignment statements, conditional statements, and do-end blocks. Pogamming constucts and featues 1. Conditional statement 2. Reseved labels 3. SUBMIT 4. Field modification statements/functions 5. Window functions a.af b.fsp c. Display fomat infomation d. Selection list window e. PREVIEW window 6. Data Set Functions (see Data Set Inteface below) 7. File functions 8. Fomat functions a.input b.put 1155
2 9. Maco functions a.symget b. SYMPUT 10. Extended tables 11. Command line 12. LEAVE and CONTINUE fom DO block 13. CONTROL statement to altenate monito timing By default, contol is given to the pogam wheneve a sceen data modification occus that does not cause an eo state. Howeve, we, as the sceen builde, can get contol moe fequently; like evey time an 'attention' key is pessed by equesting SCL to dive ou MAIN: labels moe fequently. 14. Run-Time binding. With the delayed execution o savings of compiled code, thee is no compile-time binding to data sets, and many of the functions have un-time vaiable aguments; such as put, input. and open. 15. "'ays a. Opeatos (=, IN) b. Function that accept of lists (mino, maxo) c. Binding with functions like SET, Pogamming Concepts Pogam Unit OS Veification Maintainability Infomation hiding Recusion In Vesion 6, pogam sceens, and even FSEOIT sessions can be teated as a suboutine. Though the CALL DISPLAY and CALL FSEDIT statements in SCL, we can banch to these objects, each of which have thei own pogam code, and wait fo them to etun afte setting up any global infomation we depended on them fo. Fom AF pogam sceen enty 'one.pogam' we can CALL DISPLAY('lwo.pogam'); and 'one.pogam' teats this in the same fashion an abso function takes, just sequential execution of the pogam. We can use data sets to veify the sceens. we can now bind the cuent sceen to any numbe of data sets in any fashion by doing ou own data set manipulation within the pogam souce. The list objects o lists of values that data enteed is veified against can now come fom a data set, and be moe dynamic. the data set seach can be a linea o binay seach depending on how the LOCATE function is invoked. Now the sceen can much moe easily be boken up into smalle simple units with fewe 'duties' each. This beakup means the sceens ae easie fo the end-use to undestand, and should be much easie fo the builde to maintain. Each sceen can display as much infomation as necessay to the use but only popagate items pevious and successive sceens need. Since each Sel pogam is an independent eentant enty object, it can call anything, even anothe instance of itself via the Call DISPLAY and Call FSEDIT functions. DynamiC SAS Data Set Inteface OPEN/CLOSE VB! InfolDS Info Obs Fetch/Update Vax Get/Put SET LOCATE Examples that follow 1. Value validation 2. Coss field validation We can make the pogams un based on setup that comes fom the sceen, In Vesion 5, INPUT and VARLISTfield attibutes ae an example of checking one field that is based on anothe. Now we can take this much futhe by using any logic on any field and having any pogammable elationship on any othe. The actual data set that the sceen needs does not have to be known at compile time. Simply leave a vaiable name and whateve that value is will be used as one of the data sets to be used. We can easily quey any infomation need. ed about the data set o its vaiables though the handle etuned fom open. We can fetch, update, append obsevations though explicit pogam conta\. When we have an obsevation, we If we ae using the data set fo etieval, we fetch the obsevation and then quey the vaiables of inteest Afte we decide on a data set, we can bind the data set vaiables to the pogam vai. abies so an obsevation fetch o update will use the values of the pogam vaiables. This is Run-Time binding of a sceen to a data set If we want to do list validation lookup, we can do this on any of the data sets we have opened, against any vaiable in them, in ei the linea o binay fashion by specifying paametes to LOCATE. Some pogams cuently using SCL Futue 1. Vesion 6.03 menu system 2. Vesion 6,04 futue diections system 3. Full sceen confidence inteval 4. Full sceen poject management 1. Inteface with Data Step functions 2. Inteface between the sceens - Paamete passing to eplace symgetjsymput 3. Debugging ability - Souce Language Debugge 4. Sevices window 5. Optional dopping of command and message line 6. A? to display selection lists 7. Submit fom AF to go to appopiate window and etun 8. Appointment calenda 9. Calculato 1156
3 10. Single selection choice goups 11. Switches 12. Multiple selection choice goups 13. New functions fo: Examples Cuso positioning Selection Blocks Data Set modification and definition Flat file handling SAS Option quey and set Use pogammable selection lists Moe default builtin selection lists Examples using SCl ae on following pages. Pogamming Hints, Debugging EMS is highly ecommended; without it, AF can go away in ode to satisfy memoy needs of the pocedue. tf you need you pogam sceen to continue execution instead of etuning fo inteactive i/o afte a submit, use submit continue. Conclusion With the stuctue and powe of the language, we can make ou sceens do nealy anything pogammable and still have good esponse time at the teminal. Acknowledgements The authos wish to thank Deva Kuma fo his guidance in developing SCl, and Bud Whitmeye and Bian Schellenbege fo thei aid in typesetting the pape. 8ase SAS, SAS/Af, and SAS/FSJ> ae egisteed tademaks of SAS Institute Inc., Cay, NC. 1157
4 The Sceen Contol Language (SCl) in Vesion 6 SASjAF and SASjFSp Softwae Example 1 Value validation fom a list Poblem Given a finite list of of known size and known values, validate the use's enty against the list. Solution Put the values into a pogam aay, and seach the aay evey time the use modifies the value. The pogam calls the link label indxlkup, which is expected to etun the index in the aay of the element that equals value fom the sceen. The link label ptesult sets the value of the message line to indicate whethe o not the value is valid based on the index. Sceen Command = = = > '456' is illegal, Please eente. Pogam Model Please Ente Data Value: 456 aay goodvals(20) ( 1298, 2598, 3465, 4565, 5465, 6787,7523,8234,9734, 10732, 11231, 12634, 13762, 14324, 15634, 16347,17324,18492,19988,20117 ); aay petty[o:i) $ 25 ( 'ok', 'illegal, Please eente.'); init: main: link indxlkup; link ptesult; tem: ptesult: note the tick of using the odinal value of the 'index -= 0' compaison as the aay index 'f _ msg_ == putn(value,'bests.') II' is ' /1 petty{index -= 0]; Method 1. Staight linea seach of the aay. Values do not have to be soted. do j = 1 to dim(goodvals); if goodvalsu] = value then index = j; Method 2. Binay seach of the aay. Values must be soted. hi = dim(goodvals); 10 -= 1; mt = 1; do while(lo < = hi); mi = int«lo + hi) f 2 ); if value < goodvals[ mil then hi=mi-l; else ifvatue -= goodvals[mi] then index = mi; else lo=mi+1; Method 3. - Best Solution Use the IN opeato. index = value in goodvals; Altenate Solution An altenate solution that equies no pogamming in the AF o FSEDIT enty is to use SAS Fomats and Infomats. f' sets the vaiable INDEX to indicate location of matching value, fill in fom any of fouowing methods. 'f 1158
5 The Sceen Contol Language (SCl) in Vesion 6 SASjA= and SASjFSp Softwae Example 2 Value validation fom a SAS Data Set Poblem We need to validate use's enty against a list of values that may only be known immediately pio to execution of the sceen, and can change between invocations. The values ae not of known dimension and value at compile-time. Solution Maintain the values in a SAS Data Set, which we can update at any time. We apply much of the same technique to validating against the SAS Data Set that we used fo an aay. The sceen is the same as the pevious example. Pogam Model init: get a handle on the data set we ae to seach against fo the compaison values *j dsid = open('valud.ata'); if dsid = 0 then _ msg_ = 'Unable to open the data set'; vnun = vanum(dsid,'somevnan'): if vnun = 0 then _nsg_ = 'Vaiable not in data set'; main: link indxlkup; link ptesult; tem: /' cleanup, fee memoy, elease the data set *j call close( dsid); ptesult: _ msg_ = putn(value, 'bests.') II ' is' II pettylindex = 01; sets the vaiable INDEX to indicate location of matching value, fill in fom any of following methods. *j Method 1. Staight linea seach of the data set. Values do not have to be soted. do i = 1 to nobs( dsid); if fetchobs( dsid,i) = 0 then if getvan(dsid,vnum) = value then index = i; Method 2. Binay seach of the data set. Values must be soted. hi = nobs( dsid); 10 = 1; mi = 1; do white(lo < = hi); mi = int«lo + hi)j2); iffetchobs(dsid,mi) "'= 0 then _ msg_ = 'Unable to etieve obsevation'; stop; dsval = getvan(dsid,vnum); if value < dsval then hi = mi-l; else if value = dsval then index = oi; else lo=mi+l; Method 3 ~ Best Solution with unsoted data. Use the builtin function LOCATE. index = locaten(dsid,vnum,value)j Method 4 ~ Best Solution with soted data. Use the builtin function LOCATE. index = locaten(dsid,vnum,value,'ascending'); 1159
6 The Sceen Contol language (SCll in Vesion 6 SAS/A~ and SAS/FSp Softwae Example 3 Coss Field Validation Poblem Coss field Validation The laboatoy of XYZ hospital need a Lab Repot System fo thei data enty staff. The equiements of this lab Repot Sys. tem ae: Solution All invalid data and inconsistent data must be detected as soon as that data is enteed (inteactive). Handle two kinds of inconsistency eos: 1. A 'Rea eo. Fo example, a male patientwith a lab epot 'pegnant. I In this case, the end-use should eente the coect input data. 2. A 'Suspicious' eo. Fo example, an infant with a lab epot 'athitis.' In this case, the system should equest the end-use eithe to veify o to eente the data. Wite an SCL pogam behind an FSEDIT sceen that pefoms the validation whee each new epot is a new obsevation in the data set. Fo the fist kind of inconsistency eo, We use the SCL statements ERRORON and ERROROFF to flag the eo. Fo the second kind of inconsistency eo, we pop-up a veification field. We use the SCL statements PROTECT and UNPRD TECT. It will appea as if the question field is ceated as soon as it is needed. Sceen Command = = = > * x:z Hospital Lab Repot System * Patient Infomation: Name:&NAME Sex: &SEX_ P{Je: &AGE_ Diagnosis: &RESULT main: msg = 'Data is accepted'; dununy = _blank_; link: tunoff; if veify A = 'Y' then link checkit; else veify = _blank_; tem: tunoff: eooff all ; dummy ~ blank; potect veify; - etunj checkit: select (esult); when('pegnant') jo * a eal inconsistent eo OJ if sex = 'M' then eoon sex esult; cuso sex; _ msg_ = 'Eo: inconsistent values enteed'; suspicious inconsistent eos as defmed by the pogamme OJ when('diape ash') if age > 10 then link suspae; when('athitis') jf age < 15 then link suspae; othewise; Pogam &DUMMY init: _ msg_ = 'Please ente you data'; veify = blank; dummy ~ bladk; potect veify; - &VERIFY suspae: _ msg_ = 'Waning: Suspicious data. ' II 'It is extemely ae fo a ' II age II 'old peson to have' II esult II '. Veify o eente; eoon age esult; cuso veify; unpotect veify; dummy = 'Veify the inconsistent data (Y /N)'; 1160
THE SCREEN CONTROL LANGUAGE (SOL) IN VERSION 6 SAS/AF AND SAS/FSP SOFTWARE PHIL WINTERS - SAS INSTITUTE
THE SCREEN CONTROL LANGUAGE (SOL) IN VERSION 6 SAS/AF AND SAS/FSP SOFTWARE PHIL WINTERS - SAS INSTITUTE AUTHORS: CHRIS BAILEY~ YAO CHEN, SA~ SAS INSTITUTE INC. INSTITUTE INC. Abstact Explanations and examples
More informationConfiguring RSVP-ATM QoS Interworking
Configuing RSVP-ATM QoS Intewoking Last Updated: Januay 15, 2013 This chapte descibes the tasks fo configuing the RSVP-ATM QoS Intewoking featue, which povides suppot fo Contolled Load Sevice using RSVP
More informationGetting Started PMW-EX1/PMW-EX3. 1 Rotate the grip with the RELEASE button pressed. Overview. Connecting the Computer and PMW-EX1/EX3
A PMW-EX1/PMW-EX3 Getting Stated Oveview This document descibes how to use the XDCAM EX Vesion Up Tool (heeafte Vesion Up Tool ) to upgade the PMW-EX1 and PMW-EX3 to vesion 1.20 (PMW-EX1) o vesion 1.10
More informationIP Multicast Simulation in OPNET
IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok
More informationa Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives
SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which
More informationReader & ReaderT Monad (11A) Young Won Lim 8/20/18
Copyight (c) 2016-2018 Young W. Lim. Pemission is ganted to copy, distibute and/o modify this document unde the tems of the GNU Fee Documentation License, Vesion 1.2 o any late vesion published by the
More informationdc - Linux Command Dc may be invoked with the following command-line options: -V --version Print out the version of dc
- CentOS 5.2 - Linux Uses Guide - Linux Command SYNOPSIS [-V] [--vesion] [-h] [--help] [-e sciptexpession] [--expession=sciptexpession] [-f sciptfile] [--file=sciptfile] [file...] DESCRIPTION is a evese-polish
More informationIP Network Design by Modified Branch Exchange Method
Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management
More informationIBM Optim Query Tuning Offerings Optimize Performance and Cut Costs
IBM Optim Quey Tuning Offeings Optimize Pefomance and Cut Costs Saghi Amisoleymani Solution Achitect Integated Data Management amisole@us.ibm.com June 9, 2010 Disclaime Copyight IBM Copoation [cuent yea].
More informationAny modern computer system will incorporate (at least) two levels of storage:
1 Any moden compute system will incopoate (at least) two levels of stoage: pimay stoage: andom access memoy (RAM) typical capacity 32MB to 1GB cost pe MB $3. typical access time 5ns to 6ns bust tansfe
More informationMonitors. Lecture 6. A Typical Monitor State. wait(c) Signal and Continue. Signal and What Happens Next?
Monitos Lectue 6 Monitos Summay: Last time A combination of data abstaction and mutual exclusion Automatic mutex Pogammed conditional synchonisation Widely used in concuent pogamming languages and libaies
More informationFrequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters
Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using
More information(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.
Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show
More informationQuery Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented
Quey Language #1/3: Relational Algeba Pue, Pocedual, and Set-oiented To expess a quey, we use a set of opeations. Each opeation takes one o moe elations as input paamete (set-oiented). Since each opeation
More informationJournal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012
2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo
More informationPrioritized Traffic Recovery over GMPLS Networks
Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing
More informationTowards Adaptive Information Merging Using Selected XML Fragments
Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,
More informationA Memory Efficient Array Architecture for Real-Time Motion Estimation
A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN
More informationShortest Paths for a Two-Robot Rendez-Vous
Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal
More informationUser Specified non-bonded potentials in gromacs
Use Specified non-bonded potentials in gomacs Apil 8, 2010 1 Intoduction On fist appeaances gomacs, unlike MD codes like LAMMPS o DL POLY, appeas to have vey little flexibility with egads to the fom of
More informationDEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson
DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:
More informationAddendum. COULTER GEN S System. PN C (May 1999) COULTER CORPORATION. A Beckman Coulter Company Miami, Florida USA GEN S
TM TURBO RESET R POWER COULTER GEN S System Addendum TM * SYSTEM RUN * 05/03/95 0000 COPYRIGHT 1989-1995 COULTER CORPORATION STATUS : READY ALERT: BP CBC DIFF RETICS MAIN GEN S PN 4237411 C (May 1999)
More informationAn Improved Resource Reservation Protocol
Jounal of Compute Science 3 (8: 658-665, 2007 SSN 549-3636 2007 Science Publications An mpoved Resouce Resevation Potocol Desie Oulai, Steven Chambeland and Samuel Piee Depatment of Compute Engineeing
More informationUsing SPEC SFS with the SNIA Emerald Program for EPA Energy Star Data Center Storage Program Vernon Miller IBM Nick Principe Dell EMC
Using SPEC SFS with the SNIA Emeald Pogam fo EPA Enegy Sta Data Cente Stoage Pogam Venon Mille IBM Nick Pincipe Dell EMC v6 Agenda Backgound on SNIA Emeald/Enegy Sta fo block Intoduce NAS/File test addition;
More informationGARBAGE COLLECTION METHODS. Hanan Samet
gc0 GARBAGE COLLECTION METHODS Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu
More informationReachable State Spaces of Distributed Deadlock Avoidance Protocols
Reachable State Spaces of Distibuted Deadlock Avoidance Potocols CÉSAR SÁNCHEZ and HENNY B. SIPMA Stanfod Univesity We pesent a family of efficient distibuted deadlock avoidance algoithms with applications
More informationXFVHDL: A Tool for the Synthesis of Fuzzy Logic Controllers
XFVHDL: A Tool fo the Synthesis of Fuzzy Logic Contolles E. Lago, C. J. Jiménez, D. R. López, S. Sánchez-Solano and A. Baiga Instituto de Micoelectónica de Sevilla. Cento Nacional de Micoelectónica, Edificio
More informationUCB CS61C : Machine Structures
inst.eecs.bekeley.edu/~cs61c UCB CS61C : Machine Stuctues Lectue SOE Dan Gacia Lectue 28 CPU Design : Pipelining to Impove Pefomance 2010-04-05 Stanfod Reseaches have invented a monitoing technique called
More informationPoint-Biserial Correlation Analysis of Fuzzy Attributes
Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh
More informationLecture Topics ECE 341. Lecture # 12. Control Signals. Control Signals for Datapath. Basic Processing Unit. Pipelining
EE 341 Lectue # 12 Instucto: Zeshan hishti zeshan@ece.pdx.edu Novembe 10, 2014 Potland State Univesity asic Pocessing Unit ontol Signals Hadwied ontol Datapath contol signals Dealing with memoy delay Pipelining
More informationPersistent Memory what developers need to know Mark Carlson Co-chair SNIA Technical Council Toshiba
Pesistent Memoy what developes need to know Mak Calson Co-chai SNIA Technical Council Toshiba 2018 Stoage Develope Confeence EMEA. All Rights Reseved. 1 Contents Welcome Pesistent Memoy Oveview Non-Volatile
More informationScaling Location-based Services with Dynamically Composed Location Index
Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute
More informationLecture 8 Introduction to Pipelines Adapated from slides by David Patterson
Lectue 8 Intoduction to Pipelines Adapated fom slides by David Patteson http://www-inst.eecs.bekeley.edu/~cs61c/ * 1 Review (1/3) Datapath is the hadwae that pefoms opeations necessay to execute pogams.
More informationRANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES
RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class
More information4.2. Co-terminal and Related Angles. Investigate
.2 Co-teminal and Related Angles Tigonometic atios can be used to model quantities such as
More informationComputer Science 141 Computing Hardware
Compute Science 141 Computing Hadwae Fall 2006 Havad Univesity Instucto: Pof. David Books dbooks@eecs.havad.edu [MIPS Pipeline Slides adapted fom Dave Patteson s UCB CS152 slides and May Jane Iwin s CSE331/431
More informationParametric Query Optimization for Linear and Piecewise Linear Cost Functions
Paametic Quey Oimization fo Linea and Piecewise Linea Cost Functions Avind Hulgei S. Sudashan Indian Institute of Technology, Bombay {au, sudasha}@cse.iitb.ac.in Abstact The of a quey an depends on many
More informationDetection and Recognition of Alert Traffic Signs
Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives
More informationAssessment of Track Sequence Optimization based on Recorded Field Operations
Assessment of Tack Sequence Optimization based on Recoded Field Opeations Matin A. F. Jensen 1,2,*, Claus G. Søensen 1, Dionysis Bochtis 1 1 Aahus Univesity, Faculty of Science and Technology, Depatment
More informationAll lengths in meters. E = = 7800 kg/m 3
Poblem desciption In this poblem, we apply the component mode synthesis (CMS) technique to a simple beam model. 2 0.02 0.02 All lengths in metes. E = 2.07 10 11 N/m 2 = 7800 kg/m 3 The beam is a fee-fee
More informationIn order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.
In ode to lean which questions have been answeed coectly: 1. Pint these pages. 2. Answe the questions. 3. Send this assessment with the answes via: a. FAX to (212) 967-3498. O b. Mail the answes to the
More informationCOEN-4730 Computer Architecture Lecture 2 Review of Instruction Sets and Pipelines
1 COEN-4730 Compute Achitectue Lectue 2 Review of nstuction Sets and Pipelines Cistinel Ababei Dept. of Electical and Compute Engineeing Maquette Univesity Cedits: Slides adapted fom pesentations of Sudeep
More informationConversion Functions for Symmetric Key Ciphers
Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401
More informationSegmentation of Casting Defects in X-Ray Images Based on Fractal Dimension
17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach
More informationDYNAMIC STORAGE ALLOCATION. Hanan Samet
ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu
More informationThe Java Virtual Machine. Compiler construction The structure of a frame. JVM stacks. Lecture 2
Compile constuction 2009 Lectue 2 Code geneation 1: Geneating code The Java Vitual Machine Data types Pimitive types, including intege and floating-point types of vaious sizes and the boolean type. The
More informationRT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver
1 RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Dive Amit Jain Daji Qiao Kang G. Shin The Univesity of Michigan Ann Abo, MI 4819, USA {amitj,dqiao,kgshin@eecs.umich.edu Abstact The cuent
More informationGCC-AVR Inline Assembler Cookbook Version 1.2
GCC-AVR Inline Assemble Cookbook Vesion 1.2 About this Document The GNU C compile fo Atmel AVR isk pocessos offes, to embed assembly language code into C pogams. This cool featue may be used fo manually
More informationTHE THETA BLOCKCHAIN
THE THETA BLOCKCHAIN Theta is a decentalized video steaming netwok, poweed by a new blockchain and token. By Theta Labs, Inc. Last Updated: Nov 21, 2017 esion 1.0 1 OUTLINE Motivation Reputation Dependent
More informationWhat is a System:- Characteristics of a system:-
Unit 1 st :- What is a System:- A system is an odely gouping of intedependent components linked togethe accoding to a plan to achieve a specific objective. The study of system concepts has thee basic implications:
More informationComparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters
Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,
More informationPOMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler
POMDP: Intoduction to Patially Obsevable Makov Decision Pocesses Hossein Kamalzadeh, Michael Hahsle 2019-01-02 The R package pomdp povides an inteface to pomdp-solve, a solve (witten in C) fo Patially
More informationPipes, connections, channels and multiplexors
Pipes, connections, channels and multiplexos Fancisco J. Ballesteos ABSTRACT Channels in the style of CSP ae a poeful abstaction. The ae close to pipes and connections used to inteconnect system and netok
More informationMultidimensional Testing
Multidimensional Testing QA appoach fo Stoage netwoking Yohay Lasi Visuality Systems 1 Intoduction Who I am Yohay Lasi, QA Manage at Visuality Systems Visuality Systems the leading commecial povide of
More informationMapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma
apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the
More informationOn using circuit-switched networks for file transfers
On using cicuit-switched netwoks fo file tansfes Xiuduan Fang, Malathi Veeaaghavan Univesity of Viginia Email: {xf4c, mv5g}@viginia.edu Abstact High-speed optical cicuit-switched netwoks ae being deployed
More informationAn Unsupervised Segmentation Framework For Texture Image Queries
An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu
More informationSRD991 / SRD960 Intelligent Positioners Communication with HART Hand-Held Terminal
Maste Instuction 07.2007 MI EVE0105 B-(en) SRD991 / SRD960 Intelligent Positiones Communication with HART Hand-Held Teminal The intelligent electo-pneumatic positiones SRD991/SRD960 ae designed to opeate
More informationObstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor
Obstacle Avoidance of Autonomous Mobile Robot using Steeo Vision Senso Masako Kumano Akihisa Ohya Shin ichi Yuta Intelligent Robot Laboatoy Univesity of Tsukuba, Ibaaki, 35-8573 Japan E-mail: {masako,
More informationAutomation Testing Frameworks for SharePoint application
Intenational Jounal of Compute Sciences and Engineeing Open Access Reseach Pape Volume-3, Issue-11 E-ISSN: 2347-2693 Automation Testing Famewoks fo ShaePoint application Madhu Dande 1 *, Neelima Galla
More informationQuality Aware Privacy Protection for Location-based Services
In Poceedings of the th Intenational Confeence on Database Systems fo Advanced Applications (DASFAA 007), Bangkok, Thailand, Apil 9-, 007. Quality Awae Pivacy Potection fo Location-based Sevices Zhen Xiao,,
More informationEfficient Execution Path Exploration for Detecting Races in Concurrent Programs
IAENG Intenational Jounal of Compute Science, 403, IJCS_40_3_02 Efficient Execution Path Exploation fo Detecting Races in Concuent Pogams Theodous E. Setiadi, Akihiko Ohsuga, and Mamou Maekaa Abstact Concuent
More informationOPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO
OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO Zeeshan A. Shaikh 1 and T.Y. Badguja 2 1,2 Depatment of Mechanical Engineeing, Late G. N. Sapkal
More informationOn the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes
On the Convesion between Binay Code and BinayReflected Gay Code on Boolean Cubes The Havad community has made this aticle openly available. Please shae how this access benefits you. You stoy mattes Citation
More informationThe International Conference in Knowledge Management (CIKM'94), Gaithersburg, MD, November 1994.
The Intenational Confeence in Knowledge Management (CIKM'94), Gaithesbug, MD, Novembe 994. Hashing by Poximity to Pocess Duplicates in Spatial Databases Walid G. Aef Matsushita Infomation Technology Laboatoy
More informationA Recommender System for Online Personalization in the WUM Applications
A Recommende System fo Online Pesonalization in the WUM Applications Mehdad Jalali 1, Nowati Mustapha 2, Ali Mamat 2, Md. Nasi B Sulaiman 2 Abstact foeseeing of use futue movements and intentions based
More informationFifth Wheel Modelling and Testing
Fifth heel Modelling and Testing en Masoy Mechanical Engineeing Depatment Floida Atlantic Univesity Boca aton, FL 4 Lois Malaptias IFMA Institut Fancais De Mechanique Advancee ampus De lemont Feand Les
More informationA Consistent, User Friendly Interface for Running a Variety of Underwater Acoustic Propagation Codes
Poceedings of ACOUSTICS 6 - Novembe 6, Chistchuch, New Zealand A Consistent, Use Fiendly Inteface fo Running a Vaiety of Undewate Acoustic Popagation Codes Alec J Duncan, Amos L Maggi Cente fo Maine Science
More informationEvaluation of Partial Path Queries on XML data
Evaluation of Patial Path Queies on XML data Stefanos Souldatos Dept of EE & CE, NTUA stef@dblab.ntua.g Theodoe Dalamagas Dept of EE & CE, NTUA dalamag@dblab.ntua.g Xiaoying Wu Dept. of CS, NJIT xw43@njit.edu
More informationART GALLERIES WITH INTERIOR WALLS. March 1998
ART GALLERIES WITH INTERIOR WALLS Andé Kündgen Mach 1998 Abstact. Conside an at galley fomed by a polygon on n vetices with m pais of vetices joined by inteio diagonals, the inteio walls. Each inteio wall
More informationAnd Ph.D. Candidate of Computer Science, University of Putra Malaysia 2 Faculty of Computer Science and Information Technology,
(IJCSIS) Intenational Jounal of Compute Science and Infomation Secuity, Efficient Candidacy Reduction Fo Fequent Patten Mining M.H Nadimi-Shahaki 1, Nowati Mustapha 2, Md Nasi B Sulaiman 2, Ali B Mamat
More information17/5/2009. Introduction
7/5/9 Steeo Imaging Intoduction Eample of Human Vision Peception of Depth fom Left and ight eye images Diffeence in elative position of object in left and ight eyes. Depth infomation in the views?? 7/5/9
More informationUser Visible Registers. CPU Structure and Function Ch 11. General CPU Organization (4) Control and Status Registers (5) Register Organisation (4)
PU Stuctue and Function h Geneal Oganisation Registes Instuction ycle Pipelining anch Pediction Inteupts Use Visible Registes Vaies fom one achitectue to anothe Geneal pupose egiste (GPR) ata, addess,
More informationA Family of Distributed Deadlock Avoidance Protocols and their Reachable State Spaces
A Family of Distibuted Deadlock Avoidance Potocols and thei Reachable State Spaces Césa Sánchez, Henny B. Sipma, and Zoha Manna Compute Science Depatment Stanfod Univesity, Stanfod, CA 94305-9025 {cesa,sipma,manna}@cs.stanfod.edu
More informationDYNAMIC STORAGE ALLOCATION. Hanan Samet
ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 074 e-mail: hjs@umiacs.umd.edu
More informationAccelerating Storage with RDMA Max Gurtovoy Mellanox Technologies
Acceleating Stoage with RDMA Max Gutovoy Mellanox Technologies 2018 Stoage Develope Confeence EMEA. Mellanox Technologies. All Rights Reseved. 1 What is RDMA? Remote Diect Memoy Access - povides the ability
More informationCENG 3420 Computer Organization and Design. Lecture 07: MIPS Processor - II. Bei Yu
CENG 3420 Compute Oganization and Design Lectue 07: MIPS Pocesso - II Bei Yu CEG3420 L07.1 Sping 2016 Review: Instuction Citical Paths q Calculate cycle time assuming negligible delays (fo muxes, contol
More informationAltova RaptorXML User and Reference Manual
Altova RaptoXML 2013 Use and Refeence Manual Altova RaptoXML 2013 Use & Refeence Manual All ights eseved. No pats of this wok may be epoduced in any fom o by any means - gaphic, electonic, o mechanical,
More informationEffects of Model Complexity on Generalization Performance of Convolutional Neural Networks
Effects of Model Complexity on Genealization Pefomance of Convolutional Neual Netwoks Tae-Jun Kim 1, Dongsu Zhang 2, and Joon Shik Kim 3 1 Seoul National Univesity, Seoul 151-742, Koea, E-mail: tjkim@bi.snu.ac.k
More informationMulti-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples
Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits
More informationA Minutiae-based Fingerprint Matching Algorithm Using Phase Correlation
A Minutiae-based Fingepint Matching Algoithm Using Phase Coelation Autho Chen, Weiping, Gao, Yongsheng Published 2007 Confeence Title Digital Image Computing: Techniques and Applications DOI https://doi.og/10.1109/dicta.2007.4426801
More informationCold Drawn Tube. Problem:
Cold Dawn Tube Poblem: An AISI 1 cold-dawn steel tube has an ID of 1.5 in and an OD of 1.75 in. What maximum extenal pessue can this tube take if the lagest pincipal nomal stess is not to exceed 8 pecent
More informationDecentralized Trust Management for Ad-Hoc Peer-to-Peer Networks
Decentalized Tust Management fo Ad-Hoc Pee-to-Pee Netwoks Thomas Repantis Vana Kalogeaki Depatment of Compute Science & Engineeing Univesity of Califonia, Riveside Riveside, CA 92521 {tep,vana}@cs.uc.edu
More informationModeling a shared medium access node with QoS distinction
Modeling a shaed medium access node with QoS distinction Matthias Gies, Jonas Geutet Compute Engineeing and Netwoks Laboatoy (TIK) Swiss Fedeal Institute of Technology Züich CH-8092 Züich, Switzeland email:
More informationA Functional Approach for Formalizing Regular. Universitat Karlsruhe, Institut fur Rechnerentwurf und Fehlertoleranz,
A Functional Appoach fo Fomalizing Regula Hadwae Stuctues? Dik Eisenbiegle 1, Klaus Schneide 1 and Ramayya Kuma 2 1 Univesitat Kalsuhe, Institut fu Rechneentwuf und Fehletoleanz, (Pof. D. Schmid), P.O.
More informationSIMOCODE pro. Motor Management and Control Devices. SIMOCODE pro for Modbus RTU. Answers for industry. Edition 04/2015
SIMOCODE po Moto Management and Contol Devices SIMOCODE po fo Modbus RTU Geätehandbuch Configuation Manual Edition 04/2015 Answes fo industy. Intoduction 1 System configuation and commissioning with RTU
More informationMIS to Prepress ICS. Version Date: File: ICS-MIS-Prepress-1.01.doc,.pdf. Origination & Prepress WG
MIS to Pepess ICS Vesion 1.01 Date: 2006-01-02 File: ICS-MIS-Pepess-1.01.doc,.pdf Oigination & Pepess WG Abstact This ICS defines the Inteface between the MIS and Pepess. It specifies the Pocesses fo a
More informationarxiv: v4 [cs.ds] 7 Feb 2018
Dynamic DFS in Undiected Gaphs: beaking the O(m) baie Suende Baswana Sheejit Ray Chaudhuy Keeti Choudhay Shahbaz Khan axiv:1502.02481v4 [cs.ds] 7 Feb 2018 Depth fist seach (DFS) tee is a fundamental data
More informationCommunication vs Distributed Computation: an alternative trade-off curve
Communication vs Distibuted Computation: an altenative tade-off cuve Yahya H. Ezzeldin, Mohammed amoose, Chistina Fagouli Univesity of Califonia, Los Angeles, CA 90095, USA, Email: {yahya.ezzeldin, mkamoose,
More informationYou Are Here! Review: Hazards. Agenda. Agenda. Review: Load / Branch Delay Slots 7/28/2011
CS 61C: Geat Ideas in Compute Achitectue (Machine Stuctues) Instuction Level Paallelism: Multiple Instuction Issue Guest Lectue: Justin Hsia Softwae Paallel Requests Assigned to compute e.g., Seach Katz
More informationHaptic Glove. Chan-Su Lee. Abstract. This is a final report for the DIMACS grant of student-initiated project. I implemented Boundary
Physically Accuate Haptic Rendeing of Elastic Object fo a Haptic Glove Chan-Su Lee Abstact This is a final epot fo the DIMACS gant of student-initiated poject. I implemented Bounday Element Method(BEM)
More informationOn Error Estimation in Runge-Kutta Methods
Leonado Jounal of Sciences ISSN 1583-0233 Issue 18, Januay-June 2011 p. 1-10 On Eo Estimation in Runge-Kutta Methods Ochoche ABRAHAM 1,*, Gbolahan BOLARIN 2 1 Depatment of Infomation Technology, 2 Depatment
More informationLecture 27: Voronoi Diagrams
We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the
More informationData mining based automated reverse engineering and defect discovery
Data mining based automated evese engineeing and defect discovey James F. Smith III, ThanhVu H. Nguyen Naval Reseach Laboatoy, Code 5741, Washington, D.C., 20375-5000 ABSTRACT A data mining based pocedue
More informationGEM-X255 CONTROL PANEL/COMMUNICATOR
R R PROGRAMMING INSTRUCTIONS HARDWIRE WIRELESS GEM-X55 CONTROL PANEL/COMMUNICATOR GEMINI SYSTEM SYSTEM ARMED ARMED 0/0/00 0/0/97:00 :00AM ARMED STATUS NEXT/YES A 3 D E PRIOR/NO B 56 F AREA C 790G COMPUTERIZED
More informationDATE LUIS MOLINA, P.E. FLORIDA P.E. # LEE COUNTY UTILITIES 1500 MONROE STREET, 3rd FLOOR FT. MYERS, FL 33901
BOAD OF COUNTY COMMISSIONES, FLOIDA S:\\ACAD\Collections\FV\Myerlee Gardens\Myerlee Gardens GM BID Plans.dwg, /11/2016 2:09:49 PM ATTENTION IS DIECTED IN THE FACT THAT THESE PLANS MAY HAVE BEEN EDUCED
More informationADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM
ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM Luna M. Rodiguez*, Sue Ellen Haupt, and Geoge S. Young Depatment of Meteoology and Applied Reseach Laboatoy The Pennsylvania State Univesity,
More informationAn Extension to the Local Binary Patterns for Image Retrieval
, pp.81-85 http://x.oi.og/10.14257/astl.2014.45.16 An Extension to the Local Binay Pattens fo Image Retieval Zhize Wu, Yu Xia, Shouhong Wan School of Compute Science an Technology, Univesity of Science
More informationParallel processing model for XML parsing
Recent Reseaches in Communications, Signals and nfomation Technology Paallel pocessing model fo XML pasing ADRANA GEORGEVA Fac. Applied Mathematics and nfomatics Technical Univesity of Sofia, TU-Sofia
More informationEvaluation of Partial Path Queries on XML Data
Evaluation of Patial Path Queies on XML Data Stefanos Souldatos Dept of EE & CE NTUA, Geece stef@dblab.ntua.g Theodoe Dalamagas Dept of EE & CE NTUA, Geece dalamag@dblab.ntua.g Xiaoying Wu Dept. of CS
More information