This work describes the barometric altimetry as virtual constellation applied to the Chinese Area Positioning System (CAPS), which uses the transponders of communication satellites to transfer navigation messages to u...This work describes the barometric altimetry as virtual constellation applied to the Chinese Area Positioning System (CAPS), which uses the transponders of communication satellites to transfer navigation messages to users. Barometric altimetry depends on the relationship of air pressure varying with altitude in the Earth’s atmosphere. Once the air pressure at a location is measured the site altitude can be found. This method is able to enhance and improve the availability of three-dimensional positioning. The difficulty is that the relation between barometric pressure and altitude is variable in different areas and under various weather conditions. Hence, in order to obtain higher accuracy, we need to acquire the real-time air pressure corresponding to an altimetric region’s reference height. On the other hand, the altimetry method will be applied to satellite navigation system, but the greatest difficulty lies in how to get the real-time air pressure value at the reference height in the broad areas overlaid by satellite navigation. We propose an innovational method to solve this problem. It is to collect the real-time air pressures and temperatures of the 1860 known-altitude weather observatories over China and around via satellite communication and to carry out time extrapolation forecast uniformly. To reduce data quantity, we first partition the data and encode them and then broadcast these information via navigation message to CAPS users’ receivers. Upon the interpolations being done in receivers, the reference air pressure and temperature at the receiver’s nearby place is derived. Lastly, combing with the receiver-observed real air pressure and temperature, the site’s altitude can be determined. The work is presented in the following aspects: the calculation principle, formulae, data collection, encoding, prediction, interpolation method, navigation message transmission together with errors causes and analyses. The advantages and shortcomings of the technique are discussed at the end.展开更多
This paper presents an algorithm to evaluate estimated and exact system reliabilities for a computer network in the cloud computing environment.From the quality of service（QOS） viewpoint,the computer network should ...This paper presents an algorithm to evaluate estimated and exact system reliabilities for a computer network in the cloud computing environment.From the quality of service（QOS） viewpoint,the computer network should be maintained when falling to a specific state such that it cannot afford enough capacity to satisfy demand.Moreover,the transmission time should be concerned as well.Thus,the data can be sent through several disjoint minimal paths simultaneously to shorten the transmission time.Under the maintenance budget B and time constraint T,we evaluate the system reliability that d units of data can be sent from the cloud to the client through multiple paths.Two procedures are integrated in the proposed algorithm-an estimation procedure for estimated system reliability and an adjusting procedure utilizing the branch-and-bound approach for exact system reliability.Subsequently,the estimated system reliability with lower bound and upper bound,and exact system reliability are computed by applying the recursive sum of disjoint products（RSDP） algorithm.展开更多
In this paper, we study the uniform persistence of a class of two dimensional periodic Kolmogorov ecosystems. As an improvement on a main result in [1] we obtain a new criterion of the uniform persistence for solutions.
The seismic reliability evaluation of lifeline networks has received considerable attention and been widely studied. In this paper, on the basis of an original recursive decomposition algorithm, an improved analytical...The seismic reliability evaluation of lifeline networks has received considerable attention and been widely studied. In this paper, on the basis of an original recursive decomposition algorithm, an improved analytical approach to evaluate the seismic reliability of large lifeline systems is presented. The proposed algorithm takes the shortest path from the source to the sink of a network as decomposition policy. Using the Boolean laws of set operation and the probabilistic operation principal, a recursive decomposition process is constructed in which the disjoint minimal path set and the disjoint minimal cut set are simultaneously enumerated. As the result, a probabilistic inequality can be used to provide results that satisfy a prescribed error bound. During the decomposition process, different from the original recursive decomposition algorithm which only removes edges to simplify the network, the proposed algorithm simplifies the network by merging nodes into sources and removing edges. As a result, the proposed algorithm can obtain simpler networks. Moreover, for a network owning s-independent components in its component set, two network reduction techniques are introduced to speed up the proposed algorithm. A series of case studies, including an actual water distribution network and a large urban gas system, are calculated using the proposed algorithm. The results indicate that the proposed algorithm provides a useful probabilistic analysis method for the seismic reliability evaluation of lifeline networks.展开更多
The k-set agreement problem is a generalization of the consensus problem： considering a system made up of n processes where each process proposes a value, each non-faulty process has to decide a value such that a dec...The k-set agreement problem is a generalization of the consensus problem： considering a system made up of n processes where each process proposes a value, each non-faulty process has to decide a value such that a decided value is a proposed value, and no more than k different values are decided. While this problem cannot be solved in an asynchronous system prone to t process crashes when t≥ k, it can always be solved in a synchronous system; [t/k]＋1 is then a lower bound on the number of rounds （consecutive communication steps） for the non-faulty processes to decide. The condition-based approach has been introduced in the consensus context. Its aim was to both circumvent the consensus impossibility in asynchronous systems, and allow for more efficient consensus algorithms in synchronous systems. This paper addresses the condition-based approach in the context of the k-set agreement problem. It has two main contributions. The first is the definition of a framework that allows defining conditions suited to the l-set agreement problem and the second is a generic synchronous k-set agreement algorithm based on conditions.展开更多
The Faddeev AGS equations for the coupled-channels ■NN-πΣN system with quantum numbers I=1/2 and S=0 are solved. Using separable potentials for the ■N-πΣ interaction, we calculate the transition probability for ...The Faddeev AGS equations for the coupled-channels ■NN-πΣN system with quantum numbers I=1/2 and S=0 are solved. Using separable potentials for the ■N-πΣ interaction, we calculate the transition probability for the(YK)I=0 + N→πΣN reaction. The possibility to observe the trace of the K-pp quasi-bound state in πΣN mass spectra was studied. Various types of chiral-based and phenomenological potentials are used to describe the ■N-πΣ interaction. Finally, we show that we can observe the signature of the K-pp quasi-bound state in the mass spectra, as well as the trace of branch points in the observables.展开更多
Estimating the number of isolated roots of a polynomial system is not only a fundamental study theme in algebraic geometry but also an important subproblem of homotopy methods for solving polynomial systems. For the m...Estimating the number of isolated roots of a polynomial system is not only a fundamental study theme in algebraic geometry but also an important subproblem of homotopy methods for solving polynomial systems. For the mixed trigonometric polynomial systems, which are more general than polynomial systems and rather frequently occur in many applications, the classical B6zout number and the multihomogeneous Bezout number are the best known upper bounds on the number of isolated roots. However, for the deficient mixed trigonometric polynomial systems, these two upper bounds are far greater than the actual number of isolated roots. The BKK bound is known as the most accurate upper bound on the number of isolated roots of a polynomial system. However, the extension of the definition of the BKK bound allowing it to treat mixed trigonometric polynomial systems is very difficult due to the existence of sine and cosine functions. In this paper, two new upper bounds on the number of isolated roots of a mixed trigonometric polynomial system are defined and the corresponding efficient algorithms for calculating them are presented. Numerical tests are also given to show the accuracy of these two definitions, and numerically prove they can provide tighter upper bounds on the number of isolated roots of a mixed trigonometric polynomial system than the existing upper bounds, and also the authors compare the computational time for calculating these two upper bounds.展开更多
基金Supported by the National Basic Research Program of China (Grant No. 2007CB815500)the National High Technology Research and Development Program (Grant No. 2004AA105030)+1 种基金the Pilot Project of the Knowledge Innovation Program of the Chinese Academy of Sciences (Grant No. KGCX1-21)the National Natural Science Foundation of China (Grant No. 10453001)
文摘This work describes the barometric altimetry as virtual constellation applied to the Chinese Area Positioning System (CAPS), which uses the transponders of communication satellites to transfer navigation messages to users. Barometric altimetry depends on the relationship of air pressure varying with altitude in the Earth’s atmosphere. Once the air pressure at a location is measured the site altitude can be found. This method is able to enhance and improve the availability of three-dimensional positioning. The difficulty is that the relation between barometric pressure and altitude is variable in different areas and under various weather conditions. Hence, in order to obtain higher accuracy, we need to acquire the real-time air pressure corresponding to an altimetric region’s reference height. On the other hand, the altimetry method will be applied to satellite navigation system, but the greatest difficulty lies in how to get the real-time air pressure value at the reference height in the broad areas overlaid by satellite navigation. We propose an innovational method to solve this problem. It is to collect the real-time air pressures and temperatures of the 1860 known-altitude weather observatories over China and around via satellite communication and to carry out time extrapolation forecast uniformly. To reduce data quantity, we first partition the data and encode them and then broadcast these information via navigation message to CAPS users’ receivers. Upon the interpolations being done in receivers, the reference air pressure and temperature at the receiver’s nearby place is derived. Lastly, combing with the receiver-observed real air pressure and temperature, the site’s altitude can be determined. The work is presented in the following aspects: the calculation principle, formulae, data collection, encoding, prediction, interpolation method, navigation message transmission together with errors causes and analyses. The advantages and shortcomings of the technique are discussed at the end.
基金supported in part by the National Science Council of Taiwan under Grant No.NSC 99-2221-E-011-066-MY3
文摘This paper presents an algorithm to evaluate estimated and exact system reliabilities for a computer network in the cloud computing environment.From the quality of service（QOS） viewpoint,the computer network should be maintained when falling to a specific state such that it cannot afford enough capacity to satisfy demand.Moreover,the transmission time should be concerned as well.Thus,the data can be sent through several disjoint minimal paths simultaneously to shorten the transmission time.Under the maintenance budget B and time constraint T,we evaluate the system reliability that d units of data can be sent from the cloud to the client through multiple paths.Two procedures are integrated in the proposed algorithm-an estimation procedure for estimated system reliability and an adjusting procedure utilizing the branch-and-bound approach for exact system reliability.Subsequently,the estimated system reliability with lower bound and upper bound,and exact system reliability are computed by applying the recursive sum of disjoint products（RSDP） algorithm.
文摘In this paper, we study the uniform persistence of a class of two dimensional periodic Kolmogorov ecosystems. As an improvement on a main result in [1] we obtain a new criterion of the uniform persistence for solutions.
基金Natural Science Funds for the Innovative Research Group of China Under Grant No.50621062
文摘The seismic reliability evaluation of lifeline networks has received considerable attention and been widely studied. In this paper, on the basis of an original recursive decomposition algorithm, an improved analytical approach to evaluate the seismic reliability of large lifeline systems is presented. The proposed algorithm takes the shortest path from the source to the sink of a network as decomposition policy. Using the Boolean laws of set operation and the probabilistic operation principal, a recursive decomposition process is constructed in which the disjoint minimal path set and the disjoint minimal cut set are simultaneously enumerated. As the result, a probabilistic inequality can be used to provide results that satisfy a prescribed error bound. During the decomposition process, different from the original recursive decomposition algorithm which only removes edges to simplify the network, the proposed algorithm simplifies the network by merging nodes into sources and removing edges. As a result, the proposed algorithm can obtain simpler networks. Moreover, for a network owning s-independent components in its component set, two network reduction techniques are introduced to speed up the proposed algorithm. A series of case studies, including an actual water distribution network and a large urban gas system, are calculated using the proposed algorithm. The results indicate that the proposed algorithm provides a useful probabilistic analysis method for the seismic reliability evaluation of lifeline networks.
基金supported by the European Network of Excellence ReSIST.
文摘The k-set agreement problem is a generalization of the consensus problem： considering a system made up of n processes where each process proposes a value, each non-faulty process has to decide a value such that a decided value is a proposed value, and no more than k different values are decided. While this problem cannot be solved in an asynchronous system prone to t process crashes when t≥ k, it can always be solved in a synchronous system; [t/k]＋1 is then a lower bound on the number of rounds （consecutive communication steps） for the non-faulty processes to decide. The condition-based approach has been introduced in the consensus context. Its aim was to both circumvent the consensus impossibility in asynchronous systems, and allow for more efficient consensus algorithms in synchronous systems. This paper addresses the condition-based approach in the context of the k-set agreement problem. It has two main contributions. The first is the definition of a framework that allows defining conditions suited to the l-set agreement problem and the second is a generic synchronous k-set agreement algorithm based on conditions.
文摘The Faddeev AGS equations for the coupled-channels ■NN-πΣN system with quantum numbers I=1/2 and S=0 are solved. Using separable potentials for the ■N-πΣ interaction, we calculate the transition probability for the(YK)I=0 + N→πΣN reaction. The possibility to observe the trace of the K-pp quasi-bound state in πΣN mass spectra was studied. Various types of chiral-based and phenomenological potentials are used to describe the ■N-πΣ interaction. Finally, we show that we can observe the signature of the K-pp quasi-bound state in the mass spectra, as well as the trace of branch points in the observables.
基金supported in part by the National Natural Science Foundation of China under Grant Nos.11101067 and 11571061Major Research Plan of the National Natural Science Foundation of China under Grant No.91230103the Fundamental Research Funds for the Central Universities
文摘Estimating the number of isolated roots of a polynomial system is not only a fundamental study theme in algebraic geometry but also an important subproblem of homotopy methods for solving polynomial systems. For the mixed trigonometric polynomial systems, which are more general than polynomial systems and rather frequently occur in many applications, the classical B6zout number and the multihomogeneous Bezout number are the best known upper bounds on the number of isolated roots. However, for the deficient mixed trigonometric polynomial systems, these two upper bounds are far greater than the actual number of isolated roots. The BKK bound is known as the most accurate upper bound on the number of isolated roots of a polynomial system. However, the extension of the definition of the BKK bound allowing it to treat mixed trigonometric polynomial systems is very difficult due to the existence of sine and cosine functions. In this paper, two new upper bounds on the number of isolated roots of a mixed trigonometric polynomial system are defined and the corresponding efficient algorithms for calculating them are presented. Numerical tests are also given to show the accuracy of these two definitions, and numerically prove they can provide tighter upper bounds on the number of isolated roots of a mixed trigonometric polynomial system than the existing upper bounds, and also the authors compare the computational time for calculating these two upper bounds.
基金Major Program of National Natural Science Foundation of China(60710002)Program for Changjiang Scholar and Innovative Research Team in University(PCSIRT)
