检索结果-南通市图书馆

Design and Realization of Nature Language Processing in The Application of Computer-assisted Teaching

在线全文

学校读者我要写书评

暂无评论

Design and Realization of Nature Language Processing in The ...

2012 National Conference on Information Technology and Computer Science

作者： Xianming Meng ShanDong water polytechnic,Rizhao 276826,China Feng Kong ShanDong water polytechnic,Rizhao 276826,China

with the development of computer technology,computer-assisted teaching has become an important aspect in modern education *** and more educational software plays a major role on helping people learn the *** this paper,we combine natural language process technology to multimedia technology,and develop a computer-assisted teaching system based on natural language process technology to further ***,we investigate on the reliability and feasibility of the application of automatic Chinese text segmentation *** then we probe into the readability of Chinese text,and analyze the factors influencing readability from the perspective of ***,we propose the readability determination technique based on statistics of graded vocabulary,and establish the standards for readability *** feasibility of this technique has been verified by *** exploration provides theoretic analysis and experimental evidence for the application of computer-assisted teaching.

关键词： computer-assisted teaching natural language processing word segmentation

ON-LINE SCHEDULING OF UNIT TIME JOBS WITH REJECTION ON UNIFORM MACHINES

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2008年第1期21卷 114-118页

作者： Shoupeng LIU Yuzhong ZHANG Binzhou Medical University Yantai 264003 China. ZHANG Institute of Operations Research Qufu Normal University Rizhao 276826 China.

The authors consider the problem of on-line scheduling of unit execution time jobs on uniform machines with rejection penalty. The jobs arrive one by one and can be either accepted and scheduled, or be rejected. The objective is to minimize the total completion time of the accepted jobs and the total penalty of the rejection jobs. The authors propose an on-line algorithm and prove that the competitive ratio is 1/2 （2 W √3） ≈ 1.86602.

关键词： Competitive ratio on-line scheduling uniform machine.

A NEW DESCENT MEMORY GRADIENT METHOD AND ITS GLOBAL CONVERGENCE

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2011年第4期24卷 784-794页

作者： Min SUN Qingguo BAI Department of MaShematics and Information Science Zaozhuan9 University Zaozhuang 277160 China. School of Management Qufu Normal University Rizhao 276826 China

In this article, a new descent memory gradient method without restarts is proposed for solving large scale unconstrained optimization problems. The method has the following attractive properties： 1） The search direction is always a sufficiently descent direction at every iteration without the line search used; 2） The search direction always satisfies the angle property, which is independent of the convexity of the objective function. Under mild conditions, the authors prove that the proposed method has global convergence, and its convergence rate is also investigated. The numerical results show that the new descent memory method is efficient for the given test problems.

关键词： Global convergence memory gradient method sufficiently descent.

A LMI-Based Approach for Robust Stabilization of Uncertain Linear Continuous Time Singular Markov Switched Systems with Time Delays

在线全文

学校读者我要写书评

暂无评论

A LMI-Based Approach for Robust Stabilization of Uncertain L...

第25届中国控制会议

作者： Gao Lijun, Wu Yuqiang Institute of Automation, Qufu Normal University, Rizhao 276826

＜正＞The stability and stabilization of linear continuous time singular Markov switched systems with time delay are investigated. Based on the linear matrix inequality method （LMIs） , the robust stability of uncertain linear stochastic delay system is guaranteed irrespective of the value of the time delay. Then the proposed theory can be extended to discuss the robust stabilization of uncertain stochastic differential delay systems. The gains of this controller are the solution of some linear matrix inequalities. Final numerical example is solved to show the effectiveness and validness of the theoretical results.

关键词： Markov switched systems Stabilization LMI Time delay

A Study of the Curriculum Setup of Web-Page Designing in Multi-media Major

在线全文

cnki会议

学校读者我要写书评

暂无评论

A Study of the Curriculum Setup of Web-Page Designing in Mul...

2011 IEEE 3rd International Conference on Communication Software and Networks(ICCSN 2011)

作者： Yao YuJu Wang jing Li Zongying Rizhao Polytechnic,ShanDong Rizhao,276826 China

