检索结果-内蒙古大学图书馆

Core calculations for small modular reactor during burnup cycle

ENERGY SOURCES PART A-RECOVERY UTILIZATION AND ENVIRONMENTAL EFFECTS 2021年第1期47卷 10274-10291页

作者： Karimi, Javad Shayesteh, Mohsen Zangian, Mehdi Imam Hossein Univ Phys Dept Tehran Iran Shahid Beheshti Univ Engn Dept Tehran Iran

Nuclear, modular water (AVB) reactor is a small modular reactor with special capabilities and it can be used as a source of energy for various applications. In this research, the core calculations of this reactor have been performed during the burnup cycle with deterministic and Monte Carlo approaches by the computational codes WIMSD, PARCS, and MCNPX. Due to the temperature and pressure limits for coolant in this reactor, the PMAXS generator and the developed PARCS code, PARCS-MOD, have been used in a deterministic approach. Quantities include the effective multiplication factor, the relative power distribution, the fuel, and moderator temperature distribution, reactivity feedbacks, and concentrations of some isotopes during the cycle are calculated. In addition, to comparing the results of the two approaches, some general results were compared with the results published in the documents, which we see an acceptable difference in this regard. The maximum value of a F for states BOC, MOC and EOC are -1.39, -1.85, and -1.87 (pcm.K-1), respectively. The relative difference between the calculated relative power is less than 2.6%. The relative difference between the coolant average temperature and the fuel average temperature calculated with the reference values is 0.21%, and 0.14%, respectively. The maximum axial coolant density is 650 (kg.m(-3)). Also in this research, the dead time of the ABV reactor has been calculated which is zero.

关键词： Small modular reactor abv reactor core calculation monte carlo deterministic code

来源：评论

学校读者我要写书评

暂无评论

The Arbitrarily Varying Channel With Colored Gaussian Noise

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第6期67卷 3781-3817页

作者： Pereg, Uzi Steinberg, Yossef Tech Univ Munich Inst Commun Engn D-80333 Munich Germany Technion Israel Inst Technol Dept Elect Engn IL-3200003 Haifa Israel

We address the arbitrarily varying channel (AVC) with colored Gaussian noise. The work consists of three parts. First, we study the general discrete AVC with fixed parameters, a model that combines the AVC and the time-varying channel. We determine both the deterministic code capacity and the random code capacity. Super-additivity is demonstrated, showing that the deterministic code capacity can be strictly larger than the weighted sum of the parametric capacities. In the second part, we consider the arbitrarily varying Gaussian product channel (AVGPC). Hughes and Narayan characterized the random code capacity through min-max optimization leading to a "double" water filling solution. As in the case of the standard Gaussian AVC, the deterministic code capacity is discontinuous in the input constraint, and depends on which of the input or state constraint is higher. As opposed to Shannon's classic water filling solution, it is observed that deterministic coding using independent scalar codes is suboptimal for the AVGPC. Finally, we establish the capacity of the AVC with colored Gaussian noise, where double water filling is performed in the frequency domain. The analysis relies on our preceding results, on the AVC with fixed parameters and the AVGPC.

关键词： Jamming Gaussian noise Resource management Optimization Frequency-domain analysis Wireless communication Transmitters Arbitrarily varying channel water filling colored Gaussian noise time varying channel Gaussian product channel deterministic code random code

来源：评论

学校读者我要写书评

暂无评论

On the deterministic code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第5期59卷 2683-2693页

作者： Nitinawarat, Sirin Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

We study the capacity region C-L of an arbitrarily varying multiple-access channel (AVMAC) for deterministic codes with decoding into a list of a fixed size L and for the average error probability criterion. Motivated by known results in the study of fixed size list decoding for a point-to-point arbitrarily varying channel, we define for every AVMAC whose capacity region for random codes has a nonempty interior, a nonnegative integer Omega called its symmetrizability. It is shown that for every L <= Omega, C-L has an empty interior, and for every L >= (Omega + 1)(2), C-L equals the nondegenerate capacity region of the AVMAC for random codes with a known single-letter characterization. For a binary AVMAC with a nondegenerate random code capacity region, it is shown that the symmetrizability is always finite.

关键词： Arbitrarily varying channel (AVC) capacity region deterministic code list decoding multiple-access channel random code symmetrizability

来源：评论

学校读者我要写书评

暂无评论

The Arbitrarily Varying Channel With Colored Gaussian Noise

The Arbitrarily Varying Channel With Colored Gaussian Noise

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Pereg, Uzi Steinberg, Yossef Tech Univ Munich Inst Commun Engn D-80333 Munich Germany Technion Israel Inst Technol Dept Elect Engn IL-3200003 Haifa Israel

ISBN: (纸本)9781728164328

来源：评论

学校读者我要写书评

暂无评论

Verification and validation of the high-resolution code nTF with VVER-1000 hot zero power monte carlo calculations and experimental data

引用

ANNALS OF NUCLEAR ENERGY 2022年 178卷

作者： Papadionysiou, Marianna Kim, Seongchan Hursin, Mathieu Vasiliev, Alexander Ferroukhi, Hakim Pautz, Andreas Joo, Han Gyu Paul Scherrer Inst Nucl Energy & Safety Div NES CH-5232 Villigen Switzerland Seoul Natl Univ Reactor Phys Lab Seoul 08826 South Korea

