Using Bayesian Networks for Cleansing Trauma Data

Size: px
Start display at page:

Download "Using Bayesian Networks for Cleansing Trauma Data"

Transcription

1 Uing Bayeian Network for Cleaning Trauma Data Prahant J. Dohi Dept. of Computer Siene Univ of Illinoi, Chiago, IL Lloyd G. Greenwald Dept. of Computer Siene Drexel Univ, Philadelphia, PA John R. Clarke Dept. of Surgery Drexel Univ, Philadelphia, PA Abtrat Medial data i unique due to it large volume, heterogeneity and omplexity. Thi neeitate otly ative partiipation of medial domain expert in the tak of leaning medial data. In thi paper we preent a new data leaning approah that utilize Bayeian network to orret errant attribute value. Bayeian network apture expert domain knowledge a well a the unertainty inherent in the leaning proe, both of whih exiting leaning tool fail to model. Auray i improved by utilizing ontextual information in orreting errant value. Our approah operate in onjuntion with model of poible error type that we have identified through our leaning ativitie. We evaluate our approah and apply our method to orreting intane of thee error type. Introdution The ativity of leaning a raw data et involve deteting errant value, orreting the deteted error and optionally, filling in miing value. Data leaning i viewed a a ritial pre-proeing tep to data mining (Fayyad, Piatetky- Shapiro, & Smyth 1996) and i performed either eparately or in onjuntion with other data mining ativitie. Inuffiient data entry hek in legay ytem, diparate oure of data, and exigeny in entering the data are ome of the aue of error in medial data et. Current leaning method hinge on a manual inpetion, by hand, of the data to detet and orret errant value. The manual proe of data leaning i laboriou, time onuming, and prone to error thu neeitating automated method of leaning. A generi framework of automated data leaning inlude the definition and determination of error type, the identifiation of error intane, and the orretion of the diovered error intane (Maleti & Maru 1999). Medial data i unique due to it large volume, heterogeneity and omplexity (Cio & Moore 2002) making the tak of leaning a medial databae unuually diffiult. The omplexity of medial yntax and emanti neeitate ative and otly partiipation of a medial domain expert in the data leaning effort, uing exiting method. We preent a new approah to data leaning uing Bayeian network (BN). Thi approah both improve the auray of data leaning and redue the ot. Auray Copyright 2003, Amerian Aoiation for Artifiial Intelligene ( All right reerved. i improved by deigning Bayeian network that apture the ontext of an errant value to diambiguate the error. Context may be ued, for example, to detet and orret error intane in whih a valid but inorret value ha been entered for an attribute. For example, a typographial error may aue entry of intead of 87.0 a the diagnoti ICD-9 ode for a patient with relaping fever. Inpetion of other related attribute of a patient reord i the only way to identify and orret thi la of error. Cot i redued by building automated data leaning filter from Bayeian network that are partially deigned by induing model from data. Uing upervied learning to partially indue model from data redue the need for otly ative medial domain expert partiipation. Bayeian network may be ued to produe probability ditribution over orret value. Thee ditribution an apture and retain the unertainty inherent in data leaning. Furthermore, we may ue thee network to generate the mot likely value for miing attribute value. Bayeian network repreent a mature tehnology that i flexible enough to be applied to mot domain that require leaning. Our approah operate in onjuntion with model of poible error type that we have identified through initial leaning ativitie. Thee error type inlude both medial-domain-peifi error type, uh a medial ode ubtitution, and non-domain-peifi error type, uh a typographial error. Many of our model an be applied to other domain with minimal hange, thu repreenting andidate generi data leaning tool. Thi paper i trutured to preent firt the medial data in the next etion, then to diu general error detetion tehnique and error type. Our ontext-driven probabiliti approah to leaning i given next followed by it evaluation. We then onlude thi paper and outline future work. Undertanding the Medial Data A part of a long-term projet to improve emergeny enter trauma management for patient with multiple lifethreatening injurie and peifially, better undertand the effet of time delay on patient outome (Clarke et al. 2002), we obtained a large file of patient data. The data file onit of medial reord on 169,512 patient admitted diretly to trauma enter in Pennylvania between 1986 and 1999 and regitered in the Pennylvania Trauma Sy- 72 FLAIRS 2003

2 tem Foundation Regitry. Eah patient reord i ompoed of 412 attribute of information. Thee attribute an be ategorized in the following manner: Patient General Information Thee attribute pertain to the intitution number, trauma number allotted to the patient, general demographi data, bakground information on the are provided to the patient at the ene of injury, and patient inurane information. Patient Clinial Data Thee attribute relate to patient vital ign uh a pule, repiratory rate, motor repone, glagow oma ore, and revied trauma ore. Thee vital ign are multiply reorded at the ene of injury, during tranportation to the trauma enter, and at the arrival of the patient in the trauma enter. Drug reening information i alo ontained in thee field. Proe of Aute Care Thi i the larget ategory of attribute in a patient reord. They relate to patient ompliation in the emergeny department (ED), diagnoi of injury, treatment of the patient inluding non-operative and operative proedure, and final patient outome Timetamp Thi inlude the date and time of variou event that our during the proe of are of the patient. Thi inlude the date and time of injury of the patient, ene are dipath, ene are arrival, ene are leave, arrival of the patient at the ED, arrival of variou medial peronnel in the ED, and patient diharge from the ED. We obtained thi data a a ingle flat file of 69 million data point. From thi file, we ontruted a databae of relational table that houe ditint ategorie of information. We were then able to utilize data query language and other ytem tool to manipulate the data during the proe of leaning. After trimming the data bae to patient and field meeting the requirement for our planned tudie we have a databae with over 68 million data point panning 166,768 patient reord. Our firt tak wa to lean thi data, inluding etimating miing value. Data Cleaning Preliminarie Data entry and aquiition i inherently prone to error. Though muh effort i expended in implementing variou data entry hek, mot real world data et uffer from errant value (Redman 1998) neeitating the ue of leaning tehnique. The pre-proeing tep of data leaning i ritial to ahieve tandard of data quality and avoid ompromiing tudie that may be performed on the data et. Many data leaning effort to date (e.g. (Lee et al. 1999; Hernández & Stolfo 1995)) have onentrated on the problem of deteting and removing dupliate reord during integration of data from multiple oure. Our data leaning effort onentrate on deteting and orreting data value from a ingle oure. Kimball, R. (Kimball 1996) break down the proe of leaning into the ix tep of elementizing, tandardizing, verifying, mathing, houeholding, and doumenting. Elementizing break down the reord into it atomi unit for the ubequent tep. Standardizing onvert the element into a generi form. Verifying mathe the data againt known lit uh a ode, produt lit et. Mathing map the orret value to the exiting value in the data. Bookkeeping tak are arried out during houeholding and doumenting. Our leaning effort inorporate eah of thee ix tep. Speifially, tandardizing and verifying are ombined into a ingle tep followed by mathing and doumenting. Current leaning tool (Rahm & Do 2000) are deigned to aid the manual proe of identifying and orreting error. Suh tool ue tatitial method and ubjetive analyi to both detet and orret error. Thi often entail ubtitution of the errant value with a ingle likely orret value omputed through tatitial tehnique uh a average and variane analyi. In addition to ignoring the unertainty preent in etimating the orret value, thee tool are alo inapable of diretly apturing expert domain knowledge in arriving at their deiion. Thee limitation motivate our invetigation of probabiliti model uh a Bayeian network that not only apture and model the unertainty, but alo permit aimilation of the knowledge of the domain expert. Rather than uggeting a ingle orret value, a BN generate a probability ditribution over all poible orret value. The probability ditribution repreent the unertainty impliit in the etimation of likely orret value. Either the entire ditribution or the mot likely value that ha the highet probability may then be eleted a the replaement for the errant value. In the ubetion below we outline the proe of deteting error in our trauma data et, followed by an enumeration of the different error type that were diovered during thi proe. Error Detetion Error detetion at the reord-level typially utilize tatitial outlier detetion method. Thee method are olletively referred to a data profiling. Suh method ompute for eah attribute the length, value range, variane, and direte value for that attribute, a well a the frequeny and uniquene of eah value. Ourrene of null value and miing value for attribute are alo noted. Domain-peifi aoiation rule (e.g. hopital tay = exit date - entry date) are alo mined and teted for potential errant value. Additionally, we developed partial ordering ontraint for deteting anomalie in temporal attribute. Thee partial ordering amongt the temporal attribute are detailed in (Dohi 2002). Attribute value that violate the partial ordering ontraint are iolated for potential orretion. Data leaning effort an benefit from any upplemental doumentation that aompanie the raw data, inluding the data ditionary. Suh literature, in addition to providing inight into the individual attribute emanti, erve a an invaluable referene oure for verifiation. Claifiation of Error in Trauma Data During the proe of data leaning, medial domain expert are invaluable in deiphering medial jargon that i inherent in typial medial data et, a well a eluidating relationhip between attribute. Converely, a large proportion of medial data ontain non-domain peifi entrie that do not require the otly ative partiipation of medial FLAIRS

3 expert. To ahieve thee ot aving, we have laified error mehanim into two lae: thoe that require medial knowledge and thoe that do not. Non-domain peifi error The error preented in thi group are not unique to medial data et and may our in data in other domain a well. Common data entry error: Thee inlude typographial error uh a miing deimal point in numeri and alphanumeri value, kipped harater and number, and preene of wayward peial harater. Quantitative tranformation error: Attribute requiring value in a partiular ytem of unit may frequently be error trap. For example, the body temp attribute require body temperature in o C. If the temperature i meaured in o F it mut be manually onverted to o C before entry. Thi type of tranformation proe i a oure of numerou error. Domain-peifi error The error in thi group manifet due to the medial yntax and emanti. Code ubtitution: Thee involve errant entry of invalid a well a other valid but inorret ode in plae of the orret medial ode. Temporal anomalie: Timetamp value preent in temporal attribute may violate partial ordering ontraint that are peifi to the domain. Additionally, the time interval derived from the timetamp may be above or below predefined limit. Bayeian Network for Data Cleaning Our general approah to error orretion for non-temporal data i to apture the et of attribute that an be ued to diambiguate an error uing a graphial probabiliti network, alo known a a Bayeian network (Pearl 1988). A BN i a DAG in whih node repreent random variable and link between the node repreent aual or tatitial dependenie. Bayeian network provide a graphial and intuitive method to apture the relationhip between attribute in a tak or domain. Attribute are repreented with random variable, providing a repreentation for any unertainty in attribute value. Domain knowledge i aptured in the emanti truture of the network that illutrate the aual relationhip amongt the attribute of the domain. Bayeian network provide a ompat repreentation by taking advantage of onditional independene and loal truture, and permit effiient omputation of joint probability ditribution. In the ubetion below, we introdue the generi BN at the ore of our error orretion method, followed by the proedure that wa employed for the orretion. Error Corretion Model Figure 1 depit the generi BN that wa utilized during our approah. The random variable Corret Value of Attribute apture the prior probability ditribution over the range of orret value of the attribute. Error Mehanim repreent the different type of error that may have ourred. The random variable Entered Value of Attribute take Corret Value of Attribute n n Entered Value of Attribute Error Mehanim Figure 1: The Bayeian Error Corretion Model. on the potentially errant value that have been entered into the databae for the attribute. Definition 1 Let be the attribute to be leaned. Let { i i=1...n} and { i i=1...n} be the et of attribute that have a aual and a ymptomati relation repetively, with. The ontext of i the et { j i i=1...n, j= or }. The ontext repreent domain-peifi information hardoded in the network. For eah attribute, whoe errant value are to be orreted or miing value to be filled in, the ontext i identified uing expert medial knowledge. Definition 2 Let be the attribute to be leaned. Let C be the ontext identified for. A BN of the form given in Fig 1 ontaining C i alled an intantiated BN for. The proe of entering value (evidene) for the ontextual random variable in an intantiated BN i termed a ontext hek for the attribute. A ontext hek, in addition to validating our aumption of the orret value, alo at a a trong induer of the orret value. Method of Corretion Errant and miing value may be ubtituted with the mot likely value, or all poible value, or a likely range of value for that attribute. In our error orretion we replae the errant value with either the mot likely value or a probability ditribution over all poible value of the attribute. Our approah to orreting deteted errant value for ome attribute involve a two-tep proedure. The firt tep i to intantiate a BN for the attribute, followed by iolating from the databae, the hunk of errant data pertaining to the attribute that ompoe the BN. The iolated hunk of data i randomly partitioned into a training et and a tet (holdout) et of equal ardinalitie. The training et i firt leaned manually by inpeting eah patient reord, peifially eah errant value of the attribute i mapped to it likely orret value. The BN i trained uing thi et during whih the onditional probability table are populated with the appropriate probabilitie. The training algorithm utilized a Bayeian MAP approah with Dirihlet funtion a prior for learning the onditional probabilitie. Auming the prior ditribution to be Dirihlet generally doe not reult in a ignifiant lo of auray, ine preie prior are not uually available, and Dirihlet funtion an fit a wide variety of imple funtion. The trained BN may now erve a an automated data leaning filter. It i applied to the tet et during whih the errant and ontextual 74 FLAIRS 2003

4 information within eah reord i entered into the appropriate node of the BN and a probability ditribution over the orret value i inferred. Either the mot likely value or the entire probability ditribution may be retained in the leaned data. The tradeoff involved in thi deiion are explored in (Dohi, Greenwald, & Clarke 2001). In intane where the ditribution amongt the et of orret value i uniform, the errant value i left unorreted in the data. An important advantage of our BN i it dual ue in orreting errant value a well a filling in miing value. Reliane of the leaning proe on the ontextual information permit predition of the orret value for miing value a well. A imilar methodology a before i ued to fill in miing value. A peial non-trivial la of error involve ubtitution of orret value with other valid but inorret value. The abundane and omplexity of medial ode failitate frequent ourrene of uh error in medial data et. One method of deteting and orreting uh error i a tediou manual inpetion of eah patient reord. Suh a method relie on expert domain knowledge oupled with ontextual information in inferring the mot likely orret value. Our BN by virtue of poeing both thee entitie repreent an error orretion model that i apable of orreting uh error. We give example of uh error orretion elewhere. Evaluation In thi etion we demontrate the appliation of our leaning approah to the domain peifi and non-domain peifi lae of error outlined previouly. Our approah to the firt three lae of error i to produe a probabiliti error model that relate the data field in quetion with other field in the data bae. Thi provide a ontext that may be ued, in onjuntion with a model of poible error mehanim, to ompute a probability ditribution over orret value for the data field in quetion. Our approah to the fourth la of error i to develop a et of ontraint that apture the partial ordering of all time and date field in a reord, and ue thee partial ordering ontraint to detet and orret errant temporal data field (Dohi 2002). In the next ubetion we give an example intantiated BN and tet it preditive ability. We applied our trained BN model to the data et that required leaning. In the final ubetion we how the predited orret value for the orreponding errant value. Performane One of the attribute that required leaning wa patient preexiting ondition. Figure 2 how the BN intantiated for the attribute. The random variable Error Set apture two aue of error: MiDePt (miing deimal point) and CodeSubt (ode ubtitution). The ontext onit of onene pule, on-ene ytoli blood preure, on-ene repiratory rate, and on-ene intubation. The ontinuou value of eah of thee random variable have been uitably diretized uing an entropy-baed upervied diretization tehnique. The variable Entered Errant Value and Corret Value repreent the errant value and all poible orret value repetively. Figure 2: Example Intantiated BN. Performane of the network wa aeed uing a 5- fold ro-validation tehnique. We iolated and manually leaned 78 reord ontaining errant value for the attribute. Our ro-validation tehnique enompaed 5 teting phae. In eah phae, the data wa randomly partitioned into 5 fold of whih 4 fold were utilized in training and the remaining fold wa ued for teting the BN. During teting, ontextual value a well a the errant value, if any, from the tet reord were entered and the mot likely orret value and error mehanim were predited. We oberved an average error rate of 20% (ie. mipredition on 3 ae) for prediting orret value and an error rate of 3.75% (ie. mipredition on 1 ae) for prediting the error mehanim. Predited Corret Value In Table 1 we peify the errant value followed by the mot likely orret value a predited by our intantiated BN model and relevant omment pertaining to the orretion. For lak of pae we how only a mall ampling of orretion and hide the ontext of the orreted attribute value. Row 1-4 of Table 1 diplay frequently ourring error in entry of medial ode uh a miplaement of deimal point, miing deimal point and ue of numeri harater in plae of deimal point. Mathematial tranformation uh a onverion of temperature from o F to o C beome oure of error when uh tranformation are arried out manually. Row 5-8 how orretion of errant patient body temperature value in the data. Inpetion of ontextual attribute uh a anatomi injury ore, burn data, and patient pre-exiting ondition reinfored the belief in the likely orret value. Errant entry of invalid or valid medial ode our frequently while reording medial data. In addition to abene of hek at the time of entry uh error are alo aued by the preponderane of medial ode that referene the ame FLAIRS

5 No. Value Replaed with Reaon for the ation 1 A0.6 A.06 Miplaed deimal pt. Context hek Miing deimal pt. Freq(3.31-Spinal Tap,33.10-Iniion of lung)=(356,1008) Supet that deimal pt replaed with 3, Freq(34.04-Chet tube)=9780. Context hek Supet that deimal pt replaed with 0, Freq(57.94-foley)= Context hek Preumed to be in F, onverted to C. Context hek Miing deimal point and rounding. Context hek * 5/9-32 = -12 C temp. wa further onverted. Context hek (980-32)* 5/9 = 527 Deimal pt. error. Context hek Miplaed deimal pt. Frequeny(87.03-CT head) = Context hek. 10 CHF A.03 Congetive Heart F ailure, aigned ode A.03. Context hek. 11 CHOL CHOL Could imply Choleterol or Choleytetory, both are valid preexiting ondition. 12 COPD L.03 Chroni Obtrutive Pulmonary Dieae, aigned ode L.03. Context hek medial ondition. Row 9-12 how the orretion of medial ode ubtitution error in whih the orret ode i ubtituted with either an invalid or valid ode in the data. Uing our error orretion model we performed approximately 1,100 orretion. We have maintained extenive doumentation on thee hange to make them tratable. The doumentation alo erve a a oure of referene for automating future leaning ativitie. Conluion and Future Work Data leaning i now reognized a a onequential preproeing tep in data mining. Abene of formal method of leaning, inuffiient doumentation of retropetive leaning ativitie, voluminou target data, and a lak of laifiation of andidate error make thi tak tediou and error-prone in itelf. Furthermore, the unertainty impliit in thi proe and it reliane on expert domain knowledge require development of model that are able to apture both thee qualitie. BN repreent an effiient andidate tehnology that meet thee requirement and provide a pragmati unambiguou approah to takling the tak. We preented a generi BN model that utilize the ontext of an attribute to infer a probability ditribution over the orret value of the attribute a well a mehanim of the error. The BN approah operate in onjuntion with a et of poible domain-peifi and non-domain peifi error mehanim that laify typial error in medial data et. The advantage of our approah lie in it intuitivene and ability to apture unertainty a well a domain knowledge to perform error orretion. Furthermore the BN alo addree error that involve one valid ode ubtitution with another. Diadvantage involve intantiation of a BN for eah attribute that mut be leaned, limitation of BN in modelling ontinuou-valued attribute (they mut firt be diretized), and poor reult with mall ize of training et. Many of thee tehnique were developed during a year-long effort to manually lean our target databae. It i our hope that the method we have enumerated here an help other effort to better automate thi proe. The leaned data et were employed in a ueful tatitial tudy (Clarke et al. 2002) that examined the effet of delay in the ED on patient outome for a ertain la of patient. Furthermore, we are teting our BN model on Table 1: Sample error and their orretion. variou other data et a well. Aknowledgement Thi reearh i ponored in part by a Drexel/MCP-Hahnemann Reearh Synergie award. Referene Cio, K., and Moore, G. W Uniquene of medial data mining. AI in Mediine 26(1-2):1 24. Clarke, J. R.; Trookin, S. Z.; Dohi, P. J.; Greenwald, L. G.; and Mode, C. J Time to laparotomy for intra-abdominal bleeding from trauma doe affet urvival for delay up to 90 minute. The Journal of Trauma: Injury, Infetion, and Critial Care 52(3): Dohi, P. J.; Greenwald, L.; and Clarke, J. R On retaining intermediate probabiliti model in data. In AAAI Fall Sympoium on Unertainty in AI, Dohi, P. J Effetive method for building probabiliti model from large noiy data et. Mater thei, Drexel Univerity, Philadelphia, PA Fayyad, U. M.; Piatetky-Shapiro, G.; and Smyth, P From data mining to knowledge diovery: An overview. Advane in Knowledge Diovery and Data Mining, MIT Pre/AAAI Pre Hernández, M. A., and Stolfo, S. J The merge/purge problem for large databae. In Carey, M. J., and Shneider, D. A., ed., Proeeding of the 1995 ACM SIGMOD International Conferene on Management of Data, Kimball, R Dealing with dirty data. Databae and Management Sytem 9(10):55+. Lee, M.; Lu, H.; Ling, T.; and Ko, Y Cleaning data for mining and warehouing. In Proeeding of the 10th Intl Conf on Databae and Expert Sytem, Maleti, J., and Maru, A Progre rpt on automated data leaning. Teh Rpt CS-99-02, U of Memphi. Pearl, J Probabiliti Reaoning in Intelligent Sytem: Network of Plauible Inferene. Lo Alto, California: Morgan-Kaufmann. Rahm, E., and Do, H. H Data leaning: Problem and urrent approahe. IEEE Data Engg Bulletin 23(4). Redman, T The impat of poor data quality on the typial enterprie. CACM 41(2): FLAIRS 2003

1. Introduction. Abstract

1. Introduction. Abstract Automati Ontology Derivation Uing Clutering for Image Claifiation 1 Latifur Khan and Lei Wang Department of Computer Siene Univerity of Texa at Dalla, TX 75083-0688 Email: [lkhan, leiwang]@utdalla.edu

More information

Macrohomogenous Li-Ion-Battery Modeling - Strengths and Limitations

Macrohomogenous Li-Ion-Battery Modeling - Strengths and Limitations Marohomogenou Li-Ion-Battery Modeling - Strength and Limitation Marku Lindner Chritian Wieer Adam Opel AG Sope Purpoe of the reearh: undertand and quantify impat of implifiation in marohomogeneou model

More information

KINEMATIC ANALYSIS OF VARIOUS ROBOT CONFIGURATIONS

KINEMATIC ANALYSIS OF VARIOUS ROBOT CONFIGURATIONS International Reearh Journal of Engineering and Tehnology (IRJET) e-in: 39-6 Volume: 4 Iue: May -7 www.irjet.net p-in: 39-7 KINEMATI ANALYI OF VARIOU ROBOT ONFIGURATION Game R. U., Davkhare A. A., Pakhale..

More information

Combined Radix-10 and Radix-16 Division Unit

Combined Radix-10 and Radix-16 Division Unit Combined adix- and adix-6 Diviion Unit Tomá ang and Alberto Nannarelli Dept. of Eletrial Engineering and Computer Siene, Univerity of California, Irvine, USA Dept. of Informati & Math. Modelling, Tehnial

More information

ISSN (Online), Volume 1, Special Issue 2(ICITET 15), March 2015 International Journal of Innovative Trends and Emerging Technologies

ISSN (Online), Volume 1, Special Issue 2(ICITET 15), March 2015 International Journal of Innovative Trends and Emerging Technologies International Journal of Innovative Trend and Emerging Tehnologie ROBUST SCAN TECHNIQUE FOR SECURED AES AGAINST DIFFERENTIAL CRYPTANALYSIS BASED SIDE CHANNEL ATTACK A.TAMILARASAN 1, MR.A.ANBARASAN 2 1

More information

Description of Traffic in ATM Networks by the First Erlang Formula

Description of Traffic in ATM Networks by the First Erlang Formula 5th International Conferene on Information Tehnology and Appliation (ICITA 8) Deription of Traffi in ATM Network by the Firt Erlang Formula Erik Chromý, Matej Kavaký and Ivan Baroňák Abtrat In the paper

More information

Incorporating Speculative Execution into Scheduling of Control-flow Intensive Behavioral Descriptions

Incorporating Speculative Execution into Scheduling of Control-flow Intensive Behavioral Descriptions Inorporating Speulative Exeution into Sheduling of Control-flow Intenive Behavioral Deription Ganeh Lakhminarayana, Anand Raghunathan, and Niraj K. Jha Dept. of Eletrial Engineering C&C Reearh Laboratorie

More information

Pruning Game Tree by Rollouts

Pruning Game Tree by Rollouts Pruning Game Tree by Rollout Bojun Huang Mirooft Reearh bojhuang@mirooft.om Abtrat In thi paper we how that the α-β algorithm and it ueor MT-SSS*, a two lai minimax earh algorithm, an be implemented a

More information

Parametric Micro-level Performance Models for Parallel Computing

Parametric Micro-level Performance Models for Parallel Computing Computer Siene Tehnial Report Computer Siene 12-5-1994 Parametri Miro-level Performane Model for Parallel Computing Youngtae Kim Iowa State Univerity Mark Fienup Iowa State Univerity Jeffrey S. Clary Iowa

More information

Q1:Choose the correct answer:

Q1:Choose the correct answer: Q:Chooe the orret anwer:. Purpoe of an OS i a. Create abtration b. Multiple proee ompete for ue of proeor. Coordination. Sheduler deide a. whih proee get to ue the proeor b. when proee get to ue the proeor.

More information

Calculations for multiple mixers are based on a formalism that uses sideband information and LO frequencies: ( ) sb

Calculations for multiple mixers are based on a formalism that uses sideband information and LO frequencies: ( ) sb Setting frequeny parameter in the WASP databae A. Harri 24 Aug 2003 Calulation for multiple mixer are baed on a formalim that ue ideband information and LO frequenie: b b := ign f ig f LO f IF := f ig

More information

OSI Model. SS7 Protocol Model. Application TCAP. Presentation Session Transport. ISDN-UP Null SCCP. Network. MTP Level 3 MTP Level 2 MTP Level 1

OSI Model. SS7 Protocol Model. Application TCAP. Presentation Session Transport. ISDN-UP Null SCCP. Network. MTP Level 3 MTP Level 2 MTP Level 1 Direte Event Simulation of CCS7 DAP Benjamin, AE Krzeinki and S Staven Department of Computer Siene Univerity of Stellenboh 7600 Stellenboh, South Afria fbenj,aek,taveng@.un.a.za ABSTRACT: Complex imulation

More information

Shortest Paths in Directed Graphs

Shortest Paths in Directed Graphs Shortet Path in Direted Graph Jonathan Turner January, 0 Thi note i adapted from Data Struture and Network Algorithm y Tarjan. Let G = (V, E) e a direted graph and let length e a real-valued funtion on

More information

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two

More information

Datum Transformations of NAV420 Reference Frames

Datum Transformations of NAV420 Reference Frames NA4CA Appliation Note Datum ranformation of NA4 Referene Frame Giri Baleri, Sr. Appliation Engineer Crobow ehnology, In. http://www.xbow.om hi appliation note explain how to onvert variou referene frame

More information

CleanUp: Improving Quadrilateral Finite Element Meshes

CleanUp: Improving Quadrilateral Finite Element Meshes CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)

