检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《西安科技大学学报》2013年第4期494-498,504,共6页Journal of Xi’an University of Science and Technology
摘 要:随着高校改革和高校学报改革的不断深入和发展,学报编辑的发展也逐渐成为学报同仁关注的焦点。如何客观地对编辑进行评价,制定科学的评价标准和建立完善的评价体系,成为编辑队伍建设成败的关键。科学、合理的编辑评价方法,能有效保证正确地选拔人才,充分发挥他们的积极性和创造性,为高校长期发展提供强大可持续的智力支持。从高校学报编辑的实际工作出发,阐述了层次分析法及基本流程,并应用层次分析法构建学报编辑评优层次结构模型,选定评价准则为:编辑素质、创新能力、编辑工作量、编校差错率、学术科研能力。结果表明,利用AHP法评选学报优秀编辑,操作方便,结果明确,具有较强的可行性和实用性,且定量分析与定性分析相结合,增加了优秀编辑评选的科学性和合理性,能够较好地激励学报编辑努力工作,对提高学报的办刊质量和学报事业的发展都具有重大意义。With the development of university reform and university journal reform, attention of col- leagues has been gradually focused on journal editor. How to evaluate the editor objectively, establish the scientific evaluation criteria and a perfect evaluation system, becomes the key to the success of the con- struction of editor team. Scientific and reasonable editing methods not only can effectively guarantee the correct selection of personnel, and their enthusiasm and creativity are fully given out, but also provide a strong intellectual support for the long-term sustainable development. From the actual work of university journal editors, the analytic hierarchy is elaborated, and an evaluation hierarchy structure model of jour- nal editor is established by means of the AHP method. The selected evaluation criteria are: editorial quality, innovation ability, editing quantity, error rate of proofreading, and academic research ability. The results show that the evaluation of excellent editor by means of the AHP method is a convenient opera- tion. With the combination of quatitative analysis and qualitative analysis, excellent editing evaluation is more scientific and reasonable, it can better motivate journal editors, and it has great significance for journal quality and the development of journal business.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28