The software for portable systems for obtaining. image with coding apertures (masks) is described. The software developed controls all systems that form an image and obtain shadow patterns, reconstructs the initial ga...
详细信息
The software for portable systems for obtaining. image with coding apertures (masks) is described. The software developed controls all systems that form an image and obtain shadow patterns, reconstructs the initial gamma-image, and processes previously obtained images. The software is used with portable systems in which URA and MURA type masks with different rank are used as the coding aperture. Programs for modeling the process of obtaining shadow patterns using real apparatus which has different position-sensitive detectors are described. Possible configurations of new apparatus which could be of practical interest are examined.
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited attacker. A concise metric for the leve...
详细信息
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited attacker. A concise metric for the level of probing and fault security is introduced, which is directly related to the capabilities of a realistic attacker. In order to investigate the interrelation of probing and fault security we introduce a common mathematical framework based on the formalism of information and coding theory. The framework unifies the known linear masking schemes. We proof a central theorem about the properties of linear codes which leads to optimal secret sharing schemes. These schemes provide the lower bound for the number of masks needed to counteract an attacker with a given strength. The new formalism reveals an intriguing duality principle between the problems of probing and fault security, and provides a unified view on privacy and integrity protection using error detecting codes. Finally, we introduce a new class of linear tamper-resistant codes. These are eligible to preserve security against an attacker mounting simultaneous probing and fault attacks.
The capability of the three-dimensional two-fluid codes to simulate the local boiling flow processes has been assessed. Boiling flow experiments of Roy et al. [Roy, R.P., Kang, S., Zarate, J.A., Laporta, A., 2002. Tur...
详细信息
The capability of the three-dimensional two-fluid codes to simulate the local boiling flow processes has been assessed. Boiling flow experiments of Roy et al. [Roy, R.P., Kang, S., Zarate, J.A., Laporta, A., 2002. Turbulent subcooled boiling flow-experiments and simulations, J. Heat Transfer 124, 73-93] and Lee et al. [Lee, T.H., Park, G.C., Lee, DJ., 2002. Local flow characteristics of subcooled boiling flow of water in a vertical concentric annulus. Int. J. Multiphase Flow 28, 1351-1368], both performed in annular vertical channels were used as an experimental benchmark data set. The boiling flow is strongly affected by local mechanisms in the boundary layer near the heated wall. In this paper, the influence of near-wall modelling on the distribution of flow parameters at flow boiling has been analyzed. A generic wall function model for 3D two-fluid codes, based on surface roughness analogy has been proposed instead of commonly used single-phase log-law model. The new model has been implemented in the code CFX-4.4. In general, better agreement of phase velocities with experimental data were obtained with the new model. Presented results show that the influence of nucleating bubbles on the near-wall velocity profile should be taken into account. The second goal of this paper is to compare the NEPTUNE-CFD simulations against CFX-4.4 results and experimental data. (C) 2008 Elsevier B.V. All rights reserved.
Based on XOR coding, proposed is a proactive broadcasting for wireless broadcast systems where multiple faulty packets can be rectified at the cost of transmitting an additional coded packet. Since it greatly outstrip...
详细信息
Based on XOR coding, proposed is a proactive broadcasting for wireless broadcast systems where multiple faulty packets can be rectified at the cost of transmitting an additional coded packet. Since it greatly outstrips the conventional one in terms of BER performance, the proposed scheme can aggressively allocate the transmission rate to compensate for its throughput penalty. Numerical simulations show that the proposed scheme outperforms its conventional counterpart for about 5 dB SNR at a target BER of 10(-3) for an OFDM system.
Worldwide interoperability for microwave access (WiMAX) suffers from inter-carrier interference (ICI) since it adopts orthogonal frequency division multiplexing in physical layer. This study applies a repetition codin...
详细信息
Worldwide interoperability for microwave access (WiMAX) suffers from inter-carrier interference (ICI) since it adopts orthogonal frequency division multiplexing in physical layer. This study applies a repetition coding scheme, which encodes the same data on a subcarrier pair, to the hierarchical modulation to suppress the ICI and thus the inter-layer interference. Consequently, the proposed method mitigates the effects of fading and interference and provides a finer granularity of modulation order for link adaptation. Besides, the repetition coding scheme is also applied to a hybrid automatic repeat request (HARQ) protocol to recover error packets because of poor channel conditions. The proposed method incorporates the ICI cancellation into the conventional incremental redundancy HARQ and automatically activates the cancellation of ICI without Doppler shift/mobility estimation. Simulations show that the proposed algorithms outperform the conventional schemes in time-varying Rayleigh fading channels, especially in high-mobility environments.
In digital signal processing, the sampling theorem states that any real valued function f can be reconstructed from a sequence of values of f that are discretely sampled with a frequency at least twice as high as the ...
详细信息
In digital signal processing, the sampling theorem states that any real valued function f can be reconstructed from a sequence of values of f that are discretely sampled with a frequency at least twice as high as the maximum frequency of the spectrum of f. This theorem can also be applied to functions over finite domain. Then, the range of frequencies of f can be expressed in more detail by using a bounded set instead of the maximum frequency. A function whose range of frequencies is confined to a bounded set is referred to as bandlimited function. And a sampling theorem for bandlimited functions over Boolean domain has been obtained. Here, it is important to obtain a sampling theorem for bandlimited functions not only over Boolean domain (GF(2)(n) domain) but also over GF(q)(n) domain, where q is a prime power and GF(q) is Galois field of order q. For example, in experimental designs, although the model can be expressed as a linear combination of the Fourier basis functions and the levels of each factor can be represented by GF(q), the number of levels often take a value greater than two. However, the sampling theorem for bandlimited functions over GF(q)(n) domain has not been obtained. On the other hand, the sampling points are closely related to the codewords of a linear code. However, the relation between the parity check matrix of a linear code and any distinct error vectors has not been obtained, although it is necessary for understanding the meaning of the sampling theorem for bandlimited functions. En this paper, we generalize the sampling theorem for bandlimited functions over Boolean domain to a sampling theorem for bandlimited functions over GF(q)(n) domain. We also present a theorem for the relation between the parity check matrix of a linear code and any distinct error vectors. Lastly, we clarify the relation between the sampling theorem for functions over GF(q)(n) domain and linear codes.
Based on a review of visual observations at or near critical heat flux (CHF) under subcooled flow boiling conditions and consideration of CHF triggering mechanisms, presented in a companion paper [Le Corre, J.M., Yao,...
详细信息
Based on a review of visual observations at or near critical heat flux (CHF) under subcooled flow boiling conditions and consideration of CHF triggering mechanisms, presented in a companion paper [Le Corre, J.M., Yao, S.C., Amon, C.H., 2010. Two-phase flow regimes and mechanisms of critical heat flux under subcooled flow boiling conditions. Nucl. Eng. Des.], a model using a two-dimensional transient thermal analysis of the heater undergoing nucleation was developed to mechanistically predict CHF in the case of a bubbly flow regime. The model simulates the spatial and temporal heater temperature variations during nucleation at the wall, accounting for the stochastic nature of the boiling phenomena. It is postulated that a high local wall superheat occurring underneath a nucleating bubble at the time of bubble departure can prevent wall rewetting at CHF (Leidenfrost effect). The model has also the potential to evaluate the post-DNB heater temperature up to the point of heater melting. Validation of the proposed model was performed using detailed measured wall boiling parameters near CHF, thereby bypassing most needed constitutive relations. It was found that under limiting nucleation conditions: a peak wall temperature at the time of bubble departure can be reached at CHF preventing wall cooling by quenching. The simulations show that the resulting dry patch can survive the surrounding quenching events, preventing further nucleation and leading to a fast heater temperature increase. The model was applied at CHF conditions in simple geometry coupled with one-dimensional and three dimensional (CFD) codes. It was found that, within the range where CHF occurs under bubbly flow conditions (as defined in Le Corre et al., this issue), the local wall superheat underneath nucleating bubbles is predicted to reach the Leidenfrost temperature. However, a better knowledge of statistical variations in wall boiling parameters would be necessary to correctly capture the CHF trends wi
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x is an element of {0, 1}(n) and target values f(x) is an el...
详细信息
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x is an element of {0, 1}(n) and target values f(x) is an element of {0, 1} for each of these points, with the promise that there is a polynomial over F[2] of degree at most d that agrees with f at 1-epsilon fraction of the points. Our goal is to find a degree d polynomial that has good agreement with f. We show that it is NP-hard to find a polynomial that agrees with f on more than 1-2(-d) + delta fraction of the points for any epsilon, delta > 0. This holds even with the stronger promise that the polynomial that fits the data is in fact linear, whereas the algorithm is allowed to find a polynomial of degree d. Previously the only known hardness of approximation (or even NP-completeness) was for the case when d = 1, which follows from a celebrated result of Hastad [J. ACM, 48 (2001), pp. 798-859]. In the setting of Computational Learning, our result shows the hardness of nonproper agnostic learning of parities, where the learner is allowed a low-degree polynomial over F[2] as a hypothesis. This is the first nonproper hardness result for this central problem in computational learning. Our results can be extended to multivariate polynomial reconstruction over any finite field.
Using the behavior-code duality pointed out by Rosenthal et al., we study the relations between certain desirable features of a code and the corresponding controllability properties of its behavior. Module-theoretic c...
详细信息
Using the behavior-code duality pointed out by Rosenthal et al., we study the relations between certain desirable features of a code and the corresponding controllability properties of its behavior. Module-theoretic characterizations are provided as well. The coefficients of the codes and behaviors are taken to be integers modulo in, where in is not necessarily prime.
The results of a study on the development of a method for coding explosives are presented. As coding additives (CAs), it is proposed to use aluminum alloy powders with dosed amounts of rare-earth coding elements (CEs)...
详细信息
The results of a study on the development of a method for coding explosives are presented. As coding additives (CAs), it is proposed to use aluminum alloy powders with dosed amounts of rare-earth coding elements (CEs). This choice is dictated by the fact that aluminum alloys are commonly used as efficient additives in explosive compositions, while rare-earth elements are used as additives in technological operations, but are absent in the composition of standard explosives. In this case, the key to information on a given explosive and its manufacturer is the ratio of CE concentrations determined when analyzing explosives, e.g., when investigating an act of terrorism. Examples of explosion product decoding using a LIES laser-spark express analyzer.
暂无评论