Pub Date : 2010-10-25DOI: 10.1109/ICEIT.2010.5607623
Wajid Ali, M. Kamran Malik, S. Hussain, S. Siddiq, A. Ali
Extraction of noun phrase (NP) from text is useful for many natural language processing applications, such as name entity recognition, indexing, searching, parsing etc. We present a noun phrase chunker for Urdu which is based on a statistical approach. A 100,000 words Urdu corpus is manually tagged with NP chunk tags. The corpus is used to develop a statistical approach. Initially, a statistical approach based on standard HMM model is developed for automatics NP chunking. In Urdu phrases, the case marker (CM) indicates the end of a noun phrase and is appended at its end. Thus, if one scans the sentence in reverse order, one may be able to better predict phrase endings. So, the technique is enhanced by changing scanning direction. The technique is further enhanced by merging chunk and POS tags to achieve maximum accuracy. The results of all experiments are reported with maximum overall accuracy of 97.61% achieved using HMM based approach with extended tagset and right to left (RTL) scanning.
{"title":"Urdu noun phrase chunking: HMM based approach","authors":"Wajid Ali, M. Kamran Malik, S. Hussain, S. Siddiq, A. Ali","doi":"10.1109/ICEIT.2010.5607623","DOIUrl":"https://doi.org/10.1109/ICEIT.2010.5607623","url":null,"abstract":"Extraction of noun phrase (NP) from text is useful for many natural language processing applications, such as name entity recognition, indexing, searching, parsing etc. We present a noun phrase chunker for Urdu which is based on a statistical approach. A 100,000 words Urdu corpus is manually tagged with NP chunk tags. The corpus is used to develop a statistical approach. Initially, a statistical approach based on standard HMM model is developed for automatics NP chunking. In Urdu phrases, the case marker (CM) indicates the end of a noun phrase and is appended at its end. Thus, if one scans the sentence in reverse order, one may be able to better predict phrase endings. So, the technique is enhanced by changing scanning direction. The technique is further enhanced by merging chunk and POS tags to achieve maximum accuracy. The results of all experiments are reported with maximum overall accuracy of 97.61% achieved using HMM based approach with extended tagset and right to left (RTL) scanning.","PeriodicalId":346498,"journal":{"name":"2010 International Conference on Educational and Information Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125741338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-25DOI: 10.1109/ICEIT.2010.5608449
Wang Xinzeng, Ci Linlin, Lin Junshan, Yu Ning
This paper presents a novel approach to multiple task assignments for cooperating unmanned aerial vehicles (UAVs).Aim at the problem of assigning cooperating UAVs to perform multiple task that includes identifying and attack, along with subsequent battle damage verification on multiple targets, the multiple task assignments model is built, It not only takes into account the requirements of the scenario such as task precedence and coordination, timing constraints, trajectories limitations, but also thinks the requirements of task for weapon kinds of UAV and capability of UAV and flyable trajectories, etc. The optimal solution of the multiple task assignments is an NP-hard problem. When some of the tasks must be accomplished at specified time and with specific vehicles and specific weapon, the problem becomes highly complex, and search for an optimum solution may be a very difficult task. The particle swarm optimization algorithm is improved and is used for solving multiple task assignments problem. We construct a double layer position vector spaces, it makes the particle of the particle swarm optimization algorithm correspond to the feasible solution of multiple task assignments problem. Simulations showing that it consistently and quickly provides good feasible solutions.
{"title":"Based on PSO algorithm multiple task assignments for cooperating UAVs","authors":"Wang Xinzeng, Ci Linlin, Lin Junshan, Yu Ning","doi":"10.1109/ICEIT.2010.5608449","DOIUrl":"https://doi.org/10.1109/ICEIT.2010.5608449","url":null,"abstract":"This paper presents a novel approach to multiple task assignments for cooperating unmanned aerial vehicles (UAVs).Aim at the problem of assigning cooperating UAVs to perform multiple task that includes identifying and attack, along with subsequent battle damage verification on multiple targets, the multiple task assignments model is built, It not only takes into account the requirements of the scenario such as task precedence and coordination, timing constraints, trajectories limitations, but also thinks the requirements of task for weapon kinds of UAV and capability of UAV and flyable trajectories, etc. The optimal solution of the multiple task assignments is an NP-hard problem. When some of the tasks must be accomplished at specified time and with specific vehicles and specific weapon, the problem becomes highly complex, and search for an optimum solution may be a very difficult task. The particle swarm optimization algorithm is improved and is used for solving multiple task assignments problem. We construct a double layer position vector spaces, it makes the particle of the particle swarm optimization algorithm correspond to the feasible solution of multiple task assignments problem. Simulations showing that it consistently and quickly provides good feasible solutions.","PeriodicalId":346498,"journal":{"name":"2010 International Conference on Educational and Information Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125953703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-25DOI: 10.1109/ICEIT.2010.5607673
Yi Luo
In order to encourage autonomy of college students in their studies and help them develop towards autonomy in their life-long learning, it is vital to study autonomous learning in college English instruction. After analysis of definitions of autonomous learning and a series of college English textbooks as well as based on the autonomous factors of Gardner and Miller, this paper proposes some methods of autonomous learning which are suitable to college English instruction. This paper shows the result that if the autonomous learning strategies can be implemented with college English texts, autonomy of learners and effectiveness of college English instruction can be increased greatly.
{"title":"Notice of RetractionProbing into autonomous learning in college English instruction","authors":"Yi Luo","doi":"10.1109/ICEIT.2010.5607673","DOIUrl":"https://doi.org/10.1109/ICEIT.2010.5607673","url":null,"abstract":"In order to encourage autonomy of college students in their studies and help them develop towards autonomy in their life-long learning, it is vital to study autonomous learning in college English instruction. After analysis of definitions of autonomous learning and a series of college English textbooks as well as based on the autonomous factors of Gardner and Miller, this paper proposes some methods of autonomous learning which are suitable to college English instruction. This paper shows the result that if the autonomous learning strategies can be implemented with college English texts, autonomy of learners and effectiveness of college English instruction can be increased greatly.","PeriodicalId":346498,"journal":{"name":"2010 International Conference on Educational and Information Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125999101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-25DOI: 10.1109/ICEIT.2010.5607701
Arun N. Nambiar, A. Dutta
Student advising is one of the many critical service responsibilities that faculty have in academia. Often times, however, students have very similar questions about which courses to take, the sequence of courses, and deadlines. If programs have a striated system of student standings, this further confounds the students as they may not be eligible to take certain courses due to their current status in the program. Faculty also tend to be pressed for time with research, teaching and other committee responsibilities. This results in increased frustrations for both students and faculty alike. Expert systems are software applications that respond to use queries by analyzing data captured in knowledge systems. JESS is a Java-based rule engine and scripting environment that allows the development of such an expert system. In this work, we develop an expert system using JESS that allows students to seek quick responses to their queries regarding their plan of study and progress in the program. This expert system separates the rules from the execution thus enabling users to customize or extend the system by changing or updating the XML file that stores the rules.
{"title":"Expert system for student advising using JESS","authors":"Arun N. Nambiar, A. Dutta","doi":"10.1109/ICEIT.2010.5607701","DOIUrl":"https://doi.org/10.1109/ICEIT.2010.5607701","url":null,"abstract":"Student advising is one of the many critical service responsibilities that faculty have in academia. Often times, however, students have very similar questions about which courses to take, the sequence of courses, and deadlines. If programs have a striated system of student standings, this further confounds the students as they may not be eligible to take certain courses due to their current status in the program. Faculty also tend to be pressed for time with research, teaching and other committee responsibilities. This results in increased frustrations for both students and faculty alike. Expert systems are software applications that respond to use queries by analyzing data captured in knowledge systems. JESS is a Java-based rule engine and scripting environment that allows the development of such an expert system. In this work, we develop an expert system using JESS that allows students to seek quick responses to their queries regarding their plan of study and progress in the program. This expert system separates the rules from the execution thus enabling users to customize or extend the system by changing or updating the XML file that stores the rules.","PeriodicalId":346498,"journal":{"name":"2010 International Conference on Educational and Information Technology","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115781368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-25DOI: 10.1109/ICEIT.2010.5607507
Bian Yuzhu, Ren Lili, Liang Yunxiang, S. Yingjie
In search of a way out to the embarrassing situation of current college English teaching, the paper opens out a new scope through literature study. Service- learning, which emphasizes the integration of social activities and syllabus, has shed a new light on the current dilemma. Viewing service-learning from the scope of Social Constructivist Model(SCM), the whole process of learning takes on quite a few superiorities that make the learning process become much clearer and manageable, which will finally bring forward a new scope on improving the college English teaching.
{"title":"Notice of RetractionThe service-learning under the scope of Social Constructivist Model","authors":"Bian Yuzhu, Ren Lili, Liang Yunxiang, S. Yingjie","doi":"10.1109/ICEIT.2010.5607507","DOIUrl":"https://doi.org/10.1109/ICEIT.2010.5607507","url":null,"abstract":"In search of a way out to the embarrassing situation of current college English teaching, the paper opens out a new scope through literature study. Service- learning, which emphasizes the integration of social activities and syllabus, has shed a new light on the current dilemma. Viewing service-learning from the scope of Social Constructivist Model(SCM), the whole process of learning takes on quite a few superiorities that make the learning process become much clearer and manageable, which will finally bring forward a new scope on improving the college English teaching.","PeriodicalId":346498,"journal":{"name":"2010 International Conference on Educational and Information Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131360317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-25DOI: 10.1109/ICEIT.2010.5607573
Y. Jun, Hao Aimin
In computer graphics field, smoke with the obstacles in the scene is very commonplace. In this paper, a new technique for the physics-based smoke simulation with dynamic complex obstacles is presented. In difference from other methods, our innovation firstly generates an obstacle texture which stores the positions of obstacles; then properties of the smoke in the boundary are modified according to the obstacle texture. The positions of obstacles can be acquired at any time through the obstacle texture and a transformation matrix; meanwhile, we don't need to update the obstacle texture per frame. Our scheme is independent on the complexity of the scene. Therefore, it can be applied in 3D battlefield environment and other 3D games to solve the problem of the interaction between smoke and dynamic complex obstacles.
{"title":"Physics-based smoke simulation with dynamic obstacles","authors":"Y. Jun, Hao Aimin","doi":"10.1109/ICEIT.2010.5607573","DOIUrl":"https://doi.org/10.1109/ICEIT.2010.5607573","url":null,"abstract":"In computer graphics field, smoke with the obstacles in the scene is very commonplace. In this paper, a new technique for the physics-based smoke simulation with dynamic complex obstacles is presented. In difference from other methods, our innovation firstly generates an obstacle texture which stores the positions of obstacles; then properties of the smoke in the boundary are modified according to the obstacle texture. The positions of obstacles can be acquired at any time through the obstacle texture and a transformation matrix; meanwhile, we don't need to update the obstacle texture per frame. Our scheme is independent on the complexity of the scene. Therefore, it can be applied in 3D battlefield environment and other 3D games to solve the problem of the interaction between smoke and dynamic complex obstacles.","PeriodicalId":346498,"journal":{"name":"2010 International Conference on Educational and Information Technology","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131568987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-25DOI: 10.1109/ICEIT.2010.5607601
Hao-feng Zhang, Xiao-Juan Li, Zhong-Feng Liang
Wayside Teaching is an education that the teacher teaches students outside the classroom. Based on the discussion of the connotation, features and functions of Wayside Teaching, this study uses the methods of questionnaire survey and interview, takes 288 students and 74 teachers from Universities in Xinxiang city as the research object, analyzes and summarizes the current application of Wayside Teaching in college teaching and puts forward the corresponding countermeasure aiming at the inadequate application of teaching.
{"title":"Notice of RetractionApplication research on Wayside Teaching in Universities","authors":"Hao-feng Zhang, Xiao-Juan Li, Zhong-Feng Liang","doi":"10.1109/ICEIT.2010.5607601","DOIUrl":"https://doi.org/10.1109/ICEIT.2010.5607601","url":null,"abstract":"Wayside Teaching is an education that the teacher teaches students outside the classroom. Based on the discussion of the connotation, features and functions of Wayside Teaching, this study uses the methods of questionnaire survey and interview, takes 288 students and 74 teachers from Universities in Xinxiang city as the research object, analyzes and summarizes the current application of Wayside Teaching in college teaching and puts forward the corresponding countermeasure aiming at the inadequate application of teaching.","PeriodicalId":346498,"journal":{"name":"2010 International Conference on Educational and Information Technology","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132961389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-25DOI: 10.1109/ICEIT.2010.5608379
Gan Xusheng, Duanmu Jingshun, Cong Wei
To analyze and predict the flight safety situation scientifically, a flight accident prediction model, based on least squares support vector machine (LS-SVM), is proposed. Simultaneously, three steps grid search method is introduced into the flight accident modeling to select efficiently the parameters of LS-SVM. The simulation results of modeling and predicting on flight accident 100000-hour-rate indicate that, LS-SVM model and its parameter selection method are feasible and effective in flight accident prediction.
{"title":"Flight accident modeling and predicting based on least squares support vector machine","authors":"Gan Xusheng, Duanmu Jingshun, Cong Wei","doi":"10.1109/ICEIT.2010.5608379","DOIUrl":"https://doi.org/10.1109/ICEIT.2010.5608379","url":null,"abstract":"To analyze and predict the flight safety situation scientifically, a flight accident prediction model, based on least squares support vector machine (LS-SVM), is proposed. Simultaneously, three steps grid search method is introduced into the flight accident modeling to select efficiently the parameters of LS-SVM. The simulation results of modeling and predicting on flight accident 100000-hour-rate indicate that, LS-SVM model and its parameter selection method are feasible and effective in flight accident prediction.","PeriodicalId":346498,"journal":{"name":"2010 International Conference on Educational and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130980997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-25DOI: 10.1109/ICEIT.2010.5607597
L. Xiaohui, Du Ruiqing
The This pointer is a special pointer, which point the address of an object whose member function is being run. Using the This pointer in teaching C++ programming language is able to help students understanding the process of one object's construction and destruction soundly. It is also helpful in students' understanding the principle of dynamic memory allocation and dynamic memory deallocation. This paper listed several example programs to illustrate how to help students to understand c++ programs soundly.
{"title":"The use of the This pointer in helping students to understand C++ programs soundly","authors":"L. Xiaohui, Du Ruiqing","doi":"10.1109/ICEIT.2010.5607597","DOIUrl":"https://doi.org/10.1109/ICEIT.2010.5607597","url":null,"abstract":"The This pointer is a special pointer, which point the address of an object whose member function is being run. Using the This pointer in teaching C++ programming language is able to help students understanding the process of one object's construction and destruction soundly. It is also helpful in students' understanding the principle of dynamic memory allocation and dynamic memory deallocation. This paper listed several example programs to illustrate how to help students to understand c++ programs soundly.","PeriodicalId":346498,"journal":{"name":"2010 International Conference on Educational and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133516974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-25DOI: 10.1109/ICEIT.2010.5608356
Ye Liang, Hong Bao, Hongzhe Liu
Traditional Chinese Painting and Calligraphy are unique forms of art and highly regarded for their theory, expression and techniques throughout the world. More and more popular image processing techniques have been used in this specific domain. The emphasis of traditional Chinese Painting and Calligraphy research is not the same, so traditional Chinese Painting and Calligraphy images should be classified before they are processed. In this paper, a simple and efficient classification method is proposed. The key motivation is the structure of Chinese characters and the difference of image composition between Traditional Chinese Painting and Calligraphy. At last, the algorithm is implemented and the results demonstrate the algorithm has satisfactory efficiency.
{"title":"A simple method for classification of traditional Chinese Painting and Calligraphy images","authors":"Ye Liang, Hong Bao, Hongzhe Liu","doi":"10.1109/ICEIT.2010.5608356","DOIUrl":"https://doi.org/10.1109/ICEIT.2010.5608356","url":null,"abstract":"Traditional Chinese Painting and Calligraphy are unique forms of art and highly regarded for their theory, expression and techniques throughout the world. More and more popular image processing techniques have been used in this specific domain. The emphasis of traditional Chinese Painting and Calligraphy research is not the same, so traditional Chinese Painting and Calligraphy images should be classified before they are processed. In this paper, a simple and efficient classification method is proposed. The key motivation is the structure of Chinese characters and the difference of image composition between Traditional Chinese Painting and Calligraphy. At last, the algorithm is implemented and the results demonstrate the algorithm has satisfactory efficiency.","PeriodicalId":346498,"journal":{"name":"2010 International Conference on Educational and Information Technology","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132154373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：