基于多策略搜索的出租车服务仿真模型

为更细致、精确地描述出租车服务规律,提出一种依据历史信息和路网供求信息模拟出租车空车搜索行为的动态仿真模型,出租车根据以往的驾驶经验和对路网供求信息的掌握程度决定空车时如何寻找新乘客.仿真结果表明,向出租车提供路网供求信息不能有效提高出租车的空车效率,但有助于缩短乘客平均等待时间;依据平均历史信息的搜索策略能够有效提高空车效率.模型有助于城市交通管理部门更有效地规划和管理出租车运营系统,为其决策提供参考依据.     

High efficient moving object extraction and classification in traffic video surveillance

Moving object extraction and classification are important problems in automated video surveillance systems. A background model based on region segmentation is proposed. An adaptive single Gaussian background model is used in the stable region with gradual changes, and a nonparametric model is used in the variable region with jumping changes. A generalized agglomerative scheme is used to merge the pixels in the variable region and fill in the small interspaces. A two-threshold sequential algorithmic scheme is used to group the background samples of the variable region into distinct Gaussian distributions to accelerate the kernel density computation speed of the nonparametric model. In the feature-based object classification phase, the surveillance scene is first partitioned according to the road boundaries of different traffic directions and then re-segmented according to their scene localities. The method improves the discriminability of the features in each partition. AdaBoost method is applied to evaluate the relative importance of the features in each partition respectively and distinguish whether an object is a vehicle, a single human, a human group, or a bike. Experimental results show that the proposed method achieves higher performance in comparison with the existing method.     

Spiking neural P systems with anti-spikes and without annihilating priority as number acceptors

Spiking neural P systems with anti-spikes （ASN P systems） are variant forms of spiking neural P systems, which are inspired by inhibitory impulses/spikes or inhibitory synapses. The typical feature of ASN P systems is when a neuron contains both spikes and anti-spikes, spikes and anti-spikes wil immediately annihilate each other in a maximal way. In this paper, a restricted variant of ASN P systems, cal ed ASN P systems without anni-hilating priority, is considered, where the annihilating rule is used as the standard rule, i.e., it is not obligatory to use in the neuron associated with both spikes and anti-spikes. If the annihilating rule is used in a neuron, the annihilation wil consume one time unit. As a result, such systems using two categories of spiking rules （identified by （a, a） and （a,a^-）） can achieve Turing completeness as number accepting devices.     

Memetic algorithm for multi-mode resource-constrained project scheduling problems

A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.     

The distributed representation for societal risk classification toward BBS posts

The risk classification of BBS posts is important to the evaluation of societal risk level within a period. Using the posts collected from Tianya forum as the data source, the authors adopted the societal risk indicators from socio psychology, and conduct document-level multiple societal risk classification of BBS posts. To effectively capture the semantics and word order of documents, a shallow neural network as Paragraph Vector is applied to realize the distributed vector representations of the posts in the vector space. Based on the document vectors, the authors apply one classification method KNN to identify the societal risk category of the posts. The experimental results reveal that paragraph vector in document-level societal risk classification achieves much faster training speed and at least 10% improvements of F-measures than Bag-of-Words. Furthermore, the performance of paragraph vector is also superior to edit distance and Lucene-based search method. The present work is the first attempt of combining document embedding method with socio psychology research results to public opinions area.     

Maximum likelihood estimator of the parameter for a continuous one-parameter exponential family under the optimal ranked set sampling

This paper studies a maximum likelihood estimator (MLE) of the parameter for a continuous one-parameter exponential family under ranked set sampling (RSS). The authors first find the optimal RSS according to the character of the family, viz, arrange the RSS based on quasi complete and sufficient statistic of independent and identically distributed (iid) samples. Then under this RSS, some sufficient conditions for the existence and uniqueness of the MLE, which are easily used in practice, are obtained. Using these conditions, the existence and uniqueness of the MLEs of the parameters for some usual distributions in this family are proved. Numerical simulations for these distributions fully support the result from the above two step optimizations of the sampling and the estimation method.     

Some open problems related to creative telescoping

Creative telescoping is the method of choice for obtaining information about definite sums or integrals. It has been intensively studied since the early 1990s, and can now be considered as a classical technique in computer algebra. At the same time, it is still a subject of ongoing research. This paper presents a selection of open problems in this context. The authors would be curious to hear about any substantial progress on any of these problems.     

THE λ-GROBNER BASES UNDER POLYNOMIAL COMPOSITION

Polynomial composition is the operation of replacing variables in a polynomial with other polynomials. λ-Grgbner basis is an especial Grobner basis. The main problem in the paper is： when does composition commute with λ-Grobner basis computation？ We shall answer better the above question. This has a natural application in the computation of λ-Grobner bases.