A SAS Macro for Finding Optimal k-means Clustering in One Dimension with Size Constraints
|
|
- Maximilian McDonald
- 6 years ago
- Views:
Transcription
1 Pape SD-02 A SAS Maco fo Fndng Optmal k-means Clusteng n One Dmenson wth Sze Constants Fengao Hu, Geoga Regents Unvesty; Robet E. Johnson, Vandeblt Unvesty ABSTRACT Wang and Song (2011) poposed a k-means clusteng algothm n one dmenson usng exact dynamc pogammng, whch guaantees optmalty. The algothm solved the clusteng poblem by beakng t nto smalle nested poblems. The one-dmensonal measue may, fo example, be baselne measues elated to a befoe-afte study and subects ae gouped (clusteed) on baselne befoe andomzaton. In ths pape we extend the wok by placng constants on the cluste sze, fo example, each cluste must be no less than the numbe of study ams. A SAS maco wll be pesented whch fnds the optmal clusteng gven the constant by mnmzng the wthn cluste oot mean squaed eo. An opton that andomly allocates subects to study ams s also ncluded. An example wll be gven whee a sample of pmay cae pactces ae to be allocated to teatment o contol. The study measues the degee to whch pmay cae physcans delve smokng cessaton counselng. Po to andomzaton, the pactces ae clusteed on the baselne measue. INTRODUCTION A pe-post desgn can help contol the wthn subect vaance to acheve the maxmum powe of analyss, snce each subect seves as ts own contol (Pak and Johnson, 2005). The vaance may be futhe contolled by statfcaton nto blocks po to andomzaton, whee the blocks ae elatvely homogeneous on the baselne pmay measues (Pak and Johnson, 2005). Although Pak and Johnson (2006) ponted out that teatng the baselne as a covaable povded maxmal contol of the vaance, wth o wthout pa-matchng, we ae nteested n undestandng the effect of baselne clusteng when consdeng an analyss of pe-post dffeences. In ode to statfy subects nto elatvely homogeneous blocks, a patton of the subects clusteed on the baselne values may be fomed so to mnmze the oot mean squaed eo (RMSE) of the baselne values. Snce subects wthn each block wll be andomzed to study ams, the subects baselne values must be clusteed such that not only the mnmal RMSE s acheved, but also each cluste must have at least the same numbe of subects as ams of the study. Heachcal clusteng methods, such as k-means (Lloyd, 1982), ae often used to dentfy clustes. The k-means pocedue does not always lead to the optmal clusteng snce the pocedue employs a andom path. These methods cannot easly constan the esult to have a mnmum numbe of subects fo each cluste. Unconstaned, the soluton may esult n one o moe clustes havng less than the equed numbe of subects. Fusng neghbong clustes can esolve ths, but may esult n a non-optmal set of clustes (Pak and Johnson, 2004). In ode to get an optmal set of clustes wth constants on numbe of subects, a modfed heachcal clusteng algothm s developed hee fo dentfyng clustes of unvaate baselne outcome data. It not only guaantees optmalty, but also places the desed constant on the mnmum numbe of subects n each cluste. The algothm s mplemented usng SAS/IML wth the maco ConClus (Constaned Un-dmensonal Clusteng). Fnally, we llustate how to use ths algothm by allocatng pmay cae pactces nto teatment and contol goups. The pactces ae clusteed on baselne physcan delvey of smokng cessaton counselng (Rothemch et. al, 2008). METHOD In ode to cluste on baselne to acheve mnmum RMSE wth the constant that evey cluste sze s no less than the numbe of study ams, we povde a new algothm that s an mpovement of the CKmeans.1d.dp algothm (Wang and Song, 2011). Snce, fo a fx set of clustes, mnmzng Eucldean sums of squaes (ESS) s equvalent to mnmzng RMSE when dealng wth unvaate data, we calculate RMSE by gettng the squae oot of the ato of wthnss and degees of feedom, whee wthnss epesents the Eucldean sums of squaes of wthn-cluste dstances fom each subect to ts coespondng cluste mean and the degees of feedom s the dffeence between total subects and numbe of clustes. Let x,, 1 n x be the non-descendng soted baselne values of n subects. We seek the cluste patton that mnmzes RMSE subect to the constant that evey cluste has no less than the numbe of study ams. Ou method extends that developed by Wang and Song (2011) and s equvalent to the algothm when 1. Suppose we have aanged subects nto m clustes wth mnmum wthnss. We ecod the coespondng mnmum wthnss 1
2 n enty D[, m] of an n n matx D, whee n means the ntege pat of n. The second dmenson of D s n constaned snce n subects can be clusteed nto at most clustes. The last ow of the matx D ndcates clusteng all the subects, thus the mnmum value of the last ow n matx D coesponds to the numbe of clustes elated to the cluste patton wth the smallest wthnss value, the soluton to the ognal poblem. The matx D s bult dynamcally. Suppose we want to fnd the wthnss to place n D[, m ] and the coespondng th patton that leads to ths value. Let be the ndex of the smallest odeed data value n the last, m, cluste. The value of cannot be less than m 1because t must have at least subects n each cluste, that s at least th m ( 1) totally fo the fst m 1 clustes. Futhe, must be no geate than 1 snce othewse the m cluste would not meet the constant. Thus ( m 1) 1 1. It s evdent that D[ 1, m 1] must be the optmal wthnss fo the fst 1 ponts n m 1 clustes fo othewse one would have a bette soluton to D[, m ]. Ths establshes the optmal substuctue fo dynamc pogammng and leads to the ecuence equaton n D[, m] mn { D 1, m 1 d x,, x}, 1 n, 1 m ( m1) 1 1 whee d( x,, x ) s the sum of squaed dstances fom x,, x to the mean. The matx s ntalzed as D d x1 x [,1] (,, ), that s, wthnss fo clusteng subects nto one cluste, equals to the sum of squaed dstances fom all obsevatons to the mean. Usng the above ecuence, we can obtan D[ n, m] the mnmum wthnss f all n numbes ae clusteed nto m goups, wth mnmum RMSE n, m Dn, m. n m In ode to make the pogam moe effcent, as suggested n Wang and Song (2011), the values d( x,, x ) n the ecuence d( x,, x) can be computed pogessvely and stoed based on d( x,, x 1). Usng a geneal ndex fom to, we teatvely compute x 2 ( ) d( x,, x ) d( x,, x 1 ) ( x, 1), wth, 1 1, 1, whee, s the mean of ( x,, x ). To fnd a clusteng of data wth mnmum wthnss of D, an auxlay matx B s defned to ecod the ndex of the smallest numbe n cluste m n n n B[, m] agmn { D 1, m 1 d x,, x},1 n,1 m ( m1) 1 1 Then we backtack fom Bn, kto obtan the statng and endng ndces fo all clustes and geneate an optmal soluton to the k-means poblem. EXAMPLE Eghteen pmay cae pactces wee ecuted as eseach stes unde the auspces of the Vgna Ambulatoy Cae Outcomes Reseach Netwok (ACORN), a pactce-based eseach netwok. Befoe conductng the nteventon, each pactce s baselne ate of povdng cessaton counselng by suveyng a coss-sectonal sample of vstng smokes was detemned. The pactces wee then clusteed accodng to the baselne ate. Snce the study was a two-am study wth teatment and contol, the clusteng had the constant that evey cluste has at least two subects. A goup of 18 pactces can be goups n 1 to 9 clustes as pesented n Table 1. The wthn-cluste sum squaes and RMSE ae also pesented. The esults ndcate that clusteng pactces nto 8 clustes can acheve smallest RMSE, wth 3 pactces n fst cluste and sxth cluste, and two pactces n of the emanng clustes. Note that RMSE dops lttle fom 5 to 8 clustes. Fo ths study, 5 clustes wee used. Also note that the 9 th cluste s RMSE values ae geate than those fo the 8 th cluste. Such a skewed-u shape n the cluste RMSE plot s typcal when cluste sze s constaned (Fgue 1). 2
3 Numbe of Clustes Cluste Wthnss RMSE Cluste Sze Table 1: Wthnss, RMSE, and Cluste Sze fo Optmal Pattons of the Study Baselne Data Fgue 1: Example study: RMSE by the Numbe of Clustes. Numbe of Clustes Baselne ID Cluste Numbe Table 2: Optmal Pattonng of 18 Pmay Cae Pactces Into 1-9 Clustes The detals of how to assgn each pactce nto clustes ae pesented n Table 2. The pattonng fo a sngle cluste s obvous and s not pesented. Fo example, the column of Cluste 5 shows how to cluste 18 pactces nto 5 clustes wth the constant that each cluste has at least 2 subects: 5 pactces wth ID 7, 5, 4, 13 and 9 wee 3
4 gouped nto cluste 1, 2 pactces wth ID 6 and 17 wee gouped nto cluste 2, 3 pactces wth ID 12, 10 and 16 wee gouped nto cluste 3, 6 pactces wth ID 11, 2, 14, 18, 8 and 15 wee gouped nto cluste 4, and the emande, ID 3 and 1, wee gouped nto cluste 5. Ths was the patton used n the example study. THE MACRO OVERVIEW The algothm shown above s mplemented wth SAS/IML and povded as a maco, ConClus. The use supples the nput dataset name, vaable on whch clustes ae desed (should be an odnal numec vaable), vaable that can help connect cluste esult wth ognal dataset (e.g., ID o post-teatment measues), and the constant (e.g., numbe of study ams). Two datasets ae ceated. Cluste contans the optmal cluste pattons gven the constant fo all feasble numbe of clustes (example: Table 2). RMSE contans the wthnss, RMSE, and the cluste szes fo each of the pattons (example: Table 1). SYNTAX %ConClus(baselne, <optons>) Optons EXAMPLE baselne Name of numec vaable on whch the cluste patton s desed. Ths s equed and must be lsted fst. The vaable should contan values of an odnal measue. ID=< d-vaable> Name of vaable used to help connect cluste esult wth ognal dataset. DATA=<SAS-data-set> Name of nput data set. Defaults to the last data set, _last_. CONSTR=< > Postve ntege-valued constant. Defaults to 1 and must be a dvso of the numbe of obsevatons. data Example; nput Baselne datalnes; ; un; * Patton nto clustes wth two-am study; %ConClus(Baselne,d=ID,data=Example,const=2) CONCLUSION A modfed heachcal clusteng algothm was povded as a SAS maco fo dentfyng clustes of unvaate odnal data that not only guaantees optmalty but also places the desed constant on the mnmum numbe of subects n each cluste. The maco povdes two data sets: one descbes how many subects n each cluste and the mnmum wthn-cluste sum squaes and RMSE that can be acheved fo each numbe of clustes, and the othe one descbes how to goup the subects nto dffeent numbe of clustes to acheve mnmum RMSE. The algothm pesented hee can only be appled to one-dmensonal data. An algothm that eaches optmalty, s epeatable, and meets constants on cluste sze emans to be developed fo multdmensonal data. A futue veson of ths maco wll assst wth andomzaton of subects acoss study ams statfed by cluste. 4
5 REFERENCES Lloyd, S.P. (1982), Least Squaes Quantzaton n PCM. IEEE Tansactons on Infomaton Theoy, 28(2): Pak, M and Johnson, RE (2004), Methods fo Matchng Clustes on Baselne Outcome Measues Po to Randomzaton Poceedngs of Jounal of the Amecan Statstcal Assocaton, , Alexanda, VA: Amecan Statstcal Assocaton. Pak, M and Johnson, RE (2005), Statfcaton on Baselne Measue: The Vaance Effect Poceedngs of Jounal of the Amecan Statstcal Assocaton, Vol.4, Alexanda, VA: Amecan Statstcal Assocaton. Pak, M and Johnson, RE (2006), Desgn and Analyss Methods fo Cluste Randomzed Tals wth Pa-Matchng On Baselne Outcome: Reducton of Teatment Effect Vaance Poceedngs of Jounal of the Amecan Statstcal Assocaton, Alexanda, VA: Amecan Statstcal Assocaton. Rothemch, SF, Woolf, SH, Johnson RE et.al (2008) Effect on Cessaton Counselng of Documentng Smokng Status as a Routne Vtal Sgn: An ACORN Study. Annals of Famly Medcne, Vol. 6, No.1, Wang, H and Song, M (2011), CKmeans.1d.dp: Optmal k-means Clusteng n One Dmenson by Dynamc Pogammng. The R Jounal, Vol. 3/2, Decembe 2011 CONTACT INFORMATION You comments and questons ae valued and encouaged. Contact the autho at: Name: Fengao Hu Entepse: Geoga Regents Unvesty Addess: th Steet, Depatment of Bostatstcs Cty, State ZIP: Augusta, GA, Wok Phone: Fax: E-mal: fhu@gu.edu SAS and all othe SAS Insttute Inc. poduct o sevce names ae egsteed tademaks o tademaks of SAS Insttute Inc. n the USA and othe countes. ndcates USA egstaton. Othe band and poduct names ae tademaks of the espectve companes. 5
arxiv: v1 [math.co] 21 Jan 2016
PROOF OF BIJECTION FOR COMBINATORIAL NUMBER SYSTEM axv:60.05794v [math.co] Jan 06 ABU BAKAR SIDDIQUE, SAADIA FARID, AND MUHAMMAD TAHIR Abstact. Combnatoal numbe system epesents a non-negatve natual numbes
More informationEffectiveness evaluation of electronic warfare command and control system based on grey AHP method
Avalable onlne www.jocp.com Jounal of hemcal and Phamaceutcal Reseach, 014, 6(7):535-54 Reseach Atcle ISSN : 0975-7384 ODEN(USA) : JPR5 Effectveness evaluaton of electonc wafae command and contol system
More informationNODAL AND LOOP ANALYSIS TECHNIQUES. Develop systematic techniques to determine all the voltages and currents in a circuit NODE ANALYSIS
NODAL AND LOOP ANALYSS TECHNQUES LEANNG GOALS NODAL ANALYSS LOOP ANALYSS Develop systematic techniques to determine all the voltages and currents in a circuit NODE ANALYSS One of the systematic ways to
More informationRisk assessment research for power transformer based on fuzzy synthetic evaluation
Avalable onlne www.jocp.com Jounal of Chemcal and Phamaceutcal Reseach, 23, 5(2):62-68 Reseach Atcle ISSN : 975-7384 CODEN(USA) : JCPRC5 Rsk assessment eseach fo powe tansfome based on fuzzy synthetc evaluaton
More informationPlanar Curve Representation and Matching
Plana Cuve Repesentaton and Matchng Mahe Al-Khayat and Fahad Kamanga Compute Scence and Engneeng Depatment Unvesty of Texas at Alngton Alngton, Texas 7609, USA [al-khay kamanga]@cse.uta.edu Abstact In
More informationAn Optimization Procedure In A Production Line Of Sokat Soap Industry, Ikotun, Lagos State. Adamawa State, Nigeria.
An Optmzaton Pocedue In A Poducton Lne Of Sokat Soap Industy, Ikotun, Lagos State. 1 O.S. Balogun, 2 A.A. Olatun and 3 A.A. Momoh 1 Depatment of Statstcs and Opeatons Reseach, Modbbo Adama Unvesty of Technology,
More informationRobust Proper Clustering Structure Fuzzy Modeling for Function Approximation
Robust Pope lusteng Stuctue Fuzzy Modelng fo Functon Appoxmaton hh-hng Hsao Depatment of Electcal Engneeng Kao Yuan Unvesty Kaohsung ounty,tawan RO hsao@ooneentustedutw Shun-Feng Su Depatment of Electcal
More informationAn Object Based Auto Annotation Image Retrieval System
Poceedngs of the 5th WSEAS Intenatonal Confeence on Telecommuncatons and Infomatcs, Istanbul, Tukey, May 27-29, 2006 (pp509-54) An Obect Based Auto Annotaton Image Reteval System Pe-Cheng Cheng, Been-Chan
More informationSoochow University: Description and Analysis of the Chinese Word Sense Induction System for CLP2010
Soochow Unvesty: Descpton and Analyss of the Chnese Wod Sense Inducton System fo CLP2010 Hua Xu Bng Lu Longhua Qan Guodong Zhou Natual Language Pocessng Lab School of Compute Scence and Technology Soochow
More informationDATA DIMENSIONALITY REDUCTION METHODS FOR ORDINAL DATA
DATA DIMENIONALITY REDUCTION METHOD FOR ORDINAL DATA Matn Pokop Hana Řezanková Abstact Fom questonnae suvey we fequently get data, the values ae expessed n odnal (e.g. Lket) scale. The questonnae contans
More informationFuzzy clustering ensemble based on mutual information
Poceedngs of the 6th WSEAS Intenatonal Confeence on Smulaton, Modellng and Optmzaton, Lsbon, Potugal, Septembe 22-24, 26 476 Fuzz clusteng ensemble based on mutual nfomaton YAN GAO SHIWEN GU LIMING XIA
More informationA Bayesian Approach toward Active Learning for Collaborative Filtering
A Bayesan Appoach towad Actve Leanng fo Collaboatve Flteng Rong Jn Depatment of Compute Scence and Engneeng Mchgan State Unvesty ong@cse.cmu.edu Abstact Collaboatve flteng s a useful technque fo eplotng
More informationEnhance the Alignment Accuracy of Active Shape Models Using Elastic Graph Matching
Enhance the Algnment Accuacy of Actve Shape Models Usng Elastc Gaph Matchng Sanqang Zhao 1,, Wen Gao, Shguang Shan, Baoca Yn 1 1) Multmeda and Intellgent Softwae Technology Lab, Beng Unvesty of Technology,
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationTHE MODELLING OF INVOLUTE TEETH GENERATION, WITH THE RELATIVE GENERATING TRAJECTORIES METHOD
THE MODELLING OF INVOLUTE TEETH GENERATION, WITH THE RELATIVE GENERATING TRAJECTORIES METHOD Vgl Gabel TEODOR 1, Ncuşo BAROIU 1, Flon SUSAC 1 and Ncolae OANCEA 1 ABSTRACT: The modellng of a cul of sufaces
More informationGuaranteeing Quality of Service to Peering Traffic
Guaanteeng Qualty of Sevce to Peeng Taffc Ru Zhang-Shen Depatment of Electcal Engneeng Pnceton Unvesty Emal: z@pnceton.edu ck McKeown Compute Systems Laboatoy Stanfod Unvesty Emal: nckm@stanfod.edu Abstact
More informationOne-Dimensional Linear Local Prototypes for Effective Selection of Neuro-Fuzzy Sugeno Model Initial Structure
One-Dmensonal Lnea Local Pototypes fo Effectve Selecton of euo-fuzzy Sugeno Model Intal Stuctue Jace Kabzńs Insttute of Automatc Contol, Techncal Unvesty of Lodz, Stefanowsego 8/22, 90 924 Lodz, Poland,
More informationJournal of Engineering Science and Technology Review 7 (1) (2014) Research of Anti-Noise Image Salient Region Extraction Method
Jest Jounal of Engneeng Scence and echnology Revew 7 () (04) 43 47 JOURNAL OF Engneeng Scence and echnology Revew www.jest.og Reseach of Ant-Nose Image Salent Regon Extacton Method Bng XU,*, Shy XIE and
More informationSupervised and Unsupervised Text Classification via Generic Summarization
Intenatonal Jounal of Compute Infomaton Systems and Industal Management Applcatons. ISSN 50-7988 Volume 5 (03) pp. 509-55 MIR Labs, www.mlabs.net/jcsm/ndex.html Supevsed and Unsupevsed Text Classfcaton
More informationSome Image Processing Algorithms on a RAP with Wider Bus Networks
Some Image Pocessng Algothms on a RAP wth Wde Bus Netwoks Shung-Shng Lee, Sh-Jnn Hong, Hong-Ren Tsa and Yu-Hua Lee Natonal Tawan Insttute of Technology Depatment of Electcal Engneeng 4, Secton 4, Kee-Lung
More informationPerformance Evaluation of Neighborhood Signature Techniques for Peer-to-Peer Search
Pefomance Evaluaton of Neghbohood gnatue Technques fo Pee-to-Pee each e L Wang-Chen Lee * Anand vasubamanam Depatment of Compute cence and Engneeng Pennsylvana tate Unvesty Unvesty Pak, PA 16802, UA E-al:
More informationImproved Methods on PCA Based Human Face Recognition for Distorted Images
Poceedngs of the Intenatonal MultConfeence of Engnees and Compute Scentsts 016 Vol I,, Mach 16-18, 016, Hong Kong Impoved Methods on PCA Based Human Face Recognton fo Dstoted Images Buce Poon, M. Ashaful
More informationVolumetric Textures. Esteban W. Gonzalez Clua 1 Marcelo Dreux 2
Volumetc Textues Esteban W. Gonzalez Clua 1 Macelo Deux 2 1 PUC-Ro - Depatment of Compute Scence Rua Maquês de São Vcente, 255, 22443-900, Ro de Janeo, RJ, Bazl esteban @nf.puc-o.b 2 PUC-RIO Mechancal
More informationCOMPARISON OF DIMENSIONALITY REDUCTION METHODS APPLIED TO ORDINAL DATA
The 7 th Intenatonal Days of tatstcs and Economcs, Pague, eptembe 19-21, 2013 COMPARION OF DIMENIONALITY REDUCTION METHOD APPLIED TO ORDINAL DATA Matn Pokop Hana Řezanková Abstact The pape deals wth the
More informationFUNDAMENTALS OF RADIOMETRY
1 FUNDAMENTALS OF RADIOMETRY Lectue 5 Radomety 2 Quanttatve measuement of the popetes of EM adaton nteacton wth matte o emsson fom t Radomety deals wth total EM adaton We extend the concept of adans n
More informationRANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES
RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class
More informationSchool of Computer Science. control algorithms for use in datagram networks. rates to alleviate the congestion. In the case
WF 2 Q: Wost-case Fa Weghted Fa Queueng Jon C.R. Bennett FORE Systems Hu Zhang School of Compute Scence Canege Mellon Unvesty Abstact The Genealzed Pocesso Shang (GPS) dscplne s poven to have two desable
More informationConstructing Service Semantic Link Network Based on the Probabilistic Graphical Model
Intenatonal Jounal of omputatonal Intellgence ystems, Vol. 5, No. 6 (Novembe, 2012), 1040-1051 onstuctng evce emantc Lnk Netwok Based on the Pobablstc Gaphcal odel ANPING ZHAO * ollege of ompute and Infomaton
More informationA Neural Network Model for Storing and Retrieving 2D Images of Rotated 3D Object Using Principal Components
A Neual Netwok Model fo Stong and Reteving 2D Images of Rotated 3D Object Using Pncipal Components Tsukasa AMANO, Shuichi KUROGI, Ayako EGUCHI, Takeshi NISHIDA, Yasuhio FUCHIKAWA Depatment of Contol Engineeng,
More informationFFT Library. Module user s Guide C28x Foundation Software
FFT Lbay Module use s Gude C8x Foundaton Softwae Texas Instuments Inc., May 00 Texas Instuments Inc., May 00 IMPORTAT OTICE Texas Instuments and ts subsdaes (TI) eseve the ght to make changes to the poducts
More informationHadoop based Feature Selection and Decision Making Models on Big Data
Indan Jounal of Scence and Technology, Vol 9(0), DOI: 0.7485/jst/206/v90/88905, Mach 206 ISSN (Pnt) : 0974-6846 ISSN (Onlne) : 0974-5645 Hadoop based Featue Selecton and Decson Makng Models on Bg Data
More informationTHE HIERARCHICAL MODEL OF INTERACTION BETWEEN INTELLIGENT AGENTS IN THE MANET CONTROL SYSTEMS
UDC 6.396.4 THE HIERARCHICAL MODEL OF INTERACTION BETWEEN INTELLIGENT AGENTS IN THE MANET CONTROL SYSTEMS Oleg Ya. Sova Valey A. Romanyuk Mltay Insttute of Telecommuncatons and Infomatzaton Kyv Ukane Dmyto
More informationAll lengths in meters. E = = 7800 kg/m 3
Poblem desciption In this poblem, we apply the component mode synthesis (CMS) technique to a simple beam model. 2 0.02 0.02 All lengths in metes. E = 2.07 10 11 N/m 2 = 7800 kg/m 3 The beam is a fee-fee
More informationRecognition of Shapes for Object Retrieval in Image Databases by Discrete Curve Evolution and Two Consecutive Primitive Edges
Poceedngs of the Intenatonal MultConfeence of Engnees and Compute Scentsts 009 Vol I IMECS 009 Mach 8-0 009 Hong Kong Recognton of Shapes fo Object Reteval n Image Databases by Dscete Cuve Evoluton and
More informationDynamic Optimization of Structures Subjected to Earthquake
IACSIT Intenatonal Jounal of Engneeng and Technology, Vol. 8, No. 4, August 06 Dynamc Optmzaton of Stuctues Subjected to Eathquake Aleza Lavae and Aleza Lohasb Abstact To educe the oveall tme of stuctual
More information3D Head Tracking Based on Recognition and Interpolation Using a Time-Of- Flight Depth Sensor
3D Head Tacng Based on Recognton and Intepolaton Usng a Tme-Of- Flght Depth Senso Salh Bua Götü 1 and Calo Tomas 1,2 1 Canesta Inc., 2 Due Unvesty bgotu@canesta.co tomas@cs.due.edu Abstact Ths pape descbes
More informationSegmentation of Casting Defects in X-Ray Images Based on Fractal Dimension
17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach
More informationOutlier Detection in 3D Coordinate Transformation with Fuzzy Logic
Acta Montanstca Slovaca Ročník 7 (22), číslo, -8 Outle Detecton n 3D Coodnate ansfomaton wth Fuzzy Logc Yasemn Ssman, Aslan Dlave 2 and Sebahattn Bektas Coodnate measuements nevtably contan outles that
More informationWeighted Piecewise LDA for Solving the Small Sample Size Problem in Face Verification
TNN05-P485 Weghted Pecewse LDA fo Solvng the Small Sample Sze Poblem n Face Vefcaton Maos Kypeountas, Anastasos Tefas, Membe, IEEE, and Ioanns Ptas, Seno Membe, IEEE Abstact A novel algothm that can be
More informationIP Network Design by Modified Branch Exchange Method
Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management
More informationA modal estimation based multitype sensor placement method
A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;
More informationPerformance Evaluation of WDM LAN s with Propagation Delay Constraint Analysis
Pefomance Evaluaton of WD AN s wth Popagaton Dela Constant Analss IOANNI E. POUNOURAKI Depatment of Electcal & Compute Engneeng Natonal echncal Unvest of Athens 57 73 Zogaphou, Athens GREECE Abstact: -In
More informationFault Tolerant Routing For Wireless Sensor Grid Networks
Fault oleant Routng Fo Weless Senso Gd etwoks Xn-ng Huang, Jng Deng 2, Jng a and Zeyu Wu Depatment of Electcal Engneeng 2 Depatment of Compute Scence Unvesty of ew Oleans, ew Oleans, A 7048, USA Abstact
More informationQFSRD:OrthogenesisEvolutionBasedGeneticAlgorithmforQosFitnessScopeawareRouteDiscoveryinAd Hoc Networks
Global Jounal of Compute Scence and Technology: E Netwo, Web & Secuty Volume 5 Issue 3 Veson.0 Yea 205 Type: Double Blnd Pee Revewed Intenatonal Reseach Jounal Publshe: Global Jounals Inc. (USA) Onlne
More informationVol. 4, No. 6 June 2013 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.
Vol 4, No 6 June 03 ISSN 079-8407 Jounal Emegng Tends n Computng and Infomaton Scences 009-03 CIS Jounal All ghts eseved http://wwwcsjounalog Optmal Powe Dstbuton System Placement to Install the RTU wth
More informationPoint-Biserial Correlation Analysis of Fuzzy Attributes
Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh
More informationAn Energy-Aware QoS Routing Protocol for Wireless Sensor Networks
An Enegy-Awae QoS Routng Potocol fo Weless Senso Netwoks Kemal Akkaya and Mohamed Youns Depatment of Compute Scence and Electcal Engneeng Unvesty of Mayland, Baltmoe County Baltmoe, MD 225 kemal youns@cs.umbc.edu
More informationReal Time Face Recognition Using Polynomial Regression and Sub-region Color Component Distribution
Real Tme Face Recognton Usng Polynomal Regesson and Sub-egon Colo Component Dstbuton Manshanka Mondal, Md. Almas Hossan, Md. Matu Rahman, Kamul Hasan Talukde* Compute Scence and Engneeng Dscplne Khulna
More informationAdjusting the Contact Surface of Forming Tools in Order to Compensate for Elastic Deformations during the Process
Adjustng the Contact Suface of Fomng Tools n Ode to Compensate fo Elastc Defomatons dung the Pocess Knut Goßmann, Hajo Weme, Andè Hadtmann, Las Pente, Sebastan Kechenbaue Insttute fo Machne Tools and Contol
More informationKANBAN DEVS MODELLING, SIMULATION AND VERIFICATION
KANBAN DEVS MODELLING, SIMULATION AND VERIFICATION Alex Cave and Saed Nahavand School of Engneeng and Technology, Deakn Unvesty, Geelong, Vctoa 3216, Austala nahavand@deakn.edu.au ABSTRACT Kanban Contol
More informationCost of Stable Dimensioning in Optical Packet Ring with Uniform and Symmetric Traffic
Telfo Jounal, Vol. 5, No., 03. 43 ost of Stable Dmensonng n Optcal Packet Rng th Unfom and Symmetc Taffc Bogdan Ušćumlć, Veseln Gedć, Anne Gavey, Phlppe Gavey, Mchel Movan, and Peta Matavulj Abstact Optcal
More informationA Method for Privacy Preserving Mining of Association Rules based. on Web Usage Mining
200 Intenatonal onfeence on Web Infomaton Systems and Mnng A Method fo Pvacy Pesevng Mnng of Assocaton Rules based on Web Usage Mnng Wang Yan Le Jajn Huang Dongme Gloous Sun School of Busness and Management
More informationA LIGHT SCATTERING METHOD TO MEASURE REAL-TIME PARTICULATE EMISSIONS
A Lght Scatteng Method to Measue Real-tme Patculate Emssons Rose Gong & Keyn Wllams 6 th Austalasan Tanspot Reseach Foum Wellngton New Zealand -3 Octobe 003 A LIGHT SCATTERING METHOD TO MEASURE REAL-TIME
More informationSlotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System
Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet
More informationAN EXPLICIT GROWTH MODEL OF THE STEREO REGION GROWING ALGORITHM FOR PARALLEL PROCESSING
Intenatonal Achves of Photogammety, Remote Sensng and Spatal Infomaton Scences, Vol. XXXVIII, Pat 5 AN EXPLICIT GROWTH MODEL OF THE STEREO REGION GROWING ALGORITHM FOR PARALLEL PROCESSING Dongoe Shn*,
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationConcomitants of Upper Record Statistics for Bivariate Pseudo Weibull Distribution
Available at http://pvamuedu/aam Appl Appl Math ISSN: 93-9466 Vol 5, Issue (Decembe ), pp 8 9 (Peviously, Vol 5, Issue, pp 379 388) Applications and Applied Mathematics: An Intenational Jounal (AAM) Concomitants
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationTHE THETA BLOCKCHAIN
THE THETA BLOCKCHAIN Theta is a decentalized video steaming netwok, poweed by a new blockchain and token. By Theta Labs, Inc. Last Updated: Nov 21, 2017 esion 1.0 1 OUTLINE Motivation Reputation Dependent
More informationRecognizing Facial Expressions Based on Gabor Filter Selection
Recognzng Facal Expessons Based on Gabo Flte Selecton Zang Zhang, Xaomn Mu, Le Gao School of Infomaton Engneeng Zhengzhou Unvest Zhengzhou, Chna Abstact Recognton of human emotonal state s an mpotant component
More informationSOFT COMPUTING OPTIMIZATION TECHNIQUES FOR SOLAR PHOTOVOLTAIC ARRAYS
ARPN Jounal of Engneeng and Appled Scences 2006-20 Asan Reseach Publshng Netwok (ARPN). All ghts eseved. SOFT COMPUTING OPTIMIZATION TECHNIQUES FOR SOLAR PHOTOVOLTAIC ARRAYS Ramapabha R. and Mathu B. L.
More informationCOVERAGE BASED DENSITY ESTIMATION STRATEGY FOR VANET
Intenatonal Jounal of Advanced Compute Technology (IJACT) ISSN:319-7900 COVERAGE BASED DENSITY ESTIMATION STRATEGY FOR VANET Chun-Chh Lo, Depatment of Compute Scence and Infomaton Engneeng, Natonal Cheng
More informationQuery Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented
Quey Language #1/3: Relational Algeba Pue, Pocedual, and Set-oiented To expess a quey, we use a set of opeations. Each opeation takes one o moe elations as input paamete (set-oiented). Since each opeation
More informationAccurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen
Accuate Diffaction Efficiency Contol fo Multiplexed Volume Hologaphic Gatings Xuliang Han, Gichel Kim, and Ray T. Chen Micoelectonic Reseach Cente Depatment of Electical and Compute Engineeing Univesity
More informationAn Optimised Density Based Clustering Algorithm
Intenational Jounal of Compute Applications (0975 8887) Volume 6 No.9, Septembe 010 An Optimised Density Based Clusteing Algoithm J. Hencil Pete Depatment of Compute Science St. Xavie s College, Palayamkottai,
More informationEfficient End-to-End Communication Services for Mixed Criticality Avionics Systems
214 IEEE 22nd Intenatonal Symposum of Qualty of Sevce (IWQoS) Effcent End-to-End Communcaton Sevces fo Mxed Ctcalty Avoncs Systems Yng Fang Yu Hua Xue Lu McGll Unvesty Huazhong Unv. of Sc. and Tech. McGll
More informationWhen do L-fuzzy ideals of a ring generate a distributive lattice?
Open Math. 206 4: 53 542 Open Mathematcs Open Access Reseach Atcle Nnghua Gao, Qngguo L*, and Zhaowen L When do L-fuzzy deals of a ng geneate a dstbutve lattce? DOI 0.55/math-206-0047 Receved Apl 7, 206
More informationRigid Body Segmentation and Shape Description from Dense Optical Flow Under Weak Perspective
, VOL. 19, NO. 2, FEBRUARY 1997 139 Rgd Body Segmentaton and Shape Descpton fom Dense Optcal Flow Unde Weak Pespectve Joseph Webe and Jtenda Malk Abstact We pesent an algothm fo dentfyng and tackng ndependently
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationIntuitionistic Fuzzy Soft N-ideals
Intenational Jounal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 3, Numbe 4 (2013), pp. 259-267 Reseach India Publications http://www.ipublication.com Intuitionistic Fuzzy Soft N-ideals A. Solaiaju
More informationRanking Police Administration Units on the Basis of Crime Prevention Measures using Data Envelopment Analysis and Clustering
Rankng Polce Admnstaton Unts on the Bass of Cme Peventon Measues usng Data Envelopment Analyss and Clusteng Mansh Gupta 1, B. Chanda 2 * and M. P. Gupta 3 ABSTRACT In ths pape, a novel appoach has been
More informationARTICULATED MOTION ANALYSIS FROM MOTION CAPTURE DATA
ARICULAED MOION ANALYSIS FROM MOION CAPURE DAA J. Fayad, A. Del Bue and P. M. Q. Agua 3. ABSRAC We pesent computatonal methods to extact and model dffeent onts of a genec subect, n an automatc way. he
More informationNURBS Curve Shape Modification and Fairness Evaluation for Computer Aided Aesthetic Design
oceedngs of the 7th WSEAS Int. Conf. on Sgnal ocessng, Computatonal Geomet & Atfcal Vson, Athens, Geece, August 4-6, 7 38 NURBS Cuve Shape Modfcaton and Faness Evaluaton fo Compute Aded Aesthetc Desgn
More informationA QoS Scheme for a Congestion Core Network Based on Dissimilar QoS Structures in Smart-Phone Environments
Sensos 2010, 10, 10006-10013; do:10.3390/s101110006 OPEN ACCESS sensos ISSN 1424-8220 www.mdp.com/jounal/sensos Atcle A QoS Scheme fo a Congeston Coe Netwok Based on Dssmla QoS Stuctues n Smat-Phone Envonments
More informationGraph-based Clustering
Graphbased Clusterng Transform the data nto a graph representaton ertces are the data ponts to be clustered Edges are eghted based on smlarty beteen data ponts Graph parttonng Þ Each connected component
More informationDYNAMIC STORAGE ALLOCATION. Hanan Samet
ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu
More informationarxiv: v2 [physics.soc-ph] 30 Nov 2016
Tanspotation dynamics on coupled netwoks with limited bandwidth Ming Li 1,*, Mao-Bin Hu 1, and Bing-Hong Wang 2, axiv:1607.05382v2 [physics.soc-ph] 30 Nov 2016 1 School of Engineeing Science, Univesity
More informationSYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH
I J C A 7(), 202 pp. 49-53 SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH Sushil Goel and 2 Rajesh Vema Associate Pofesso, Depatment of Compute Science, Dyal Singh College,
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationFUZZY ARTMAP AND NEURAL NETWORK APPROACH TO ONLINE PROCESSING OF INPUTS WITH MISSING VALUES
FUZZY ARTMAP AD EURAL ETWORK APPROACH TO OLIE PROCESSIG OF IPUTS WITH MISSIG VALUES F.V. elwamondo* and T. Mawala* * School of Electcal and Infomaton Engneeng, Unvesty of the Wtwatesand, Johannesbug, Pvate
More informationPoint-Cloud-to-Point-Cloud Technique on Tool Calibration for Dental Implant Surgical Path Tracking
Pont-Cloud-to-Pont-Cloud Technque on Tool Calbaton fo Dental Implant Sugcal Path Tackng Auanuch Losakul, Jackt Suthakon and Chanja Snthanayothn Abstact Dental mplant s nomally used n posthetc dentsty.
More informationFeature Extraction for Collaborative Filtering: A Genetic Programming Approach
IJCSI Intenatonal Jounal of Compute Scence Issues Vol. 9 Issue 5 No Septembe 0 www.ijcsi.og 348 Featue xtacton fo Collaboatve Flteng: A Genetc Pogammng Appoach Deepa Anand Depatment of Compute Scence Chst
More informationFast Inductance Extraction of Large VLSI Circuits
Fast Inductance Extacton of Lage VLSI Ccuts Hemant Mahawa mahawah@cs.tamu.edu Vvek San san@cs.tamu.edu Texas A&M Unvesty College Staton, TX 83 Wepng Sh wsh@cs.tamu.edu Abstact Accuate estmaton of sgnal
More informationRefraction Ray Normal
Ray Nomal wave cests θ Bounday θ θ θ less dense, n1 moe dense, n2 (>n1) Moe Smply: θ θ Note: (Lght) Rays bend towads the nomal when gong fom a egon of low ndex of efacton to a egon of hgh ndex of efacton
More informationDerivation of the Nodal Forces Equivalent to Uniform Pressure for Quadratic Isoparametric Elements RAWB, Last Update: 30 September 2008
Deivation of the odal oces Equivalent to Unifom Pessue fo Quadatic sopaametic Elements RWB, Last Update: 0 Septembe 008 The displacement vecto u at an point within a single element, E, is lineal elated
More informationInteractive Rendering of Deforming NURBS Surfaces
EUROGRAHICS 97 / D. Fellne and L. Szmay-Kalos Volume 6, (997), Numbe 3 (Guest Edtos) Inteactve Rendeng of Defomng NURBS Sufaces Fedeck W. B. L Rynson W. H. Lau Mak Geen Compute Gaphcs and Meda Laboatoy
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationA BROKER FOR SELECTING AND PROVISIONING HIGH
A BROKER FOR SELECTING AND PROVISIONING HIGH QUALITY SYNDICATED DATA (Reseac Pape) Danlo Adagna, Cna Cappello, Maco Comu, Caa Fancalanc, Babaa Penc Poltecnco d Mlano, Mlano, Italy adagna, cappell, comu,
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationGeneralized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences
Ameican Jounal of ata ining and Knowledge iscovey 27; 2(4): 2-8 http://www.sciencepublishinggoup.com//admkd doi:.648/.admkd.2724.2 Genealized Gey Taget ecision ethod Based on ecision akes Indiffeence Attibute
More informationInteractive NURBS Tutorial in Virtual Reality
Inteacte NURBS Ttoal n Vtal Realty Eng 477 Poect Fa Octobe 10 2006 Edmond Nadle enadle@mch.ed 734 913-6970 Eng 477 Poect Fa Octobe 10 2006 Eng 477 Poect Fa Octobe 10 2006 NURBS Ces and Sfaces = Non-Unfom
More informationA Metric for the Activeness of a Class Sachin Lakra, Deepak Kumar Sharma, Jugnesh Kumar, Ramesh Chandra Verma, T V Prasad
Metc fo the ctveness of a lass Sachn Laka, Deepak Kma Shama, Jgnesh Kma, Ramesh handa Vema, T V Pasad bstact In ths pape, the athos popose a softwae metc called lass ctveness Metc (M) whch helps to detemne
More informationPrioritized Traffic Recovery over GMPLS Networks
Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationGENERAL MODEL FOR AIRBORNE AND SPACEBORNE LINEAR ARRAY SENSORS
GENERAL MODEL FOR AIRBORNE AND SPAEBORNE LINEAR ARRAY SENSORS Danela Pol Insttute of Geodesy and Photogammety, Swss Fedeal Insttute of Technology, Zuch, Swtzeland danela@geod.baug.ethz.ch KEY WORDS: Oentaton,
More informationMapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma
apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the
More informationModule 6 STILL IMAGE COMPRESSION STANDARDS
Module 6 STILL IMAE COMPRESSION STANDARDS Lesson 17 JPE-2000 Achitectue and Featues Instuctional Objectives At the end of this lesson, the students should be able to: 1. State the shotcomings of JPE standad.
More informationControlled Information Maximization for SOM Knowledge Induced Learning
3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity
More informationInput Layer f = 2 f = 0 f = f = 3 1,16 1,1 1,2 1,3 2, ,2 3,3 3,16. f = 1. f = Output Layer
Using the Gow-And-Pune Netwok to Solve Poblems of Lage Dimensionality B.J. Biedis and T.D. Gedeon School of Compute Science & Engineeing The Univesity of New South Wales Sydney NSW 2052 AUSTRALIA bbiedis@cse.unsw.edu.au
More informationA VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM
Accepted fo publication Intenational Jounal of Flexible Automation and Integated Manufactuing. A VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM Nagiza F. Samatova,
More information