基于动态规则构造的排课系统设计与实现

:2002-03-18:(00C291);(ZD0007):(1974),,,:1005-3751(2002)06-0012-03DesignandRealizationofObject-OrientedintheLesson-ArrangementSystem,,(,415000)MEIXiao2yong,SUNJian2ping,XIAOZheng2hong(DepartmentofComputerScienceofTeachersCollegeofChangde,ChangdeHNX415000,China):,,,:;;;Abstract:Applytheobject-orientedtechnologytothelesson-arrangementsystem.Itdiscussesthecourseandkeyalgorithminlesson-arrangement,analysesthereasonwhytheconflicter2mergesandpresentsthesolutionandexperimentalanalysiscon2clusiontotheconflict.Keywords:object-oriented;lesson-arrangement;reasoningrule;conflictrate.:TP311.52:A1,(OO),,,,:,,,;,,,,,22.1,,Windows,,:(1):(2):(3):,,,(1)1(),Baseclass,,,,(),,,:ifsum(Libi)0then2120026CallTzypneoform1.firststep-initialize(sender:tobject)//,;ElsebeginCallTzypneoform1.secondstep-orientation(sender:tob2ject)//;,,;CallTzypneoform1.thirdstep-predeject(sender:tobject)//;CallTzypneoform1.forthstep-trans(sender:tobject)//;CobeginCallTzypneoform1.fifthstep-colliesion(sender:tobject)//,CallTzypneoform1.sixthstep-inspect(sender:tobject)//CoendCallEnd-pixel(sender:tobject)//222.2,,(1)(Cteachset),:;:,,,(2)(CteachList),SOCKET:ID:,,,,,,,,(3)(CroomList):;:,,,ID(4)(CruleSet)::,,2.3,:1E={(e1,e2,en)},eiT,Teacher={e1,e2,ek,i=1,2,,k,kN},N,2I,MINUP(),X=YMINUP(XY),minzcpp[]={a1,a2,,an},minconf[]={b1,b2,,bn},Totali,Maxcoursesie=w,PatternPattern.count,Canpatternset,Largepatternset={}E={e1,e2,,ek|eiT,I=1,2,,k},:step1E=,step7;step2(e1,e2,,ek)E,L=1,EE-{(e1,e2,,ek)};step3K-L+1=0,(e1,e2,,ek),step1;step4K-L+1W,(couL,timeL),(couL+W-1,timeL+W-1),LENw;(couL,timeL),(couK,timeK),LENK-L+1;step5forI=1toLEN(coui,timei)if(patterncanpatternset=){Pattern.count=Pattern.count+13120026canPatternsetcanPatternsetpatterntotal[i]total[i]+1};step6LL+1step3;step7canpatternset=,step11;step8patterncanpatternset,canpatternsetcanpatternset-pattern;step9ifpattern.count/total[i]minup[i]thenthenlargepatternsetlargepatternsetpattern;step10step7;step11iflargepatternset=,3r,t,p(s)(s),,:T=r+P(s)3t,,P(s)=ae-bs,0a1b,ae-bsrt,p(s),r,p(s)/r,,,:()tr/p(s);()tr/p(s);()t=r/p(s),,,,;,;,,,:p(w)=r/t,p(w)=ae-bw,,w=(1/b)ln(at/r),,,,p(s)t=r/p(s),:(1),;(2)ab,44.1Ci,Ti,(T),TkTiTk,:33:,(=/),,,,42,99,,1120520520524024024018018018015/3015/7015/9012/7012/7012/9018/5018/7018/900370021474.2,,,:30,60,100,169,:12,21,6,3,99,,,,,:[1]TianZhang,RaghuRamakrishnan,andMironLivny.Birch:Anefficientdataclusteringmethodforverylargedatabases[C].InProceedingsoftheACMSIGMODConferenceonManagementofData(SIGMOD96),1996,103-114.[2]DeerwesterS,DumaisST,FurnasGW,LandauerTK,HarshmanR.Indexingbylatentsemanticanalysis[J].JournaloftheAmericanSocietyforInformationScience,1990,41(6):391-407.[3]EdwardYourdon,CarlArgila..[M].PRENTICEHALL,1998.[4]PeterCoad,EdwardYourdon..[M].:,1992.4120026