Miracle-dz/UniFAR-FTUs huggingface dataset:
Heterogeneous Track-to-Track Fusion Using Equivalent Measurement and Unscented Transform

This document presents a novel track-to-track fusion (T2TF) approach for heterogeneous tracks. T2TF enables a distributed fusion structure, where tracks from local trackers are transmitted to a global tracker, that fuses the local tracks. T2TF offers the opportunity of low communication load almost without loss of information, compared to centralized measurement-to-track fusion (CMF). Heterogeneous tracks are of different state spaces, which are often non-linearly related. Heterogeneous track-to-track fusion (HT2TF) arises two challenges. Firstly, the fusion of tracks in different state spaces. Secondly, the cross-correlation in the state estimation errors. The presented HT2TF approach is based on the equivalent measurement and the unscented transform (UT). Compared to state-of-the-art approaches, the Jacobian is not required. For evaluation our approach is compared with the corresponding CMF.
SAGE: a comprehensive resource of genetic variants integrating South Asian whole genomes and exomes

Abstract South Asia is home to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{upgreek} \usepackage{mathrsfs} \setlength{\oddsidemargin}{-69pt} \begin{document} }{}$\sim $\end{document}20% of the world population and characterized by distinct ethnic, linguistic, cultural and genetic lineages. Only limited representative samples from the region have found its place in large population-scale international genome projects. The recent availability of genome scale data from multiple populations and datasets from South Asian countries in public domain motivated us to integrate the data into a comprehensive resource. In the present study, we have integrated a total of six datasets encompassing 1213 human exomes and genomes to create a compendium of 154 814 557 genetic variants and adding a total of 69 059 255 novel variants. The variants were systematically annotated using public resources and along with the allele frequencies are available as a browsable-online resource South Asian genomes and exomes. As a proof of principle application of the data and resource for genetic epidemiology, we have analyzed the pathogenic genetic variants causing retinitis pigmentosa. Our analysis reveals the genetic landscape of the disease and suggests subset of genetic variants to be highly prevalent in South Asia.
Heterothallic sexual reproduction in three canker-inducing tree pathogens within the Fusarium torreyae species complex

ABSTRACT Fusarium zanthoxyli and F. continuum are sister taxa that are the etiological agents of canker disease of prickly ash (Zanthoxylum bungeanum) in northern China. These two pathogens, together with F. torreyae, the causal agent of canker disease of the critically endangered conifer Florida torreya (Torreya taxifolia) from northern Florida and southwestern Georgia, constitute a novel clade, the F. torreyae species complex. To assess their reproductive mode, a polymerase chain reaction (PCR) assay targeting the MAT1-1 and MAT1-2 idiomorphs was designed and validated, using MAT sequences mined from the whole-genome sequence of the three F. torreyae clade pathogens and several closely related fusaria. Results of the MAT idiomorph PCR assay indicated that isolates of the three pathogens were MAT1-1 or MAT1-2. When MAT1-1 and MAT1-2 isolates of each species were crossed on carrot agar, all of the F. zanthoxyli (N = 30) and F. continuum (N = 3) isolates tested were female fertile, yielding mature perithecia with viable ascospores. By comparison, only one pairing of the five different isolates of F. torreyae produced perithecia; however, the majority of the asci in this cross aborted or produced fewer than eight ascospores. Of the three temperatures tested (i.e., 22, 25, and 27 C), the optimal temperature for perithecium production was 22–25 C in F. zanthoxyli and 25 C in F. continuum and F. torreyae. Ascospore progeny from three separate crosses of F. zanthoxyli and F. continuum and one cross of F. torreyae were genotyped to assess whether they were the products of genetic recombination and sexual reproduction. Genotyping of 34–40 progeny from the F. zanthoxyli and F. continuum crosses confirmed that they were the products of sexual reproduction. However, only 36% of the progeny in the F. torreyae cross were recombinant, which was roughly half of the nonparental progeny expected with three markers segregating.
Saliency detection based on aggregated Wasserstein distance

Abstract. This paper proposes a saliency detection method based on the aggregated Wasserstein distance. A multidimensional Gaussian mixture model is used to model the superpixels, whereby the color information of different color spaces is combined. To overcome the lack of the closed-form solution for the Gaussian mixture model, we employ the aggregated Wasserstein distance to measure the perceptual similarity between different superpixels. The saliency value is then calculated from two aspects. First, the global saliency is computed through all the superpixels in the image using the aggregated Wasserstein distance. Second, the local saliency is computed in a lower range with the same measure. Finally, a saliency map is obtained by combining the two types of saliencies, and is filtered by spectral clustering all the superpixels. The experimental results show that the proposed method outperforms 11 recent exact algorithms on three widely used open datasets.
FlowHacker: Detecting Unknown Network Attacks in Big Traffic Data Using Network Flows