More information

Relayer Selection Strategies in Cellular Networks with Peer-to-Peer Relaying

Relayer Selection Strategies in Cellular Networks with Peer-to-Peer Relaying Relayer Seletion Strategie in Cellular Network with Peer-to-Peer Relaying V. Sreng, H. Yanikomeroglu, and D. D. Faloner Broadband Communiation and Wirele Sytem (BCWS) Centre Dept. of Sytem and Computer

More information

View-Based Tree-Language Rewritings

View-Based Tree-Language Rewritings View-Baed Tree-Language Rewriting Lak Lakhmanan, Alex Thomo Univerity of Britih Columbia, Canada Univerity of Vitoria, Canada Importane of tree XML Semi-trutured textual format are very popular.

More information

COURSEWORK 1 FOR INF2B: FINDING THE DISTANCE OF CLOSEST PAIRS OF POINTS ISSUED: 9FEBRUARY 2017

COURSEWORK 1 FOR INF2B: FINDING THE DISTANCE OF CLOSEST PAIRS OF POINTS ISSUED: 9FEBRUARY 2017 COURSEWORK 1 FOR INF2B: FINDING THE DISTANCE OF CLOSEST PAIRS OF POINTS ISSUED: 9FEBRUARY 2017 Submiion Deadline: The ourework onit of two part (of a different nature) relating to one problem. A hown below

