This paper is a continuation of a previously published work regarding application of lumped-parameter code COCOSYS to the containment atmosphere mixing in the presence of jet/plume gas injection. The aim of the previo...
详细信息
This paper is a continuation of a previously published work regarding application of lumped-parameter code COCOSYS to the containment atmosphere mixing in the presence of jet/plume gas injection. The aim of the previous study was to develop a nodalisation scheme for satisfactory simulation of MISTRA M5 experiment. For this paper the aim was expanded to include the demonstration of nodalisation applicability to different experimental sequence. The task was defied to simulate additional MISTRA facility experiment using the same (except the differences caused by different experimental conditions, e.g., injection diameter) nodalisation scheme. The paper presents results of the simulation of two MISTRA facility experiments - M5 from the SARNET spray benchmark and one test from the International Standard Problem No. 47. Presented simulations were performed using lumped-parameter code COCOSYS with the same enhanced nodalisation scheme. Lumped-parameter code provided reasonable results in both cases. Nodalisational features employed to enhance plume injection simulation in lumped-parameter approach successfully mitigated inherent limitations of this approach in gas mixing modelling. (C) 2014 Elsevier B.V. All rights reserved.
An efficient intra coding method is presented for depth coding, namely edge skip. In the proposed method, the depth edge macro-block (MB) is skipped without coding. At the decoder side, the edge MB is reconstructed wi...
详细信息
An efficient intra coding method is presented for depth coding, namely edge skip. In the proposed method, the depth edge macro-block (MB) is skipped without coding. At the decoder side, the edge MB is reconstructed with the reference samples of the adjacent left and above lines, and the associated partitioning information. The partitioning information is derived from the co-located area in the corresponding reconstructed texture image by a k-means clustering. Experimental results demonstrate that the proposed method significantly improves the coding efficiency both objectively and subjectively.
The application of turbo codes to environments with impulsive noise, e.g. power line and digital subscriber line communication, but also mobile radio scenarios, is considered. A detector/turbo decoder concept, derived...
详细信息
The application of turbo codes to environments with impulsive noise, e.g. power line and digital subscriber line communication, but also mobile radio scenarios, is considered. A detector/turbo decoder concept, derived from turbo equalisation, avoiding potential numerical instabilities, is proposed. It is shown that turbo codes facilitate considerable performance improvements.
A novel matching pursuit (MP) image coding method is presented. A block partitioning scheme is employed to effectively exploit the spatial characteristics of MP atoms. Experimental results show that the proposed metho...
详细信息
A novel matching pursuit (MP) image coding method is presented. A block partitioning scheme is employed to effectively exploit the spatial characteristics of MP atoms. Experimental results show that the proposed method significantly outperforms the existing MP coding methods and thus bridges the gap in coding efficiency between MP- and wavelet-based approaches.
In this paper, we propose a sparseness constraint NMF method, named graph regularized matrix factorization with sparse coding (GRNMF SC). By combining manifold learning and sparse coding techniques together, GRNMF SC ...
详细信息
In this paper, we propose a sparseness constraint NMF method, named graph regularized matrix factorization with sparse coding (GRNMF SC). By combining manifold learning and sparse coding techniques together, GRNMF SC can efficiently extract the basic vectors from the data space, which preserves the intrinsic manifold structure and also the local features of original data. The target function of our method is easy to propose, while the solving procedures are really nontrivial;in the paper we gave the detailed derivation of solving the target function and also a strict proof of its convergence, which is a key contribution of the paper. Compared with sparseness constrained NMF and GNMF algorithms, GRNMF SCcan learn much sparser representation of the data and can also preserve the geometrical structure of the data, which endow it with powerful discriminating ability. Furthermore, the GRNMF SC is generalized as supervised and unsupervised models to meet different demands. Experimental results demonstrate encouraging results of GRNMF SC on image recognition and clustering when comparing with the other state-of-the-art NMF methods.
The (Schur) squares of linear codes are an interesting research topic in coding theory, and they have important applications in cryptography. Linear complementary dual codes (LCD codes) have been widely applied in dat...
详细信息
The (Schur) squares of linear codes are an interesting research topic in coding theory, and they have important applications in cryptography. Linear complementary dual codes (LCD codes) have been widely applied in data storage, communication systems, consumer electronics, and cryptography. Given these exciting applications of squares and LCD codes, we mainly focus on the squares of LCD cyclic codes in this paper. It will be proved that the square of an LCD cyclic code is still an LCD cyclic code. As a subclass of cyclic codes, Bose-Chaudhuri-Hocquenghem codes (BCH codes) have explicit defining sets that include consecutive integers, which gives an advantage of analyzing the parameters of BCH codes and their related codes. We will investigate the squares C-2(t) and C-2(t)(c) of the primitive LCD BCH codes C(t) and their complements C(t)(c) , respectively, where C(t)=C-(q,C-qm-1,C-2t,C--t+1) is the BCH code of length q(m)-1 over F-q with designed distance 2t . Two sufficient and necessary conditions to guarantee that C-2(t)not equalcoding theory and C-2(t)F-c not equal(q)n are proposed by giving restrictions on designed distances. Furthermore, the dimensions and lower bounds on minimum distances of C-2(t) and C-2(t)(c) are presented in some cases. The parameters of the squares of the complements of the Melas codes M(q,m) are also investigated.
The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-tuples of vectors. In this paper we pro...
详细信息
The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-tuples of vectors. In this paper we prove a new identity relating the multicovering radii of a code to a relativized notion of ordinary covering radius. This identity is used to prove new bounds on the multicovering radii of particular codes.
TASS/SMR-S is thermal-hydraulic design code for safety analysis of SMART plant. SBLOCA is considered as the design basis accident in the SMART. The capability of TASS/SMR-S for SBLOCA analysis was assessed using LOFT ...
详细信息
TASS/SMR-S is thermal-hydraulic design code for safety analysis of SMART plant. SBLOCA is considered as the design basis accident in the SMART. The capability of TASS/SMR-S for SBLOCA analysis was assessed using LOFT L3-7 as TMI action plan. Because TASS/SMR-S has been developed only for SMART, which is an integral reactor with helical steam generator heat exchanger, the steam generator model of TASS/SMR-S cannot be used directly for LOFT experiment that involves the use of U-tube steam generator. Therefore, the general heat structure model of TASS/SMR-S was used for modeling the SG heat exchanger. Nevertheless, TASS/SMR-S predicted important thermal-hydraulic parameters such as system pressure, fluid temperatures, and cladding temperature of reactor within reasonable error ranges. Further, TASS/SMR-S was applied to simulate SBLOCA in the SMART plant. In this simulation, thermal hydraulic parameters similar to those predicted in LOFT L3-7 were predicted. (c) 2012 Elsevier B.V. All rights reserved.
Inner Product Masking (IPM) is a generalization of several masking schemes including the Boolean one to protect cryptographic implementation against side-channel analysis. The core competitiveness of IPM is that it pr...
详细信息
Inner Product Masking (IPM) is a generalization of several masking schemes including the Boolean one to protect cryptographic implementation against side-channel analysis. The core competitiveness of IPM is that it provides higher side-channel resistance than Boolean masking with the same number of shares. In this paper, we follow a coding theoretic approach and categorize all linear codes of IPM with n = 2 shares over the finite field F-28 in terms of side-channel resistance. We focus on 2-share masking schemes, as they provide, at bit-level, as high as 3rd-order security (much higher than the 1st-order security of Boolean masking). We present the optimal codes for IPM in the sense of side-channel resistance assessed by the signal-to-noise ratio (SNR) and the mutual information (MI). We also show that IPM with equivalent linear codes have comparable level of side-channel resistance. Furthermore, we take the Best Known Linear Codes into consideration for comparison. The numerical results of SNR and MI confirm the effectiveness of our proposal for categorizing.
Adopting orthogonal frequency division multiplexing (OFDM) to low-density parity check (LDPC) coded multiple-input multiple-output (MIMO) is attractive scheme for wireless communication systems. An iterative receiver ...
详细信息
Adopting orthogonal frequency division multiplexing (OFDM) to low-density parity check (LDPC) coded multiple-input multiple-output (MIMO) is attractive scheme for wireless communication systems. An iterative receiver design for LDPC coded MIMO-OFDM system is proposed as the foundation for enhancing the wireless link performance can deliver the coverage, speed, throughput and reliability. However, in previous works, evaluations are basically assumed for a certain channel scenario and it is inefficient in incorporating different channel scenarios. The aim of this paper is to improve the system range for equivalent error rate, while not significantly increasing system complexity compared to conventional iterative receiver solution under realistic channel environment. We show that our proposed iteration adaptation at receiver can considerably adopt the system to realistic change environment, and reach very high reliability. Simulations of our optimization reveal superior error rate performance and lower computational cost vs. conventional LDPC coded MIMO OFDM system. Our simulation results also capture the effects of realistic vs. typical channel fading types (i.e., Rician vs. Rayleigh, respectively) and fading parameter models (average vs. random azimuth spread and K factor) on system performance and complexity. (C) 2014 Elsevier Ltd. All rights reserved.
暂无评论