# The Aggregation Mechanism Mining of Passengers' Flow with Period Distribution Based on Suburban Rail Lines.

1. IntroductionThe success of urbanization in China has also brought some problems as follows: urban traffic congestion in megacities is becoming more and more serious, and the focus of urban life is shifting to suburbs, and the passenger flow between suburbs increases. The passenger flow of the rail transit has a great change that is difficult to predict, resulting in increased difficulty of passenger organization; large passenger flow stranded will lead to major safety issues; for example, the serious trampling accident in Chen Yi Square in Shanghai Bund on New Year's Day of 2015 was a security alarm. By means of big data theory analysis and advanced data mining technology, the study on the aggregation rule of rail passenger flow at the station can obtain the characteristics of passenger flow at different stations and different means in time and help the operators adjust the driving schedule in time and provide decision-making basis for daily transportation dispatching.

In many passenger travel distribution models, the gravity model and the growth coefficient method are widely used. In 1940, Stouffer first proposed the interventional opportunity model. In 1955, Casey proposed a gravity model, which was subsequently interpreted NT in terms of maximum entropy and maximum likelihood. In 1965, Fumess proposed the well-known growth coefficient method. Subsequently, the linear regression model was brought into use in traffic planning to predict travel occurrence and attractiveness in the United States. At the end of 1960, the British scholars put forward a cross-classification method; on this basis, Gordon proposed a nonfamily travel model [1]. Yam et al. developed a special model to predict official travel [2]. Bowman and Ben-Akiva established a model to predict the travel occurrence from the traveler's activities as the starting point [3]. These foreign scholars made a more in-depth study in the passenger flow prediction and distribution models, which laid a theoretical basis. In recent years, many studies have been conducted in China: Xiaoguang proposed a polynomial distribution lagging model for short-term traffic flow forecasting, which gave overall considerations to factors impacting on the traffic state time series except its own lagging term, and the model calculation is more accurate [4]. Enjian analyzed the theoretical flaws in the traditional disaggregated models and constructed an OD distribution forecasting model based on aggregated data [5]. On the joint model of OD distribution and path selection, Professor Peng used the extrapolation method on parameter calibration because of the lack of survey results on destination selection, which resulted in the separation of two phases and affected the prediction accuracy of the model [6]. A short-term passenger flow OD estimation model based on the state space method was proposed, and the accuracy of the prediction results is improved [7]. In the OD matrix, the objective function was estimated by using the generalized least square model as the OD matrix, and the corresponding solving process using the Lagrangian algorithm was given. However, the accuracy of back stepping results was barely satisfactory [8, 9]. A multiobjective mathematical model was proposed to address a situation in which several projects are candidate to be invested completely or partially. The computational results were compared with solutions obtained by NSGA-II algorithm [10]. A multiobjective model for relief resources distribution facilities under an uncertain condition is investigated in two ways of demand satisfaction by considering the relief resources accessibility and demand satisfaction in a fuzzy logic. To solve the problem and to do the sensitivity analysis, the NSGA-II algorithm was presented. A constraint method was also proposed to evaluate the performance of the proposed algorithm [11].

The above research results have not been studied deep in the mass data preprocessing, and there have still been no supplementary mechanisms for coping with lack of data field value and so on. The application of passenger data mainly focuses on the calibration of model parameters. If we can carry on the fine pretreatment and the missing supplement to the passenger flow data, and on this basis, we explore deeper to probe the station time aggregation mechanism of passengers, which will provide the data support for the optimization of the scheme. Based on the passenger flow data of AFC inbound and outbound traffic from the operators, this paper studies the information tracking based on passengers' transportation card numbers and travel time and calculates the travel time of passengers by combining relevant time parameter data, so as to construct the model of mining passenger aggregation mechanism. It is of great help on train operating plan making and temporary adjustment and can provide theoretical and methodic references for supplementation of passenger flow forecasting and emergency relief model.

2. Urban Rail Transit Passenger Flow Data Cleaning and Processing

After many years of operation, the rail transportation enterprise has accumulated a great deal of operation-related data, and the Oracle database has a large capacity, and because of not-so-reasonable design of fields, stored procedures, data rules, and paradigms in the early stage of database construction, the stored operational data contains redundancy or error that not only occupies a lot of storage space and causes a waste of storage resources but also greatly reduces the effectiveness of data analysis and stability. Therefore, for abnormal data identification, missing data complement, error data correction, redundant data cleaning, and so on [12], big data analysis and processing methods are of great significance.