Web-page designing is a newly-developing cross-subject which extends from art and computer *** in the paper is an analysis of the trend of demand in the web-page designing and the construction of the curriculum setup of web-page designing,and this paper strengthens the combination of art quality and technical quality in the teaching of web-page designing in Multi-media major.

关键词： computer multi-media major web-page designing curriculum setup

在线全文

cnki会议

学校读者我要写书评

暂无评论

基于CIT的高校图书馆服务质量实证研究

图书馆杂志 2010年第5期29卷 49-56页

作者：罗军曲阜师范大学日照校区图书馆山东276826

使用定性研究的关键事件技术收集读者感知的图书馆服务中的关键事件,对影响图书馆服务质量的关键事件加以分类,归纳出影响服务质量的关键因素群和要素。在此基础上,运用层次分析法从图书馆专业人员角度进行关键因素的权重分析,建立图书... 详细信息

使用定性研究的关键事件技术收集读者感知的图书馆服务中的关键事件,对影响图书馆服务质量的关键事件加以分类,归纳出影响服务质量的关键因素群和要素。在此基础上,运用层次分析法从图书馆专业人员角度进行关键因素的权重分析,建立图书馆服务质量感知模型。

关键词：图书馆服务服务质量关键事件技术层次分析法

Modeling Free-Riding on Peer-to-peer File Sharing System

在线全文

学校读者我要写书评

暂无评论

Modeling Free-Riding on Peer-to-peer File Sharing System

2008年中国高校通信类院系学术研讨会

作者： Cao Xiaolong,Cao Baoxiang,Yu Jiguo School of Computer Science,Qufu Normal University,Rizhao 276826

＜正＞While the fundamental premise of peer-to-peer system is that of voluntary resource sharing among individual peers, there is an inherent tension between individual rationality and collective welfare that threatens the viability of the *** who attempt to benefit from the resources of others without offering their own resources in exchange are termed as"free-riders". We present a state model with three different classes of peers to capture the effect of free-riding on the peer-to-peer file sharing system.

关键词： free-riders peer-to-peer markov chain

A Polynomially Solvable Special Case of the Knapsack Sharing Problem

在线全文

cnki会议

学校读者我要写书评

暂无评论

A Polynomially Solvable Special Case of the Knapsack Sharing...

中国运筹学会第七届学术交流会

作者： Cuilian Wu Yuzhong Zhang College of Operations Research and Management Science,Qufu Normal University,Rizhao,Shangdong, 276826

n this paper, a polynomial algorithm for a special case of knapsack sharingproblem is presented by decomposing it into a series of multidimentional knapsackproblems, without the assumption that the number of the const... 详细信息

关键词： knapsack problem knapsack sharing problem polynomial time algorithm

Approximate Strong Equilibrium in Load Balancing Games

在线全文

cnki会议

学校读者我要写书评

暂无评论

Approximate Strong Equilibrium in Load Balancing Games

中国企业运筹学第七届学术年会暨山东省运筹学会学术会议

作者： Song-Song Li Yu-Zhong Zhang School of Management,Qufu Normal University,Rizhao 276826,Shandong,China

In this paper,we consider approximate strong equilibrium in the load balancing games with identical *** load balancing games,every job chooses one of the servers,and each job wishes to minimize its cost,given by the workload of the server it is assigned to.A Nash equilibrium（NE） is a strategy profile that is resilient to unilateral *** an NE in this game is ***,NE-configurations are not stable against coordinated deviations of several jobs.A strong Nash equilibrium（SE） is one that is stable against coordinated deviations of any *** will evaluate how well a NE-configuration approximates *** any job assignment in a load balancing game,the improvement ratio（IR） of a deviation of a job is defined as the ratio between the pre-and post-deviation *** NE is said to be a ρ-approximate SE（ρ≥1） if there is no coalition of jobs such that each job of the coalition will have an IR more than ρ from coordinated deviations of the *** this paper,we prove,for load balancing games of up to 8 servers,any NE assignment is a 5/4 approximate SE,and the bound is ***,it is a（3 2 - 2m-3 2（m-1） 2）-approximate SE if the game has m（m≥9） servers.

关键词： Nash equilibrium load balancing approximation