More information

Chapter 13 Non Sampling Errors

Chapter 13 Non Sampling Errors Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Inverse Kinematics 1 1/29/2018

Inverse Kinematics 1 1/29/2018 Invere Kinemati 1 Invere Kinemati 2 given the poe of the end effetor, find the joint variable that produe the end effetor poe for a -joint robot, given find 1 o R T 3 2 1,,,,, q q q q q q RPP + Spherial

More information

The Association of System Performance Professionals

The Association of System Performance Professionals The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and

More information

In-Plane Shear Behavior of SC Composite Walls: Theory vs. Experiment

In-Plane Shear Behavior of SC Composite Walls: Theory vs. Experiment Tranation, MiRT, 6- November,, New Delhi, India Div-VI: Paper ID# 764 In-Plane hear Behavior of C Compoite Wall: Theory v. Experiment Amit H. Varma, ai Zhang, Hoeok Chi 3, Peter Booth 4, Tod Baker 5 Aoiate

More information

Interconnection Styles

Interconnection Styles Interonnetion tyles oftware Design Following the Export (erver) tyle 2 M1 M4 M5 4 M3 M6 1 3 oftware Design Following the Export (Client) tyle e 2 e M1 M4 M5 4 M3 M6 1 e 3 oftware Design Following the Export

More information

