Time filter

Source Type

Chen X.-M.,Dalian University of Technology | Gao C.,Beijing Institute of Information and Control | Wang L.,Dalian University of Technology
Chinese Control Conference, CCC | Year: 2013

Recursive nonparametric identification of affine nonlinear systems is considered in this paper. First, by using Markov chain approach, the geometric ergodicity is established for the affine nonlinear system under suitable conditions with the help of the concept of Q-geometric ergodicity. Then recursive local constant kernel regression estimator is proposed for estimating the values of the nonlinear functions at fixed points. It is proved that the estimate converges to the true value with probability one. Finally a simulation example is provided to justify the theoretical analysis. © 2013 TCCT, CAA.

Yang J.-Y.,Yuncheng University | Yang J.-Y.,Beijing Institute of Information and Control | Wang X.-Y.,Yuncheng University | Li X.-Z.,Xinyang Normal University | And 2 more authors.
Computers and Mathematics with Applications | Year: 2011

An HIV-infection model is proposed, its global stability of the disease free equilibrium is studied, and existence of the endemic equilibria is analyzed. The observed data in a city in China is used to determine the parameters in the model using the least-squares approach. The theoretical prediction agrees well with the data available from a local government agency in the city. © 2010 Elsevier Ltd. All rights reserved.

Li Y.,Harbin Institute of Technology | Wu C.,Harbin Institute of Technology | Liu J.,Beijing Institute of Information and Control | Luo P.,Harbin Institute of Technology
International Journal of Computational Intelligence Systems | Year: 2014

Predicting stock composite index is useful, which can raise the interest of both the investors and the corresponding researchers. This paper presented a new combination prediction model based on the technique of artificial intelligence and the principle of combination forecast. The principle of combination forecast, as a valid foundation of the new model, was strictly proved and carefully illustrated in this paper. Given the predicting rules, the new combination model was established by synthesizing three commonly used prediction models based on the principle of combination forecast. The comprehensive usage of qualitative forecast and quantitative forecast is also a feature of the new model. To valid the new model, comparison analysis and multi-agent simulation were both applied. Besides, the application of multi-agent simulation made the new model able to guide the investors’ operations in a real stock market. According to the theoretical proof, the comparison analysis and the simulation experiment, the new combination prediction model tends to be a powerful and applicable tool in making the investment decisions. © 2014, the authors.

Wang Z.,Beijing Institute of Information and Control | Wang Z.,Northwestern Polytechnical University
Proceedings of 2011 International Conference on Computer Science and Network Technology, ICCSNT 2011 | Year: 2011

Semantic network is the development direction of the world wide web, and it converts the traditional system and the abstract one-dimension table into the associations between semantics through ontology construction, one party for the separation of field data and operating data while the other party to provide new starting point for further researches on field data and business logic reuse. At present the remote education theory put forward the new demand for the management of knowledge base and business logic reuse. We also made progress in the study of the ontology construction, semantic database management and other areas, so it's up to date to achieve a remote education system prototype based on the semantic network. The thesis is about the development of OntoLearning remote education system prototype. OntoLearning is a remote education network system of multilayer based on Web layer, service layer, business application layer, integrated layer and resource layer. It is a main function module covering teaching, file management, objective establishment, and progress management of remote education system, of which the ontology through RDF language briefly describes the semantic relations of teaching management of each party. © 2011 IEEE.

Li Y.,Beijing Institute of Information and Control | Sun J.,Beijing Institute of Information and Control | Wang K.,Beijing Institute of Information and Control | Zheng A.,Beijing Institute of Information and Control
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

Evaluation and recommendation are different actions, but they are consistent in mining and using information efficiently and effectively to improve their persuasiveness and accuracy. From the view of information processing, the paper builds a two-dimensional graph model which expresses the relationships between evaluators and objects. This graph model reflects the original information of evaluation or recommendation systems and has its equivalent matrix form. Next, the principle of matrix projection can be applied to get the evaluation or recommendation vector by solving the matrix maximization problems. What's more, a rating data set of online move is selected to verify the model and method. In conclusion, from the example analysis, it is found that the proposed evaluation method is reasonable, and from the numerical experimental comparison, the proposed recommendation method is proved to be time-saving and more accurate than the generally adopted recommendation methods. © 2011 Springer-Verlag.

Li Y.,Harbin Institute of Technology | Wu C.,Harbin Institute of Technology | Wang X.,Harbin Institute of Technology | Wu S.,Beijing Institute of Information and Control
Knowledge-Based Systems | Year: 2013