Data redundancy, missing data, and nonstandard quality problems will have a fatal impact on big data application, so there is a need for cleaning big data having quality problems. You can use the parallel technology to achieve high scalability of big data cleaning. However, due to the lack of effective design, common data cleaning methods based on MapReduce have redundant computation, which leads to the performance degradation' To optimize the data cleaning to improve the efficiency of cleaning operations may start from the process shown in Figure 1 to design the optimization process.

In the data generated by the rail transit operation, some are filled in by hand, some are automatically generated by the machine, and some are inevitably missed. For this reason, a missing value filling mechanism based on naive Bayesian classification is proposed. See Figure 2 for the basic process:

P([C.sub.i] | X) = P(X | [C.sub.i]) x P([C.sub.i]) / P (X). (1)

P([C.sub.i] | X) means that when incident X occurs, the probability of incident [C.sub.i] occurs, P(X | [C.sub.i]) means that when incident [C.sub.i] occurs, the probability of incident X occurs, P([C.sub.i]) means the probability of incident [C.sub.i], and P(X) means the probability of incident X.

(1) Parameter Estimation. The entire missing value is populated with the value of the maximum probability as the filling value calculated by Bayesian classification [13]. The task of the parameter estimation module is to calculate all the probabilities using (1), where all values of P(X) are constant, so only the calculation of P(X | [C.sub.i]) x P([C.sub.i]) is needed. If the prior probability of missing values is unknown, then it can be assumed to be equal probability, and P(X | [C.sub.i]) can be calculated using

P(X | [C.sub.i]) = P([X.sub.1] | [C.sub.i]) x P([X.sub.2] | [C.sub.i]) x ... x P([X.sub.n] | [C.sub.i]). (2)

P(X | [C.sub.i]) means that when incident [C.sub.i] occurs, the probability of incident X occurs, P([X.sub.1] | [C.sub.i]) means that when incident [C.sub.i] occurs, the probability of incident [X.sub.1] occurs, ..., P([X.sub.n] | [C.sub.i]) means that when incident [C.sub.i] occurs, the probability of incident [X.sub.n] occurs.

So the entire parameter estimation module is used to calculate the probability P(X | [C.sub.i]) of each value of all attributes.

From the perspective of probability theory, when the sample space is large enough, the probability can be approximately equivalent to that of the frequency, and the system uses frequency of occurrence of each attribute value in tuples without missing values to calculate probability P([X.sub.n] | [C.sub.i]).

(2) Connection Module. According to (2), the probability of various values to be filled in the tuples containing missing values that are determined by its dependency attribute value can be calculated. However, since MapReduce can only process one record at a time in the Map phase and Reduce phase, the system must make the dependency attribute value and its conditional probability correlate; this is existence necessity and the problem to be solved of the connection module. The input data of the connection module is the output data of the parameter estimation module and the original data to be filled. The output data is the file correlating the dependent attribute values in the tuples containing the missing data with the conditional probability of the values.

(3) Filling Module. The filling module is implemented with MapReduce. First, the output result and the original input data of the connection module are subject to connective operation with offset as the key. The Map phase is similar to the connection module. The Reduce phase uses (2) to calculate the conditional probability corresponding to each [C.sub.i] (a possible value of an attribute to be filled) and select [C.sub.i] with the maximum P([C.sub.i] | X) probability for filling the missing value.

3. The [Time_cluster.sup.m,n.sub.k] Model of Aggregation Mechanism Mining

When the database is changed, the fuzzy frequent attribute set may not be frequent in the updated database. In this paper, the definition of negative bounds of the fuzzy frequent attribute sets is proposed for the fuzzy sets of the fuzzy frequent attribute set, the negative boundary, and the fuzzy attribute set in the original database and used for mining the time passenger flow.

3.1. Mining Association Rules of Passenger Flow Time Series in Rail Transit. In fuzzy discretization of time series, set the time series S = ([x.sub.1], [x.sub.2], [x.sub.3], ..., [x.sub.n]), the time window of the width w acts on the subsequence [S.sub.i] = ([x.sub.1], [x.sub.2], ..., [x.sub.i+w-1]) formed by S, and a series of subsequences [x.sub.1], [x.sub.2], [x.sub.3], ..., [x.sub.n-w+1] of the width w is formed by single-step slip

W(s,w) = {[S.sub.i] | i = 1, 2, ..., n - w + 1}. (3)

