Following the Benchmark Phase I on the criticality excursion organized by the OECD NEA Working Party on the Nuclear Criticality Safety (Expert Group on Criticality Excursion), the Phase II of the benchmark was launche...
详细信息
Following the Benchmark Phase I on the criticality excursion organized by the OECD NEA Working Party on the Nuclear Criticality Safety (Expert Group on Criticality Excursion), the Phase II of the benchmark was launched by selecting three experiments (R159, R76, R61) conducted at Japanese TRACY facility and one (LE1-641) from French SILENE facility. The main features of the Phase II of the benchmark are the ramp reactivity insertion generated by pumping fuel solution into the core tank (TRACY) or slow withdrawal of central transient rod (SILENE), and the use of both low enriched uranium (10 w/o, TRACY) and high enriched uranium (93 w/o, SILENE) for the uranyl nitrate fuel solution. As in the Phase I, trace code was used for the Phase II and the benchmark evaluated results were presented and discussed. The kinetic parameters, reactivity temperature and void coefficients for the benchmark were prepared using SRAC code system (PIJ, ANISN, CITATION and TWOTRAN modules) with JENDL-3.3 library. In general, the code benchmark results for the TRACY cases show excellent agreement with the measured data. However, for the SILENE case, overestimation of the power profile was observed. (C) 2015 Elsevier Ltd. All rights reserved.
Reflux condensation in the U-tubes of a steam generator (SG) plays a vital role in removing heat in pressurized water reactors (PWRs) during mid-loop operations and/or accidents. To evaluate the efficacy of reflux con...
详细信息
Reflux condensation in the U-tubes of a steam generator (SG) plays a vital role in removing heat in pressurized water reactors (PWRs) during mid-loop operations and/or accidents. To evaluate the efficacy of reflux condensation in SG U-tubes, a comprehensive understanding of the heat transfer characteristics associated with pure steam is necessary. Therefore, this study performs experiments to examine the reflux condensation of pure steam within a vertical tube with an inner diameter of 19 mm and an outer diameter of 22 mm. The steam bulk temperatures were systematically altered at 10-degree intervals within the range of 120-150 degrees C, and the steam Reynolds number ranged from 4876 to 20,430. Throughout, the temperature of the coolant within the cooling jacket and its rate of flow remained constant at 55 degrees C and 8 L/min, respectively. Validation via the trace system code confirmed good agreement with the experimental results, further bolstering confidence in the consistency of the current findings with the data previously used to calibrate and refine the correlations within the system code.
codes over finite commutative chain rings have been introduced as a generalization of codes over finite fields. Let S vertical bar R be a Galois extension of finite commutative chain rings. If C subset of S-n is an S-...
详细信息
codes over finite commutative chain rings have been introduced as a generalization of codes over finite fields. Let S vertical bar R be a Galois extension of finite commutative chain rings. If C subset of S-n is an S-code, it is possible to define, starting from C, two different R-codes: Res(C) = C boolean AND R-n and Tr(C), where Tr is the trace function. In this work we analyze the relationships between these R-codes and the duality operator. (C) 2013 Elsevier Inc. All rights reserved.
Linear codes over F(p) often admit a natural representation as trace codes of codes that are defined over an extension field F(p)m. In this paper, we obtain estimates for the weights of subcodes of such trace codes. O...
详细信息
Linear codes over F(p) often admit a natural representation as trace codes of codes that are defined over an extension field F(p)m. In this paper, we obtain estimates for the weights of subcodes of such trace codes. Our main result is a far-reaching generalization of the Carlitz-Uchiyama bound for the duals of binary BCH codes. In particular, we prove sharp bounds for the generalized Hamming weights of a large class of codes, including duals of BCH codes, classical Goppa codes, Melas codes, and arbitrary cyclic codes of length n = p(m)-1. Our main tool is the theory of algebraic functions over finite fields, in particular the Hasse-Weil bound for the number of places of degree one.
Recently, the research of trace codes over finite fields has received a lot of attention because some of these codes have good parameters. In this paper, we construct several classes of trace codes from some special c...
详细信息
Recently, the research of trace codes over finite fields has received a lot of attention because some of these codes have good parameters. In this paper, we construct several classes of trace codes from some special classes of linear codes and give their weight distributions, showing that they contain some optimal and almost optimal codes. Furthermore, we determine the parameters of the duals of the trace codes, and show that they are distanceoptimal or nearly distance-optimal with respect to the sphere-packing bound. (c) 2023 Elsevier B.V. All rights reserved.
The dual code of the Melas code is called the Kloosterman code. The weights of its codewords can be expressed by the Kloosterman sums, and are uniformly distributed with respect to the Sato-Tate measure. In this paper...
详细信息
The dual code of the Melas code is called the Kloosterman code. The weights of its codewords can be expressed by the Kloosterman sums, and are uniformly distributed with respect to the Sato-Tate measure. In this paper, the hyper-Kloosterman code C-m(q), a generalization of the Kloosterman code is defined, and the uniform distribution property is deduced using the hyper-Kloosterman sums when m is even and p - 1 \m. Finally we discuss doubly-evenness for the weights in the binary case. It shows that we can construct infinitely many doubly-even codes in a non-trivial way.
We derive the weight distribution of the binary trace codes with words (Tr(ax(q+1) + bx(3) + cx)(x is an element of Fq2+) where a, b, c is an element of F-q2 and Tr is the trace map from F-q2 to F-2. The weights of th...
详细信息
We derive the weight distribution of the binary trace codes with words (Tr(ax(q+1) + bx(3) + cx)(x is an element of Fq2+) where a, b, c is an element of F-q2 and Tr is the trace map from F-q2 to F-2. The weights of these words determine the exponential sums which were considered earlier by Moreno, Kumar, and Lahtonen. Results from the theory of quadratic forms play a role but the decisive argument is of an algebraic-geometric nature, namely, from the theory of surfaces.
The integrated safety assessment (ISA) methodology, developed by the Spanish Nuclear Safety Council (CSN), has been applied to a thermal-hydraulic analysis of cold leg LOCA sequences with unavailable High Pressure Inj...
详细信息
The integrated safety assessment (ISA) methodology, developed by the Spanish Nuclear Safety Council (CSN), has been applied to a thermal-hydraulic analysis of cold leg LOCA sequences with unavailable High Pressure Injection System in a Westinghouse 3-loop PWR. This analysis has been performed with trace 5.0 patch 1 code. ISA methodology allows obtaining the Damage Domain (the region of space of parameters where a safety limit is exceeded) as a function of uncertain parameters (break area) and operator actuation times, and provides to the analyst useful information about the impact of these uncertain parameters in safety concerns. In this work two main issues have been analyzed: the effect of reactor coolant pump trip and the available time for beginning of secondary-side depressurization. The main conclusions are that present Emergency Operating Procedures (EOPs) are adequate for managing this kind of sequences and the ISA methodology is able to take into account time delays and parameter uncertainties. (C) 2014 Elsevier Ltd. All rights reserved.
This paper studies the countercurrent flow model in the trace code version 5.0. Steam and water are chosen as the working fluids that flow counter-currently in a circular pipe. Three types of countercurrent flow model...
详细信息
This paper studies the countercurrent flow model in the trace code version 5.0. Steam and water are chosen as the working fluids that flow counter-currently in a circular pipe. Three types of countercurrent flow models, including the Wallis, Kutateladze and Bankoff correlations, are investigated. A single tube model was built to study the Wallis and the Kutateladze correlations, and the variable in the calculation model is the pipe diameter. A perforated plate model was constructed to study the Bankoff correlation, and the variables include the pipe and hole diameters, the number of holes and the plate thickness. The hydraulic diameter of the pipe varied from 2.5 to 200 mm for the tests on the Wallis and Kutateladze correlations. To validate the Bankoff correlation, the hydraulic diameter of the pipe was varied from 50 to 200 mm, and the plate thickness varied from 10 to 40 mm. In this study we validate the countercurrent flow model in the trace code, and comment on the application ranges of the three correlations. (C) 2010 Elsevier Ltd. All rights reserved.
Let F-q be the finite field with q elements of characteristic p, F-qm be the extension of degree m > 1 and f (x) be a polynomial over F-qm. The maximum number of affine F-qm-rational points that a curve of the form...
详细信息
Let F-q be the finite field with q elements of characteristic p, F-qm be the extension of degree m > 1 and f (x) be a polynomial over F-qm. The maximum number of affine F-qm-rational points that a curve of the form y(q) - y = f(x) can have is q(m+1). We determine a necessary and sufficient condition for such a curve to achieve this maximum number. Then we study the weights of two-dimensional (2-D) cyclic codes. For this, we give a trace representation of the codes starting with the zeros of the dual 2-D cyclic code. This leads to a relation between the weights of codewords and a family of Artin-Schreier curves. We give a lower bound on the minimum distance for a large class of 2-D cyclic codes. Then we look at some special classes that are not covered by our main result and obtain similar minimum distance bounds. (C) 2003 Elsevier Inc. All rights reserved.
暂无评论