Classical Univariate Statistics

Classical Univariate Statistics 1 2 Statitial Modelling and Computing Nik Fieller Department of Probability & Statiti Unierity of Sheffield, UK Claial Uniariate Statiti (& Alternatie) Claial tatitial tet and p-alue Simple imulation method

More information

Web Science and additionality

Web Science and additionality Admin tuff... Lecture 1: EITN01 Web Intelligence and Information Retrieval Meage, lide, handout, lab manual and link: http://www.eit.lth.e/coure/eitn01 Contact: Ander Ardö, Ander.Ardo@eit.lth.e, room:

More information

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary

More information

Visual Targeted Advertisement System Based on User Profiling and Content Consumption for Mobile Broadcasting Television

Visual Targeted Advertisement System Based on User Profiling and Content Consumption for Mobile Broadcasting Television Viual Targeted Advertiement Sytem Baed on Uer Profiling and ontent onumption for Mobile Broadating Televiion Silvia Uribe Federio Alvarez Joé Manuel Menéndez Guillermo inero Abtrat ontent peronaliation

More information

The norm Package. November 15, Title Analysis of multivariate normal datasets with missing values

The norm Package. November 15, Title Analysis of multivariate normal datasets with missing values The norm Package November 15, 2003 Verion 1.0-9 Date 2002/05/06 Title Analyi of multivariate normal dataet with miing value Author Ported to R by Alvaro A. Novo . Original by Joeph