W(s, w) is regarded as n - w + 1 points in w Euclidean space, randomly assigned to the class k, to calculate each type of center as a representative of each category and the elements [S.sub.i] i = 1, 2, ..., n - w + 1 of the set W(s, w), and the membership attribute function [u.sub.j]([S.sub.i]) belonging to the class - j representatives is

[u.sub.j] ([S.sub.i]) = [(1 / [[parallel][s.sub.i] - [x.sub.j][parallel].sup.2]).sup.1/(b-1)] / [[summation].sup.k.sub.c=1] [(1 / [parallel][s.sub.i] - [x.sub.c][parallel]).sup.2] j = 1, 2, ..., k; b > 1, (4)

where b > i denotes a constant that controls the fuzzy degree of the clustering results. [[parallel][s.sub.i] - [x.sub.j][parallel].sup.2] represents the square of the distance from each point to the representative point of the class j.

In the calculation of the support, if A occurs, B occurs in time T; that is, we need to determine the frequency of occurrence of A:

F(A) = [n-w+1.summation over (i=1)] [u.sub.A]([S.sub.i]), (5)

where [u.sub.A]([S.sub.i]) is the membership of point [S.sub.i] belonging to the Ath representative attribute.

The support c of the correlation rule [mathematical expression not reproducible] denotes frequency of occurrence of B in time T after A happens, with reference to the C-means method of the rule [mathematical expression not reproducible]

C([B.sub.T] : A) = p(A) x {p ([B.sub.T] | A) log p([B.sub.T] | A) / p ([B.sub.T]) + [1 - p([B.sub.T] | A)] log 1 - p ([B.sub.T] | A) / 1 - p ([B.sub.T])}, (6)

where p(A) denotes probability of occurrence of the rule in A, p([B.sub.T] | A) represents occurrence forms of B in time T after A occurs, and the right side of (5) represents the information acquisition process from a priori probability p([B.sub.T]) to posteriori probability p([B.sub.T] | A).

3.2. Mining of Temporal Passenger Flow OD Pairs Based on the Support of Correlation Rules. By preprocessing the AFC passenger flow data of the rail transit stations, the obtained data have been more accurate and in accord with the data format and redundancy requirement of the application data mining tools. The main algorithm is used to explore temporal aggregation correlation rules for passenger data for the purpose of mining the temporal passenger flow and the passenger flow OD pairs with traffic card numbers as the major cord and the designed algorithm is shown as follows.

Step 1. Calculate [u.sub.A]([S.sub.i]) first and then [mathematical expression not reproducible] according to the support of passenger flow of the rail transit, and set minsupport = [mathematical expression not reproducible].

Step 2. Initialize AFC passenger flow database according to the mining condition with the cleaned and preprocessed data as initial data for correlation rule mining, scanning the transaction database [T.sub.ID], and finding all the item sets whose length is k = 1, forming candidate 1-item set([C.sub.1]), substituting [C.sub.1] into (5) and (6), and calculating the support of each item, comparing with the minimum support one by one, and forming the frequent 1-item set if the support is greater than the minsupport.

Step 3. Generate candidate (k + 1) item set [C.sub.k+1] according to the frequent k-item set, if [C.sub.k+1] [not equal to] [PHI], go to the next step; otherwise the loop ends.

Step 4. Scan the database to calculate and determine the support for each candidate item set.

Step 5. Delete candidate items with the support smaller than minsupport, forming a frequent item set [L.sub.k+1] of the (k + 1) item.

Step 6. k = k + 1, go to Step 3.

Step 7. This results in the frequent item set correlation rules of temporal passenger flow aggregation.

Step 8. Output 2-hour particle size of the temporal passenger flow aggregation and the results of OD pairs to guide the preparation and adjustment of rail transit operation plans.

4. Case Study and Analysis

4.1. Cleaning and Missing Filling of Passenger Flow Data. Passenger flow data of this paper comes from the AFC gate of Shanghai Rail Transit Line 9, and passenger flow period covers 6:00-22:00. The main data field includes card number, arrival time, inbound station, departure time, outbound station, P + R (the indication if the P + R parking lots is used), and total time (travel time), many of which are redundant data such as fare evasion, transportation card lost, and other reasons that resulted in the invalid data, and some raw data are shown as Table 1.

From the original data we can see that some data fields are missing, especially the fields that have to be filled; the data cleaning and filling method designed in Section 2 is used to deal with the original data to facilitate data mining.

