To meet the requirement of the satellite attitude and orbit control system (AOCS) could recover control in abnormal conditions, A reconfigurable control system using variable-structure control and improved pseudo-inverse is developed based on the error quaternion non-linear model in this paper, which overcomes the no uniqueness of initial pseudo inverse matrix. Simulation shows that it could provide desirable control qualities in the event of one reaction wheel failure, and robust for disturbance.
{"title":"A Design of Reconfigurable Satellite Control System with Reaction Wheels Based on Error Quaternion Model","authors":"Peijun Yu, Keqiang Xia, Jiancheng Li","doi":"10.1109/ICICIS.2011.62","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.62","url":null,"abstract":"To meet the requirement of the satellite attitude and orbit control system (AOCS) could recover control in abnormal conditions, A reconfigurable control system using variable-structure control and improved pseudo-inverse is developed based on the error quaternion non-linear model in this paper, which overcomes the no uniqueness of initial pseudo inverse matrix. Simulation shows that it could provide desirable control qualities in the event of one reaction wheel failure, and robust for disturbance.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130344148","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}
M. Shafieezadeh, Masood Kiarash Rad, Kamyar Raoufi, Nafiseh Payani
For all members within a supply chain, effectively managing dependencies is very important. Indeed, as market pressures dictate that today's commercial supply chains provide rapid and efficient supply, the need to collaborate with all members within the supply chain is becoming increasingly critical. As such, there is an emerging need for organizations to understand, formalize, and manage the resulting interdependencies. This paper develops and illustrates a Cause- Effect-based, systematic process for analysing and selecting collaboration policies in a supply chain. These collaboration policies can enhance performance of supply chain members and the dynamic analysis presented in this paper can help to analyze dynamic behavior of these policies in a supply chain.
{"title":"A Framework for Analyzing and Enhancing Collaboration in Supply Chain through Dynamic Analysis","authors":"M. Shafieezadeh, Masood Kiarash Rad, Kamyar Raoufi, Nafiseh Payani","doi":"10.1109/ICICIS.2011.95","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.95","url":null,"abstract":"For all members within a supply chain, effectively managing dependencies is very important. Indeed, as market pressures dictate that today's commercial supply chains provide rapid and efficient supply, the need to collaborate with all members within the supply chain is becoming increasingly critical. As such, there is an emerging need for organizations to understand, formalize, and manage the resulting interdependencies. This paper develops and illustrates a Cause- Effect-based, systematic process for analysing and selecting collaboration policies in a supply chain. These collaboration policies can enhance performance of supply chain members and the dynamic analysis presented in this paper can help to analyze dynamic behavior of these policies in a supply chain.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129078337","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}
Handwriting recognition is a main topic of Optical Character Recognition (OCR), which has a very wide application area. Hidden Markov model is a popular model for handwriting recognition because of its effectiveness and robustness. In this paper, we propose a hidden Markov model with parameter-optimized k-means clustering for handwriting recognition. We explore two deep features of the images of characters, thus significantly boosting the effectiveness of k-means clustering. The experiments show that our model largely increases the average accuracy of HMM with k-means clustering to 83.5% when the number of clusters is 3000.
{"title":"Hidden Markov Model with Parameter-Optimized K-Means Clustering for Handwriting Recognition","authors":"Weijie Su, Xin Jin","doi":"10.1109/ICICIS.2011.113","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.113","url":null,"abstract":"Handwriting recognition is a main topic of Optical Character Recognition (OCR), which has a very wide application area. Hidden Markov model is a popular model for handwriting recognition because of its effectiveness and robustness. In this paper, we propose a hidden Markov model with parameter-optimized k-means clustering for handwriting recognition. We explore two deep features of the images of characters, thus significantly boosting the effectiveness of k-means clustering. The experiments show that our model largely increases the average accuracy of HMM with k-means clustering to 83.5% when the number of clusters is 3000.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129903130","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}
Mining frequent sub tree from databases of labeled trees is a new research field that has many practical applications in areas such as computer networks, Web mining, bioinformatics, XML document mining, etc. These applications share a requirement for the more expressive power of labeled trees to capture the complex relations among data entities. In this paper an efficient algorithm is introduced for mining frequent, ordered, embedded sub tree in tree-like databases. Using a new data structure called scope-list, which is a canonical representation of tree node, the algorithm first generates all candidate trees, then enumerates embedded, ordered trees, finally joins scope-list to compute frequency of embedded ordered trees. Experiments show the performance of the algorithm is about 15% better than other similar mining methods and has good scale-up properties.
{"title":"Mining Frequent Embedded Subtree from Tree-Like Databases","authors":"Lizhi Liu, Jun Liu","doi":"10.1109/ICICIS.2011.8","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.8","url":null,"abstract":"Mining frequent sub tree from databases of labeled trees is a new research field that has many practical applications in areas such as computer networks, Web mining, bioinformatics, XML document mining, etc. These applications share a requirement for the more expressive power of labeled trees to capture the complex relations among data entities. In this paper an efficient algorithm is introduced for mining frequent, ordered, embedded sub tree in tree-like databases. Using a new data structure called scope-list, which is a canonical representation of tree node, the algorithm first generates all candidate trees, then enumerates embedded, ordered trees, finally joins scope-list to compute frequency of embedded ordered trees. Experiments show the performance of the algorithm is about 15% better than other similar mining methods and has good scale-up properties.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127569141","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}
Mining frequent item sets over P2P network is a challenging problem. The obstacles mainly lie in numerous frequent item sets and huge communication cost. To solve the two problems, a maximal item set mining algorithm P2PMaxSet is proposed. Firstly, only maximal item set is considered, which reduces the number of item sets greatly. Secondly, mining results are only interchanged between neighbor nodes, which save communication cost. Finally, adjust strategies are discussed for dynamic environment. Experimental results show P2PMaxSet is not only accurate but also with lower communication cost.
{"title":"Discovering Frequent Itemsets over P2P Network","authors":"Wei Song, Lei Gao, Junshan Wang, Jinhong Li","doi":"10.1109/ICICIS.2011.104","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.104","url":null,"abstract":"Mining frequent item sets over P2P network is a challenging problem. The obstacles mainly lie in numerous frequent item sets and huge communication cost. To solve the two problems, a maximal item set mining algorithm P2PMaxSet is proposed. Firstly, only maximal item set is considered, which reduces the number of item sets greatly. Secondly, mining results are only interchanged between neighbor nodes, which save communication cost. Finally, adjust strategies are discussed for dynamic environment. Experimental results show P2PMaxSet is not only accurate but also with lower communication cost.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122605665","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 the analysis of the characteristics of network traffic we proposed a method for web site network security. We separate efficiently users by cookie, analyse user's activity by Hidden Semi-Markov Model, caculate the normal degree and allocate the bandwidth for the normal users. So we can defense DDoS attacks and control abnormal network traffic flow.
{"title":"An Intrusion Detection System Based on Network Processor","authors":"Li Yun, Xuejun Wang, Yongchang Yang","doi":"10.1109/ICICIS.2011.143","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.143","url":null,"abstract":"In the analysis of the characteristics of network traffic we proposed a method for web site network security. We separate efficiently users by cookie, analyse user's activity by Hidden Semi-Markov Model, caculate the normal degree and allocate the bandwidth for the normal users. So we can defense DDoS attacks and control abnormal network traffic flow.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123996243","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 describes research in the use of the PC/SC to develop Smart Card applications. This page was designed to give you a basic understanding of how to setup PC/SC communication with a reader and card. This is a great starting point, however it leaves out the most important part, card communication. We have left this out purposfully because every card communicates differently. allowing you to get a basic understanding of how easy it can be to access smart cards from any PC/SC compliant reader.
{"title":"Developing Smart Card Application with PC/SC","authors":"Xu Junwu, Xie Fang","doi":"10.1109/ICICIS.2011.76","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.76","url":null,"abstract":"This paper describes research in the use of the PC/SC to develop Smart Card applications. This page was designed to give you a basic understanding of how to setup PC/SC communication with a reader and card. This is a great starting point, however it leaves out the most important part, card communication. We have left this out purposfully because every card communicates differently. allowing you to get a basic understanding of how easy it can be to access smart cards from any PC/SC compliant reader.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124015585","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}
A computer-based decision support system called a Production Economical Reporting and Control System (PERCS) has been developed to help people work in food processing industries: decisions making, choosing between alternatives, solving problems and planning for the future. The system was divided into five parts: (a) the data management, (b) the model management system, (c) the knowledge engine, (d) the user interface, and (e) the user(s). This system was capable to report on the following functions: First, materials traceability which includes: sources, quantities, dates, names, prices, packages types and numbers, etc. Second was for machines and product lines report. Third, part was concerning about labor reports which includes: jobs, productivity, shift number, breakdown causes. Fourth, storing status, and the final part was for the quality report which includes: quantities, types, dates,. etc. Onion dehydration industry was taken as a case study to apply the computer-based system for helping in technical management for this factory.
{"title":"Decision Support System for Technical Management of Food Processing Industries","authors":"S. A. Ali, A. Bahnasawy","doi":"10.1109/ICICIS.2011.12","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.12","url":null,"abstract":"A computer-based decision support system called a Production Economical Reporting and Control System (PERCS) has been developed to help people work in food processing industries: decisions making, choosing between alternatives, solving problems and planning for the future. The system was divided into five parts: (a) the data management, (b) the model management system, (c) the knowledge engine, (d) the user interface, and (e) the user(s). This system was capable to report on the following functions: First, materials traceability which includes: sources, quantities, dates, names, prices, packages types and numbers, etc. Second was for machines and product lines report. Third, part was concerning about labor reports which includes: jobs, productivity, shift number, breakdown causes. Fourth, storing status, and the final part was for the quality report which includes: quantities, types, dates,. etc. Onion dehydration industry was taken as a case study to apply the computer-based system for helping in technical management for this factory.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117233278","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 article introduces the usual methods of software optimization of the tiny computer system in detail and it also discusses the prevention of virus and illegal invasion. These methods have higher practical and serviceability.
{"title":"Software Optimization and Safety of the Tiny Computer System","authors":"Min-Song Li, Duan Zhuo-hua","doi":"10.1109/ICICIS.2011.157","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.157","url":null,"abstract":"This article introduces the usual methods of software optimization of the tiny computer system in detail and it also discusses the prevention of virus and illegal invasion. These methods have higher practical and serviceability.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"42 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132462065","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 make investment model targeted and practical, the disturbance in the right side of the capital accumulation equation in the model should be clarified and thus a model of stochastic investment under interest rate uncertainty should be established. The research is based upon Calcagnini's thought, but the method is improved. When the interest rate is fixed, enterprise expects the marginal expected present value of capital to be equal to the cost of capital. In the research about uncertain interest rate model, it is found that when investment is reversible, increasing investment during the fluctuation of interest rate will make the expected discounted profit rise.
{"title":"Analysis on Model of Investment under Interest Rate Uncertainty","authors":"Yancheng Zhu","doi":"10.1109/ICICIS.2011.48","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.48","url":null,"abstract":"In order to make investment model targeted and practical, the disturbance in the right side of the capital accumulation equation in the model should be clarified and thus a model of stochastic investment under interest rate uncertainty should be established. The research is based upon Calcagnini's thought, but the method is improved. When the interest rate is fixed, enterprise expects the marginal expected present value of capital to be equal to the cost of capital. In the research about uncertain interest rate model, it is found that when investment is reversible, increasing investment during the fluctuation of interest rate will make the expected discounted profit rise.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125353192","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
扫码关注我们
求助内容：
应助结果提醒方式：