Search results for: Xiaoyan Zhu
7 Almost Periodic Solution for a Food-limited Population Model with Delay and Feedback Control
Authors: Xiaoyan Dou, Yongkun Li
Abstract:
In this paper, we consider a food-limited population model with delay and feedback control. By applying the comparison theorem of the differential equation and constructing a suitable Lyapunov functional, sufficient conditions which guarantee the permanence and existence of a unique globally attractive positive almost periodic solution of the system are obtained.
Keywords: Almost periodic solution, food-limited population, feedback control, permanence.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19596 The Study on Evaluation System and Method of Legacy System
Authors: Chao Qi, Fuyang Peng, Bo Deng, Xiaoyan Su
Abstract:
In the upgrade process of enterprise information systems, how to deal with and utilize those legacy systems affects the efficiency of construction and development of the new system. We propose an evaluation system, which comprehensively describes the capacity of legacy information systems in five aspects. Then we propose a practical legacy systems evaluation method. Base on the evaluation result, we can determine the current state of legacy system which was evaluated.Keywords: Legacy Information Systems, Evaluation IndexSystem, Evaluation Method, Evaluation Level
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16195 The Application of the Queuing Theory in the Traffic Flow of Intersection
Authors: Shuguo Yang, Xiaoyan Yang
Abstract:
It is practically significant to research the traffic flow of intersection because the capacity of intersection affects the efficiency of highway network directly. This paper analyzes the traffic conditions of an intersection in certain urban by the methods of queuing theory and statistical experiment, sets up a corresponding mathematical model and compares it with the actual values. The result shows that queuing theory is applied in the study of intersection traffic flow and it can provide references for the other similar designs.
Keywords: Intersection, Queuing theory, Statistical experiment, System metrics.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 75424 The Study on Migration Strategy of Legacy System
Authors: Chao Qi, Fuyang Peng, Bo Deng, Xiaoyan Su
Abstract:
In the upgrade process of enterprise information systems, whether new systems will be success and their development will be efficient, depends on how to deal with and utilize those legacy systems. We propose an evaluation system, which comprehensively describes the capacity of legacy information systems in five aspects. Then a practical legacy systems evaluation method is scripted. Base on the evaluation result, we put forward 4 kinds of migration strategy: eliminated, maintenance, modification, encapsulating. The methods and strategies play important roles in practice.Keywords: Legacy Systems, Evaluation Method, Migration Strategy.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17123 The Study on Service-oriented Encapsulating Methods of Legacy Systems
Authors: Chao Qi, Xiaoyan Su, Zhan Mao, Xuan Qi
Abstract:
At present, web Service is the first choice to reuse the legacy system for the implementation of SOA. According to the status of the implementation of SOA and the status of the legacy systems, we propose four encapsulating strategies. Base on the strategies, we proposal the service-oriented encapsulating framework, the legacy system can be encapsulated by the service-oriented encapsulating layer in three aspects, communication protocols, data and program. The reuse rate of the legacy systems can be increased by using this frameworkKeywords: Legacy system, service-oriented encapsulating, SOA.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15622 Margin-Based Feed-Forward Neural Network Classifiers
Authors: Han Xiao, Xiaoyan Zhu
Abstract:
Margin-Based Principle has been proposed for a long time, it has been proved that this principle could reduce the structural risk and improve the performance in both theoretical and practical aspects. Meanwhile, feed-forward neural network is a traditional classifier, which is very hot at present with a deeper architecture. However, the training algorithm of feed-forward neural network is developed and generated from Widrow-Hoff Principle that means to minimize the squared error. In this paper, we propose a new training algorithm for feed-forward neural networks based on Margin-Based Principle, which could effectively promote the accuracy and generalization ability of neural network classifiers with less labelled samples and flexible network. We have conducted experiments on four UCI open datasets and achieved good results as expected. In conclusion, our model could handle more sparse labelled and more high-dimension dataset in a high accuracy while modification from old ANN method to our method is easy and almost free of work.Keywords: Max-Margin Principle, Feed-Forward Neural Network, Classifier.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17251 Constant Factor Approximation Algorithm for p-Median Network Design Problem with Multiple Cable Types
Authors: Chaghoub Soraya, Zhang Xiaoyan
Abstract:
This research presents the first constant approximation algorithm to the p-median network design problem with multiple cable types. This problem was addressed with a single cable type and there is a bifactor approximation algorithm for the problem. To the best of our knowledge, the algorithm proposed in this paper is the first constant approximation algorithm for the p-median network design with multiple cable types. The addressed problem is a combination of two well studied problems which are p-median problem and network design problem. The introduced algorithm is a random sampling approximation algorithm of constant factor which is conceived by using some random sampling techniques form the literature. It is based on a redistribution Lemma from the literature and a steiner tree problem as a subproblem. This algorithm is simple, and it relies on the notions of random sampling and probability. The proposed approach gives an approximation solution with one constant ratio without violating any of the constraints, in contrast to the one proposed in the literature. This paper provides a (21 + 2)-approximation algorithm for the p-median network design problem with multiple cable types using random sampling techniques.Keywords: Approximation algorithms, buy-at-bulk, combinatorial optimization, network design, p-median.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 595