It is well known that Approximated Maximum Likelihood(AML) estimator has the best performance for short time sampling wideband source bearing estimation. But for a long time, the heavy computational load of maximizing the multivariate, highly non-linear likelihood function prevented it from popular use. In this paper, we introduced Ant Colony Algorithm (ACA) to work with AML for computing the exact solutions to the likelihood function with a guarantee of global convergence. The resulted estimator is called Approximated Maximum Likelihood bearing estimator based on Ant Colony Algorithm (ACA-AML). Simulations show that ACA-AML not only reduces the computational complexity greatly but also maintains the excellent performance of the original AML estimator.
{"title":"Approximated Maximum Likelihood Bearing Estimation Based on Ant Colony Algorithm","authors":"H. Zhai, Yunshan Hou, Yong Jin","doi":"10.1109/WISM.2010.147","DOIUrl":"https://doi.org/10.1109/WISM.2010.147","url":null,"abstract":"It is well known that Approximated Maximum Likelihood(AML) estimator has the best performance for short time sampling wideband source bearing estimation. But for a long time, the heavy computational load of maximizing the multivariate, highly non-linear likelihood function prevented it from popular use. In this paper, we introduced Ant Colony Algorithm (ACA) to work with AML for computing the exact solutions to the likelihood function with a guarantee of global convergence. The resulted estimator is called Approximated Maximum Likelihood bearing estimator based on Ant Colony Algorithm (ACA-AML). Simulations show that ACA-AML not only reduces the computational complexity greatly but also maintains the excellent performance of the original AML estimator.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"18 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":"126395767","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}
As the traditional security and defense systems appear some defects, such as wiring problems, higher construction and maintenance expense and delay of receiving alarm messages, a scheme based on Internet of Things is proposed. Embedded ARM9 S3C2440A micro controller is adopted as system master controller, which carries out receiving and processing the transmission alarm message of RF chip worked at 2.4GHz ISM band and searching the alarm message server by Object Name Service(ONS). Alarm message is transmitted on the internet in time by using socket, and the remote terminal will real-time monitor the home security situation. The experiment results show the system obtains expected impressions.
针对传统安防系统存在布线问题、建设维护费用较高、接收报警信息较慢等缺陷，提出了一种基于物联网的安防系统方案。采用嵌入式ARM9 S3C2440A微控制器作为系统主控制器，对工作在2.4GHz ISM频段的射频芯片发送的报警信息进行接收和处理，并通过对象名称服务(Object Name Service, ONS)对报警信息服务器进行搜索。通过socket将报警信息及时传送到互联网上，远程终端实时监控家庭安全情况。实验结果表明，该系统达到了预期的效果。
{"title":"Investigation of Security and Defense System for Home Based on Internet of Things","authors":"Guang-xue Yang, Feng-jiao Li","doi":"10.1109/WISM.2010.32","DOIUrl":"https://doi.org/10.1109/WISM.2010.32","url":null,"abstract":"As the traditional security and defense systems appear some defects, such as wiring problems, higher construction and maintenance expense and delay of receiving alarm messages, a scheme based on Internet of Things is proposed. Embedded ARM9 S3C2440A micro controller is adopted as system master controller, which carries out receiving and processing the transmission alarm message of RF chip worked at 2.4GHz ISM band and searching the alarm message server by Object Name Service(ONS). Alarm message is transmitted on the internet in time by using socket, and the remote terminal will real-time monitor the home security situation. The experiment results show the system obtains expected impressions.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"10 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":"127907662","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 filing and classification of E-government document in E-government information system are accomplished manually, which restricts the government information technology seriously. To solve this problem, a classification algorithm for E-government document based on support vector machine is proposed. For the general workflow of E-government document circulation in the current information system, a scheme of the auto-classification and archiving based on service is presented so that it is realized in a heterogeneous information system. In this scheme, the original system is reused to create new value as much as possible and change of workflow is responded more rapidly. It is a new solution to the automatic E-government system.
{"title":"The Classification for E-government Document Based on SVM","authors":"Yunliang Jiang, Qing Shen, Jing Fan, Xiongtao Zhang","doi":"10.1109/WISM.2010.14","DOIUrl":"https://doi.org/10.1109/WISM.2010.14","url":null,"abstract":"The filing and classification of E-government document in E-government information system are accomplished manually, which restricts the government information technology seriously. To solve this problem, a classification algorithm for E-government document based on support vector machine is proposed. For the general workflow of E-government document circulation in the current information system, a scheme of the auto-classification and archiving based on service is presented so that it is realized in a heterogeneous information system. In this scheme, the original system is reused to create new value as much as possible and change of workflow is responded more rapidly. It is a new solution to the automatic E-government system.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"25 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":"127992504","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, some properties about filter and congruence are proposed at first, then we discuss some properties about approximation operators in residuated lattice.
本文首先给出了关于滤波和同余的一些性质，然后讨论了残馀格中近似算子的一些性质。
{"title":"Approximation Operators in Residuated Lattice","authors":"Yingchao Shao, Zhengjiang Wu, K. Qin","doi":"10.1109/WISM.2010.40","DOIUrl":"https://doi.org/10.1109/WISM.2010.40","url":null,"abstract":"In this paper, some properties about filter and congruence are proposed at first, then we discuss some properties about approximation operators in residuated lattice.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"21 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":"134539859","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 proposes an algorithm of personalized blog information retrieval based on user’s interest model. First of all, it discusses the system architecture of personalized blog information retrieval. Next it studies the identification module of blog web page. Then it focuses the document feature representation and the algorithm flow of blog document similarity based on the vector space model. And then it details the personalized user modeling technique. Finally it gives the experiment results and makes the analysis.
{"title":"Research on Personalized Blog Information Retrieval","authors":"Ping Zhou","doi":"10.1109/WISM.2010.61","DOIUrl":"https://doi.org/10.1109/WISM.2010.61","url":null,"abstract":"This paper proposes an algorithm of personalized blog information retrieval based on user’s interest model. First of all, it discusses the system architecture of personalized blog information retrieval. Next it studies the identification module of blog web page. Then it focuses the document feature representation and the algorithm flow of blog document similarity based on the vector space model. And then it details the personalized user modeling technique. Finally it gives the experiment results and makes the analysis.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"34 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":"134331815","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 discusses the best method of DEM generation. Optimal Linear Method of. Focusing on its high precision, high fidelity, the authors indicate that the truncation error of interpolation model should be considered as the main error in estimating the error of DEM generation method. A new DEM generation method (MADEM) based on Map Algebra is provided. It is in fact a linear interpolation on horizontal projection of the steepest descent line realized by recursive powered Voronoi interpolation between assigned points and lines. Its precision is much better than that of the DEM generation methods basing on linear interpolation on Delaunay Triangulation under the same conditions, and it also has the feature of high fidelity. Having been compared with other methods, the DEM generation method in this paper should be the best linear interpolation method of all.
{"title":"Introduction of Optimal Linear DEM Generation Method -- MADEM","authors":"Hai Hu, Jiajun Zhou, Peng Hu, Chuanyong Yang","doi":"10.1109/WISM.2010.140","DOIUrl":"https://doi.org/10.1109/WISM.2010.140","url":null,"abstract":"This paper discusses the best method of DEM generation. Optimal Linear Method of. Focusing on its high precision, high fidelity, the authors indicate that the truncation error of interpolation model should be considered as the main error in estimating the error of DEM generation method. A new DEM generation method (MADEM) based on Map Algebra is provided. It is in fact a linear interpolation on horizontal projection of the steepest descent line realized by recursive powered Voronoi interpolation between assigned points and lines. Its precision is much better than that of the DEM generation methods basing on linear interpolation on Delaunay Triangulation under the same conditions, and it also has the feature of high fidelity. Having been compared with other methods, the DEM generation method in this paper should be the best linear interpolation method of all.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"22 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":"129379341","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 shortest addition chains can provide high efficiency for the modular exponentiation in RSA, but the time and space complexity of finding out the shortest addition chains is extremely high. This research adopts addition chains tree to produce addition chains and store them into a database,in which the number of child nodes of each node is uncertain until the children of this node in the tree is completed. When we retrieve a number which does not exist in the database in this method, the system will automatically expand the tree to reach it; meanwhile, if the number is already available in the database, we can get the result very quickly without the further data calculation. The favorable results of the theoretical analysis and the experiments demonstrate that the proposed algorithm is more efficient than the other methods.
{"title":"Design and Implementation of Layer Extended Shortest Addition Chains Database for Fast Modular Exponentiation in RSA","authors":"Yiling Li, Qingyu Ma","doi":"10.1109/WISM.2010.174","DOIUrl":"https://doi.org/10.1109/WISM.2010.174","url":null,"abstract":"The shortest addition chains can provide high efficiency for the modular exponentiation in RSA, but the time and space complexity of finding out the shortest addition chains is extremely high. This research adopts addition chains tree to produce addition chains and store them into a database,in which the number of child nodes of each node is uncertain until the children of this node in the tree is completed. When we retrieve a number which does not exist in the database in this method, the system will automatically expand the tree to reach it; meanwhile, if the number is already available in the database, we can get the result very quickly without the further data calculation. The favorable results of the theoretical analysis and the experiments demonstrate that the proposed algorithm is more efficient than the other methods.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"1 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":"128895759","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}
Line simplification algorithm is an important method in geographic information processing, and point number in result data determines simplification ratio. Based on sample data, curve function is established between parameter and point number using method of curve fit, then curve point with maximum curvature is found out in parameter value range, and the parameter value corresponding with this point acts as optimal parameter value. Law between parameter with simplification algorithm is revealed qualitatively and quantitatively, and maximum curvature method determining optimal simplification parameter value is also put forward. As a conclusion, it’s feasible for simplifying large amount of lines data by analyzing factors affected by parameter and for confirming optimal parameter value at maximum curvature point.
{"title":"Selecting Optimal Parameter Value of Single Parameter Line Simplification Algorithm Based on Maximum Curvature","authors":"Xiao-li Wang, Cheng-Shun Jiang, Qing-hui Sun","doi":"10.1109/WISM.2010.19","DOIUrl":"https://doi.org/10.1109/WISM.2010.19","url":null,"abstract":"Line simplification algorithm is an important method in geographic information processing, and point number in result data determines simplification ratio. Based on sample data, curve function is established between parameter and point number using method of curve fit, then curve point with maximum curvature is found out in parameter value range, and the parameter value corresponding with this point acts as optimal parameter value. Law between parameter with simplification algorithm is revealed qualitatively and quantitatively, and maximum curvature method determining optimal simplification parameter value is also put forward. As a conclusion, it’s feasible for simplifying large amount of lines data by analyzing factors affected by parameter and for confirming optimal parameter value at maximum curvature point.","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":"115903497","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}
It is well known that output-to-state stability(OSS)is important for engineer application. In this paper, OSS problems for one class of discontinuous dynamical systems are considered. Piecewise smooth OSS-Lyapunov functions are adopted. Furthermore, interconnections of discontinuous dynamical systems are studied. The results for a class of discontinuous dynamical systems and interconnection of discontinuous dynamical systems’ OSS character are shown, respectively.
{"title":"Output-to-State Stability for One Class of Discontinuous Dynamical Systems","authors":"Wei Zhao","doi":"10.1109/WISM.2010.48","DOIUrl":"https://doi.org/10.1109/WISM.2010.48","url":null,"abstract":"It is well known that output-to-state stability(OSS)is important for engineer application. In this paper, OSS problems for one class of discontinuous dynamical systems are considered. Piecewise smooth OSS-Lyapunov functions are adopted. Furthermore, interconnections of discontinuous dynamical systems are studied. The results for a class of discontinuous dynamical systems and interconnection of discontinuous dynamical systems’ OSS character are shown, respectively.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"94 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":"116911279","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}
Recent study of the agent model is not complete, for the model is often constructed out of the institutional environment. As a result, agents have no E-institution knowledge and cooperate blindly. The aim of this paper is to construct an agent model in an institutional environment, to make agents have the E-institution knowledge of social structures, interaction structures, norms and to make agents have the characteristics of behaving proactively, reactively, rationally, and expectably in the institutional environment. To achieve this aim, we extend the agent model with the E-institution elements (roles, role relations, scenes etc) and present a language of the agent model (including the semantic and the properties) to show the characteristics of this kind of agents according to the role-playings of the agents. As a result, agents have the expected characteristics in the institutional environment.
{"title":"An Extended Agent Model Based on E-institutions","authors":"You-ming Zhou, Ji Gao","doi":"10.1109/WISM.2010.175","DOIUrl":"https://doi.org/10.1109/WISM.2010.175","url":null,"abstract":"Recent study of the agent model is not complete, for the model is often constructed out of the institutional environment. As a result, agents have no E-institution knowledge and cooperate blindly. The aim of this paper is to construct an agent model in an institutional environment, to make agents have the E-institution knowledge of social structures, interaction structures, norms and to make agents have the characteristics of behaving proactively, reactively, rationally, and expectably in the institutional environment. To achieve this aim, we extend the agent model with the E-institution elements (roles, role relations, scenes etc) and present a language of the agent model (including the semantic and the properties) to show the characteristics of this kind of agents according to the role-playings of the agents. As a result, agents have the expected characteristics in the institutional environment.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"29 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":"124069111","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
扫码关注我们
求助内容：
应助结果提醒方式：