In order to fill the loss values of the original data, substituting (2) into (1) yields

P([C.sub.i] | X) = P (X | [C.sub.i]) = P([X.sub.1] | [C.sub.i]) x P([X.sub.2] | [C.sub.i]) x ... x P ([X.sub.n] | [C.sub.i]) x P ([C.sub.i]) / P (X). (7)

Based on the card number field value of AFC data, travel times and the OD percentage of each passenger are collected and retrieved by SQL statement and substituted into (7), and through parameter estimation, connection, filling, and other modules, supplementing the original data yields results of Table 2.

4.2. Mining of Passenger Flow Period Aggregation. According to the time series discretization design in Section 3.1, the passenger flow period is divided according to the 2-hour particle size, and single-step slip forms a series of time series S = ([x.sub.1], [x.sub.2], [x.sub.3], ..., [x.sub.n]) with width of 2.

Calculating W(s, w) = {S; | i = 1, 2, ..., n - w + 1} and the membership function [u.sub.j]([S.sub.i]) = [(1/[[parallel][s.sub.i] - [x.sub.i][parallel].sup.2]).sup.1/(n-1)] / [[summation].sup.k.sub.c=1][(1/[parallel][s.sub.i] - [x.sub.c][parallel]).sup.2] j = 1, 2, ..., k; b > 1 obtains the membership of station passenger flow aggregation of every 2-hour particle size.

Passenger flow period covers 6:00 to 20:00 and is divided as 2-hour particle size into 6:00-8:00, 8:00-10:00, 10:00-12:00, 12:00-14:00, 14:00-16:00, 16:00-18:00, 18:00-20:00, and 20:00-22:00, and membership [u.sub.j]([S.sub.i]), calculation of support C(A - B), and passenger flow of each period are shown in Table 3.

The above-mentioned mining algorithm can be used to calculate 2-hour particle size period passenger flow of the Shanghai Metro Line 9: Guilin Road, Caohejing Development Zone, Hechuan Road, Xingzhong Road, Qibao, Zhongchun Road, Jiuting, Sijing, Sheshan, Dongjing, Da Xue Cheng Station. The results are shown in Table 4.

Figure 3 shows the change trend of distribution time data. It can show the passenger flow distribution of the stations in the 2-hour particle size range visually. The distribution of the passenger flow can guide the operation directly.

The mining results in Table 4 can provide the data support for the travel rush hour of the passengers and traffic adjustment scheme of the rail transit station, so that the train capacity can be matched with the passenger flow, and the passengers are quickly distributed to the road network. It can also provide data support for the determination of the speed ratio of express/slow trains of the subway lines of the rail transit. The ratio of the express/slow trains can be determined according to the temporal passenger flow, thus saving energy consumption and passenger travel time.

4.3. Mining of Passenger Flow OD Pairs Based on Correlation

Rules. According to Section 3.2, [mathematical expression not reproducible] of the OD pairs of each traffic card number and compared with minsupport = [mathematical expression not reproducible], the pairs with values higher than it are determined as the OD pairs. The mining results are shown in Table 5. The mining results can provide accurate decision-making support for the determination of the arrival scheme of the express trains in the express/slow mode.

It can be seen from Table 5 that if we can combine the travel time of passengers to mine the OD pairs, it can provide more elaborated decision support for the optimization of the express/slow train program. To a certain extent, the accessibility of passenger travel is increased; especially in the peak commuting, accessibility is particularly important to reduce the unnecessary transfer, and transfer passenger flow in the road network is relatively reduced.

5. Conclusions

Suburban rail transport passenger transport organization problems have troubled operation and management enterprises over years. Passenger transport organizations are involved in key indicators such as the temporal passenger flow, passenger OD, and speed car ratio of the express/slow trains. Passenger flow data of the rail transit are complicated in structure, in which redundancy and missing coexist. In this paper, we use the big data processing method to purify and supplement the original data and then explore the time distribution rule and the OD pairs of the passenger flow in depth. The passenger flow AFC data of Shanghai Rail Transit Line 9 are taken as inputs and are revised, supplemented, and mined to give out the time distribution characteristics of the passenger flow of Line 9 in the end and verify the feasibility of the method. In the future, the time distribution rule and OD pairs of passenger flow under the network condition will be mined in order to guide the establishment of the operation plan of the whole road network.

https://doi.org/10.1155/2017/3819304

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

