This paper puts forward a unified service integration model of digital campus system based on Service-Oriented Architecture (SOA). The principle of SOA-based digital campus is discussed at first, and then its service-oriented digital campus platform architecture based on unified platforms. The design methods and steps of digital campus integration are illustrated, and three main platforms including unified authentication, unified platform for data sharing and exchange and unified information portal in digital campus system integration are explained and implemented as well. Finally an example in China is presented for verification.
{"title":"Design a Digital Campus Information System Based on SOA","authors":"Xiaojun Kang","doi":"10.1109/WISM.2010.24","DOIUrl":"https://doi.org/10.1109/WISM.2010.24","url":null,"abstract":"This paper puts forward a unified service integration model of digital campus system based on Service-Oriented Architecture (SOA). The principle of SOA-based digital campus is discussed at first, and then its service-oriented digital campus platform architecture based on unified platforms. The design methods and steps of digital campus integration are illustrated, and three main platforms including unified authentication, unified platform for data sharing and exchange and unified information portal in digital campus system integration are explained and implemented as well. Finally an example in China is presented for verification.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"355 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134194180","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}
The reaction mechanism of micronized coal re-burning (MCR) organic acid salt used as an accelerator had been described by 81 substances and 564 elementary reactions in this paper. And also the CHEMKIN software had been used to simulate the condition above. In the process of simulation of CHEMKIN, we used acetone as a substitute for Calcium Magnesium Acetate( CMA )to predigest. The results showed as follows: With the rising of the temperature, the falling of re-burning fuel ratio, the increasing of excess air coefficient in re-burning zone and the decreasing of calcium-sulfur ratio, the removal efficiency of NO decreases gradually; While the initiative concentration of SO2 increases 100ppm at a time, the content of NO decreases 12ppm, which restrains the generation of NO.
{"title":"Numerical Simulation of Micronized Re-burning (MCR) Organic Acid Salt Used as an Accelerator","authors":"Manyin Hu, Xiuhong Wang, Zhong Liu, Yong Yang","doi":"10.1109/WISM.2010.35","DOIUrl":"https://doi.org/10.1109/WISM.2010.35","url":null,"abstract":"The reaction mechanism of micronized coal re-burning (MCR) organic acid salt used as an accelerator had been described by 81 substances and 564 elementary reactions in this paper. And also the CHEMKIN software had been used to simulate the condition above. In the process of simulation of CHEMKIN, we used acetone as a substitute for Calcium Magnesium Acetate( CMA )to predigest. The results showed as follows: With the rising of the temperature, the falling of re-burning fuel ratio, the increasing of excess air coefficient in re-burning zone and the decreasing of calcium-sulfur ratio, the removal efficiency of NO decreases gradually; While the initiative concentration of SO2 increases 100ppm at a time, the content of NO decreases 12ppm, which restrains the generation of NO.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"63 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114041748","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}
Synchronization between two hyper-chaotic systems with different structures is studied with full state hybrid projective method and Lyapunov stability theory. A general synchronization formula is derived. Then a concrete synchronization controller is given where hyper-chaotic Chen system and Lü system are taken as instances. Finally effectiveness of the controller derived in this paper is verified by numerical simulations.
{"title":"Synchronization Research of Uncoupled Hyper-chaotic Systems","authors":"Yuliang Liu, Xu Sun","doi":"10.1109/WISM.2010.22","DOIUrl":"https://doi.org/10.1109/WISM.2010.22","url":null,"abstract":"Synchronization between two hyper-chaotic systems with different structures is studied with full state hybrid projective method and Lyapunov stability theory. A general synchronization formula is derived. Then a concrete synchronization controller is given where hyper-chaotic Chen system and Lü system are taken as instances. Finally effectiveness of the controller derived in this paper is verified by numerical simulations.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115267112","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}
In this paper, a fast terminal sliding mode control with fuzzy disturbance observer scheme is proposed. In the scheme, a novel adaptive law for fuzzy disturbance observer is presented, which has faster convergence than the conventional one. Combining the fast terminal mode and the novel fuzzy disturbance observer, the proposed new scheme is not only suitable for uncertainty nonlinear system, but also can achieve faster convergence. The relationship and difference between the suggested fuzzy disturbance observer and the conventional one are discussed. Finally, simulation studies for rotational inverted pendulum are provided to confirm the performance and the effectiveness of the proposed control approach.
{"title":"A Fast Terminal Sliding Mode Control with Novel Fuzzy Disturbance Observer","authors":"Guoyong Huang","doi":"10.1109/WISM.2010.173","DOIUrl":"https://doi.org/10.1109/WISM.2010.173","url":null,"abstract":"In this paper, a fast terminal sliding mode control with fuzzy disturbance observer scheme is proposed. In the scheme, a novel adaptive law for fuzzy disturbance observer is presented, which has faster convergence than the conventional one. Combining the fast terminal mode and the novel fuzzy disturbance observer, the proposed new scheme is not only suitable for uncertainty nonlinear system, but also can achieve faster convergence. The relationship and difference between the suggested fuzzy disturbance observer and the conventional one are discussed. Finally, simulation studies for rotational inverted pendulum are provided to confirm the performance and the effectiveness of the proposed control approach.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"485 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122180339","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}
Word frequency analysis plays an essential role in many data mining tasks of large-scale data set based on text corpus, and hash list is a very simple but efficient structure for frequent pattern discovering. In this paper, a Poisson approximation approach is exploited to analyze the space efficiency of hash list under different parameters on probability. Based on our theoretical model, an optimal parameter setting for hash list is given. Experimental result of real data shows that hash list with the optimal parameter can reach minimum or nearly minimum memory cost.
{"title":"Optimal Hash List for Word Frequency Analysis","authors":"Sheng-Lan Peng","doi":"10.1109/WISM.2010.59","DOIUrl":"https://doi.org/10.1109/WISM.2010.59","url":null,"abstract":"Word frequency analysis plays an essential role in many data mining tasks of large-scale data set based on text corpus, and hash list is a very simple but efficient structure for frequent pattern discovering. In this paper, a Poisson approximation approach is exploited to analyze the space efficiency of hash list under different parameters on probability. Based on our theoretical model, an optimal parameter setting for hash list is given. Experimental result of real data shows that hash list with the optimal parameter can reach minimum or nearly minimum memory cost.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122761700","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}
Temporal-based mining is an attractive direction which is newly generated from the Data Mining field. By taking the time factor into account, some knowledge and interesting information, such as burst events and topic durations, can be mined out from data collections which are coordinated according to their duration (timestamp). Given the huge web as a temporal data collection, in this paper, we introduce a framework based on our current work. The main task is to find the association between two topics in different time slots (durations). Given a keyword as the main topic, we expect to find three kinds of topics which are relevant to the main topic: periodical topic, non-periodical topic and burst topic. These three types of topics can satisfy the needs of users with different requirements.
{"title":"A Framework: Event Extraction from the Temporal Web","authors":"Yiyang Yang, Zhiguo Gong","doi":"10.1109/WISM.2010.90","DOIUrl":"https://doi.org/10.1109/WISM.2010.90","url":null,"abstract":"Temporal-based mining is an attractive direction which is newly generated from the Data Mining field. By taking the time factor into account, some knowledge and interesting information, such as burst events and topic durations, can be mined out from data collections which are coordinated according to their duration (timestamp). Given the huge web as a temporal data collection, in this paper, we introduce a framework based on our current work. The main task is to find the association between two topics in different time slots (durations). Given a keyword as the main topic, we expect to find three kinds of topics which are relevant to the main topic: periodical topic, non-periodical topic and burst topic. These three types of topics can satisfy the needs of users with different requirements.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125263556","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}
In order to solve the fault diagnosis problem of performance Parameter, Adaptive Neuro-Fuzzy inference system (ANFIS) was applied to build a fault diagnosis model of automobile engine and induce cloud model of fan-out, outputting results are continued. Through verification of the built diagnosis model with data of engine tests, it has been found that the recognition accuracy increase from 84.38% to 98.81%, training error falling from 0.001683 to 0.0011526. Simulation results show that the fitting ability, convergence speed and recognition accuracy of improved ANFIS model are all superior to ANFIS. So a contingent fault of automobile engine can be identified effectively. Moreover, it can effectively detect the performance parameter failure for the automobile engine.
{"title":"The Performance Parameter Fault Diagnosis for Automobile Engine Based on ANFIS","authors":"Jianhua Zhang, Li-fang Kong, Z. Tian, Wei Hao","doi":"10.1109/WISM.2010.149","DOIUrl":"https://doi.org/10.1109/WISM.2010.149","url":null,"abstract":"In order to solve the fault diagnosis problem of performance Parameter, Adaptive Neuro-Fuzzy inference system (ANFIS) was applied to build a fault diagnosis model of automobile engine and induce cloud model of fan-out, outputting results are continued. Through verification of the built diagnosis model with data of engine tests, it has been found that the recognition accuracy increase from 84.38% to 98.81%, training error falling from 0.001683 to 0.0011526. Simulation results show that the fitting ability, convergence speed and recognition accuracy of improved ANFIS model are all superior to ANFIS. So a contingent fault of automobile engine can be identified effectively. Moreover, it can effectively detect the performance parameter failure for the automobile engine.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124562986","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}
Result caching is an efficient technique for reducing the query processing load, hence it is commonly used in search engines. In this paper, we study query result caching and proposes a cache management policy for achieving higher hit ratios compared to traditional heuristics methods. Our cache management policy comprises an eviction policy and an admission policy, and it divides the memory allocated for caching into two parts. Our first contribution is a new set of feature-based cache eviction policies that achieve significant improvement over previous methods. Our second contribution is a study an admission policy which uses stateful features to prevent infrequent queries from polluting the cache, substantially improving the hit ratios greatly. Experiment results on two different query logs show that our policy achieves higher hit ratios when compared to previously methods.
{"title":"Improved Techniques for Caches of Search Engines Results","authors":"Hui Li, Cunhua Li, Yun Hu, Shu Zhang, Xia Wang","doi":"10.1109/WISM.2010.142","DOIUrl":"https://doi.org/10.1109/WISM.2010.142","url":null,"abstract":"Result caching is an efficient technique for reducing the query processing load, hence it is commonly used in search engines. In this paper, we study query result caching and proposes a cache management policy for achieving higher hit ratios compared to traditional heuristics methods. Our cache management policy comprises an eviction policy and an admission policy, and it divides the memory allocated for caching into two parts. Our first contribution is a new set of feature-based cache eviction policies that achieve significant improvement over previous methods. Our second contribution is a study an admission policy which uses stateful features to prevent infrequent queries from polluting the cache, substantially improving the hit ratios greatly. Experiment results on two different query logs show that our policy achieves higher hit ratios when compared to previously methods.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131369598","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}
Task scheduling problems are of paramount importance which relate to the efficiency of the whole cloud computing facilities. In Hadoop, the open-source implementation of MapReduce, scheduling policies, such as FIFO or delay scheduling in FAIR scheduler is used by the master node to distribute waiting tasks to computing nodes (slaves) in response to the status messages of these nodes it receives. Although delay scheduling policy has claimed to improve the throughput and response times by a factor of 2 compared to FIFO policy, it can still achieve more improvement by considering a holistic view of all the tasks waiting to be processed. Therefore, this paper proposes a new scheduler which makes a scheduling decision by evaluating the entire group of tasks in the job queue. A genetic algorithm is designed as the optimization method for the new scheduler. The preliminary simulation results show that our scheduler can get a shorter make span for jobs than FIFO and delay scheduling policies and achieve a better balanced load across all the nodes in the cloud.
{"title":"GA-Based Task Scheduler for the Cloud Computing Systems","authors":"Yujia Ge, Guiyi Wei","doi":"10.1109/WISM.2010.87","DOIUrl":"https://doi.org/10.1109/WISM.2010.87","url":null,"abstract":"Task scheduling problems are of paramount importance which relate to the efficiency of the whole cloud computing facilities. In Hadoop, the open-source implementation of MapReduce, scheduling policies, such as FIFO or delay scheduling in FAIR scheduler is used by the master node to distribute waiting tasks to computing nodes (slaves) in response to the status messages of these nodes it receives. Although delay scheduling policy has claimed to improve the throughput and response times by a factor of 2 compared to FIFO policy, it can still achieve more improvement by considering a holistic view of all the tasks waiting to be processed. Therefore, this paper proposes a new scheduler which makes a scheduling decision by evaluating the entire group of tasks in the job queue. A genetic algorithm is designed as the optimization method for the new scheduler. The preliminary simulation results show that our scheduler can get a shorter make span for jobs than FIFO and delay scheduling policies and achieve a better balanced load across all the nodes in the cloud.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126800035","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}
This paper points towards the integration rules of mapping from relational database such as SQL DDL, schema and data into the semantic web ontology such as OWL which build on top of RDF using vocabulary RDFS and XML schema data type. From the study, different cases are considered: such as tables, relationships, composite-column, single or multiple primary key, foreign key, constraints, check between, check like, etc, and then using one of these cases to mapping data rows to ontology instances. This approach reduces the cost and time for building ontology (OWL).
{"title":"Towards Integration Rules of Mapping from Relational Databases to Semantic Web Ontology","authors":"M. Hazber, Jincai Yang, Qian Jin","doi":"10.1109/WISM.2010.21","DOIUrl":"https://doi.org/10.1109/WISM.2010.21","url":null,"abstract":"This paper points towards the integration rules of mapping from relational database such as SQL DDL, schema and data into the semantic web ontology such as OWL which build on top of RDF using vocabulary RDFS and XML schema data type. From the study, different cases are considered: such as tables, relationships, composite-column, single or multiple primary key, foreign key, constraints, check between, check like, etc, and then using one of these cases to mapping data rows to ontology instances. This approach reduces the cost and time for building ontology (OWL).","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127803052","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
扫码关注我们
求助内容：
应助结果提醒方式：