More information

About this Topic. Topic 4. Arithmetic Circuits. Different adder architectures. Basic Ripple Carry Adder

About this Topic. Topic 4. Arithmetic Circuits. Different adder architectures. Basic Ripple Carry Adder About thi Topi Topi 4 Arithmeti Ciruit Peter Cheung Department of Eletrial & Eletroni Engineering Imperial College London URL: www.ee.imperial.a.uk/pheung/ E-mail: p.heung@imperial.a.uk Comparion of adder

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity

More information

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Partial Character Decoding for Improved Regular Expression Matching in FPGAs Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia

More information

On combining Learning Vector Quantization and the Bayesian classifiers for natural textured images

On combining Learning Vector Quantization and the Bayesian classifiers for natural textured images On combining Learning Vector Quantization and the Bayeian claifier for natural textured image María Guiarro Dept. Ingeniería del Software e Inteligencia Artificial Facultad Informática Univeridad Complutene

More information

A Dictionary based Efficient Text Compression Technique using Replacement Strategy

A Dictionary based Efficient Text Compression Technique using Replacement Strategy A based Effiient Text Compression Tehnique using Replaement Strategy Debashis Chakraborty Assistant Professor, Department of CSE, St. Thomas College of Engineering and Tehnology, Kolkata, 700023, India