The research described in this paper was supported by the National Natural Science Foundation of China (Grant no. 71601110), the National Key Research and Development Plan of China (Grant no. 2016YFC0802505), and the National Key Technologies R&D Program of China (Grant no. 2015BAG19B02-28). The authors also gratefully acknowledge those who provided data and suggestions.

References

[1] W. Gordon, "Improved modeling of non-home-base trips," Transportation Research Record, pp. 23-25, 1996.

[2] R. C. M. Yam, R. C. Whitfield, and R. W. F. Chung, "Forecasting traffic generation in public housing estates," Journal of Transportation Engineering, vol. 126, no. 4, pp. 358-361, 2000.

[3] J. L. Bowman and M. E. Ben-Akiva, "Activity-based disaggregate travel demand model system with activity schedules," Transportation Research A: Policy and Practice, vol. 35, no. 1, pp. 1-28, 2001.

[4] Y. Xiaoguang, "Multinomial distribution lagging model used for short-term traffic flow prediction," Journal of Tongji University, vol. 39, no. 9, pp. 1297-1302, 2011.

[5] Y. Enjian, Study on Urban Rail Transit OD Distribution Prediction Models under Networking Condition [D], Beijing Jiaotong University, 2013.

[6] Z. Peng, "Urban rail transit network short-term passenger flow OD estimation model," The Journal of Traffic Systems Engineering and Information Technology, vol. 15, no. 2, pp. 149-155, 2015.

[7] C. Xiaohong, "Study on rail transit passenger flow dynamic OD matrix estimation methods," The Journal of Tongji University, vol. 24, no. 12, pp. 56-72, 2010.

[8] A. Jamili, M. A. Shafia, S. J. Sadjadi, and R. Tavakkoli-Moghaddam, "Solving a periodic single-track train timetabling problem by an efficient hybrid algorithm," Engineering Applications of Artificial Intelligence, vol. 25, no. 4, pp. 793-800, 2012.

[9] M. T. Isaai, A. Kanani, M. Tootoonchi, and H. R. Afzali, "Intelligent timetable evaluation using fuzzy AHP," Expert Systems with Applications, vol. 38, no. 4, pp. 3718-3723, 2011.

