The Hα imaging spectrograph (HIS) is the scientific payload of first solar space mission, Chinese explorer (CHASE), supported by China National Space Administration (CNSA). CHASE/HIS achieves, for time in space, spectroscopic observations with high spectral and temporal resolutions. Separate channels raster scanning mode (RSM) continuum (CIM) are integrated into one, a highly design achieved th...

The disjunctive skolem chase is a sound and complete (albeit non-terminating) algorithm that can be used to solve conjunctive query answering over DL ontologies and programs with disjunctive existential rules. Even though acyclicity notions can be used to ensure chase termination for a large subset of real-world knowledge bases, the complexity of reasoning over acyclic theories still remains hi...

Abstract— In this paper, we present a hard-decision decoding technique based on Genetic Algorithms (HDGA), which is applicable to the general case where the only known structure is given by the generating matrix G. We also present a new soft-decision decoding based on HDGA and the Chase algorithm (SDGA). The simulations, applied on some binary Linear Block Codes, show that the genetic decoder h...

Akhtar et al. introduced equality-generating constraints and functional constraints as an initial step towards dependency-like integrity constraints for RDF data [1]. Here, we focus on functional constraints. The usefulness of functional constraints is not limited to the RDF data model. Therefore, we study the functional constraints in the more general setting of relations with arbitrary arity....

Conjunctive query answering over databases with constraints – also known as (tuple-generating) dependencies – is considered a central database task. To this end, several versions of a construction called chase have been described. Given a set Σ of dependencies, it is interesting to ask which constraints not contained in Σ that are initially satisfied in a given database instance are preserved w...

This letter investigates the combination of the Chase-2 and sum-product (SP) algorithms for low-density parity-check (LDPC) codes. A simple modification of the tanh rule for check node update is given, which incorporates test error patterns (TEPs) used in the Chase algorithm into SP decoding of LDPC codes. Moreover, a simple yet effective approach is proposed to construct TEPs for dealing with ...