GPS Ionospheric mapping and tomography: A case of study in a geomagnetic storm

The ionosphere has been normally detected by traditional instruments, such as ionosonde, scatter radars, topside sounders onboard satellites and in situ rocket. However, most instruments are expensive and also restricted to either the bottomside ionosphere or the lower part of the topside ionosphere (usually lower than 800 km), such as ground based radar measurements. Nowadays, GPS satellites in high altitude orbits (~20,200 km) are capable of providing details on the structure of the entire ionosphere, even the plasmasphere. In this paper, a Regional Ionospheric Mapping and Tomography (RIMT) tool was developed, which can be used to retrieve 2-D TEC and 3-D ionospheric electron density profiles using ground-based or space-borne GPS measurements. Some results are presented from the RIMT tool using regional GPS networks in South Korea and validated using the independent ionosonde. GPS can provide time-varying ionospheric profiles and information at any specified grid related to ionospheric activities and states, including the electron density response at the F2-layer peak (the NmF2) during geomagnetic storms.Comment: Proceeding of IEEE International Geoscience and Remote Sensing Symposium (IGARSS), 24-29 July, 2011, Vancouver, Canad

Determinations of |V_ub| and |V_cb| from measurements of B -> X_u,c\ell\nu differential decay rates

Methods are described in the framework of light-cone expansion which allow one to determine the Cabibbo-Kobayashi-Maskawa matrix elements |V_ub| and |V_cb| from measurements of the differential decay rates as a function of the scaling variables in the inclusive semileptonic decays of B mesons. By these model-independent methods the dominant hadronic uncertainties can be avoided and the B -> X_u\ell\nu decay can be very efficiently differentiated from the B -> X_c\ell\nu decay, which may lead to precise determinations of |V_ub| and |V_cb|.Comment: 11 pages, 2 figures, version as published in Mod. Phys. Lett. A, more discussion, references added, title chang

A Generic Position Based Method for Real Root Isolation of Zero-Dimensional Polynomial Systems

We improve the local generic position method for isolating the real roots of a zero-dimensional bivariate polynomial system with two polynomials and extend the method to general zero-dimensional polynomial systems. The method mainly involves resultant computation and real root isolation of univariate polynomial equations. The roots of the system have a linear univariate representation. The complexity of the method is $\tilde{O}_B(N^{10})$ for the bivariate case, where $N=\max(d,\tau)$, $d$ resp., $\tau$ is an upper bound on the degree, resp., the maximal coefficient bitsize of the input polynomials. The algorithm is certified with probability 1 in the multivariate case. The implementation shows that the method is efficient, especially for bivariate polynomial systems.Comment: 24 pages, 5 figure

3D Textured Model Encryption via 3D Lu Chaotic Mapping

In the coming Virtual/Augmented Reality (VR/AR) era, 3D contents will be popularized just as images and videos today. The security and privacy of these 3D contents should be taken into consideration. 3D contents contain surface models and solid models. The surface models include point clouds, meshes and textured models. Previous work mainly focus on encryption of solid models, point clouds and meshes. This work focuses on the most complicated 3D textured model. We propose a 3D Lu chaotic mapping based encryption method of 3D textured model. We encrypt the vertexes, the polygons and the textures of 3D models separately using the 3D Lu chaotic mapping. Then the encrypted vertices, edges and texture maps are composited together to form the final encrypted 3D textured model. The experimental results reveal that our method can encrypt and decrypt 3D textured models correctly. In addition, our method can resistant several attacks such as brute-force attack and statistic attack.Comment: 13 pages, 7 figures, under review of SCI

Control of a lane-drop bottleneck through variable speed limits

In this study, we formulate the VSL control problem for the traffic system in a zone upstream to a lane-drop bottleneck based on two traffic flow models: the Lighthill-Whitham-Richards (LWR) model, which is an infinite-dimensional partial differential equation, and the link queue model, which is a finite-dimensional ordinary differential equation. In both models, the discharging flow-rate is determined by a recently developed model of capacity drop, and the upstream in-flux is regulated by the speed limit in the VSL zone. Since the link queue model approximates the LWR model and is much simpler, we first analyze the control problem and develop effective VSL strategies based on the former. First for an open-loop control system with a constant speed limit, we prove that a constant speed limit can introduce an uncongested equilibrium state, in addition to a congested one with capacity drop, but the congested equilibrium state is always exponentially stable. Then we apply a feedback proportional-integral (PI) controller to form a closed-loop control system, in which the congested equilibrium state and, therefore, capacity drop can be removed by the I-controller. Both analytical and numerical results show that, with appropriately chosen controller parameters, the closed-loop control system is stable, effect, and robust. Finally, we show that the VSL strategies based on I- and PI-controllers are also stable, effective, and robust for the LWR model. Since the properties of the control system are transferable between the two models, we establish a dual approach for studying the control problems of nonlinear traffic flow systems. We also confirm that the VSL strategy is effective only if capacity drop occurs. The obtained method and insights can be useful for future studies on other traffic control methods and implementations of VSL strategies.Comment: 31 pages, 14 figure

Algorithms for the minimum sum coloring problem: a review

The Minimum Sum Coloring Problem (MSCP) is a variant of the well-known vertex coloring problem which has a number of AI related applications. Due to its theoretical and practical relevance, MSCP attracts increasing attention. The only existing review on the problem dates back to 2004 and mainly covers the history of MSCP and theoretical developments on specific graphs. In recent years, the field has witnessed significant progresses on approximation algorithms and practical solution algorithms. The purpose of this review is to provide a comprehensive inspection of the most recent and representative MSCP algorithms. To be informative, we identify the general framework followed by practical solution algorithms and the key ingredients that make them successful. By classifying the main search strategies and putting forward the critical elements of the reviewed methods, we wish to encourage future development of more powerful methods and motivate new applications

Spin-dependent empirical formula for the lowest excitation energies of the natural parity states in even-even nuclei

We present an empirical expression which holds for the lowest excitation energy of the natural parity states in even-even nuclei throughout the entire periodic table. This formula contains spin-dependent factors so that it is applied to different multipole states with the same model parameters in contrast to the recently proposed empirical expression where the model parameters had to be fitted for each multipole separately.Comment: 9 pages, 5 figure