[10] A. Ceder, "Public-transport automated timetables using even headway and even passenger load concepts," in Proceedings of the 32nd Australasian Transport Research Forum (ATRF '09), 17, 1 pages, Auckland, New Zealand, October 2009.

[11] A. Nuzzolo, U. Crisalli, and L. Rosati, "A schedule-based assignment model with explicit capacity constraints for congested transit networks," Transportation Research Part C: Emerging Technologies, vol. 20, no. 1, pp. 16-33, 2012.

[12] M. Carey and I. Crawford, "Scheduling trains on a network of busy complex stations," Transportation Research B: Methodological, vol. 41, no. 2, pp. 159-178, 2007.

[13] V. Guihaire and J. K. Hao, "Transit network design and scheduling: a global review," Transportation Research A: Policy and Practice, vol. 42, no. 10, pp. 1251-1273, 2008.

Xiaobing Ding, Hua Hu, Zhigang Liu, and Haiyan Zhu

College of Urban Rail Transportation, Shanghai University of Engineering Science, Shanghai 201620, China

Correspondence should be addressed to Xiaobing Ding; dxbsuda@163.com

Received 31 December 2016; Revised 21 March 2017; Accepted 8 May 2017; Published 22 June 2017

Academic Editor: Seenith Sivasundaram

Caption: Figure 1: The flowchart of data cleaning and preprocessing.

Caption: Figure 2: The flowchart of missing value filling.

Caption: Figure 3: The aggregation passenger flow based on distribution time.

Table 1: The AFC passenger flow data of Shanghai Metro Line 16 (original). Card number Arrival time Inbound station Departure time U12452172127 09:12 Jiuting 09:43 U07452172874 05:58 University Town 06:49 U31842254712 06:58 University Town 07:28 U12452172127 08:31 Jiuting 09:03 U07452172874 06:21 University Town 07:23 U31842254712 06:24 University Town 07:28 U07452172874 16:46 Zhaojiabang Rd. 17:51 U07452172874 17:02 Xujiahui Card number Outbound station P + R Total time (minute) U12452172127 Xujiahui 31 U07452172874 Zhaojiabang Positive U31842254712 Yishan Rd. Positive U12452172127 Xujiahui U07452172874 Zhaojiabang Positive U31842254712 Yishan Rd. Positive 30 U07452172874 University Town Positive U07452172874 30 Table 2: The AFC passenger flow data of Shanghai Metro Line 16 (supplementary and correction). Card number Arrival time Inbound station Departure time U12452172127 09:12 Jiuting 09:43 U07452172874 05:58 University Town 06:49 U31842254712 06:58 University Town 07:28 U12452172127 08:31 Jiuting 09:03 U07452172874 06:21 University Town 07:10 U31842254712 06:24 University Town 07:28 U07452172874 16:46 Zhaojiabang Rd. 17:32 U07452172874 17:02 Xujiahui 17:48 Card number Outbound station P+R Total time (minute) U12452172127 Xujiahui Negative 31 U07452172874 Zhaojiabang Rd. Positive 51 U31842254712 Yishan Rd. Negative 30 U12452172127 Xujiahui Negative 32 U07452172874 Zhaojiabang Rd. Positive 41 U31842254712 Yishan Rd. Positive 30 U07452172874 University Town Positive 46 U07452172874 University Town Positive 30 Table 3: Characteristic values of 2-hour particle size of Da Xue Cheng Station. Class Time series Membership Calculation of Passenger [u.sub.j]([S.sub.i]) support C(A - B) flow 6:00-8:00 0.85 0.90 47,804 8:01-10:00 0.74 0.86 31,012 10:01-12:00 0.91 0.84 11,430 12:01-14:00 0.90 0.80 9,010 14:01-16:00 0.89 0.84 13,014 16:01-18:00 0.82 0.81 30,254 18:01-20:00 0.69 0.83 30,147 20:01-22:00 0.92 0.84 29,874 Table 4: The aggregation passenger flow based on distribution time. Station Time range St1 St2 St3 St4 St5 St6 6:01-8:00 7,031 6,031 9,214 15,274 22,215 14721 8:01-10:00 12,031 13,031 8,610 11,201 20,203 6,321 10:01-12:00 10,574 7,574 7,141 9,845 6,201 5014 12:01-14:00 9,414 3,414 6,573 9,216 5,845 4782 14:01-16:00 9,018 10,034 5,362 8,142 9,216 3587 16:01-18:00 8,124 8,124 5,217 9,345 13,201 8721 18:01-20:00 10,250 22,230 6,057 9,714 9,231 6321 20:01-22:00 9,217 13,217 5,325 8,521 7,227 5014 Station Time range St7 St8 St9 St10 St11 6:01-8:00 16,014 8,721 10,721 30,264 28,214 8:01-10:00 11,782 6,321 9,843 19,721 18,734 10:01-12:00 9,487 7,034 7,123 10,351 16,321 12:01-14:00 5,014 6,791 8,787 9,014 10,024 14:01-16:00 6,571 8,482 5,591 7,782 9,789 16:01-18:00 20,362 6,217 10,258 9,587 8,137 18:01-20:00 18,217 9,354 9,239 8,214 10,354 20:01-22:00 9,057 8,242 8,427 9,241 9,792 Table 5: The mining of passengers' travel OD pair rule (upward direction). Card number O D P + R U12452172127 Jiuting Xujiahui Negative U07452172874 Songjiang University Town Zhaojiabang Rd. Positive U31842254712 Songjiang University Town Yishan Rd. Positive U01552172876 Songjiang New Town Qibao Positive U07452172874 Songjiang New Town Yishan Rd. Positive U12452376572 Songjiang Sports Center Century Ave. Negative U06571172546 Dongjing Century Ave. Negative U318745684324 Sheshan Xujiahui Negative U01555476158 Qibao Century Ave. Negative U15478475786 Jiuting Century Ave. Negative

Printer friendly Cite/link Email Feedback | |

Title Annotation: | Research Article |
---|---|

Author: | Ding, Xiaobing; Hu, Hua; Liu, Zhigang; Zhu, Haiyan |

Publication: | Discrete Dynamics in Nature and Society |

Article Type: | Report |

Geographic Code: | 9CHIN |

Date: | Jan 1, 2017 |

Words: | 4584 |

Previous Article: | A Parameter Estimation Method for Nonlinear Systems Based on Improved Boundary Chicken Swarm Optimization. |

Next Article: | A Nonhomogeneous Dirichlet Problem for a Nonlinear Pseudoparabolic Equation Arising in the Flow of Second-Grade Fluid. |

Topics: |