Enterprise Master Patient Index
|
|
- Russell York
- 8 years ago
- Views:
Transcription
1 Enterprse Master Patent Index Healthcare data are captured n many dfferent settngs such as hosptals, clncs, labs, and physcan offces. Accordng to a report by the CDC, patents n the Unted States made an estmated 1.1 bllon vsts to physcan offces, hosptal outpatent departments and hosptal emergency departments just n Ths corresponds to a rate of about four vsts per patent. In addton to the large volume of vst data generated on an annual bass, the data s also dstrbuted across dfferent healthcare settngs as patents vst hosptals, prmary and specalty physcans and move across the country. In order to put together the longtudnal health record of a patent, all ther data needs to be ntegrated accurately and effcently despte the fact that the data s captured usng dsparate and heterogeneous systems. The heterogenety of the systems used to capture patent data at the dfferent healthcare systems cause patent records to have multple unrelated patent dentfers assgned to them wth the possblty of multple dentfers assgned to a gven patent record wthn a sngle nsttuton. The lack of precse standards on the format of patent dentfyng and patent demographc data results n ncomplete data sharng among healthcare professonals, patents, and data repostores. In addton to the syntactc heterogenety of the data, the data capture process s often not carefully controlled for qualty nor necessarly defned n a common way across dfferent data sources, resultng n unavodable and all too common data entry errors whch further exacerbate the nconsstency of the data. Common data management desgn ssues nclude lack of normalzaton or de-normalzaton and mssng ntegrty constrants whereas mproper data handlng results n wrong or mssng data or uncontrolled data duplcaton. In order to ntegrate all ths healthcare data, the varous patent dentfers assgned to a gven patent ether at dfferent nsttutons or erroneously by a sngle nsttuton, must be lnked together despte the presence of syntactc and semantc dfferences n the assocated demographc data captured for the patent. Ths problem has been known for more than fve decades as the record lnkage or the record matchng problem. The goal n the record matchng problem s to dentfy records that refer to the same real world entty, even f the records do not match completely. If each record carred a unque, unversal, and error-free dentfcaton code, the only problem would be to fnd an optmal search sequence that would mnmze the total number of record comparsons. The syntactc and semantc dfferences between the data sources as well as the data entry errors ntroduced durng capture coupled wth pure qualty control measures result n the need to use dentfcaton codes that are nether unque nor error-free. The followng examples llustrates the stuaton where even though two records refer to the same patent, because of semantc and syntactc varatons n the two records, the task of matchng them cannot be easly automated. The followng example makes t clear that only a sophstcated record matchng algorthm could automatcally make the decson on whether to lnk the dentfers assgned to the followng two patent records. Name Address Age Javer Martnez 49 E. Applecross Road 33 Haver Marteenez 49 Applecross Road 36
2 Sophstcated record matchng algorthms approach ths complex problem by decomposng the overall process nto three tasks: the data preparaton phase, the searchng phase and the matchng phase. The data preparaton phase s a pre-processng phase whch parses and transforms the data n an effort to remove the syntactc and semantc heterogenety of the patent demographc data. In the absence of unque patent dentfers, the matchng algorthms must use patent demographc data as the matchng varables so, n the data preparaton phase the ndvdual felds are transformed n order for them to conform to the data types of ther correspondng domans. In the searchng phase, the algorthms search through the data to dentfy canddates for potental matches. The brute-force approach of an exhaustve search across the Cartesan product of the data sets s of quadratc order, wth respect to the number of records so t s not feasble for lnkng large data sets. For example, attemptng to lnk two data sets wth only 10,000 records each usng an exhaustve search would requre 100 mllon comparsons. To reduce the total number of comparsons, blockng algorthms are used whch partton the full Cartesan product of possble record pars nto smaller subsets. The topc of blockng algorthms s addressed n more detal n a separate secton. In the matchng phase, the record pars dentfed durng the searchng phase are compared to dentfy matches. Typcally, a subset of the patent s demographc attrbutes, whch are referred to as the matchng varables, s used to dentfy matches. The correspondng matchng varables for each par of records are compared wth one another formng the comparson vector. The matchng decson must determne whether a par of records should be regarded as lnked, not lnked or possbly lnked, dependng upon the varous agreements or dsagreements of tems of dentfyng nformaton. The specfcaton of a record lnkng procedure requres both a method for measurng closeness of agreement between records as well as an algorthm that uses ths measure for decdng when to classfy records as matches. For example, f we are lnkng person records, a possble measurement would be to compare the famly names of the two records and assgn the value of 1 to those pars where there s absolute agreement and 0 to those pars where there s absolute dsagreement. Values n between 0 and 1 are most frequently used to ndcate how close the values n the two dfferent domans are. Matchng algorthms are classfed as determnstc or probablstc. The secton on matchng algorthms defnes these two classfcatons n detal and descrbes the advantages and dsadvantages of each approach. Blockng Algorthms In most record lnkage cases, the two datasets that need to be ntegrated do not posses a unque dentfer so a collecton of record attrbutes must be used to match records and record pars from the two datasets need to be compared to one another to dentfy matchng records. For example, a typcal scenaro s to use the frst name, last name, gender and brth date of each record as the dentfyng attrbutes for a dstnct patent record. The next step s to compare record pars from the two data sources and apply a matchng algorthm to detect whether the two records of a par match or not. The naïve approach of comparng every possble record par from the two datasets s of quadratc complexty and s thereby computatonally nfeasble for large sets. As was mentoned prevously, comparng all the record pars n an effort to match two data sets wth 10,000 records each, requres 100 mllon comparsons, makng t prohbtvely expensve. In addton to the computatonal complexty, comparng these many records n memory
3 ncreases the demands on the memory subsystem to the pont where the data set cannot all be kept n memory. The algorthm wll need to page records nto memory as needed complcatng the complexty of the mplementaton. To reduce the huge number of possble record par comparsons, record lnkage systems employ blockng algorthms to reduce the large number of record pars that need to be compared. The most commonly used blockng algorthm uses one or more record attrbutes, referred to as the blockng key. Examples of blockng keys are usng the frst four characters of the last name n one case or the zp code attrbute combned wth an age category. The attrbutes of the blockng key are used to splt the datasets nto blocks. Then only records from the block wth the same blockng key need to be compared for possble matches. There s a cost-beneft trade-off to be consdered n choosng the blockng keys. If the number of records n each block s very large, as would be the case when usng the gender as the only blockng attrbute, then more record pars than necessary wll be generated. If the number of records n each block s very small, many potental record matches wll be mssed snce the matchng algorthm wll only compare records that fall n the same block. An example of ths stuaton would be usng the SSN as the only attrbute n the blockng key. In ths case only records wth the same SSN would end up n the same block, whch means that records wth ncorrect or mssng values n the SSN feld would not match. A conflctng goal for a blockng algorthm s that whle attemptng to reduce the number of record pars that need to be compared, the algorthm must not erroneously assgn potentally matchng records to two dfferent blocks because then they wll never match wth one another. It s preferable to use the least error-prone attrbutes n the blockng key and as a further safeguard, multple passes of blockng are sometmes used wth dfferent blockng keys n each phase so that potental matches that are mssed wth a certan blockng key wll be consdered for matchng n a subsequent phase. A number of more advanced blockng algorthms have been proposed over the years that am to acheve a reducton n the number of record pars that need to be compared whle reducng the errors n separatng potental matches. The sorted neghborhood blockng algorthm parttons each dataset usng the blockng key, sorts the records usng the blockng key values and then moves a sldng wndow across the records. Records wthn the wndow are then pared wth each other and ncluded n the canddate record par lst. For a wndow of sze w and a total number of records of n, ths lmts the number of possble record par comparsons for each record to 2w-1 and the total number of generated record pars to O(wn). Another blockng algorthm s the Bgram Indexng method. The Bgram Indexng method converts blockng keys nto a lst of bgrams and generates one block for each bgram value n the lst. It then assgns records wth the same blockng key value to all the blocks labeled wth one of the bgram values of that blockng key. The last advanced blockng algorthm we descrbe here s the Canopy Clusterng algorthm whch forms clusters by choosng a record at random and puttng n ts cluster all the records wthn a certan dstance to t. The record chosen at random and any records wthn a certan tght threshold dstance of t are then removed from the canddate set of records. Fgure 1 llustrates an example of four data clusters and the canopes that
4 cover them. Ponts belongng to the same cluster are colored n the same shade of gray. Pont A was selected at random and forms a canopy consstng of all ponts wthn the outer (sold) threshold. Ponts nsde the nner (dashed) threshold are excluded from beng the center of, and formng new canopes. Canopes for B, C, D, and E were formed smlarly to A. Note that the optmalty condton holds: for each cluster there exsts at least one canopy that completely contans that cluster. Note also that whle there s some overlap, there are many ponts excluded by each canopy. Expensve dstance measurements wll only be made between pars of ponts n the same canopes, far fewer than all possble pars n the data set [MCCAL]. The number of record par comparsons 2 fn resultng from canopy clusterng s O where n s the number of records n each of c the two data sets, c s the number of canopes and f s the average number of canopes a record belongs to. The threshold parameter should be set so that f s small and c s large, n order to reduce the amount of computaton. Fgure 1 Illustraton of the Canopy Clusterng Blockng Algorthm Matchng Algorthms The subject of record lnkage has receved actve attenton by the research communty for more than ffty years and durng that tme, many algorthms have been proposed. At the same tme no algorthm has emerged as the most approprate for use n every possble populaton of patent demographc data. Ths plethora of matchng algorthms can be classfed as belongng nto one of two major categores of matchng algorthms: determnstc or probablstc algorthms.
5 Determnstc (or exact or all-or-none) algorthms employ a set of rules based on exact agreement/dsagreement results between correspondng felds n potental record pars. Determnstc algorthms are the most approprate choce when records on both sources of data that need to be ntegrated contan a varable or characterstc of an ndvdual that s deally () unversally avalable, () fxed, () easly recorded, (v) unque to each ndvdual, and (v) readly verfable. Few, f any, varables meet all these requrements although some come close enough to be useable. The advantage of determnstc algorthms s that they are easy to mplement but ther dsadvantage s that they only produce accurate matchng results after careful analyss and extensve preprocessng of the data sets that need to be matched. In one of the few publshed studes of the applcaton of determnstc matchng algorthms, the authors descrbe n detal the process that they employed n order to acheve accurate matchng results usng a determnstc algorthm. Ther objectve was to match records from two hosptal systems patent regstres wth the Socal Securty Death Master Fle. The source data was preprocessed usng feld specfc approaches such as encodng names usng phonetc compressons algorthms, mputaton of mssng gender feld values usng the frst name to look up gender specfc names n the Census and parsng of brth dates nto month, day and year followed by correcton or elmnaton of nvald values. They used number theory-based algorthms to detect cases where the order of the names vared between sources. After the preprocessng phase, the authors extracted samples from the two data sets and manually revewed the matches found usng a socal securty-only matchng phase n order to generate a gold standard for measurng the error rates of lnkage varables and for comparng the matchng accuracy of varous combnatons of these varables. After extensve analyss of varous combnatons of matchng varables the concluded that the best matchng attrbutes for ther dataset were the SSN, the frst name transformed by the NYSIIS phonetc encodng algorthm, month of brth and gender. A more recent study that compares a determnstc wth a probablstc matchng algorthm usng an emprcal evaluaton comes to smlar conclusons regardng the advantages and dsadvantages of determnstc algorthms. Determnstc matchng algorthms can produce good results f the qualty of the source data s farly hgh, the data s preprocessed carefully and after matchng attrbutes are selected after a detaled analyss of ther performance n small subsets of the data. Probablstc algorthms have ganed popularty due to ther applcablty n most common scenaros where the data sets that need to be ntegrated do not posses one or more attrbutes wth the characterstcs descrbed earler. Most data sets have attrbutes where ther values contan errors and omssons and they typcally do not possess a unque and unversally avalable hgh qualty dentfer. Probablstc record matchng reles on calculatng scores n determnng whether two records are a match and those underlyng scores are based on probabltes. A set of record attrbutes are frst selected after analyzng the data set and those attrbutes form what s referred to as the match key. Canddate record pars are then compared to one another by usng a dstance metrc to calculate the smlarty between correspondng felds of the match key. The values of the dstance metrc for each record form a comparson vector. The probablty of each comparson vector s then evaluated to determne whether the two records are close enough to each other to be classfed as a match. The probablstc approach to record lnkage orgnated wth the work of genetcst Howard Newcombe who ntroduced odds
6 ratos of frequences and the decson rules for delneatng matches and non-matches. Felleg and Sunter then organzed Newcombe s deas nto a rgorous mathematcal framework whch formalzed the record lnkage problem n probablstc terms. Before presentng the rgorous formulaton of the record lnkage problem, some notaton needs to be ntroduced. The assumpton s that there are two sets of records that need to be lnked to one another. The two sets of records are denoted as A and B and a sngle record from each set s denoted by lower case letters a and b, respectvely. The set of all possble record pars conssts of the Cartesan product of the two sets A B = {( a, b); a A, b B} The objectve of the matchng algorthm s to partton the set of record pars nto the two subsets of matchng pars and M = {( a, b) A B a = b} U = {( a, b) A B a b} of non-matchng pars. Note that snce ths s a parttonng of the two sets, that mples that M U = A B and M U =. Let s assume that the match key conssts of K attrbutes. The two records n each record par are compared wth one another, formng a comparson vector γ of length K. The space of all possble values of γ s Γ : [ γ γ γ γ ] T j γ =,..., 1, 2,..., K wth γ {0,1 }. In partcular, γ = 1 ndcates that the correspondng values for feld n j the two records n record par j are close enough based on the selected dstance metrc to be consdered a match and γ = 0 otherwse. If we assume that the observaton of γ s an j event generated from some probablty dstrbuton, we can then consder the condtonal probablty of observng γ gven that the record par s a match and denote that dstrbuton as: m( γ ) = P( γ ( a, b) M ) = P( γ M ) as well as the condtonal probablty of observng γ gven that the record par s a nonmatch, denoted as: u( γ ) = P( γ ( a, b) U ) = P( γ U ) Gven ths model, a matchng algorthm s smply a mappng or decson rule that upon observng the comparson vector γ for record par ( a, b) t needs to decde f t s a matched par, labelng the record par as A 1, or f t s an unmatched par, labelng t by A 3. There wll be some cases n whch the nether label can be assgned wth suffcent confdence and those cases wll be labeled as A 2. A lnkage rule can now be defned as a mappng from Γ, the comparson space, onto a set of random decson functons D = { d( γ )} where
7 and d γ ) = { P( A γ ), P( A γ ), P( γ )}; γ Γ ( 1 2 A3 3 = 1 P( γ ) = 1. A There are two types of error assocated wth a lnkage rule. The frst occurs when an unmatched record par s assgned to be a match (also referred to as a Type I error) and the probablty of ths error s: P γ γ ). ( A1 U ) = u( ) P( A1 γ Γ The second type of error s when a matched par s assgned to be a non-match (also referred to as a Type II error): P γ γ ). ( A3 M ) = m( ) P( A3 γ Γ For fxed values of the false match rate µ and false non-match rate λ, Felleg and Sunter defne the optmal lnkage rule at levels µ and λ, denoted by L ( µ, λ, Γ) as the rule for whch P ( A2 L) P( A2 L ) over all possble L ( µ, λ, Γ). They then defne a lnkage rule by frst assgnng an orderng to all comparson vectors γ such that the correspondng sequence of ratos m ( γ ) u( γ ) s monotone ncreasng and ndexng the ordered set {γ } by the subscrpt ( = 1,2,..., N ) and wrte u = u γ ); m = m( γ ) where N = Γ. They fnally prove that f ; Γ n u = 1 N µ =, λ = Γ m, and n < n, = n ( then L o ( µ, λ, Γ) s the optmal algorthm at the levels ( µ, λ) where the decson rule s defned as: (1,0,0) d(γ ) = (0,1,0) (0,0,1) f f f 1 n n < < n n The proof for the optmalty of the algorthm as well as detals on the mplementaton of the algorthm can be found n the orgnal paper by Felleg and Sunter OpenEMPI OpenEMPI s an Open Source Enterprse Master Patent Index (EMPI) that orgnated from the remnants of the Care Data Exchange software that were turned over to the open source communty after the Santa Barbara County (Calforna) Care Data Exchange (SBCCDE) ceased operatons. Snce t was orgnally released t has undergone consderable refactorng and redesgn n an effort to acheve the followng goals: a. decompose the overall system nto a collecton of servces, b. make t extensble so that new algorthms can be easly embedded nto the system over tme, c. optmze the data model to support nstances N Γ Γ
8 wth large numbers of patents, and d. provde standards-based ntegraton access ponts nto the system so that OpenEMPI can be easly ntegrated nto exstng healthcare envronments. To acheve the frst goal, the system was re-desgned so that the overall archtecture of the software s now based on Servce Orented Archtecture (SOA) prncples; the overall system archtecture conssts of a collecton of loosely coupled components and nteracton among components only takes place through well defned nterfaces. Fgure 2 llustrates the new archtecture of OpenEMPI wth only some of the servces ncluded n the fgure for concseness. The fgure also llustrates the layered nature of the archtecture where servces are allocated to the data access layer, the servce layer or the UI layer and where each layer bulds on top of the layer below. Layered archtectures provde flexblty by allowng entre layers to be removed and replaced wthout affectng the rest of the system. For example, movng OpenEMPI to utlze storage n the cloud would smply requre mplementaton of a new data layer to be deployed on a Storage-as-a-Servce (SaaS) nfrastructure wthout requrng modfcatons to the rest of the applcaton. Some of the key servces that comprse the archtecture of OpenEMPI nclude the Blockng Servce, whch abstracts the algorthms that reduce the number of record pars that need to be compared for matchng purposes, the Matchng Servce, whch provdes an abstracton for the algorthm that determne whether two or more patent records n the system dentfy a unque patent, the Strng Comparson Servce, whch determnes the measure of smlarty between two patent demographc attrbutes, and the Standardzaton Servce, whch supports the data preparaton phase and transforms patent attrbutes nto a standard format for the purpose of mprovng matchng performance. By decomposng the system nto components and specfyng nterfaces as the only means of nteracton between those components, the new archtecture acheved the extensblty goal. The system can be easly extended by smply mplementng a dfferent verson of a servce and pluggng nto the system wthout requrng any modfcatons to the rest of the system. Ths capablty of allowng for the pluggng n of new and nterchangeable algorthms n any of the servces s crucal snce t allows for OpenEMPI to become a platform for the testng and valdaton of varous ntellgent algorthms n any of the three phases of the record lnkage process.
9 Fgure 2 SOA-based Archtecture of OpenEMPI An EMPI nternally utlzes algorthms from the feld of record lnkage to detect and lnk duplcate records. Over the years many algorthms have been proposed wth dfferent operatng assumptons and performance characterstcs as descrbed n prevous sectons of ths report. By utlzng the extensblty of OpenEMPI, multple, alternatve matchng algorthms may be mplemented and the most approprate choce may be selected durng deployment. The software dstrbuton currently ncludes a fully functonal mplementaton of both a smple, determnstc algorthm as well as a probablstc matchng algorthm, whch s an mplementaton of the Felleg-Sunter algorthm that uses Expectaton-Maxmzaton (EM) for estmatng the margnal probabltes of the model. The same extensblty mechansm s also avalable n the blockng servce mplementaton and n the strng comparson servce. The current strng comparson servce provdes a number of strng dstance metrcs ncludng an exact strng comparator, the Jaro, Jaro-Wnkler, and the Levenshten dstance metrcs among others. The next objectve for the redesgn of OpenEMPI was the optmzaton of the data model to support the persstence and retreval of patent dentfyng and demographc data. Ths objectve was selected for two reasons. The ntent s for OpenEMPI to be sutable for mplementaton n large-scale healthcare envronments wth hundreds of thousands to mllons of patent records, and where the system needs to sustan ntense user workloads. Ths goal can only be acheved f the data model s desgned from the begnnng wth hgh performance as a key crteron. The second reason for the focus on optmzaton of the data model was to form a sold bass on top of whch multple addtonal matchng algorthms could be developed, tested and deployed n a producton envronment. Wth a data model where query performance s not consdered durng desgn, t would be mpossble to develop matchng algorthms that are effcent and sutable for mplementaton n large-scale envronments.
10 The fnal objectve was the provson of ntegraton ponts nto OpenEMPI n order to facltate ts ntegraton nto the Informaton Technology (IT) nfrastructure of exstng healthcare envronments. To acheve ths goal, OpenEMPI provdes support for the Patent Identfer Cross-Referencng (PIX) and Patent Demographcs Query (PDQ) standards defned by the Integratng the Healthcare Enterprse (IHE) organzaton. IHE defnes the workflow and specfes the standards to be used n the mplementaton of those workflows for promotng the sharng of medcal nformaton. The PIX profle supports the cross-referencng of patent dentfers from multple Patent Identfer Domans and the PDQ profle provdes ways for multple dstrbuted applcatons to query a patent nformaton server for a lst of patents, based on user-defned search crtera, and retreve a patent s demographc nformaton. OpenEMPI utlzes the open source mplementaton of the PIX/PDQ profles n OpenPIXPDQ and the two projects combned have been tested successfully at both the 2009 and 2010 IHE Connectathon. To further smplfy the ntegraton of OpenEMPI nto exstng IT nfrastructure, there are plans for the development of both a REST-based and a SOAP-based web servces nterface to the full functonalty avalable by OpenEMPI.
benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationThe Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationDescriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications
CMSC828G Prncples of Data Mnng Lecture #9 Today s Readng: HMS, chapter 9 Today s Lecture: Descrptve Modelng Clusterng Algorthms Descrptve Models model presents the man features of the data, a global summary
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationDemographic and Health Surveys Methodology
samplng and household lstng manual Demographc and Health Surveys Methodology Ths document s part of the Demographc and Health Survey s DHS Toolkt of methodology for the MEASURE DHS Phase III project, mplemented
More informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang
More informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
More informationAPPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho
More informationInstructions for Analyzing Data from CAHPS Surveys:
Instructons for Analyzng Data from CAHPS Surveys: Usng the CAHPS Analyss Program Verson 4.1 Purpose of ths Document...1 The CAHPS Analyss Program...1 Computng Requrements...1 Pre-Analyss Decsons...2 What
More informationRequIn, a tool for fast web traffic inference
RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France Olver.aul@nt-evry.fr, Jean-Etenne.Kba@nt-evry.fr Abstract As networked
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationSingle and multiple stage classifiers implementing logistic discrimination
Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
More informationConversion between the vector and raster data structures using Fuzzy Geographical Entities
Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationCredit Limit Optimization (CLO) for Credit Cards
Credt Lmt Optmzaton (CLO) for Credt Cards Vay S. Desa CSCC IX, Ednburgh September 8, 2005 Copyrght 2003, SAS Insttute Inc. All rghts reserved. SAS Propretary Agenda Background Tradtonal approaches to credt
More informationStatistical Methods to Develop Rating Models
Statstcal Methods to Develop Ratng Models [Evelyn Hayden and Danel Porath, Österrechsche Natonalbank and Unversty of Appled Scences at Manz] Source: The Basel II Rsk Parameters Estmaton, Valdaton, and
More informationFREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES
FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES Zuzanna BRO EK-MUCHA, Grzegorz ZADORA, 2 Insttute of Forensc Research, Cracow, Poland 2 Faculty of Chemstry, Jagellonan
More informationWeb Object Indexing Using Domain Knowledge *
Web Object Indexng Usng Doman Knowledge * Muyuan Wang Department of Automaton Tsnghua Unversty Bejng 100084, Chna (86-10)51774518 Zhwe L, Le Lu, We-Yng Ma Mcrosoft Research Asa Sgma Center, Hadan Dstrct
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationiavenue iavenue i i i iavenue iavenue iavenue
Saratoga Systems' enterprse-wde Avenue CRM system s a comprehensve web-enabled software soluton. Ths next generaton system enables you to effectvely manage and enhance your customer relatonshps n both
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More information1.1 The University may award Higher Doctorate degrees as specified from time-to-time in UPR AS11 1.
HIGHER DOCTORATE DEGREES SUMMARY OF PRINCIPAL CHANGES General changes None Secton 3.2 Refer to text (Amendments to verson 03.0, UPR AS02 are shown n talcs.) 1 INTRODUCTION 1.1 The Unversty may award Hgher
More informationVembu StoreGrid Windows Client Installation Guide
Ser v cepr ov dered t on Cl enti nst al l at ongu de W ndows Vembu StoreGrd Wndows Clent Installaton Gude Download the Wndows nstaller, VembuStoreGrd_4_2_0_SP_Clent_Only.exe To nstall StoreGrd clent on
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationEfficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ
Effcent Strpng Technques for Varable Bt Rate Contnuous Meda Fle Servers æ Prashant J. Shenoy Harrck M. Vn Department of Computer Scence, Department of Computer Scences, Unversty of Massachusetts at Amherst
More informationEfficient Project Portfolio as a tool for Enterprise Risk Management
Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse
More informationTraffic-light a stress test for life insurance provisions
MEMORANDUM Date 006-09-7 Authors Bengt von Bahr, Göran Ronge Traffc-lght a stress test for lfe nsurance provsons Fnansnspetonen P.O. Box 6750 SE-113 85 Stocholm [Sveavägen 167] Tel +46 8 787 80 00 Fax
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika.
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationPSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12
14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationJoint Scheduling of Processing and Shuffle Phases in MapReduce Systems
Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, Alcatel-Lucent
More informationSoftware project management with GAs
Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de
More informationHow To Understand The Results Of The German Meris Cloud And Water Vapour Product
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationData Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationA Simple Approach to Clustering in Excel
A Smple Approach to Clusterng n Excel Aravnd H Center for Computatonal Engneerng and Networng Amrta Vshwa Vdyapeetham, Combatore, Inda C Rajgopal Center for Computatonal Engneerng and Networng Amrta Vshwa
More informationTo manage leave, meeting institutional requirements and treating individual staff members fairly and consistently.
Corporate Polces & Procedures Human Resources - Document CPP216 Leave Management Frst Produced: Current Verson: Past Revsons: Revew Cycle: Apples From: 09/09/09 26/10/12 09/09/09 3 years Immedately Authorsaton:
More informationA DATA MINING APPLICATION IN A STUDENT DATABASE
JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationCanon NTSC Help Desk Documentation
Canon NTSC Help Desk Documentaton READ THIS BEFORE PROCEEDING Before revewng ths documentaton, Canon Busness Solutons, Inc. ( CBS ) hereby refers you, the customer or customer s representatve or agent
More informationRobust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School
Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management
More informationCloud-based Social Application Deployment using Local Processing and Global Distribution
Cloud-based Socal Applcaton Deployment usng Local Processng and Global Dstrbuton Zh Wang *, Baochun L, Lfeng Sun *, and Shqang Yang * * Bejng Key Laboratory of Networked Multmeda Department of Computer
More information2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet
2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B-1348 Louvan-la-Neuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 E-mal: corestat-lbrary@uclouvan.be
More informationA Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
More informationMethodology to Determine Relationships between Performance Factors in Hadoop Cloud Computing Applications
Methodology to Determne Relatonshps between Performance Factors n Hadoop Cloud Computng Applcatons Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng and
More informationWISE-Integrator: An Automatic Integrator of Web Search Interfaces for E-Commerce
WSE-ntegrator: An Automatc ntegrator of Web Search nterfaces for E-Commerce Ha He, Wey Meng Dept. of Computer Scence SUNY at Bnghamton Bnghamton, NY 13902 {hahe,meng}@cs.bnghamton.edu Clement Yu Dept.
More information1 Example 1: Axis-aligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationRate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer
More information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More information8 Algorithm for Binary Searching in Trees
8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the
More informationThe Current Employment Statistics (CES) survey,
Busness Brths and Deaths Impact of busness brths and deaths n the payroll survey The CES probablty-based sample redesgn accounts for most busness brth employment through the mputaton of busness deaths,
More informationNEURO-FUZZY INFERENCE SYSTEM FOR E-COMMERCE WEBSITE EVALUATION
NEURO-FUZZY INFERENE SYSTEM FOR E-OMMERE WEBSITE EVALUATION Huan Lu, School of Software, Harbn Unversty of Scence and Technology, Harbn, hna Faculty of Appled Mathematcs and omputer Scence, Belarusan State
More informationMETHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS
METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng
More informationA Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing
A Replcaton-Based and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 Ryadh-Saud Araba Abstract The very large nfrastructure
More information320 The Internatonal Arab Journal of Informaton Technology, Vol. 5, No. 3, July 2008 Comparsons Between Data Clusterng Algorthms Osama Abu Abbas Computer Scence Department, Yarmouk Unversty, Jordan Abstract:
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationIT09 - Identity Management Policy
IT09 - Identty Management Polcy Introducton 1 The Unersty needs to manage dentty accounts for all users of the Unersty s electronc systems and ensure that users hae an approprate leel of access to these
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationHollinger Canadian Publishing Holdings Co. ( HCPH ) proceeding under the Companies Creditors Arrangement Act ( CCAA )
February 17, 2011 Andrew J. Hatnay ahatnay@kmlaw.ca Dear Sr/Madam: Re: Re: Hollnger Canadan Publshng Holdngs Co. ( HCPH ) proceedng under the Companes Credtors Arrangement Act ( CCAA ) Update on CCAA Proceedngs
More informationCS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements
Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there
More informationAn MILP model for planning of batch plants operating in a campaign-mode
An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationProceedings of the Annual Meeting of the American Statistical Association, August 5-9, 2001
Proceedngs of the Annual Meetng of the Amercan Statstcal Assocaton, August 5-9, 2001 LIST-ASSISTED SAMPLING: THE EFFECT OF TELEPHONE SYSTEM CHANGES ON DESIGN 1 Clyde Tucker, Bureau of Labor Statstcs James
More informationComputer-assisted Auditing for High- Volume Medical Coding
Computer-asssted Audtng for Hgh-Volume Medcal Codng Computer-asssted Audtng for Hgh- Volume Medcal Codng by Danel T. Henze, PhD; Peter Feller, MS; Jerry McCorkle, BA; and Mark Morsch, MS Abstract The volume
More informationPower-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationA Secure Password-Authenticated Key Agreement Using Smart Cards
A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationVision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION
Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble
More informationPolitecnico di Torino. Porto Institutional Repository
Poltecnco d Torno Porto Insttutonal Repostory [Artcle] A cost-effectve cloud computng framework for acceleratng multmeda communcaton smulatons Orgnal Ctaton: D. Angel, E. Masala (2012). A cost-effectve
More informationImplementations of Web-based Recommender Systems Using Hybrid Methods
Internatonal Journal of Computer Scence & Applcatons Vol. 3 Issue 3, pp 52-64 2006 Technomathematcs Research Foundaton Implementatons of Web-based Recommender Systems Usng Hybrd Methods Janusz Sobeck Insttute
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationHosted Voice Self Service Installation Guide
Hosted Voce Self Servce Installaton Gude Contact us at 1-877-355-1501 learnmore@elnk.com www.earthlnk.com 2015 EarthLnk. Trademarks are property of ther respectve owners. All rghts reserved. 1071-07629
More informationSample Design in TIMSS and PIRLS
Sample Desgn n TIMSS and PIRLS Introducton Marc Joncas Perre Foy TIMSS and PIRLS are desgned to provde vald and relable measurement of trends n student achevement n countres around the world, whle keepng
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationHow To Trade Water Quality
Movng Beyond Open Markets for Water Qualty Tradng: The Gans from Structured Blateral Trades Tanl Zhao Yukako Sado Rchard N. Bosvert Gregory L. Poe Cornell Unversty EAERE Preconference on Water Economcs
More informationHowHow to Find the Best Online Stock Broker
A GENERAL APPROACH FOR SECURITY MONITORING AND PREVENTIVE CONTROL OF NETWORKS WITH LARGE WIND POWER PRODUCTION Helena Vasconcelos INESC Porto hvasconcelos@nescportopt J N Fdalgo INESC Porto and FEUP jfdalgo@nescportopt
More informationAnalysis of Energy-Conserving Access Protocols for Wireless Identification Networks
From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC-97), March 2-23, 1997. 1 Analyss of Energy-Conservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara
More informationThe Use of Analytics for Claim Fraud Detection Roosevelt C. Mosley, Jr., FCAS, MAAA Nick Kucera Pinnacle Actuarial Resources Inc.
Paper 1837-2014 The Use of Analytcs for Clam Fraud Detecton Roosevelt C. Mosley, Jr., FCAS, MAAA Nck Kucera Pnnacle Actuaral Resources Inc., Bloomngton, IL ABSTRACT As t has been wdely reported n the nsurance
More informationUsing Supervised Clustering Technique to Classify Received Messages in 137 Call Center of Tehran City Council
Usng Supervsed Clusterng Technque to Classfy Receved Messages n 137 Call Center of Tehran Cty Councl Mahdyeh Haghr 1*, Hamd Hassanpour 2 (1) Informaton Technology engneerng/e-commerce, Shraz Unversty (2)
More informationNPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6
PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION
More informationDynamic Scheduling of Emergency Department Resources
Dynamc Schedulng of Emergency Department Resources Junchao Xao Laboratory for Internet Software Technologes, Insttute of Software, Chnese Academy of Scences P.O.Box 8718, No. 4 South Fourth Street, Zhong
More informationOutsourcing inventory management decisions in healthcare: Models and application
European Journal of Operatonal Research 154 (24) 271 29 O.R. Applcatons Outsourcng nventory management decsons n healthcare: Models and applcaton www.elsever.com/locate/dsw Lawrence Ncholson a, Asoo J.
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationApplication of Multi-Agents for Fault Detection and Reconfiguration of Power Distribution Systems
1 Applcaton of Mult-Agents for Fault Detecton and Reconfguraton of Power Dstrbuton Systems K. Nareshkumar, Member, IEEE, M. A. Choudhry, Senor Member, IEEE, J. La, A. Felach, Senor Member, IEEE Abstract--The
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationSome literature also use the term Process Control
A Formal Approach for Internal Controls Complance n Busness Processes Koumars Namr 1, Nenad Stojanovc 2 1 SAP Research Center CEC Karlsruhe, SAP AG, Vncenz-Preßntz-Str.1 76131 Karlsruhe, Germany Koumars.Namr@sap.com
More informationAbstract. Clustering ensembles have emerged as a powerful method for improving both the
Clusterng Ensembles: {topchyal, Models jan, of punch}@cse.msu.edu Consensus and Weak Parttons * Alexander Topchy, Anl K. Jan, and Wllam Punch Department of Computer Scence and Engneerng, Mchgan State Unversty
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationFORMAL ANALYSIS FOR REAL-TIME SCHEDULING
FORMAL ANALYSIS FOR REAL-TIME SCHEDULING Bruno Dutertre and Vctora Stavrdou, SRI Internatonal, Menlo Park, CA Introducton In modern avoncs archtectures, applcaton software ncreasngly reles on servces provded
More informationFace Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)
Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton
More informationHow To Solve An Onlne Control Polcy On A Vrtualzed Data Center
Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely urgaonka@usc.edu, {kozat, garash}@docomolabs-usa.com, mjneely@usc.edu
More informationFormulating & Solving Integer Problems Chapter 11 289
Formulatng & Solvng Integer Problems Chapter 11 289 The Optonal Stop TSP If we drop the requrement that every stop must be vsted, we then get the optonal stop TSP. Ths mght correspond to a ob sequencng
More information