More information

Cluster-Based Cumulative Ensembles

Cluster-Based Cumulative Ensembles Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,

More information

A SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS

A SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt

More information

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm

More information

A Novel Method for Removing Image Staircase Artifacts

A Novel Method for Removing Image Staircase Artifacts Vol.139 (SIP 016, pp.56-63 http://dx.doi.org/10.1457/atl.016.139.54 A Novel Method for Removing Image Stairae Artifat Zhong Chen 1,, Zhiwei Hou 1, Yuegang Xing, Xiaobing Chen 1 1 Jiangu Key Laboratory

More information

An Evolutionary Multiple Heuristic with Genetic Local Search for Solving TSP

An Evolutionary Multiple Heuristic with Genetic Local Search for Solving TSP An Evolutionary Multiple Heuriti with Geneti Loal Searh for Solving TSP Peng Gang Ihiro Iimura 2 and Shigeru Nakayama 3 Department of Information and Computer Siene Faulty of Engineering Kagohima Univerity

More information

Computer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder

Computer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal

More information

Automatic design of robust PID controllers based on QFT specifications

Automatic design of robust PID controllers based on QFT specifications IFAC Conferene on Advane in PID Control PID'1 Breia (Italy), Marh 8-3, 1 Automati deign of robut PID ontroller baed on QFT peifiation R. Comaòliva*, T. Eobet* J. Quevedo* * Advaned Control Sytem (SAC),

More information

Exploiting Enriched Contextual Information for Mobile App Classification

Exploiting Enriched Contextual Information for Mobile App Classification Exploiting Enrihed Contextual Information for Mobile App Classifiation Hengshu Zhu 1 Huanhuan Cao 2 Enhong Chen 1 Hui Xiong 3 Jilei Tian 2 1 University of Siene and Tehnology of China 2 Nokia Researh Center

More information

Operational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz

Operational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,

More information

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

Make your process world

Make your process world Automation platforms Modion Quantum Safety System Make your proess world a safer plae You are faing omplex hallenges... Safety is at the heart of your proess In order to maintain and inrease your ompetitiveness,

More information

Markov Random Fields in Image Segmentation

Markov Random Fields in Image Segmentation Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

Key Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.

Key Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing. Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in

More information

AUTOMATIC TEST CASE GENERATION USING UML MODELS

AUTOMATIC TEST CASE GENERATION USING UML MODELS Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,

More information

arxiv: v1 [physics.soc-ph] 17 Oct 2013

arxiv: v1 [physics.soc-ph] 17 Oct 2013 Emergene of Blind Area in Information Sreading arxiv:131707v1 [hyi.o-h] 17 Ot 2013 Zi-Ke Zhang 1,2,, Chu-Xu Zhang 1,3,, Xiao-Pu Han 1,2 and Chuang Liu 1,2 1 Intitute of Information Eonomy, Hangzhou Normal

More information

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,

More information

Topics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X

Topics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term

More information

A note on degenerate and spectrally degenerate graphs

A note on degenerate and spectrally degenerate graphs A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove

More information

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart. Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut

More information

IMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak

IMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe

More information

Building a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique

Building a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique 202 International Conference on Frontier in Handwriting Recognition Building a Compact On-line MRF Recognizer for Large Character Set uing Structured Dictionary Repreentation and Vector Quantization Technique

More information

Karen L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract

Karen L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial

More information

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

Laboratory Exercise 2

Laboratory Exercise 2 Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on

More information

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

Minimum congestion spanning trees in bipartite and random graphs

Minimum congestion spanning trees in bipartite and random graphs Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu

More information

A TOPSIS based Method for Gene Selection for Cancer Classification

A TOPSIS based Method for Gene Selection for Cancer Classification Volume 67 No17, April 2013 A TOPSIS baed Method for Gene Selection for Cancer Claification IMAbd-El Fattah,WIKhedr, KMSallam, 1 Department of Statitic, 3 Department of Deciion upport, 2 Department of information

More information

Torpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control

Torpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control orpedo rajetory Visual Simulation Based on Nonlinear Bakstepping Control Peng Hai-jun 1, Li Hui-zhou Chen Ye 1, 1. Depart. of Weaponry Eng, Naval Univ. of Engineering, Wuhan 400, China. Depart. of Aeronautial

More information

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis

More information

An Approach to Physics Based Surrogate Model Development for Application with IDPSA

An Approach to Physics Based Surrogate Model Development for Application with IDPSA An Approah to Physis Based Surrogate Model Development for Appliation with IDPSA Ignas Mikus a*, Kaspar Kööp a, Marti Jeltsov a, Yuri Vorobyev b, Walter Villanueva a, and Pavel Kudinov a a Royal Institute

More information

How to. write a paper. The basics writing a solid paper Different communities/different standards Common errors

How to. write a paper. The basics writing a solid paper Different communities/different standards Common errors How to write a paper The baic writing a olid paper Different communitie/different tandard Common error Reource Raibert eay My grammar point Article on a v. the Bug in writing Clarity Goal Conciene Calling

More information

A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED

A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED Jutin Domke and Yianni Aloimono Computational Viion Laboratory, Center for Automation Reearch Univerity of Maryland College Park,

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

A User-Attention Based Focus Detection Framework and Its Applications

A User-Attention Based Focus Detection Framework and Its Applications A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information

More information

KS3 Maths Assessment Objectives

KS3 Maths Assessment Objectives KS3 Math Aement Objective Tranition Stage 9 Ratio & Proportion Probabilit y & Statitic Appreciate the infinite nature of the et of integer, real and rational number Can interpret fraction and percentage

More information

Trainable Context Model for Multiscale Segmentation

Trainable Context Model for Multiscale Segmentation Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu

More information

Data Mining with Linguistic Thresholds

Data Mining with Linguistic Thresholds Int. J. Contemp. Math. Science, Vol. 7, 22, no. 35, 7-725 Data Mining with Linguitic Threhold Tzung-Pei Hong Department of Electrical Engineering National Univerity of Kaohiung Kaohiung, Taiwan, R.O.C.

More information

Routing Definition 4.1

Routing Definition 4.1 4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing

More information

Ana C. Andrés del Valle. To cite this version: HAL Id: pastel https://pastel.archives-ouvertes.fr/pastel

Ana C. Andrés del Valle. To cite this version: HAL Id: pastel https://pastel.archives-ouvertes.fr/pastel Analye de mouvement faial dur de image monoulaire ave appliation aux téléommuniation: Couplage de la ompréhenion de l expreion et du uivi de la poe du viage Ana C. André del Valle To ite thi verion: Ana

More information

Reporting Checklist for Nature Neuroscience

Reporting Checklist for Nature Neuroscience Correponding Author: Manucript Number: Manucript Type: Jeremy Elman NNBC48172A Brief Communication Reporting Checklit for Nature Neurocience # Figure: 2 # Figure: 5 # Table: 6 # Video: 0 Thi checklit i

More information

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens

More information

Kinematic design of a double wishbone type front suspension mechanism using multi-objective optimization

Kinematic design of a double wishbone type front suspension mechanism using multi-objective optimization 5 th utralaian Congre on pplied Mehani, CM 2007 10-12 Deember 2007, Bribane, utralia Kinemati deign of a double wihbone tpe front upenion mehanim uing multi-objetive optimiation J. S. wang 1, S. R. Kim

More information

AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM

AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt

More information

Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks

Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks Nearly Contant Approximation for Data Aggregation Scheduling in Wirele Senor Network Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Yinghu Li and France Yao Computer Science Department, City Univerity of

More information

An Approach to a Test Oracle for XML Query Testing

An Approach to a Test Oracle for XML Query Testing An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,

More information

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Analyzing Hydra Historical Statistics Part 2

Analyzing Hydra Historical Statistics Part 2 Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the

More information

Aspects of Formal and Graphical Design of a Bus System

Aspects of Formal and Graphical Design of a Bus System Apect of Formal and Graphical Deign of a Bu Sytem Tiberiu Seceleanu Univerity of Turku, Dpt. of Information Technology Turku, Finland tiberiu.eceleanu@utu.fi Tomi Weterlund Turku Centre for Computer Science

More information

Lecture 14: Minimum Spanning Tree I

Lecture 14: Minimum Spanning Tree I COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using

More information

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu

More information

PROJECT PERIODIC REPORT

PROJECT PERIODIC REPORT FP7-ICT-2007-1 Contrat no.: 215040 www.ative-projet.eu PROJECT PERIODIC REPORT Publishable Summary Grant Agreement number: ICT-215040 Projet aronym: Projet title: Enabling the Knowledge Powered Enterprise

More information

Dynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array

Dynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array Dynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array Januz A. Starzyk,Yongtao Guo, and Zhineng Zhu School of Electrical Engineering & Computer Science

More information

else end while End References

else end while End References 621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized

More information

ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION

ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa

More information

CS201: Data Structures and Algorithms. Assignment 2. Version 1d

CS201: Data Structures and Algorithms. Assignment 2. Version 1d CS201: Data Structure and Algorithm Aignment 2 Introduction Verion 1d You will compare the performance of green binary earch tree veru red-black tree by reading in a corpu of text, toring the word and

More information

Keywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE

Keywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent

More information

Floating Point CORDIC Based Power Operation

Floating Point CORDIC Based Power Operation Floating Point CORDIC Baed Power Operation Kazumi Malhan, Padmaja AVL Electrical and Computer Engineering Department School of Engineering and Computer Science Oakland Univerity, Rocheter, MI e-mail: kmalhan@oakland.edu,

More information