Traditional Network Intrusion Detection Systems (NIDSs) inspect the payload of the packets looking for known intrusion signatures or deviations from normal behavior, but inspecting traffic at the current speed of Internet Service Provider (ISP) networks is difficult or even unfeasible. This paper presents an approach to detect malicious traffic and identify malicious hosts by inspecting flows, leveraging a combination of unsupervised machine learning and threat intelligence, without requiring either previous knowledge about attacks or traffic without attacks. The approach was implemented in the FlowHacker NIDS and evaluated with two kinds of traffic flows: synthetic traffic flows and real ISP traffic flows.
An Efficient 3D Reconstruction System for Chinese Ancient Architectures

Multi-View 3D reconstruction has been studied by researchers from various countries for decades, but still is a heat point in the field of computer vision. Generally 3D reconstruction system can be realized by the method of incremental Structure-from-Motion, which consists of several procedures such as feature detection, feature matching and triangulation. In this paper, we propose a speed-up 3D reconstruction system that associates several efficient algorithms, which can recover 3D structure form a set of unordered images of the ancient architectures in China. The experiment result shows that the system has a good performance in efficiency and final reconstruction appearance of kinds of buildings.
A Fast and Power-Efficient Hardware Architecture for Visual Feature Detection in Affine-SIFT

Visual feature detection has been widely used in many computer vision applications, with increasing concern on feature robustness, processing speed, and power efficiency. In comparison with popular feature detection algorithms, affine-SIFT achieves the strongest robustness on the image illumination, image rotation, and image scale transformation, but exhibits extreme high computation complexity. To improve its computing efficiency, this work first proposes three hardware optimization methods to address three main performance bottlenecks. The first method is the reverse affine-based pipelined computing with optimized memory accessing. The second method is about stream processing with full parallel Gaussian pyramid. The third method is the rotation invariant binary pattern based feature vector generation. Then by incorporating these three optimization methods, this paper designs a high-efficient pipelined and parallel hardware architecture with optimized parallel memory accessing. Postlayout simulations using TSMC 65-nm 1P9M low power process show that this work achieves a processing speed of 97 fps at 1080p (1000 feature points per frame on average) under 200 MHz, with power consumption at 300 mW. In comparison, its computing efficiency (1005.6K pixels/s at 1 MHz) and power efficiency (670.5K pixels/s at 1 mW) are higher than state-of-the-art works and it is more promising for broad vision applications especially the embedded vision and mobile vision applications.
StreamDB: A Unified Data Management System for Service-Based Cloud Application

Current data management systems are mainly divided into two categories: Database Management System (DBMS) and Data Stream Management System (DSMS). The increasing use of streaming analysis in modern service-based cloud applications has created an arms race among DBMS vendors to offer ever more sophisticated in-database streaming support, which requires handling the volume, variety, velocity and variability of fast data collections. Unfortunately, current solutions either only provide limited streaming analysis capacity and horizontal scalability (classic RDBMS) or trade off transaction processing for other properties (NoSQL DBMS), leading to the curse of no "one size fits all" for DBMS. In this paper, we argue that transaction processing is a relevant concept for DSMS. As a first step toward "One Size Fits All" Data Management System, we present StreamDB, which integrates transaction processing in DSMS as opposed to extending DBMS to support streams. First, we describe how StreamDB processes transactions in a streaming environment, then we compare our approach with traditional in-memory DBMS on typical transactional benchmarks. Our results show that StreamDB is advantageous in terms of throughput, scalability, and latency. Finally, we argue that the ideas present here provide insight on the development of next-generation data management systems and motivate further study of the challenges inherent in unifying DBMS and DSMS.
PUSC: Privacy-Preserving User-Centric Skyline Computation Over Multiple Encrypted Domains

In this paper, we present a new privacy-preserving user-centric skyline computation framework over different encrypted domains, which we referred to as PUSC. With PUSC, a user can flexibly obtain the skyline set from different service providers without disclosing user preferences to third parties in the system. Specifically, we introduce a secure user-defined vector dominance protocol to compare the vector dominance relationship between two encrypted vectors, according to user's preference. This serves as the core protocol in PUSC. Detailed security analysis shows that the proposed PUSC achieves the goal of selecting skyline set according to authorized users' preferences without leaking their privacy to other parties. In addition, performance evaluation demonstrates PUSC's efficiency in terms of providing skyline computation and transmission while minimizing privacy disclosure.
Design of AGV Low-Delay Visual Servo System

