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.     

Bell state preparation based on switching between quantum system models

For the preparation of any target Bell state under continuous quantum measurement, this paper proposes a method which achieves the control objective by switching between two different models or by switching between two control channels under one model. Proper control Hamiltonians are selected for the two system models, a switching strategy between the two models is designed, and the stability of the whole switching system is proved in theory. For a given target Bell state, the effectiveness of the proposed switching control strategy between different models is illustrated through simulation experiments.     

Positive observer design for positive Markovian jump systems with partly known transition rates

The paper is concerned with positive observer design for positive Markovian jump systems with partly known transition rates. By applying a linear co-positive type Lyapunov-Krasovskii function, a sufficient condition is proposed to ensure the stochastic stability of the error positive system and the existence of the positive observer, which is computed in linear programming. Finally, an example is given to demonstrate the validity of the main results.     

Fairness of extra-gain guilty in performance of supply chain and contract design

Considering a one-supplier and two-retailer supply chain setting in which the supplier makes contacts with retailers in sequence based on FCFS(first–come–first-service) principle, the authors investigate the marginal effect of extra-gain guilty fairness concerns of supply chain members on the contract design, supply chain's profit and profit distribution. When the supplier considers distributional fairness of loss aversion and extra-gain guilty, extra-gain guilty concern reduces the optimal wholesale and retail price, and improves supply chain performance. When the first or the second retailer considers distributional fairness and peer-induced fairness, extra-gain guilty concerns decrease the optimal wholesale and retail price but increase the profit of all supply chain members only when the level of loss aversion is large enough and the level of extra-gain guilty is less than 1/2. However, when the level of loss aversion is small and the level of extra-gain guilty is less than 1/2, extra-gain guilty has no influence on supply chain performance. The analysis reveals that the supply chain performance can be further improved by considering fairness of extra-gain guilty.     

The generalized Serre problem over <Emphasis Type="Italic">K</Emphasis>-Hermite rings

This paper investigates the completion and the zero prime factorization for matrices over a K-Hermite ring. The authors have generalized Kaplansky’s related results, solved similar Lin-Bose problem and generalized Serre problem over a K-Hermite ring.     

Performance comparison of distributed state estimation algorithms for power systems

A newly proposed distributed dynamic state estimation algorithm based on the maximum a posteriori (MAP) technique is generalised and studied for power systems. The system model involves linear time-varying load dynamics and nonlinear measurements. The main contribution of this paper is to compare the performance and feasibility of this distributed algorithm with several existing distributed state estimation algorithms in the literature. Simulations are tested on the IEEE 39-bus and 118-bus systems under various operating conditions. The results show that this distributed algorithm performs better than distributed quasi-steady state estimation algorithms which do not use the load dynamic model. The results also show that the performance of this distributed method is very close to that by the centralized state estimation method. The merits of this algorithm over the centralized method lie in its low computational complexity and low communication load. Hence, the analysis supports the efficiency and benefits of the distributed algorithm in applications to large-scale power systems.     

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.     

Robust output regulation problem for discrete-time linear systems with both input and communication delays

Recently, the robust output regulation problem for continuous-time linear systems with both input and communication time-delays was studied. This paper will further present the results on the robust output regulation problem for discrete-time linear systems with input and communication delays. The motivation of this paper comes from two aspects. First, it is known that the solvability of the output regulation problem for linear systems is dictated by two matrix equations. While, for delay-free systems, these two matrix equations are same for both continuous-time systems and discrete-time systems, they are different for continuous-time time-delay systems and discrete-time time-delay systems. Second, the stabilization methods for continuous-time timedelay systems and discrete-time time-delay systems are also somehow different. Thus, an independent treatment of the robust output regulation problem for discrete-time time-delay systems will be useful and necessary.     

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.     

Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems

Hybrid systems are dynamical systems with interacting discrete computation and continuous physical processes, which have become more common, more indispensable, and more complicated in our modern life. Particularly, many of them are safety-critical, and therefore are required to meet a critical safety standard. Invariant generation plays a central role in the verification and synthesis of hybrid systems. In the previous work, the fourth author and his coauthors gave a necessary and sufficient condition for a semi-algebraic set being an invariant of a polynomial autonomous dynamical system, which gave a confirmative answer to the open problem. In addition, based on which a complete algorithm for generating all semi-algebraic invariants of a given polynomial autonomous hybrid system with the given shape was proposed. This paper considers how to extend their work to non-autonomous dynamical and hybrid systems. Non-autonomous dynamical and hybrid systems are with inputs, which are very common in practice; in contrast, autonomous ones are without inputs. Furthermore, the authors present a sound and complete algorithm to verify semi-algebraic invariants for non-autonomous polynomial hybrid systems. Based on which, the authors propose a sound and complete algorithm to generate all invariants with a pre-defined template.