2,459 research outputs found
Application of protein phosphatase 1 inhibition assay and a reversed phase liquid chromatography for the detection of microcystins in algal dietary supplements.
No full textOverexpression of MUC15 Activates Extracellular Signal–Regulated Kinase 1/2 and Promotes the Oncogenic Potential of Human Colon Cancer Cells
No full textThe construction of binary Huffman equivalent codes with a greater number of synchronising codewords
No full text[[abstract]]An inherent problem with a Variable-Length Code (VLC) is that even a single bit error can cause a loss of synchronisation, and thus lead to error propagation. Codeword synchronisation has been extensively studied as a means to overcome this drawback and efficiently stop error propagation. In this paper, we first present the sufficient and necessary conditions for the existence of binary Huffman equivalent codes with the shortest, or at most two shortest, synchronising codeword(s) of length m + 1, where m (>1) is the shortest codeword length. Next, based on the results, we propose a unified approach for constructing each of these binary Huffman equivalent codes with the shortest, or at most two shortest, synchronising codeword(s) of length m + 1, if such a code exists for a given length vector.[[note]]SC
RESIDENCY-BASED DISTRIBUTED COLLABORATIVE KEY AGREEMENT FOR DYNAMIC PEER GROUPS
No full text[[abstract]]The contributory group key agreement is suitable for real group-oriented network environments because it avoids the drawbacks of the centralized key generation center and the problem with the single point of failure in three different types of group-oriented communication schemes. previous studies have pointed out that the group member topology and the group key re-establishment strategy are two important aspects of scheme performance, especially with frequent member changes and large group sizes. Hence, based on the binary tree topology, we proposed the Residency-based Batch Rekeying Algorithm (RBR) to deal with membership dynamic events and group key re-establishment to maintain the forward/backward secrecy. The Residency-based Batch Rekeying Algorithm is divided into four phases, namely the Queue-Tree phase, the QT-Merge phase, the ST-Merge phase, and the Relocation phase. Using the concepts of subtree division and residency time classification, we design a new key tree topology to ensure that the join/leave member's location is as near as possible to the key tree root node to reduce the rekeying cost. Finally, we show that the rekeying cost of RBR is lower than that of any other proposed scheme via both mathematical analysis and simulation experiment.[[note]]SC
Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution
No full text[[abstract]]Fast computation of two-dimensional (2-D) generalized discrete Fourier transforms (GDFTs) and generalized discrete Hartley transforms (GDHTs) are discussed in terms of a new method which is derived based on index permutation, linear congruences, and polynomial transforms, Further, the 2-D skew circular convolution computed by the proposed skew polynomial transform is also included. (C) 2000 Elsevier Science B.V. All rights reserved.[[note]]SC
A generalized output pruning algorithm for matrix-vector multiplication and its application to compute pruning discrete cosine transform
No full text[[abstract]]In this correspondence, a generalized output pruning algorithm for matrix-vector multiplication is proposed. It is shown that for a given decomposition of the matrix of the transform kernel and the pruning pattern, the unnecessary operations for computing an output pruning discrete cosine transform (DCT) can be eliminated thoroughly by using the proposed algorithm.[[note]]SC
A refined fast 2-D discrete cosine transform algorithm
No full text[[abstract]]In this paper, a fast computation algorithm for the two-dimensional discrete cosine transform (2-D DCT) is derived based on index permutation. As a result, only the computation of N N-point 1-D DCT's and some post-additions are required for the computation of an (NxN)-point 2-D DCT. Furthermore, as compared with [7], the derivation of the refined algorithm is more succinct, and the associated post-addition stage possesses a more regular butterfly structure. The regular structure of the proposed algorithm makes it more suitable for VLSI and parallel implementations.[[note]]SC
A refined fast 2-D discrete cosine transform algorithm with regular butterfly structure
No full text[[abstract]]In this paper, a fast computation algorithm for the two-dimensional discrete cosine transform (2-D DCT) is derived based on index permutation. As a result, only the computation of N N-point 1-D DCT's and some post-additions are required for the computation of an (NxN)-point 2-D DCT. Furthermore, as compared with [7], the derivation of the refined algorithm is more succinct, and the associated post-addition stage possesses a more regular butterfly structure. The regular structure of the proposed algorithm makes it more suitable for VLSI and parallel implementations.[[note]]SC
Ultra-compact half-mode substrate integrated waveguide bandpass filters with IRCSRR metamaterial on reinforced hydrocarbon polymer ceramic composites
No full textIn this work, metamaterial-enabled ultra-compact evanescent-mode half-mode substrate integrated waveguide (HMSIW) bandpass filters are developed by loading inner-rotary complementary split-ring resonator (IRCSRR) on reinforced hydrocarbon polymer ceramic composites substrate. In the proposed IRCSRR, inner-rotary slots are etched inside the conventional complementary split-ring resonator (CSRR) metamaterials to enhance the product of equivalent inductance and capacitance without occupying extra circuit area. Therefore, the proposed HMSIW-IRCSRR filters can obtain more size reduction with the same operation frequency as compared with the conventional CSRR-based ones. Similar as the conventional CSRR case, the evanescent-mode transmission below the dominant cutoff frequency of HMSIW can be produced by the negative permittivity effect of IRCSRR, and a transmission zero (TZ) at the upper stopband can be simultaneously generated by the mutual coupling between HMSIW and IRCSRR. Then, to improve the upper stopband performance, source-load coupling topology is utilized in the two-pole filters, which can produce multiple extra TZs. Meanwhile, multiple microstrip L/T-shaped open stubs are employed to introduce hybrid low-pass effect to further extend the upper stopband much wider. To demonstrate the availability of the aforementioned concepts, a series of HSMIW-IRCSRR filters are experimentally designed, fabricated and verified. Measured results shows that both ultra-compact sizes and excellent frequency-selecting performance are achieved simultaneously, as well as good agreement with simulations, all of which illustrating quite good promises for the practical radio frequency and microwave applications
HSD3B1 as a Novel Trophoblast-associated Marker That Assists in the Differential Diagnosis of Trophoblastic Tumors and Tumorlike Lesions
No full text- …