The visual sensing technology has been more and more applied to AGV (Automated Guided Vehicle), sometimes, the visual-aided navigation will fail to orientate and grab the objective due to vehicle body shaking. For the traditional method, the motion characteristics between image frames are obtained through Fourier transform of images, to obtain the image compensations and correct the image, with more calculations and poor real-time performance. In most AGVs, gyroscope and pose measurement sensor are equipped. In this paper, the output parameters of gyroscope were read, to correct the image and obtain the stable output. Through experiment, time delay for obtaining the corrected parameters is reduced by 97% than that obtained through traditional method.
Delegation of Decryption Rights With Revocability From Learning With Errors

The notion of decryption rights delegation was initially introduced by Blaze <italic>et al.</italic> in EUROCRYPT 1998. It, defined as <italic>proxy re-encryption</italic>, allows a semi-trusted proxy to convert a ciphertext intended for a party to another ciphertext of the same plaintext, without knowledge of the underlying plaintext and decryption key. It has been explored to many real-world applications, e.g., encrypted email forwarding. However, the intrinsic all-or-nothing share feature of proxy re-encryption yields a limitation that the share cannot be revoked. This may hinder the scalability of its applications in practice. In this paper, for the first time, we define the concept of revocability in terms of decryption rights delegation. The novel concept enables data owner to revoke the shared decryption rights when needed. Inspired by the seminal lattice-based proxy re-encryption proposed in PKC 2014, we design a concrete lattice-based construction which satisfies the notion. In our construction, we make use of binary-tree structure to implement the revocation of decryption rights, so that the update of re-encryption key is reduced to <inline-formula> <tex-math notation="LaTeX">$O(logN)$ </tex-math></inline-formula> (instead of <inline-formula> <tex-math notation="LaTeX">$O(N)$ </tex-math></inline-formula>), where <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula> is the maximum number of delegatee. Furthermore, the security of our scheme is based on the standard learning with errors problem (LWE problem), which could be reduced to the worst-case hard problems (such as GapSVP and SIVP) in the context of lattices. The scheme is chosen ciphertext secure in the standard model. As of independent interest, our scheme achieves both backward and forward security, which means that once a user is revoked after a time period <inline-formula> <tex-math notation="LaTeX">$\mathbf {t}$ </tex-math></inline-formula>, it cannot gain access to all encrypted files before and after <inline-formula> <tex-math notation="LaTeX">$\mathbf {t}$ </tex-math></inline-formula>.
DBQA: Multi-Environment Analyzer for Query Execution Time and Cost

In today’s computational world, many ways are available for storing and retrieving database. Numbers of commercial database management systems are available in the market with their superiors. The primary goal of DBMSs is to provide a way to store and retrieve database information that is both convenient and efficient. The question is which one to be selected according to our need and usage. While selecting DBMSs the main agenda is its performance. The performance of the system measured in terms of cost and time. If a larger query process with minimum time and cost, we can say the performance of the system is good. The care of performance is taken by query optimization technique in query processing. This is a core part of the paper; in the paper, we have developed DBQA (Database Query Analyzer) to analyze performance of the top four DBMSs on select queries with respect to time and cost. The DBMSs used for performance are MySQL, PostgreSQL, Oracle and MS SQL Server. The standard dataset DBLP have used for testing with 9360103 records.
A Mechanical Design for Efficient Hopping of Planetary Rover on Soft Soil

This paper presents a novel mechanical design for efficient traverse of hopping rovers. In order to continue the exploration of planetary environment without any human help, optimizations and efficient designs of rovers are essential. In particular, improving robustness and decreasing energy consumption are crucial aspects of rovers design. Hopping efficiency on sandy surfaces is strikingly worse than on hard ground, because such soil is deformed and easily causes slip. The purpose of this paper is to develop a novel mechanical design which can get enough friction from granular media. First, the effects of soft soil for hopping are studied by comparing with hopping on hard ground in terms of energy. Next, a novel foot pad design for hopping on planetary terrain is proposed. Inspired by the conventional wheeled vehicle design, treads, called grouser, are installed for the bottom of the proposed foot pad. The effectiveness of the proposed design is validated through experimental evaluation.
PFS: A Personalized Flight Recommendation Service via Cross-Domain Triadic Factorization

When a passenger is going to book an airline flight, after he inputs his query conditions, he has to search from a long flight list to find the one that best matchs his preferences. Therefore, a friendly personalized flight recommender system is a necessary tool for online travel service companies. However, the majority of current approaches do not work well since in most cases, there is no enough historical order information on the route the customers may plan to take. In this paper, we propose an approach for building a Personalize Flight recommendation Service (PFS). In PFS, the attributes' information of flight orders is organized into several domains, and a tensor factorization method is used to recommend flights to users. Specifically, PFS applies a history-based weighting strategy to better model users' biases. PFS is also implemented in a distributed and parallel way to increase its execution speed when dealing with a huge amount of flight data. Extensive experiments on both a real flight order dataset and a synthetic large-scale dataset show the superiority of our model against other comparative ones.
MIMO Through-Wall-Radar Spotlight Imaging Based on Arithmetic Image Fusion

