检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王依凡 叶宏达 邱子杰 王志勇[3] WANG Yifan 1,YE Hongda 2,QIU Zijie 2, WANG Zhiyong 3(1.School of Computer Science and Engineering,University of Electronic Science and Technology of China,Chengdu 611731,China;2.School of Information and Communication Engineering,University of Electronic Science and Technology of China,Chengdu 611731,China;3.School of Mathematical Science,University of Electronic Science and Technology of China,Chengdu 611731,China)
机构地区:[1]电子科技大学计算机科学与工程学院,四川成都611731 [2]电子科技大学信息与通信工程学院,四川成都611731 [3]电子科技大学数学科学学院,四川成都611731
出 处:《实验科学与技术》2018年第5期1-5,29,共6页Experiment Science and Technology
基 金:国家自然科学基金(11301058);中央高校基本业务费(ZYGX2015J103)
摘 要:该文针对"拍照赚钱"APP的众包任务定价问题,考虑区域定价的差异下,基于曲线拟合工具和K-Means聚类分析算法,通过SPSS软件综合分析得出众包任务价格与区域生活水平、时间成本、人均任务数和任务难度系数等因素之间的定价规律,建立了以任务价格为决策变量、以众包平台利润限度为约束条件、以区域任务完成率最大化为目标的单目标优化模型,并建立了新的任务定价方案。在考虑将任务打包发布情况下,对定价模型进行修正,通过蒙特卡洛模拟法,给出模拟的实施效果。This paper aims at the crowdsourced tasks pricing problem for app of“Making Money by Photographing”.Considering the difference of regional pricing,the algorithm is based on curve fitting tool and K - Means clustering analysis algorithm.The statistic package for social science (SPSS)software is used to analyze the pricing rules of the package task and the regional living standard,the time cost,the per capita task number and the task difficulty coefficient.A new single objective optimization model is set up,which takes the task price as the decision variable,the profit limit of the public package platform as the constrain condition and the goal of maximizing the completion rate of the regional task.Considering that the task is packaged and released,the pricing model is modified,and the implementation effect of simulation is given by Monte Carlo simulation.
关 键 词:曲线拟合 K—Means聚类算法 单目标优化模型 蒙特卡洛算法 任务完成率
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28