Map Matching algorithms (MMA) are developed to solve spatial ambiguities that arise in the process of assigning GPS measurements onto a digital roadway network. There is a lack of systematic parameter tuning approache...
详细信息
ISBN:
(纸本)9781509056774
Map Matching algorithms (MMA) are developed to solve spatial ambiguities that arise in the process of assigning GPS measurements onto a digital roadway network. There is a lack of systematic parameter tuning approaches for optimizing the MMA performance. Thus, a novel integrated framework is proposed for a systematic calibration of the parameters of a post-processing MMA. The calibration approach consists of an Instance-specific Parameter Tuning Strategy (IPTS) that employs Fuzzy Logic principles. The proposed fuzzy IPTS tool determines the best algorithm parameter values by using instance-specific information a priori to the execution of the MMA. A preliminary prototype of an IPTS system is designed based on real-world data, which identifies the explanatory variables that condition the MMA performance. The implementation of the fuzzy IPTS tool on real-word data yields an enhanced MMA performance in the solution quality and computational time compared to the results of the execution of the MMA with constant algorithm settings.
Conventional sampling techniques fall short of drawing descriptive sketches of the data when the data is grossly corrupted as such corruptions break the low rank structure required for them to perform satisfactorily. ...
详细信息
ISBN:
(纸本)9781538610343
Conventional sampling techniques fall short of drawing descriptive sketches of the data when the data is grossly corrupted as such corruptions break the low rank structure required for them to perform satisfactorily. In this paper, we present new sampling algorithms which can locate the informative columns in presence of severe data corruptions. In addition, we develop new scalable randomized designs of the proposed algorithms. The proposed approach is simultaneously robust to sparse corruption and outliers and substantially outperforms the state-of-the-art robust sampling algorithms as demonstrated by experiments conducted using both real and synthetic data.
Getting confidence regions for parameter estimates obtained from data collected by a wireless sensor network (WSN) is very important to assess the performance of the estimator. The sign perturbed sums (SPS) approach h...
详细信息
ISBN:
(纸本)9781467389990
Getting confidence regions for parameter estimates obtained from data collected by a wireless sensor network (WSN) is very important to assess the performance of the estimator. The sign perturbed sums (SPS) approach has been proposed recently to defined exact confidence regions in a centralized setting even if only few measurements are available. SPS may be distributed to get confidence regions at each node of a WSN. This paper investigates a data dissemination strategy called Tagged and Aggregated Sums (TAS), exploiting the particularities of SPS, to efficiently provide each node with the information necessary to evaluate locally the confidence region. TAS and flooding (FL) algorithms have been investigated through simulations and then implemented on commercial sensor nodes. The impact of collision avoidance mechanisms at the medium access control (MAC) layer is also experimentally assessed. Performance comparisons show that TAS outperforms FL in structured networks.(1)
In the multi-robot applications, the maintained and desired network may he destroyed by failed robots. The existing self-healing algorithms only handle with the case of single robot failure, however, multiple robot fa...
详细信息
ISBN:
(纸本)9781538635247
In the multi-robot applications, the maintained and desired network may he destroyed by failed robots. The existing self-healing algorithms only handle with the case of single robot failure, however, multiple robot failures may cause several challenges, such as disconnected network and conflicts among repair paths. This paper presents a distributed self-healing algorithm based on 2-hop neighbor infomation to resolve the problems caused by multiple robot failures. Simulations and experiment show that the proposed algorithm manages to restore connectivity of the mobile robot network and improves the synchronization of the network globally, which validate the effectiveness of the proposed algorithm in resolving multiple robot failures.
An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition problem. As a combinatorial problem, grap...
详细信息
ISBN:
(纸本)9781538634721
An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition problem. As a combinatorial problem, graph partition is NP-hard, but existing relaxation methods provide reasonable approximate solutions that can be scaled for large graphs. Competitive benchmarks and challenges have proven to be an effective means to advance state-of-the-art performance and foster community collaboration. This paper describes a graph partition challenge with a baseline partition algorithm of sub-quadratic complexity. The algorithm employs rigorous Bayesian inferential methods based on a statistical model that captures characteristics of the real-world graphs. This strong foundation enables the algorithm to address limitations of well-known graph partition approaches such as modularity maximization. This paper describes various aspects of the challenge including: (1) the data sets and streaming graph generator, (2) the baseline partition algorithm with pseudocode, (3) an argument for the correctness of parallelizing the Bayesian inference, (4) different parallel computation strategies such as node-based parallelism and matrix-based parallelism, (5) evaluation metrics for partition correctness and computational requirements, (6) preliminary timing of a Python-based demonstration code and the open source C++ code, and (7) considerations for partitioning the graph in streaming fashion. Data sets and source code for the algorithm as well as metrics, with detailed documentation are available at ***.
High-Efficiency Video Coding (HEVC) is the newest video coding standard and presents improved efficiency. However, the coding computational complexity of this process is significant because of its coding structure cal...
详细信息
ISBN:
(纸本)9781509067213
High-Efficiency Video Coding (HEVC) is the newest video coding standard and presents improved efficiency. However, the coding computational complexity of this process is significant because of its coding structure called quad-tree structure coding units (CUs) for improving compression efficiency. In this paper, a fast algorithm based on image complexity of current CU is proposed to reduce the computational complexity caused by CU partition. Using the number of colors, entropy, and contrast can distinguish the image complexity of different CUs. Such complexity is related to whether the CU needs to be partitioned or its rate distortion optimization can be skipped. Coding bits of current CU are used as qualifications to determine whether to partition the current CU. Experimental results show that the proposed algorithm can reduce coding time by 35% on average and exhibits an acceptable loss of Bjøntegaard delta bit rate of 0.8% compared with the default algorithm in HM-16.11 for encoding natural sequences.
Current networks are changing very fast. Network administrators need more flexible and powerful tools to be able to support new protocols or services very fast. The P4 language provides new level of abstraction for fl...
详细信息
ISBN:
(纸本)9789090304281
Current networks are changing very fast. Network administrators need more flexible and powerful tools to be able to support new protocols or services very fast. The P4 language provides new level of abstraction for flexible packet processing. Therefore, we have designed new architecture for memory efficient mapping of P4 match/action tables to FPGA. The architecture is based on DCFL algorithm and is able to balance the processing speed and available memory resources.
In this paper, we study a class of hierarchical finite transition systems representing a set of fault configurations, and we consider synthesizing fault tolerant controllers for such systems that lead to a graceful de...
详细信息
ISBN:
(纸本)9781509028733
In this paper, we study a class of hierarchical finite transition systems representing a set of fault configurations, and we consider synthesizing fault tolerant controllers for such systems that lead to a graceful degradation as faults occur. In previous work, the problem was solved under the assumptions that (i) the specification for each fault configuration is of "reach-avoid-stay" type, (ii) the knowledge of the fault occurrence is immediate. We extend the previous work in two aspects. First, we propose an algorithm that works for specifications given in a more general fragment of linear temporal logic. Secondly, we show how the proposed algorithm can be modified to synthesize controllers that guarantee satisfaction of the specification even in the presence of fault detection delays.
Cooperative caching is a promising technology for enhancing user experience and reducing redundant transmissions through the participation of multiple caching nodes. In this paper, we design a clustering algorithm for...
详细信息
ISBN:
(纸本)9781509050192
Cooperative caching is a promising technology for enhancing user experience and reducing redundant transmissions through the participation of multiple caching nodes. In this paper, we design a clustering algorithm for the sectionalized caching, in which each user divides its caching space into two parts and the contents cached in these two parts are determined according to the individual interest and the joint interest of all users in the same cluster respectively. Different to most of the existing works forming the clusters based on the interest similarity of all files, we adopt the piecewise interest similarity as the criterion of clustering, which takes advantage of the content diversity and contributes to the reduction of the transmission delay. We measure the gain of the cooperation between two users and obtain the piecewise interest similarity for two users accordingly. Since the gain of clustered caching highly depends on the formed cluster structure, we estimate the gain of the clustered caching based on the piecewise interest similarities by online learning and propose an affinity propagation (AP) based clustering algorithm. Finally, our proposed clustering algorithm is evaluated by simulation to show its superiority over the conventional clustering algorithms.
EtherCAT (Ethernet control automation technology) has the advantages of high speed, high efficiency and many kinds of physical topology. EtherCAT uses distributed clock technology to achieve precise clock synchronizat...
详细信息
ISBN:
(纸本)9781509061617
EtherCAT (Ethernet control automation technology) has the advantages of high speed, high efficiency and many kinds of physical topology. EtherCAT uses distributed clock technology to achieve precise clock synchronization between slave nodes. It is especially important for the precise clock synchronization in the real-time control system. The crystal oscillator of slave stations will lead to tiny difference of the timing cycle between them. Transmission process of data frame between the different stations also produce delays. These clock synchronization delay errors will affect the performance of real-time systems. In order to minimize the error and improve the real-time performance of the system, it is necessary to study the EtherCAT clock synchronization algorithm. This paper presents a high precision clock synchronization algorithm which is based on the improvement of the clock synchronization algorithm of EtherCAT. Toolbox Truetime is a simulation toolbox based on Matlab/Simulink, it can be used to simulate distributed realtime control systems and network control systems. The feasibility of the algorithm is verified by Truetime toolbox, and the new algorithm has high precision.
暂无评论