This paper investigates some properties of two-way alternating pushdown automata with only existential (universal) states which have inkdots and sublogarithmic space. We show, for example, that for sublogarithmic space-bounded computations, multi-inkdot tow-way alternating pushdown automata with only existential states are incomparable with the ones with only universal states, and the classes of sets accepted by these pushdown automata are not closed under complementation.
{"title":"Sublogarithmic Space-bounded Multi-inkdot Alternating Pushdown Automata with Only Existential (Universal) States","authors":"Jianliang Xu, Jian-liang Wang","doi":"10.1109/JCAI.2009.151","DOIUrl":"https://doi.org/10.1109/JCAI.2009.151","url":null,"abstract":"This paper investigates some properties of two-way alternating pushdown automata with only existential (universal) states which have inkdots and sublogarithmic space. We show, for example, that for sublogarithmic space-bounded computations, multi-inkdot tow-way alternating pushdown automata with only existential states are incomparable with the ones with only universal states, and the classes of sets accepted by these pushdown automata are not closed under complementation.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132163505","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}
Zhi Li, Shuixiu Wu, Xiaoqing Wang, Hao Ye, Ming-Wen Wang, Jihua Ye
We propose a novel way to apply Independent Component Analysis (ICA) [1] on eight kinds of visual descriptors (features), and combine the eight features of the same database to extract independent component (IC) feature of each feature. A comparative study on the retrieval performance has been done between the original features and IC features in four image databases. Experiment results show that the IC features are of much less in dimension than the original features, and achieve satisfying retrieval results, sometimes even better than the original results. In this way, hardware storage can be saved in the retrieval preprocessing step.
{"title":"Dimensional Reduction Based on Independent Component Analysis for Content Based Image Retrieval","authors":"Zhi Li, Shuixiu Wu, Xiaoqing Wang, Hao Ye, Ming-Wen Wang, Jihua Ye","doi":"10.1109/JCAI.2009.142","DOIUrl":"https://doi.org/10.1109/JCAI.2009.142","url":null,"abstract":"We propose a novel way to apply Independent Component Analysis (ICA) [1] on eight kinds of visual descriptors (features), and combine the eight features of the same database to extract independent component (IC) feature of each feature. A comparative study on the retrieval performance has been done between the original features and IC features in four image databases. Experiment results show that the IC features are of much less in dimension than the original features, and achieve satisfying retrieval results, sometimes even better than the original results. In this way, hardware storage can be saved in the retrieval preprocessing step.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128878918","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}
With the development and widely used of Internet and information technology, the Web has become one of the most important means to obtain information for people. According to the web document classification and the theory of artificial neural network, a web classification mining method based on wavelet neural network is presented in this paper. Moreover, we adopt a algorithm of reduce the number of the wavelet basic function by analysis the sparseness property of sample data which can optimize the wavelet network in a large extent, and the learning algorithm based on the gradient descent was used to train network. The structure of web classification mining system based on wavelet neural network is given. With the ability of strong nonlinear function approach and pattern classification and fast convergence of wavelet neural network, the classification mining method can truly classify the web text information. The actual classification results show that this method is feasible and effective.
{"title":"Research of Web Classification Mining Based on Wavelet Neural Network","authors":"Jingwen Tian, Meijuan Gao","doi":"10.1109/JCAI.2009.209","DOIUrl":"https://doi.org/10.1109/JCAI.2009.209","url":null,"abstract":"With the development and widely used of Internet and information technology, the Web has become one of the most important means to obtain information for people. According to the web document classification and the theory of artificial neural network, a web classification mining method based on wavelet neural network is presented in this paper. Moreover, we adopt a algorithm of reduce the number of the wavelet basic function by analysis the sparseness property of sample data which can optimize the wavelet network in a large extent, and the learning algorithm based on the gradient descent was used to train network. The structure of web classification mining system based on wavelet neural network is given. With the ability of strong nonlinear function approach and pattern classification and fast convergence of wavelet neural network, the classification mining method can truly classify the web text information. The actual classification results show that this method is feasible and effective.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115697494","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}
Due to the double fed induction generator’s (DFIG) advantage of controlling active and reactive power independently and partial power converter, DFIG is becoming a popular type of wind power generation system. Nowadays, the grid code demands that the wind power generator possesses the ability of riding through the grid voltage sags, only when the grid voltage drops below the specific curve, the wind turbine is allowed to disconnect. DFIG wind power system has serious problems with the corresponding voltage sag as its partly power converter: depending on the depth and the conditions at the start of the sag, current, power and reactive power peaks may exceed rated values and may lead to a system shut down. The experiment system includes a DC motor, a DFIG, a 3-phase diode rectifier, a converter, a crowbar and a voltage sags generator. The DC motor simulates the behavior of wind turbine, the 3-phase diode rectifier and the converter controls the DFIG, the crowbar is connected to the rotor of DFIG and the converter. The voltage sags generator provides the voltage sags event for the experiment system. The controller of the converter and crowbar includes DSP and FPGA. It judges the moment of voltage sags and trigs the crowbar, so is the key part of the LVRT system. The simulation and experiment result shows that the dynamic response of inner current loop of rotor side converter is important for damping the transient current during voltage sags. The converter in the rotor side with crowbar using the dq transfer voltage measure method could reduce the transient current in rotor and stator. The DFIG system with crowbar could quickly recover from the voltage sags and provide reactive power to support the grid. So crowbar is important for improving LVRT capability of DFIG. The converter with crowbar in the rotor side implement the LVRT of DFIG, it could send reactive power during voltage sags.
{"title":"Analysis on DFIG Wind Power System Low-Voltage Ridethrough","authors":"Yulong Wang, Jianlin Li, S. Hu, Hong-hua Xu","doi":"10.1109/JCAI.2009.31","DOIUrl":"https://doi.org/10.1109/JCAI.2009.31","url":null,"abstract":"Due to the double fed induction generator’s (DFIG) advantage of controlling active and reactive power independently and partial power converter, DFIG is becoming a popular type of wind power generation system. Nowadays, the grid code demands that the wind power generator possesses the ability of riding through the grid voltage sags, only when the grid voltage drops below the specific curve, the wind turbine is allowed to disconnect. DFIG wind power system has serious problems with the corresponding voltage sag as its partly power converter: depending on the depth and the conditions at the start of the sag, current, power and reactive power peaks may exceed rated values and may lead to a system shut down. The experiment system includes a DC motor, a DFIG, a 3-phase diode rectifier, a converter, a crowbar and a voltage sags generator. The DC motor simulates the behavior of wind turbine, the 3-phase diode rectifier and the converter controls the DFIG, the crowbar is connected to the rotor of DFIG and the converter. The voltage sags generator provides the voltage sags event for the experiment system. The controller of the converter and crowbar includes DSP and FPGA. It judges the moment of voltage sags and trigs the crowbar, so is the key part of the LVRT system. The simulation and experiment result shows that the dynamic response of inner current loop of rotor side converter is important for damping the transient current during voltage sags. The converter in the rotor side with crowbar using the dq transfer voltage measure method could reduce the transient current in rotor and stator. The DFIG system with crowbar could quickly recover from the voltage sags and provide reactive power to support the grid. So crowbar is important for improving LVRT capability of DFIG. The converter with crowbar in the rotor side implement the LVRT of DFIG, it could send reactive power during voltage sags.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116965405","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}
Supplier selection in industry is a cross-functional, group decision-making problem, frequently solved by a non-programmed decision-making process, and involving long-term commitment for a company. During recent years, how to determine suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions usually is complex and unstructured. Especially, some decision-making data is undefined, vague and fuzzy data. Especially the determination of weight for supplier selection is very difficult. Considering these circumstances, in this paper, at first we transform the triangular fuzzy numbers into crisp date, and then we use the BP neutral networks to calculate the weight of indexes for supplier selection, the weight we obtained is reliable and reasonable, considering the suitability of grey correlation analysis for supplier selection problem, we use the grey correlation analysis to select the best supplier, Finally, an empirical study is conducted to demonstrate the procedure of the proposed system and identify the suitable supplier.
{"title":"Selection of Suppliers Based on BP Neutral Networks and Grey Correlation Analysis","authors":"Ke Chen, Zhong Xuan, Xianlian Shang","doi":"10.1109/JCAI.2009.52","DOIUrl":"https://doi.org/10.1109/JCAI.2009.52","url":null,"abstract":"Supplier selection in industry is a cross-functional, group decision-making problem, frequently solved by a non-programmed decision-making process, and involving long-term commitment for a company. During recent years, how to determine suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions usually is complex and unstructured. Especially, some decision-making data is undefined, vague and fuzzy data. Especially the determination of weight for supplier selection is very difficult. Considering these circumstances, in this paper, at first we transform the triangular fuzzy numbers into crisp date, and then we use the BP neutral networks to calculate the weight of indexes for supplier selection, the weight we obtained is reliable and reasonable, considering the suitability of grey correlation analysis for supplier selection problem, we use the grey correlation analysis to select the best supplier, Finally, an empirical study is conducted to demonstrate the procedure of the proposed system and identify the suitable supplier.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115995158","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}
EDI stands for Electronic Data Interchange, a method of transporting all types of information, such as purchase orders, invoices, payments and even graphics, to another party electronically. XML is a meta-language that allows users to define markup for their documents using tags. This paper first introduces the XML applications in our country and the defects of this method. Then puts forward a new XML resolution that combines EDI and XML technology together. At the end of this paper, the characters of this new method and an instance based on the new method are given to support its correctness.
{"title":"The Application of EDI Technology in Electronic Commerce System","authors":"Tao Li, Yilei Wang, Lan Lu","doi":"10.1109/JCAI.2009.106","DOIUrl":"https://doi.org/10.1109/JCAI.2009.106","url":null,"abstract":"EDI stands for Electronic Data Interchange, a method of transporting all types of information, such as purchase orders, invoices, payments and even graphics, to another party electronically. XML is a meta-language that allows users to define markup for their documents using tags. This paper first introduces the XML applications in our country and the defects of this method. Then puts forward a new XML resolution that combines EDI and XML technology together. At the end of this paper, the characters of this new method and an instance based on the new method are given to support its correctness.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116022476","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}
Tor is the second generation Onion Router, supporting the anonymous transport of TCP streams over the Internet. Its low latency makes it very suitable for common Internet communication applications. So Tor has become the most successful public anonymity communication service in the Internet. In this paper, we investigate Tor current Circuit-Building Protocol. We found some performance and user experience deficiencies in this protocol. Based on the investigation we propose Improved Circuit-Building Protocol. The protocol includes two phases: user-selectable relay node selection and circuit construction. In the new protocol, we propose three new algorithms: user-selectable relay node selection algorithm, fast circuit constructing algorithm and backup circuit algorithm. In addition we also present an evaluation to the new protocol in terms of user experience, performance and anonymity. Through our evaluation, we think with our Improved Circuit-Building Protocol, we can provide better user experience, better performance and the same anonymity with current Circuit-Building Protocol to Tor users.
{"title":"An Improved Tor Circuit-Building Protocol","authors":"Xin Liu, Neng-Ming Wang","doi":"10.1109/JCAI.2009.27","DOIUrl":"https://doi.org/10.1109/JCAI.2009.27","url":null,"abstract":"Tor is the second generation Onion Router, supporting the anonymous transport of TCP streams over the Internet. Its low latency makes it very suitable for common Internet communication applications. So Tor has become the most successful public anonymity communication service in the Internet. In this paper, we investigate Tor current Circuit-Building Protocol. We found some performance and user experience deficiencies in this protocol. Based on the investigation we propose Improved Circuit-Building Protocol. The protocol includes two phases: user-selectable relay node selection and circuit construction. In the new protocol, we propose three new algorithms: user-selectable relay node selection algorithm, fast circuit constructing algorithm and backup circuit algorithm. In addition we also present an evaluation to the new protocol in terms of user experience, performance and anonymity. Through our evaluation, we think with our Improved Circuit-Building Protocol, we can provide better user experience, better performance and the same anonymity with current Circuit-Building Protocol to Tor users.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117179262","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}
Web services composition refers to the process of com-posing several web services to provide a new value-added service. It is an emerging paradigm for application integration within and across organizational boundaries. BPEL is presently the most prominent language to specify and execute business processes, using web services as its technological basis. However, BPEL is an XML-based language and may suffer from ambiguity and some erroneous properties. It is feasible to analyze BPEL with some formal methods like Petri nets, which is helpful to clarify the semantics of BPEL.In this paper we discuss some service composition patterns supported in BPEL based on SynchroNet, a special class of Petri nets.
{"title":"Analyzing Service Composition Patterns in BPEL","authors":"Yu Huang, Jieying Li, Haiqiang Dun, Hanpin Wang","doi":"10.1109/JCAI.2009.210","DOIUrl":"https://doi.org/10.1109/JCAI.2009.210","url":null,"abstract":"Web services composition refers to the process of com-posing several web services to provide a new value-added service. It is an emerging paradigm for application integration within and across organizational boundaries. BPEL is presently the most prominent language to specify and execute business processes, using web services as its technological basis. However, BPEL is an XML-based language and may suffer from ambiguity and some erroneous properties. It is feasible to analyze BPEL with some formal methods like Petri nets, which is helpful to clarify the semantics of BPEL.In this paper we discuss some service composition patterns supported in BPEL based on SynchroNet, a special class of Petri nets.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128603875","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 new association rule algorithm is discussed. It is based on the weighted association rule algorithms of minwal(0) and minwal(w).The new algorithm can effectively mine the association rules which define some attributes as antecedent partial, while others as consequent partial. The new algorithm also can effectively mine the association rules with lower support and high confidence, and these association rules are greater significant in some applications.
{"title":"A New Association Rule for Causes and Effects Analysis","authors":"Zhefu Yu, Huibiao Lu, Chuanying Jia","doi":"10.1109/JCAI.2009.36","DOIUrl":"https://doi.org/10.1109/JCAI.2009.36","url":null,"abstract":"A new association rule algorithm is discussed. It is based on the weighted association rule algorithms of minwal(0) and minwal(w).The new algorithm can effectively mine the association rules which define some attributes as antecedent partial, while others as consequent partial. The new algorithm also can effectively mine the association rules with lower support and high confidence, and these association rules are greater significant in some applications.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129580964","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 new adaptive weight computation algorithm for a robust array antenna is presented to improve the shortcoming of linearly constrained adaptive beamformer’s sensitivity to the mismatch between the prescribed and actual direction of arrival (MPDOA).The adaptive array minimizes the mean output power under the direction constraint that the mean square deviation between the desired and actual responses satisfies a certain magnitude bound. A new efficient and accurate approximation of the continuous direction range integration is derived and an equivalent inequality constraint is given, and it is proved that the solution occurs on the inequality constraint bound, then the Lagrange multiplier method and the Newton’s one are united to solve the equivalent equality constrained minimization problem. Some computer simulation results show that the superior performance of the proposed beamformer in the robustness against MPDOA and high SINR than the existing directionally constrained beamforming algorithms.
{"title":"A Robust Adaptive Beamforming Approach","authors":"B. Ji, J. Qian","doi":"10.1109/JCAI.2009.215","DOIUrl":"https://doi.org/10.1109/JCAI.2009.215","url":null,"abstract":"In this paper, a new adaptive weight computation algorithm for a robust array antenna is presented to improve the shortcoming of linearly constrained adaptive beamformer’s sensitivity to the mismatch between the prescribed and actual direction of arrival (MPDOA).The adaptive array minimizes the mean output power under the direction constraint that the mean square deviation between the desired and actual responses satisfies a certain magnitude bound. A new efficient and accurate approximation of the continuous direction range integration is derived and an equivalent inequality constraint is given, and it is proved that the solution occurs on the inequality constraint bound, then the Lagrange multiplier method and the Newton’s one are united to solve the equivalent equality constrained minimization problem. Some computer simulation results show that the superior performance of the proposed beamformer in the robustness against MPDOA and high SINR than the existing directionally constrained beamforming algorithms.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127079915","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
扫码关注我们
求助内容：
应助结果提醒方式：