In this paper, we present an easy single-side two-location spotlight imaging method for mapping the wall layout of buildings and for detection of stationary targets within buildings by utilizing multiple-input multiple-output (MIMO) through-wall-radar. Rather than imaging for building walls directly, the images of all building corners are generated to speculate wall layout indirectly by successively deploying the MIMO through-wall-radar at two appropriate locations on only one side of building and then carrying out spotlight imaging with two different squint views. The phase coherence factor (PCF) weighting is introduced to suppress the interferences of multi-path ghosts and grating-side lobes in two single-location images, and an arithmetic fusion strategy is designed to fuse two single-location images into one panorama image with all corner images and clear target images. Computer Simulation Technology (CST) electromagnetic simulation validates the proposed imaging method.
Accurate Analysis of JEM Interference In Airborne Array Characteristics using Parallel HO-IE-DDM

In this paper, we present a parallel integral equations based on domain decomposition method discretized by higher-order basis functions (HO-IE-DDM) to analyze airborne array interference problems affected by jet engine modulation. This paper proposes two main novelties. Firstly, the interfered radiation characteristics of airborne array by multiple rotating blades are analyzed using integrated simulation technology. Secondly, the recalculation amount is reduced by using HO-IE-DDM, for only re-computing the changed parts of the model during the analysis process. Numerical examples with complex electrically large structures are simulating to demonstrate the flexibility, accuracy, and efficiency of HO-IE-DDM. The compared maps show the change laws of modulation level.
Eye tracking as a mean to detect feigned cognitive impairment in the Word Memory Test

Abstract Eye movements showed initial promise for the detection of deception and may be harder to consciously manipulate than conventional accuracy measures. Therefore, we integrated an eye-tracker with the Word Memory Test (WMT) and tested its usefulness for the detection of feigned cognitive impairment. As part of the study, simulators (n = 44) and honest controls (n = 41) performed WMT's immediate-recognition (IR) subtest while their eye movements were recorded. In comparison to the control group, simulators spent less time gazing at relevant stimuli, spent more time gazing at irrelevant stimuli, and had a lower saccade rate. Group classification using a scale that combined the eye movement measures and the WMT's accuracy measure showed tentative promise (i.e., it enhanced classification compared to the use of the accuracy measure as the sole predictor of group membership). Overall, integration of an eye-tracker with the WMT was found to be feasible and the eye movement measures showed initial promise for the detection of feigned cognitive impairment. Moreover, eye movement measures proved useful in enhancing our understanding of strategies utilized by the simulators and the cognitive processes that affect their behavior. While the findings are clearly preliminary, we hope that they will encourage further research of these promising psychophysiological measures.
FlipTracker: Understanding Natural Error Resilience in HPC Applications

As high-performance computing systems scale in size and computational power, the danger of silent errors, i.e., errors that can bypass hardware detection mechanisms and impact application state, grows dramatically. Consequently, applications running on HPC systems need to exhibit resilience to such errors. Previous work has found that, for certain codes, this resilience can come for free, i.e., some applications are naturally resilient, but few studies have shown the code patterns—combinations or sequences of computations—that make an application naturally resilient. In this paper, we present FlipTracker, a framework designed to extract these patterns using fine-grained tracking of error propagation and resilience properties, and we use it to present a set of computation patterns that are responsible for making representative HPC applications naturally resilient to errors. This not only enables a deeper understanding of resilience properties of these codes, but also can guide future application designs towards patterns with natural resilience.
Continuum Delta Robot: a Novel Translational Parallel Robot with Continuum Joints

Researches on continuum robots thrive due to many advantages such as design compactness and motion dexterity. Among the recent advances, it is well noted the proposal of Parallel Continuum Robot (PCR) whose legs are made from elastic rods. The legs undergo deformations along their entire lengths and sophisticated mechanics is used to describe their shapes and the kinematics. Following a different approach, this paper proposes to design parallel robots with continuum joints. The continuum joints would assume constant curvature bending and hence produce relatively simple kinematics. With the bending ranges achievable beyond 90°, a parallel robot with continuum joints, instead of universal or spherical joints, can realize larger workspace. As a particular demonstrative example, a Continuum Delta Robot (CDR) is proposed. Each of the CDR's legs consists of two coupled continuum joints which inherently realize translational movements of the end effector. The design concept, kinematics, system description and experimental characterizations are presented. From the presented Continuum Delta Robot, more parallel robots with continuum joints can be proposed and new design methodology can be developed.