Identifying short message services (SMSs) seed users helps to discover the information's originals and transmission paths. A tree-network model was proposed to depict the characteristics of SMS seed users who have such three features as "ahead of time", "mass texting" and "numerous retransmissions". For acquiring the established network model's width and depth, a clustering algorithm based on density was adopted and a recursion algorithm was designed to solve such problems. An objective, comprehensive and scale-free evaluation function was further presented to rank the potential seed users by using the width and the depth obtained above. Furthermore, the model's empirical analysis was made based on part of the Shenzhen's cell phone SMS data in February of 2012. The model is effective and applicable as a powerful tool to solve the SMS seed users' mining problem. © 2012 Published by Elsevier B.V. All rights reserved.

Teng M.,Beijing Institute of Information and Control | Teng M.,Bohai University | Zhu G.,CAS Academy of Mathematics and Systems Science
Journal of Intelligent Information Systems | Year: 2015

RDF (Resource Description Framework) data are more and more prevalent in the applications of semantic web and web data publication. The search over Web scale RDF data is essential for users to retrieve desired information from the huge RDF datasets, which typically applied as knowledge bases supporting many advanced information seeking tasks. In this paper, we propose some techniques that allow users to interactively search over the Web scale RDF data by using keywords as well as their predicates as additional constraints. We observe that the straightforward way of keyword search over the Web scale RDF data often generates a huge number of matching sub-structures (i.e., graphs containing the query keywords) due to the ambiguity of query intention generated from a small number of query keywords, although most of them are false interpretations of the query intention. To effectively interpret the semantics of queries, we define a novel keyword query called structure-aware keyword query that utilizes the predicates of RDF triples to assist users in clarifying their query intention. The challenge of such queries is to effectively and efficiently find a proper set of predicate-keyword pairs for query interpretation, to reduce the manual cost of user feedbacks as much as possible. To verify the novel query mechanism, we implement a system, and test it over the DBPedia 3.7 dataset. Results show that, for most queries, users can often efficiently get desired results by providing a small number of simple feedbacks on the constraints of predicates automatically generated. © 2014, Springer Science+Business Media New York.

Chen X.-M.,Dalian University of Technology | Gao C.,Beijing Institute of Information and Control
Kongzhi Lilun Yu Yingyong/Control Theory and Applications | Year: 2013

In nonparametric statistics, local polynomial regression is one of the most important tools. However, almost the previous work is based on nonrecursive algorithms. We investigate the recursive local linear regression estimation. The recursive algorithms are derived for the nonparametric estimation of the regression function and its derivative. Strong consistence of the estimates is established under reasonable conditions. The applications to estimation of the regression model with nonlinear conditional heteroskedasticity and identification of the nonlinear ARX (NARX) system are demonstrated by numerical simulation.

Liu H.,Xinyang Normal University | Yu J.,Beijing Institute of Information and Control | Zhu G.,CAS Academy of Mathematics and Systems Science
Journal of Systems Science and Complexity | Year: 2012

This paper discusses the application of a pulse vaccination strategy to prevent and control some infectious diseases, which is described by age-structured SIR model in which susceptible and recovered individuals are structured by chronological age, while infected individuals are structured by infection age (duration since infection). The time dependent disease-free equilibrium is determined, for which an explicit expression exists. The analytical results show that there exists a globally stable infection-free situation if the impulsive period T and proportion p satisfy R 0(p, T) < 1. Optimal problem is discussed: Pulse vaccination strategy with minimal costs at given R 0(p, T) < 1. © 2012 Institute of Systems Science, Academy of Mathematics and Systems Science, CAS and Springer-Verlag Berlin Heidelberg.

Teng M.,Beijing Institute of Information and Control | Ma D.,Renmin University of China | Du X.,Renmin University of China
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2015

Preference queries serve for retrieving a small set of tuples with top aggregated scores over multiple features, from a large set of tuples. We consider the problem of maintaining the ranking lists of items for preference queries in dynamic virtual environments, which is very useful for avatars in virtual environments to continuously monitor interesting items surrounding them. Traditional solutions on preference queries utilize the pre-computed materialized ranking lists to efficiently find top items by only retrieving a prefix of the ranking lists. However, for preference queries in virtual environments, items (tuples) to be ranked change frequently due to the movements and updates of avatars. Creating and maintaining materialized ranking lists in such dynamic scenarios will be extremely expensive. In this paper, we address the problem by proposing a solution as a marriage of continuous range query and continuous topk query. A preference query is continuously processed by dynamically adding and removing the perceived items of an avatar. Extensive experimental studies show that the proposed techniques are very efficient in handling the continuous updates of ranking lists. © Springer International Publishing Switzerland 2015.

Loading Beijing Institute of Information and Control collaborators
Loading Beijing Institute of Information and Control collaborators