1-8hit |
Dexiu HU Zhen HUANG Xi CHEN Jianhua LU
This paper proposes a moving source localization method that combines TDOA, FDOA and doppler rate measurements. First, the observation equations are linearized by introducing nuisance variables and an initial solution of all the variables is acquired using the weighted least squares method. Then, the Taylor expression and gradient method is applied to eliminate the correlation between the elements in the initial solution and obtain the final estimation of the source position and velocity. The proposed method achieves CRLB derived using TDOA, FDOA and doppler rate and is much more accurate than the conventional TDOA/FDOA based method. In addition, it can avoid the rank-deficiency problem and is more robust than the conventional method. Simulations are conducted to examine the algorithm's performance and compare it with conventional TDOA/FDOA based method.
This paper presents a visual knowledge structure reasoning method using Intelligent Topic Map which extends the conventional Topic Map in structure and enhances its reasoning functions. Visual knowledge structure reasoning method integrates two types of knowledge reasoning: the knowledge logical relation reasoning and the knowledge structure reasoning. The knowledge logical relation reasoning implements knowledge consistency checking and the implicit associations reasoning between knowledge points. We propose a Knowledge Unit Circle Search strategy for the knowledge structure reasoning. It implements the semantic implication extension, the semantic relevant extension and the semantic class belonging confirmation. Moreover, the knowledge structure reasoning results are visualized using ITM Toolkit. A prototype system of visual knowledge structure reasoning has been implemented and applied to the massive knowledge organization, management and service for education.
Wenyun GAO Xi CHEN Dexiu HU Haisheng XU
This paper presents non-iterative cooperative/parallel Kalman filtering algorithms for decentralized network navigation, in which mobile nodes cooperate in both spatial and temporal domains to infer their positions. We begin by presenting an augmented minimum-mean-square error (MMSE) estimator for centralized navigation network, and then decouple it into a set of local sub-ones each corresponding to a mobile node; all these sub-estimators work in parallel and cooperatively — with the state estimates exchanging between neighbors — to provide results similar to those obtained by the augmented one. After that, we employ the approximation methods that adopted in the conventional nonlinear Kalman filters to calculate the second-order terms involved in these sub-estimators, and propose a decentralized cooperative/parallel Kalman filtering based network navigation framework. Finally, upon the framework, we present two cooperative/parallel Kalman filtering algorithms corresponding to the extended and unscented Kalman filters respectively, and compare them with conventional decentralized methods by simulations to show the superiority.
The centralized controller of SDN enables a global topology view of the underlying network. It is possible for the SDN controller to achieve globally optimized resource composition and utilization, including optimized end-to-end paths. Currently, resource composition in SDN arena is usually conducted in an imperative manner where composition logics are explicitly specified in high level programming languages. It requires strong programming and OpenFlow backgrounds. This paper proposes declarative path composition, namely Compass, which offers a human-friendly user interface similar to natural language. Borrowing methodologies from Semantic Web, Compass models and stores SDN resources using OWL and RDF, respectively, to foster the virtualized and unified management of the network resources regardless of the concrete controller platform. Besides, path composition is conducted in a declarative manner where the user merely specifies the composition goal in the SPARQL query language instead of explicitly specifying concrete composition details in programming languages. Composed paths are also reused based on similarity matching, to reduce the chance of time-consuming path composition. The experiment results reflect the applicability of Compass in path composition and reuse.
In this letter, a quantitative evaluation index of contrast improvement of color images for dichromats is proposed. The index is made by adding two parameters to an existing index to make evaluation results consistent with human evaluation results. The effectiveness and validity of the proposed index are verified by experiments.
Tailin NIU Xi CHEN Longjiang QU Chao LI
(m+k,m)-functions with good cryptographic properties when 1≤k
For dichromats to receive the information represented in color images, it is important to study contrast improvement methods and quantitative evaluation indices of color conversion results. There is an index to evaluate the degree of contrast improvement and in this index, the contrast for dichromacy caused by the lightness component is given importance. In addition, random sampling was introduced in the computation of this index. Although the validity of the index has been shown through comparison with a subjective evaluation, it is considered that the following two points should be examined. First, should contrast for normal trichromacy caused by the lightness component also be attached importance. Second, the influence of random sampling should be examined in detail. In this paper, a new index is proposed and the above-mentioned points are examined. For the first point, the following is revealed through experiment. Consideration of the contrast for normal trichromacy caused by a lightness component that is the same as that for dichromacy may or may not result in a good outcome. The evaluation performance of the proposed index is equivalent to that of the previous index overall. It can be said that the proposed index is superior to the previous one in terms of the unity of evaluating contrast. For the second point, the computation time and the evaluation of significant digits are shown. In this paper, a sampling number such that the number of significant digits can be considered as three is used. In this case, the variation caused by random sampling is negligible compared with the range of the proposed index, whereas the computation time is about one-seventh that when the sampling is not adopted.
Xi CHEN Guodong JIANG Kaikai CHI Shubin ZHANG Gang CHEN Jiang LIU
Many nodes in Internet of Things (IoT) rely on batteries for power. Additionally, the demand for executing compute-intensive and latency-sensitive tasks is increasing for IoT nodes. In some practical scenarios, the computation tasks of WDs have the non-separable characteristic, that is, binary offloading strategies should be used. In this paper, we focus on the design of an efficient binary offloading algorithm that minimizes system energy consumption (EC) for TDMA-based wireless-powered multi-access edge computing networks, where WDs either compute tasks locally or offload them to hybrid access points (H-APs). We formulate the EC minimization problem which is a non-convex problem and decompose it into a master problem optimizing binary offloading decision and a subproblem optimizing WPT duration and task offloading transmission durations. For the master problem, a DRL based method is applied to obtain the near-optimal offloading decision. For the subproblem, we firstly consider the scenario where the nodes do not have completion time constraints and obtain the optimal analytical solution. Then we consider the scenario with the constraints. By jointly using the Golden Section Method and bisection method, the optimal solution can be obtained due to the convexity of the constraint function. Simulation results show that the proposed offloading algorithm based on DRL can achieve the near-minimal EC.