Novel codes allow the prediction of parameters with increased resolution, in comparison to the conventional approach, sometimes using meshing smaller than the size of the fuel pin. Optimally, complex geometric struc-tures, like the ones included in the VVER core e.g. corner stiffeners, would be modeled explicitly by novel neutronic codes. In this paper, the performance of the deterministic neutron transport code nTF is studied for VVER geometries. The code is verified standalone with Monte Carlo reference solutions for a range of Hot Zero Power (HZP) models, from 2D pincells to the 3D full core of a VVER-1000, described in the X2 benchmark. Several modeling options and approximations are studied to optimize the nTF X2 3D core model. The updated version of nTF, including all necessary modifications to improve its VVER modeling capabilities, presents good agreement with the reference solutions for the simple VVER configurations and the critical state of the X2 core. Specifically for the full core critical state, the RMS of the pin power difference is 1.5% and the eigenvalue dif-ference 74 pcm with respect to a Monte Carlo reference solution. Any resulting discrepancies are analyzed, the more significant ones with the use of the lattice code CASMO5-VVER that employs similar methods as nTF. The optimized nTF X2 full core model is validated with the experimental data included in the X2 benchmark, pro-duced by HZP start-up tests. The differences of the nTF results with the measured and simulated data of the X2 benchmark remain within the accuracy limits set by the utilities and the literature of deterministic code veri-fication for most cases. The related discrepancies are discussed in detail.

关键词： High -resolution deterministic code Heavy reflector nTRACER CASMO5-VVER VVER

来源：评论

学校读者我要写书评

暂无评论

The Arbitrarily Varying Broadcast Channel With Causal Side Information at the Encoder

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第2期66卷 757-779页

作者： Pereg, Uzi Steinberg, Yossef Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

In this paper, we study the arbitrarily varying broadcast channel (AVBC) when the state information is available at the transmitter in a causal manner. We establish the inner and outer bounds on both the random code capacity region and the deterministic code capacity region with degraded message sets. The capacity region is then determined for a class of channels satisfying a condition on the mutual information between the strategy variables and the channel outputs. As an example, we consider the arbitrarily varying binary symmetric broadcast channel. We show the cases where the condition holds and, hence, the capacity region is determined and other cases where there is a gap between the bounds. This gap shows that the minimax theorem does not hold for rate regions.

关键词： Compounds Decoding Random variables Wireless communication Jamming Encoding Transmitters Arbitrarily varying channel broadcast channel degraded message sets causal state information Shannon strategies side information minimax theorem deterministic code random code symmetrizability

来源：评论

学校读者我要写书评

暂无评论

The Arbitrarily Varying Channel Under Constraints With Side Information at the Encoder

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第2期65卷 861-887页

作者： Pereg, Uzi Steinberg, Yossef Technion Israel Inst Technol Elect Engn Dept IL-32000 Haifa Israel

We study the arbitrarily varying channel (AVC) with input and state constraints, when the encoder has state information in a causal or noncausal manner. For the causal state information setting, we develop lower and upper bounds on the random code capacity. A lower bound on the deterministic code capacity is established in the case of a message-averaged input constraint. In the setting where a state constraint is imposed on the jammer, while the user is under no constraints, the random code bounds coincide, and the random code capacity is determined. Furthermore, for this scenario, a generalized non-symmetrizability condition is stated, under which the deterministic code capacity coincides with the random code capacity. For the noncausal state information setting, we determine the random code capacity of the AVC under input and state constraints. In addition, a condition on the channel is stated, under which the deterministic code capacity coincides with the random code capacity.

关键词： Arbitrarily varying channel causal state information noncausal state information Shannon strategies Gel'fand-Pinsker channel side information minimax theorem deterministic code random code symmetrizability

来源：评论

学校读者我要写书评

暂无评论

The Capacity Region of the Arbitrarily Varying MAC: With and Without Constraints

The Capacity Region of the Arbitrarily Varying MAC: With and...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Pereg, Uzi Steinberg, Yossef Technion Dept Elect Engn IL-32000 Haifa Israel

ISBN: (纸本)9781538692912

We determine both the random code capacity region and the deterministic code capacity region of the arbitrarily varying multiple access channel (AVMAC) under input and state constraints. For the AVMAC without constraints, the characterization due to Ahlswede and Cai is complete except for two cases, pointed out in the literature as an open problem. The missing piece is obtained as a special case of our results.

关键词： Arbitrarily varying channel multiple access minimax deterministic code symmerizability random code

来源：评论

学校读者我要写书评

暂无评论

The Arbitrarily Varying Gaussian Relay Channel with Sender Frequency Division 56

The Arbitrarily Varying Gaussian Relay Channel with Sender F...

引用

56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Pereg, Uzi Steinberg, Yossef Technion Dept Elect Engn IL-32000 Haifa Israel

ISBN: (纸本)9781538665961

We consider the arbitrarily varying Gaussian relay channel with sender frequency division. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. It is observed that when the channel input is subject to a low power limit, the deterministic code capacity may be strictly lower than the random code capacity, and the gap vanishes as the input becomes less constrained. A second model addressed in this paper is the general case of primitive arbitrarily varying relay channels. We develop lower and upper bounds on the random code capacity, and give conditions under which the deterministic code capacity coincides with the random code capacity, and conditions under which it is lower. Then, we establish the capacity of the primitive counterpart of the arbitrarily varying Gaussian relay channel with sender frequency division. In this case, the deterministic and random code capacities are the same.

关键词： Arbitrarily varying channel deterministic code Gaussian relay channel Markov block code orthogonal sender components partial decode-forward random code sender frequency division

来源：评论

学校读者我要写书评

暂无评论

The Arbitrarily Varying Relay Channel

The Arbitrarily Varying Relay Channel

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Pereg, Uzi Steinberg, Yossef Technion Dept Elect Engn IL-32000 Haifa Israel

ISBN: (纸本)9781538647813

We study the arbitrarily varying relay channel, and establish the cutset bound, decode-forward bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider deterministic coding schemes, and derive the deterministic code capacity, under certain conditions.

关键词： Arbitrarily varying channel decode-forward deterministic code Markov block code minimax theorem random code relay channel symmetrizability

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：