简介:这份报纸为在无线通讯工业手机卡片计划的需求评价和分类提供一条有效、有用的途径。我们使用最大的可能性的评价基于历史的出售数据估计主要需求和每张手机卡片的替换概率。这个评价模型是非线性的,因此我们转变它到一个混合整数由对数的转变和piecewise的线性编程模型线性近似。根据评价结果,我们能做分类计划。考虑到手机卡片的资源是有限的,我们联合优化手机卡片计划的分类和数量。在数字学习,我们在中国把我们的途径用于一个大活动服务供应商并且发现我们的途径能增加这个活动服务供应商的收入23.69%。敏感分析证明活动服务供应商应该提供更多的分类当能被分到每家店的手机卡片的类型是有限的时,增加收入。
简介:Wirelesssensornetworkspromiseanewparadigmforgatheringdataviacollaborationamongsensorsspreadingoveralargegeometricalregion.Manyapplicationsimposedelayrequirementsfordatagatheringandaskfortime-efficientschedulesforaggregatingsenseddataandsendingtothedatasink.Inthispaper,theauthorsstudytheminimumdataaggregationtimeproblemundercollision-freetransmissionmodel.Ineachtimeround,datasentbyasensorreachesallsensorswithinitstransmissionrange,butasensorcanreceivedataonlywhenitistheonlydatathatreachesthesensor.Thegoalistofindthemethodthatschedulesdatatransmissionandaggregationatsensorssothatthetimeforallrequesteddatatobesenttothedatasinkisminimal.TheauthorsproposeanewapproximationalgorithmforthisNP-hardproblemwithguaranteedperformanceratio(7Δ)/(Iog_2|S|)+c,whichsignificantlyreducesthecurrentbestratioofΔ-1,whereSisthesetofsensorscontainingsourcedata,Δisthemaximalnumberofsensorswithinthetransmissionrangeofanysensor,andcisaconstant.Theauthorsalsoconductextensivesimulation,theobtainedresultsjustifytheimprovementofproposedalgorithmovertheexistingone.