248 results on '"Qi, HongSheng"'
Search Results
202. Online inference of lane changing events for connected and automated vehicle applications with analytical logistic diffusion stochastic differential equation.
- Author
-
Qi, Hongsheng, Chen, Chenxi, Hu, Xianbiao, and Zhang, Jiahao
- Subjects
- *
FALSE positive error , *AUTONOMOUS vehicles , *LANE changing - Abstract
• The stochastic lane-changing trajectory is modeled with the logistic diffusion method, which is represented by a stochastic differential equation. The analytical solution is derived. • The analytical distribution of the lateral movement is solved by the Fokker Planck equation. • A procedure of inferring lane changing initiation moment (LCIM), cross-lane-mark moment (CLMM), and lane changing duration (LCD) is established. • The proposed method is tested against real-world data. The results are encouraging. Inferences of the lane changing behaviors (including lane changing initiation moment LCIM, cross-lane-mark moment CLMM, and lane changing duration LCD) of the surrounding vehicles and taking actions to avoid collision are essential for the safe operation of connected and autonomous vehicles (CAVs). The majority of current models rely on data-driven methods that need to be trained before deployment. Besides, an analytical and stochastic formulation of the lateral model which can generate CLMM and LCD distribution and adjust the parameters online is still lacking. To the best of our knowledge, currently, no method can provide an analytically stochastic lateral movement that explicitly considers the system noise and simultaneously outputs the information of lane changing initiation moment, cross-lane-mark moment, and lane changing duration in a real-time manner. To fill such a gap, a stochastic lateral trajectory framework with parsimonious parameters is established and an online simultaneous inference of LCIM, CLMM, and LCD is developed. The proposed method is tested with the highD and NGSIM datasets. The results show that 1) computational efficiency-wise, the algorithm takes milliseconds to run, which suggests promising prospects for field deployment; 2) the false negative and false positive errors of the LCIM inference are as low as 1.5%, indicating that the method is robust to the stochastic noise; 3) LCIM inference is insensitive to the lane width, which means the model is error tolerant when such information is lacking; and 4) the error of CLMM inference is within 2 sec , while most of the error of LCD locates within 4 sec , suggesting satisfactory performance. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
203. Numerical Solution to Morgan's Problem
- Author
-
Qi, Hongsheng, primary and Cheng, Daizhan, additional
- Published
- 2006
- Full Text
- View/download PDF
204. Stabilization of Switched Linearizable Nonlinear Systems
- Author
-
Cheng, Daizhan, primary and Qi, Hongsheng, additional
- Published
- 2006
- Full Text
- View/download PDF
205. On shift register via semi-tensor product approach.
- Author
-
Qi, Hongsheng
- Published
- 2013
206. Topological Structure of a Boolean Network.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
In this chapter a formulation of Boolean networks is introduced and their topological structure is then investigated. The matrix expression of logic, discussed in previous chapters, is used and, under this framework, the dynamics of a Boolean network equation is converted into an equivalent algebraic form as a standard discrete-time linear system. Analyzing the transition matrix of the linear system, easily computable formulas are obtained to show (a) the number of fixed points, (b) the numbers of cycles of different lengths, (c) the transient period, which is the time for all points to enter the set of attractors, (d) the basin of each attractor. In addition, algorithms are developed to calculate all the fixed points, cycles, transient periods, and basins of attraction of all attractors. This chapter is partly based on Cheng and Qi (IEEE Trans. Automat. Contr. 55(10):2251–2258, 2010). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
207. Model Construction via Observed Data.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
This chapter considers how to construct a dynamical model of a Boolean network via observed data. In an example, data are obtained from diagnoses to describe the diffusion process of cancer cells. Instead of constructing the logical dynamics of a Boolean network directly, we first construct its algebraic form and then convert it back to logical form. A general construction technique is initially proposed. To reduce the amount of data required, the model with known network graph is considered. Motivated by this, the least in-degree model is proposed, which can reduce considerably the amount of data required. Finally, the uniform network is investigated. The amount of data required for the identification of such a network is independent of the size of the network. In addition, some principles are proposed for dealing with data which contain errors. This chapter is based on Cheng et al. (Model construction of Boolean network via observed data, 2010). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
208. FrontMatter.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Published
- 2011
209. Random Boolean Networks.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
In this chapter we give a brief introduction to random Boolean networks. This a topic of considerable current interest and the results are abundant, so a detailed discussion is beyond the scope of this book. What we present here are just the basics. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
210. BackMatter.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Published
- 2011
211. Identification of Boolean Control Networks.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
Identification is essential for the application of theoretical results on Boolean control networks to practical problems because knowing the structure of a network is the first priority when solving any related problems. Particularly, when a large or, potentially, huge network (e.g., a genetic regulatory network) is considered, we need to identify it or approximate it by using a small network. In this chapter necessary and sufficient conditions are first obtained for the identifiability of state equations from input-state data. An alternative necessary and sufficient condition for a controllable Boolean network to be observable is then presented. Based on these two results, necessary and sufficient conditions for identifiability from input–output data are obtained, and some particular cases are considered. To identify practical models, a numerical algorithm is proposed. This chapter is based on Cheng and Zhao (Automatica, 2010). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
212. Applications to Game Theory.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
In this chapter, the problem of solving infinitely repeated games by means of Nash or sub-Nash equilibria is considered. Using the algebraic form of a logical dynamical system, a strategy with finite memory can be expressed as a logical matrix. The Nash equilibria are then computable, providing Nash solutions to the given game. When the Nash equilibrium does not exist, sub-Nash equilibria and ε-tolerance solutions may provide a reasonable solution to the game. Common Nash or sub-Nash equilibria make different memory-length strategies comparable. An optimal or sub-optimal solution can then be obtained. Certain algorithms are proposed. This chapter is based on Cheng et al. (Nash and sub-Nash solutions to infinitely repeated games, 2010; Proc. IEEE CDC΄2010, 2010). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
213. Optimal Control.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
In this chapter we consider the optimal control of logical control networks. First, we formulate the optimal control problem and show that an optimal trajectory could converge to a cycle in the input-state space. The optimal control is then revealed, based on the topological structure of control networks. Finally, we introduce higher-order logical control networks. For such networks, the updated values of the state variables depend on the previous finite number of historic states and controls. The optimal control problem for such systems is them investigated by converting them to the first-order case. This chapter is based on Zhao et al. (IEEE Trans. Automat. Contr., 2010). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
214. Input-State Incidence Matrices.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
This chapter introduces a new concept: the input-state incidence matrix (ISIM) of a Boolean control network. This provides an algebraic description of the geometric structure of the control network in the input-state product space. As a row-periodic matrix, the structure of the ISIM is explored in detail. Then we show its applications to investigating the controllability, observability, and the topological structure of the input-state transfer graph. Finally, the same problems are discussed for mix-valued logical dynamic systems. This chapter is based on Zhao et al. (Syst. Control Lett., 2010). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
215. Feedback Decomposition of Boolean Control Networks.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
In this chapter we consider the decomposition problem of Boolean control networks. Decomposition is also a fundamental problem in control theory. State-space decomposition can significantly simplify a system, making control design much easier and more efficient. This chapter first discusses state-space decomposition of Boolean control networks. The input–output decomposition problem (IODP), also called Morgan΄s problem, is one of the most famous open problems in modern control theory (Glumineau and Moog, IEEE Trans. Automat. Contr. 37(7):1067–1072, 1992; Herrera and Latay, IEEE Trans. Automat. Contr. 38(12):1834–1838, 1993; Morgan, Proceedings of the Joint Automatic Control Conference, 1964). The IODP for Boolean control systems is then investigated. This chapter is based on Qi et al. (On decomposition of Boolean networks, 2010). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
216. k-valued Networks.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
When genetic circuits are described as Boolean networks, the gene state is quantized to only two levels, true and false, but this is obviously an approximation. Even if this two-valued status were precisely correct, since the heredity is groupwise, a group of genes bounded by a chromosome may also be considered as a multivalued logical variable. Multivalued networks also appear in some other complex systems, for instance, in chemical reactions and cognitive science (Adamatzky, Chaos Solitons Fractals 18:917–936, 2003; Volkert and Conrad, J. Theor. Biol. 193(2):287–306, 1998). When the gene state is not limited to true and false, such as when the effect of one gene on another is not strong, we should modify the model. In this chapter we consider k-valued networks. As with a Boolean network, the dynamics of a k-valued network can be converted into an conventional discrete-time dynamical system. Many results obtained for Boolean networks can then be transferred in a parallel way to the k-valued case. This chapter is mainly devoted to the transfer of some major results from Boolean networks to k-valued networks. In the last section, a more general network, called a mix-valued network, is introduced. This chapter is based on Li and Cheng (Int. J. Bifurc. Chaos 20(3):561–582, 2010). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
217. Disturbance Decoupling.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
The disturbance decoupling problem (DDP) is a classical problem of control theory. For a control system with disturbance, the purpose of DDP is to design a control such that the disturbance on the system will not affect the output of the system. We refer to Wonham (Linear Multivariable Control: A Geometric Approach, 2nd edn., Springer, Berlin, 1979) for the DDP of linear control systems and Isidori (Nonlinear Control Systems, 3rd edn., Springer, Berlin, 1995) for the DDP of nonlinear control systems. This chapter considers the DDP for Boolean control networks. First, a Y-friendly subspace is introduced. Using this, the DDP via both state feedback control and constant control is then investigated. The canalizing mapping is then discussed and used to design constant controllers. This chapter is based on Cheng (IEEE Trans. Automat. Contr., 2010), Cheng et al. (Proc. 7th IEEE International Conference on Control & Automation (ICCA΄09), 2009). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
218. Stability and Stabilization.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
This chapter considers the global convergence of Boolean control networks. In the first part, what are effectively the scalar forms of logical variables are used. Hence, the Boolean matrix, which consists of 0 and 1 entries, is discussed first. One of the main tools in this investigation is the vector metric on a set of Boolean matrices. Using this, a sufficient condition for global stability, which means global convergence, is considered. The method is then extended to solving the stabilization of Boolean control systems. In the second part, the algebraic form dynamics are investigated. A necessary and sufficient condition is provided. The primary contents in this chapter are from Cheng et al. (Int. J. Robust Nonlinear Control, 2010). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
219. Realization of Boolean Control Networks.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
This chapter considers the realization of a Boolean control network. As with a dynamic control system, we consider the controllable and observable normal forms first. Based on this, the Kalman decomposed form of a Boolean control network is constructed. Finally, the minimum realization problem is discussed. Coordinate transformations and regular subspaces are fundamental tools in these investigations. This chapter is based on Cheng et al. (Automatica 46(1):62–69, 2010). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
220. State Space and Subspaces.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
This chapter presents a systematic description of state spaces and subspaces of Boolean (control) networks. After defining the state space and subspaces, the coordinate transformation of Boolean (control) networks is proposed. Using coordinate transformation, some useful kinds of subspaces, including regular subspaces and invariant subspaces, are investigated in detail. Moreover, the indistinct rolling gear structure of Boolean networks is revealed. This state-space description makes a state-space approach, similar to that of the modern control theory, applicable to the analysis of Boolean networks and the synthesis of Boolean control systems. This chapter is based on Cheng and Qi (IEEE Trans. Neural. Netw. 21(4):584–594, 2010). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
221. Controllability and Observability of Boolean Control Networks.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
In this chapter the controllability and observability of Boolean control networks are investigated. First, the dynamics of a Boolean control network (BCN) is expressed in its algebraic form. Then, using the network transition matrix, the controllability via two kinds of inputs is discovered by providing the corresponding reachable sets in precise form. Finally, the observability is also solved by giving necessary and sufficient conditions. This chapter is based on Cheng and Qi (Automatica 45(7):1659–1667, 2009). The problem of controllability and observability will be discussed again later after some new tools have been developed. We refer to Chap. 16 for some further developments on controllability and observability of Boolean control networks, where the problem for mix-valued logical control systems is also considered. The discussion is based on a new concept, the input-state incidence matrix. We also refer to Chap. 16 for an alternative condition for observability. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
222. Input-State Approach to Boolean Control Networks.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
Input–output structure is essential in systems and control theory. But what about cellular networks? It was pointed out in Ideker et al. (Annu. Rev. Genomics Hum. Genet. 2:343–372, 2001) that ˵Gene-regulatory networks are defined by trans and cis logic… . Both of these types of regulatory networks have input and output.″ Ignoring outputs, this chapter considers Boolean control systems which have input-state structure. We first propose a framework for Boolean control networks, and the structure of attractors of the networks is then investigated. The input-state approach is then applied to the analysis of large Boolean networks and a compound structure of cycles is obtained. We call such a structure ˵rolling gear″ structure and will discuss some of its interesting properties. It could be used to reveal the hidden order in some network-based phenomena such as in huge networks ˵tiny cycles decide the vast order″. This chapter is based on Cheng (IEEE Trans. Neural Netw. 20(3):512–521, 2009). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
223. Logical Equations.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
Numerical problems considered in arithmetic can be very difficult, but, using algebraic methods, such a problem may be converted into one of solving a (potentially very simple) algebraic equation. In this chapter we attempt to solve logical problems by converting them into algebraic equations. Problems such as infection problems in logic can, in this way, be reduced to the solvability of the related algebraic equations Cheng an Li (Front. Electr. Electron. Eng. China 4(3):259–269, 2009). This is made possible by the semi-tensor product of matrices and the matrix expression of logic introduced in the previous chapters. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
224. Semi-tensor Product of Matrices.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
This chapter provides a basic introduction to the semi-tensor product of matrices. We will emphasize concepts, geometric interpretations, and some fundamental properties. All proofs are omitted as we refer to Cheng and Qi (Semi-tensor Product of Matrices–Theory and Applications, Science Press, Beijing, 2007) for them. The theory of the semi-tensor product consists mainly of two parts: algebraic calculation and differential calculation. A survey can be found in Cheng (Proc. 4th International Congress of Chinese Mathematicians, pp. 641–668, Higher Edu. Press, Int. Press, Hangzhou, 2007). This book involves only the first part, which is introduced in this chapter. We refer to Mei et al. (Semi-tensor Product Approach to Transient Analysis of Power Systems, Tsinghua Univ. Press, Beijing, 2010) for some applications of the semi-tensor product to power systems, where the second part (differential calculation) is mainly used. Appendix B provides the proofs for some fundamental results on the semi-tensor product which are used in this book. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
225. Matrix Expression of Logic.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
Using matrices to express logical relations is one of the foundations of the approach proposed in this book. In this chapter we express a statement or a logical variable as a vector, and express a logical operator via its structure matrix. The action of a logical operator on logical variables can then be expressed as the semi-tensor product of the structure matrix of the operator with vectors of logical arguments (Cheng, Proc. 4th International Congress of Chinese Mathematicians, pp. 641–668, Higher Edu. Press, Int. Press, Hangzhou, 2007; Cheng and Qi, Semi-tensor Product of Matrices–Theory and Applications, Science Press, Beijing, 2007). [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
226. Propositional Logic.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Abstract
This chapter provides a brief introduction to propositional logic. Propositional logic is the foundation of mathematical logic. It uses simple statements as logical variables and connectives as logical operators. Operators connect simple statements to form compound statements, and a logical function usually contains multiple compound statements. Propositional logic investigates the logical characteristics and rules associated with logical statements. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
227. Synthesis of Boolean networks via semi-tensor product.
- Author
-
Cheng Daizhan, Qi Hongsheng, and Zhao Yin
- Published
- 2011
228. Are current microscopic traffic models capable of generating jerk profile consistent with real world observations?
- Author
-
Qi, HongSheng
- Abstract
Microscopic behavior modeling plays center role in traffic flow analyais, simulation, and autonomous vehicles algorithm development. Numerous efforts are devoted to the development of it in both longitudinal dimension and lateral dimension. Empirical observations reveal that the jerk (differential of acceleration) greatly influences traffic safety and a speed-dependent jerk profile exists regarding longitudinal and lateral movement. Replication of the speed-dependent jerk profile is crucial when the microscopic models are employed to the analysis of traffic safety. However, this research shows that current stochastic microscopic models cannot describe speed-dependent jerks, and thus cannot be directly used to describe driving behavior with considerable jerk profiles. This research firstly derives the jerk distribution for a general stochastic car following model, and then shows that several car following models together with lateral movement model cannot generate the realistic jerk distribution. A compound Poisson formulation is proposed to remedy the drawback of these models. The model consists of a diffusion part and a jump part. The former describes normal driving stochasticity while the latter describes driving involving high jerk. The numerical studies show that the proposed model can replicate the speed-dependent jerk phenomenon. The propagation of the behavior in the traffic flow is also investigated.
- Published
- 2023
- Full Text
- View/download PDF
229. Parameterized solution to generalized Sylvester matrix equation.
- Author
-
Qiao Yupeng, Qi Hongsheng, and Cheng Daizhan
- Published
- 2008
- Full Text
- View/download PDF
230. Stability of Polynomial Systems via Polynomial Lyapunov Functions.
- Author
-
Qi Hongsheng and Cheng Daizhan
- Published
- 2007
- Full Text
- View/download PDF
231. Extracting carrier concentration of black c-BN single crystal by mid-infrared reflectance spectroscopy.
- Author
-
Wei, Xing, Qi, Hongsheng, Zhu, Siqi, Zhang, Xiangfa, Wang, Yongkai, Ouyang, Xiaoping, and Zheng, Wei
- Subjects
- *
CARRIER density , *SINGLE crystals , *HALL effect , *DIELECTRIC function , *HOT pressing - Abstract
Cubic boron nitride (c-BN) is a synthetic ultra-wide bandgap semiconductor with attractive application prospects in electronics and optoelectronics. At present, the size of c-BN single crystals obtained by hot pressing method is generally less than 1 mm extremely unfavorable to extracting its carrier concentration through Hall effect measurement. For c-BN crystals, the longitudinal optical phonon-plasma coupling (LOPC) mode which is produced by the coupling of longitudinal optical phonons and free carriers can be observed in mid-infrared reflectance spectrum. Thus, in this work, the mid-infrared reflectance spectrum of the black c-BN crystal grown by hot pressing method is measured. Based on classical dielectric function theory, the carrier concentration of that c-BN sample is finally extracted as 7.14 × 1017 cm−3. Combining electrical measurements, its mobility is also obtained as 11.91 cm2·V-1·s-1. • The highlights of our work is as follows. • This is the first time to extract carrier concentration by fitting LOPC + mode in the mid-infrared reflectance spectrum of the black c-BN crystal, which provides a practical method to obtain the electrical properties without any contact for tiny samples. • The reliability of carrier concentration extracted from mid-infrared reflectance spectrum is confirmed through theoretical simulation. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
232. Influence of signal on the capacity of signalized intersection.
- Author
-
QI Hongsheng, YE Ying, WEI Wei, WANG Dianhai, and CHEN Xiaoming
- Subjects
TRAFFIC flow ,GRAPH theory ,EQUATIONS ,STRUCTURAL optimization ,TRAFFIC engineering - Abstract
In order to describe capacity of intersections, and take the factors such as intersection geometric feature, traffic flow characteristic, channelized section and regulation measures into account, this research expresses the basic phase set based on graph theory through the analysis of conflict movements. Then the common expression of capacity is given by equations. The four-leg intersection is analyzed as an example, whose necessary and sufficient condition is derived. At last, the optimization model of intersection capacity is established. The results show that the signal parameters greatly influence the intersection capacity. Equivalent saturation degree assignment is actually intersection capacity maximal control. For common four-leg intersection, the sufficient and necessary condition for capacity is that the sum of flow ratio equals 2. [ABSTRACT FROM AUTHOR]
- Published
- 2013
233. Model Construction of Boolean Network via Observed Data.
- Author
-
Cheng, Daizhan, Qi, Hongsheng, and Li, Zhiqiang
- Subjects
- *
DATA analysis , *CANCER cells , *DIAGNOSIS , *DIFFUSION processes , *BOOLEAN algebra , *GRAPH theory , *DATA modeling , *MATHEMATICAL models , *HEURISTIC algorithms - Abstract
In this paper, a set of data is assumed to be obtained from an experiment that satisfies a Boolean dynamic process. For instance, the dataset can be obtained from the diagnosis of describing the diffusion process of cancer cells. With the observed datasets, several methods to construct the dynamic models for such Boolean networks are proposed. Instead of building the logical dynamics of a Boolean network directly, its algebraic form is constructed first and then is converted back to the logical form. Firstly, a general construction technique is proposed. To reduce the size of required data, the model with the known network graph is considered. Motivated by this, the least in-degree model is constructed that can reduce the size of required data set tremendously. Next, the uniform network is investigated. The number of required data points for identification of such networks is independent of the size of the network. Finally, some principles are proposed for dealing with data with errors. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
234. On dynamics and Nash equilibriums of networked games
- Author
-
Cheng, Daizhan, Xu, Tingting, He, Fenghua, and Qi, Hongsheng
- Abstract
Networked noncooperative games are investigated, where each player (or agent) plays with all other players in its neighborhood. Assume the evolution is based on the fact that each player uses its neighbors' current information to decide its next strategy. By using sub-neighborhood, the dynamics of the evolution is obtained. Then a method for calculating Nash equilibriums from mixed strategies of multi-players is proposed. The relationship between local Nash equilibriums based on individual neighborhoods and global Nash equilibriums of overall network is revealed. Then a technique is proposed to construct Nash equilibriums of an evolutionary game from its one step static Nash equilibriums. The basic tool of this approach is the semi-tensor product of matrices, which converts strategies into logical matrices and payoffs into pseudo-Boolean functions, then networked evolutionary games become discrete time dynamic systems.
- Published
- 2014
- Full Text
- View/download PDF
235. Quasi-real time estimation of turning movement spillover events based on partial connected vehicle data.
- Author
-
Qi, Hongsheng, Dai, Rumeng, Tang, Qing, and Hu, Xianbiao
- Subjects
- *
TIME perception , *ALGORITHMS , *NONLINEAR equations , *DYNAMIC testing , *VEHICLES - Abstract
• A quasi-real time estimator of turning movement spillover (TMS) using partial connect vehicle data is proposed. The estimator can identify the TMS triggering movements and estimate the TMS durations. • A nonlinear minimization problem was formulated to minimize the deviation of the theoretical trajectory from the observed trajectory. • The estimation algorithm is tested against dynamic demand and common signal settings. The results prove the accuracy and the computational efficiency. Turning movement spillover (TMS) is the result of a turning bay section (TBS) not being able to accommodate all arriving vehicles, so that the turning-vehicle queue spills back and blocks other vehicles turning in different directions. We are not aware of any TMS estimation method that can remedy this situation or support relevant applications in real time. This research proposes a quasi-real time algorithm for estimating TMS, which includes triggering movement as well as duration estimation. The proposed method is based on data for connected vehicles (CVs), including their trajectories and their desired turning directions. In addition, a model that uses partial trajectory data is proposed. For each assumed TMS, a "simplified trajectory" is developed by the construction of a piece-wise linear curve. To minimize any deviation of the simplified trajectory from observation, a TMS estimation can be made. This proposed method is effective and computationally efficient when tested against dynamic demand in two mainstream signal phase settings, with varied sample sizes. Even though data for a higher number of vehicle samples is generally favorable, the proposed model still makes a good estimate when only one trajectory is available. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
236. Quantum tomography by regularized linear regressions.
- Author
-
Mu, Biqiang, Qi, Hongsheng, Petersen, Ian R., and Shi, Guodong
- Subjects
- *
DENSITY matrices , *TOMOGRAPHY , *QUANTUM states , *REGULARIZATION parameter , *REGRESSION analysis , *FINITE size scaling (Statistical physics) - Abstract
In this paper, we study extended linear regression approaches for quantum state tomography based on regularization techniques. For unknown quantum states represented by density matrices, performing measurements under certain basis yields random outcomes, from which a classical linear regression model can be established. First of all, for complete or over-complete measurement bases, we show that the empirical data can be utilized for the construction of a weighted least squares estimate (LSE) for quantum tomography. Taking into consideration the trace-one condition, a constrained weighted LSE can be explicitly computed, being the optimal unbiased estimation among all linear estimators. Next, for general measurement bases, we show that ℓ 2 -regularization with proper regularization gain provides even a lower mean-square error under a cost in bias. The optimal regularization parameter is defined in terms of a risk characterization for any finite sample size and a resulting implementable estimator is proposed. Finally, a concise and unified formula is established for the regularization parameter with complete measurement basis under an equivalent regression model, which proves that the proposed implementable tuning estimator is asymptotically optimal as the number of copies grows to infinity. Additionally, several numerical examples are provided to validate the established results. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
237. Measurement-induced Boolean dynamics and controllability for closed quantum networks.
- Author
-
Qi, Hongsheng, Mu, Biqiang, Petersen, Ian R., and Shi, Guodong
- Subjects
- *
QUANTUM theory , *CONTROLLABILITY in systems engineering , *MARKOV processes , *QUANTUM measurement , *QUANTUM information science , *UNITARY operators - Abstract
In this paper, we study dynamical quantum networks which evolve according to Schrödinger equations but subject to sequential local or global quantum measurements. A network of qubits forms a composite quantum system whose state undergoes unitary evolution in between periodic measurements, leading to hybrid quantum dynamics with random jumps at discrete time instances along a continuous orbit. The measurements either act on the entire network of qubits, or only a subset of qubits. First of all, we reveal that this type of hybrid quantum dynamics induces probabilistic Boolean recursions representing the measurement outcomes. With global measurements, it is shown that such resulting Boolean recursions define Markov chains whose state-transitions are fully determined by the network Hamiltonian and the measurement observables. Particularly, we establish an explicit and algebraic representation of the underlying recursive random mapping driving such induced Markov chains. Next, with local measurements, the resulting probabilistic Boolean dynamics is shown to be no longer Markovian. The state transition probability at any given time becomes dependent on the entire history of the sample path, for which we establish a recursive way of computing such non-Markovian probability transitions. Finally, we adopt the classical bilinear control model for the continuous Schrödinger evolution, and show how the measurements affect the controllability of the quantum networks. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
238. Distributed gradient-based sampling algorithm for least-squares in switching multi-agent networks
- Author
-
Lin, Peng and Qi, Hongsheng
- Published
- 2020
- Full Text
- View/download PDF
239. Completeness and normal form of multi-valued logical functions.
- Author
-
Cheng, Daizhan, Liu, Zequn, and Qi, Hongsheng
- Subjects
- *
BOOLEAN functions - Abstract
Theory of completeness is essential for multi-valued logical functions. Using semi-tensor product (STP) of matrices, the algebraic form of k -valued logical functions is presented. Using algebraic form, a method is proposed to construct an adequate set of connectives (ASC), consisting of unary operators with conjunction/disjunction for k -valued logical functions, which can be used to express any k -valued logical functions. Based on it, two normal forms of k -valued logical functions are presented, which are extensions of the disjunctive normal form and conjunctive normal form of Boolean functions respectively. The ASC is then simplified to a condensed set. Finally, the normal forms are further extended to mix-valued logical functions. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
240. Simulative investigation on head injuries of electric self-balancing scooter riders subject to ground impact.
- Author
-
Xu, Jun, Shang, Shi, Qi, Hongsheng, Yu, Guizhen, Wang, Yunpeng, and Chen, Peng
- Subjects
- *
SCOOTERING , *HEAD injuries , *IMPACT (Mechanics) , *TRAFFIC safety , *SUSTAINABLE transportation , *ACCIDENT prevention - Abstract
The safety performance of an electric self-balancing scooter (ESS) has recently become a main concern in preventing its further wide application as a major candidate for green transportation. Scooter riders may suffer severe brain injuries in possible vehicle crash accidents not only from contact with a windshield or bonnet but also from secondary contact with the ground. In this paper, virtual vehicle–ESS crash scenarios combined with finite element (FE) car models and multi-body scooter/human models are set up. Post-impact kinematic gestures of scooter riders under various contact conditions, such as different vehicle impact speeds, ESS moving speeds, impact angles or positions, and different human sizes, are classified and analyzed. Furthermore, head–ground impact processes are reconstructed using validated FE head models, and important parameters of contusion and laceration (e.g., coup or contrecoup pressures and Von Mises stress and the maximum shear stress) are extracted and analyzed to assess the severity of regional contusion from head–ground contact. Results show that the brain injury risk increases with vehicle speeds and ESS moving speeds and may provide fundamental knowledge to popularize the use of a helmet and the vehicle-fitted safety systems, and lay a strong foundation for the reconstruction of ESS-involved accidents. There is scope to improve safety for the use of ESS in public roads according to the analysis and conclusions. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
241. A contact length model for grinding wheel-workpiece contact
- Author
-
Qi, Hongsheng
- Subjects
- 670, TJ Mechanical engineering and machinery
- Published
- 1995
242. Interference Game for Intelligent Sensors in Cyber–physical Systems.
- Author
-
Ding, Kemi, Ren, Xiaoqiang, Qi, Hongsheng, Shi, Guodong, Wang, Xiaofan, and Shi, Ling
- Subjects
- *
INTELLIGENT sensors , *CYBER physical systems , *DATA packeting , *PROBLEM solving , *POWER transmission , *NASH equilibrium - Abstract
This paper investigates the remote state estimation for a cyber–physical system (CPS) where a group of (primary) sensors transmit sensing data packets to the remote estimators for state estimation via their individual channels. In view of the complexity arising from the scale of such system, it is desirable for the primary sensors to share their channels with the newly-added (potential) ones, especially when the sensing data of primary ones contains less valuable information. However, the channel sharing inevitably leads to signal interference among sensors using the same channels, and it may further degenerate the remote estimation performance. Thus, the system designer should allocate the transmission power for sensors to maximize the global estimation accuracy. We emphasize the non-cooperative nature among sensors, and solve the problem in an exchange market framework with a platform acting on behalf of the system designer, and prove that the optimal power allocation is a spontaneous outcome of the market under well-designed prices. More specifically, under (subsidized) prices announced by the platform, the primary sensors are willing to open up their channels for sharing, in which a distributed optimal power allocation is derived explicitly. To alleviate transmission interference, the platform will charge potential sensors for the use of channels, among which the mutual interaction is formulated as a non-cooperative game and the existence of a pure Nash equilibrium is proved. We also devise an algorithm for the platform to design subsidized/toll prices, which is given in an explicit recursive form with simple iterations, and therefore suited for the platform with limited computation capability. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
243. Dynamics of opinions with social biases.
- Author
-
Chen, Zihan, Qin, Jiahu, Li, Bo, Qi, Hongsheng, Buchhorn, Peter, and Shi, Guodong
- Abstract
This paper aims to provide a systemic analysis to social opinion dynamics subject to individual biases. As a generalization of the classical DeGroot social interactions, defined by linearly coupled dynamics of peer opinions that evolve over time, biases add to state-dependent edge weights and therefore lead to highly nonlinear network dynamics. Previous studies have dealt with convergence and stability analysis of such systems for a few specific initial node opinions and network structures, and here we focus on how individual biases affect social equilibria and their stabilities. Two categories of equilibria, namely the boundary and interior equilibria, are defined. For a few fundamental network structures, some important interior network equilibria are presented explicitly for a wide range of system parameters, which are shown to be locally unstable in general. Particularly, the interval centroid is proven to be unstable regardless of the bias level and the network topologies. Next, we prove that when the initial network opinions are polarized towards one side of the state space, node biases will drive the opinion evolution to the corresponding interval boundaries. Such polarization attraction effect continues to hold under even directed and switching network structures. Finally, a number of numerical examples are provided to validate our study and advance the understanding of the nonlinearity inherited within the biased opinion evolution. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
244. Are electric self-balancing scooters safe in vehicle crash accidents?
- Author
-
Xu, Jun, Shang, Shi, Yu, Guizhen, Qi, Hongsheng, Wang, Yunpeng, and Xu, Shucai
- Subjects
- *
TRAFFIC accidents , *SCOOTERS , *HEAD injuries , *ROAD users , *COMPUTER simulation - Abstract
With the pressing demand of environmentally friendly personal transportation vehicles, mobility scooters become more and more popular for the short-distance transportation. Similar to pedestrians and bicyclists, scooter riders are vulnerable road users and are expected to receive severe injuries during traffic accidents. In this research, a MADYMO model of vehicle–scooter crash scenarios is numerically set up. The model of the vehicle with the scenario is validated in pedestrian–vehicle accident investigation with previous literatures in terms of throwing distance and HIC 15 value. HIC 15 values gained at systematic parametric studies. Injury information from various vehicle crashing speeds (i.e. from 10 m/s to 24 m/s), angles (i.e. from 0 to 360°), scooter's speeds (i.e. from 0 m/s to 4 m/s), contact positions (i.e. left, middle and right bumper positions) are extracted, analyzed and then compared with those from widely studied pedestrian–vehicle and bicycle–vehicle accidents. Results show that the ESS provides better impact protection for the riders. Riding ESS would not increase the risk higher than walking at the same impact conditions in terms of head injury. The responsible reasons should be the smaller friction coefficient between the wheel-road than the heel-road interactions, different body gestures leading to different contact positions, forces and timing. Results may shed lights upon the future research of mobility scooter safety analysis and also the safety design guidance for the scooters. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
245. Probing carrier concentration of doped GaN single crystals from LO phonon-plasmon coupled modes.
- Author
-
Li, Linxuan, Zhu, Siqi, Cheng, Lu, Qi, Hongsheng, Fan, Yu, and Zheng, Wei
- Subjects
- *
CARRIER density , *SINGLE crystals , *CHARGE carrier mobility , *NEAR infrared reflectance spectroscopy , *GALLIUM nitride , *CHARGE carriers , *REFLECTANCE measurement - Abstract
Raman and infrared reflectance spectroscopy were used to study GaN single crystals with different doping types and carrier concentrations. In different samples, the characteristic spectra related to LO phonon-plasmon coupled (LOPC) mode are observed as changing regularly with carrier concentration. Furthermore, to obtain the carrier concentration and mobility of GaN crystals, Raman and infrared reflectance spectra with LOPC modes were fitted. The carrier concentration obtained agrees well with that obtained from the Hall measurement, which confirms that these non-contact and non-destructive spectroscopy methods with high spatial resolution are reliable to probe the carrier concentration of doped GaN single crystals. • Getting the carrier concentrations and mobility of GaN with different concentration (1016-1018) by Raman and infrared reflectance spectroscopy. • Verifying the reliability of spectroscopy methods in testing carrier concentration of bulk GaN with different doping types. • Discussing possible reasons for the different mobility obtained by Hall, Raman and infrared reflectance measurements. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
246. Extraction of carrier concentration and mobility of ZnO by mid-infrared reflectance spectroscopy.
- Author
-
Fan, Yu, Zheng, Wei, Zhu, Siqi, Cheng, Lu, Qi, Hongsheng, Li, Linxuan, and Huang, Feng
- Subjects
- *
CARRIER density , *REFLECTANCE spectroscopy , *ZINC oxide , *SEMICONDUCTOR doping , *DOPING agents (Chemistry) , *POLARITONS , *CHARGE carrier mobility - Abstract
As a representative of the third-generation semiconductors, ZnO has great development potential in the fields of optics and electricity, so the measurement on its electrical properties is quite important. Here, we try to extract the carrier concentration and mobility of ZnO by mid-infrared reflectance spectroscopy. Considering that the longitudinal optical phonon-plasmon coupling (LOPC) mode formed by the coupling of ZnO optical phonons and free carriers depends on carrier concentration and mobility, we conduct a test on the MIR spectra (400-1600 cm−1) of ZnO crystals with different carrier concentration (1018-1015 cm−3). By fitting the strong reflection peak shape corresponding to phonon-polaritons formed by the coupling of its LOPC and infrared light through m-CDF model, the carrier concentration and mobility of these samples are obtained, which are consistent with those got from the Hall-effect measurement. • Extracted carrier concentration by fitting LOPC+ mode of the MIR spectrum of ZnO with different doping concentrations. • Determined the relationship between the LO and TO phonon damping of semiconductor with the change of doping concentration. • Proposed that combining LO phonon frequency fluctuation and considering crystal anisotropy can further fit the LOPC peak. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
247. Doped metasurfaces: Etched structure-free flims based on regular spatially doped semiconductor and compatible with general optical ones.
- Author
-
Jin K, Ding Y, Cheng L, Qi H, and Zheng W
- Abstract
The metasurfaces through the reasonable design and arrangement of subwavelength nanostructures to control the spatial light field are expected to replace the traditional lens elements. However, the low light use efficiency (LUE) and difficulty in preparation caused by the etching process restrict the development of its application. Here, an idea of "doped metasurfaces" based on a spatial and regular doping of semiconductor thin films is proposed for the first time. Since the metasurfaces has no etched micro-nano structure, other optical functional films are allowed to be added, which greatly improves and enriches its optical performance. The effectiveness of the design is verified by simulating a suitable metasurface lens. The simulation results show that this designed MIR metalens possesses wide operating range, high transmittance, and high LUE. The method proposed here provides a new idea or perspective for constructing metasurfaces devices compatible with traditional optical thin films., Competing Interests: The authors declare no competing financial interests., (© 2021 The Author(s).)
- Published
- 2021
- Full Text
- View/download PDF
248. State-space analysis of Boolean networks.
- Author
-
Cheng D and Qi H
- Subjects
- Algorithms, Animals, Computer Simulation, Humans, Time Factors, Logistic Models, Neural Networks, Computer, Nonlinear Dynamics
- Abstract
This paper provides a comprehensive framework for the state-space approach to Boolean networks. First, it surveys the authors' recent work on the topic: Using semitensor product of matrices and the matrix expression of logic, the logical dynamic equations of Boolean (control) networks can be converted into standard discrete-time dynamics. To use the state-space approach, the state space and its subspaces of a Boolean network have been carefully defined. The basis of a subspace has been constructed. Particularly, the regular subspace, Y-friendly subspace, and invariant subspace are precisely defined, and the verifying algorithms are presented. As an application, the indistinct rolling gear structure of a Boolean network is revealed.
- Published
- 2010
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.