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

arXiv 2017年

作者： Markov, Yu.A. Markova, M.A. Gitman, D.M. Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia P.N. Lebedev Physical Institute Moscow Russia Department of Physics Tomsk State University Tomsk Russia Institute of Physics University of São Paulo São Paulo Brazil

A connection between a unitary quantization scheme and para-Fermi statistics of order 2 is considered. An appropriate extension of Green's ansatz is suggested. This extension allows one to transform bilinear and trilinear commutation relations for the annihilation and creation operators of two different para-Fermi fields φaand φbinto identity. The way of incorporating para-Grassmann numbers ξkinto a general scheme of uniquantization is also offered. For parastatistics of order 2 a new fact is revealed, namely, the trilinear relations containing both the para-Grassmann variables ξkand the field operators ak, bmunder a certain invertible mapping go over into the unitary equivalent relations, where commutators are replaced by anticommutators and vice versa. It is shown that the consequence of this circumstance is the existence of two alternative definitions of the coherent state for para-Fermi oscillators. The Klein transformation for Green's components of the operators ak, bmis constructed in an explicit form that enables us to reduce the initial commutation rules for the components to the normal commutation relations of ordinary Fermi fields. A nontrivial connection between trilinear commutation relations of the unitary quantization scheme and so-called Lie-supertriple system is analysed. A brief discussion of the possibility of embedding the Duffin-Kemmer-Petiau theory into the unitary quantization scheme is provided. Copyright © 2017, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep inelastic e−τ and μ−τ conversion in the NA64 experiment at the CERN SPS

引用

Physical Review D 2018年第1期98卷 015007-015007页

作者： Sergei Gninenko Sergey Kovalenko Serguei Kuleshov Valery E. Lyubovitskij Alexey S. Zhevlakov Institute for Nuclear Research 117312 Moscow Russia Departamento de Física y Centro Científico Tecnológico de Valparaíso-CCTVal Universidad Técnica Federico Santa María Casilla 110-V Valparaíso Chile Institut für Theoretische Physik Universität Tübingen Kepler Center for Astro and Particle Physics Auf der Morgenstelle 14 D-72076 Tübingen Germany Department of Physics Tomsk State University 634050 Tomsk Russia Tomsk State Pedagogical University 634061 Tomsk Russia Matrosov Institute for System Dynamics and Control Theory SB RAS Lermontov str. 134 664033 Irkutsk Russia

We study the lepton flavor violating (LFV) e(μ)−τ conversion in deep inelastic scattering (DIS) of electrons (muons) on fixed-target nuclei. Our model-independent analysis is based on the set of low-energy effective four-fermion LFV operators composed of leptons and quarks with the corresponding mass scales Λk for each operator. Using the estimated sensitivity of the search for this LFV process in events with large missing energy in the NA64 experiment at the CERN SPS, we derive lower limits for Λk and compared them with the corresponding limits existing in the literature. We show that the DIS e(μ)−τ conversion is able to provide a plenty of new limits as yet nonexisting in the literature. We also analyzed the energy spectrum of the final-state τ and discussed the viability of the observation of this process in the NA64 experiment and ones akin to it. The case of polarized beams and targets is also discussed.

关键词： Particle interactions

来源：评论

学校读者我要写书评

暂无评论

On the Construction of Triples of Diagonal Latin Squares of Order 10

引用

Electronic Notes in Discrete Mathematics 2016年 54卷 307-312页

作者： Zaikin, Oleg Zhuravlev, Alexey Kochemazov, Stepan Vatutin, Eduard Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russian Federation Internet-portal BOINC.ru Moscow Russian Federation Southwest State University Kursk Russian Federation

We provide a triple of diagonal Latin squares of order 10 that is the closest to being a triple of mutually orthogonal diagonal Latin squares found so far. It was obtained by constructing all orthogonal mates for diagonal Latin squares generated according to a specific scheme. We also show that a triple of mutually orthogonal diagonal Latin squares of order 10 cannot be constructed based on diagonal Latin squares from specific families. © 2016 Elsevier B.V.

关键词： diagonality Latin square orthogonality SAT

来源：评论

学校读者我要写书评

暂无评论

Pauli form factor of quark and nontrivial topological structure of the QCD

引用

Physical Review D 2017年第5期96卷 054030-054030页

作者： Baiyang Zhang Andrey Radzhabov Nikolai Kochelev Pengming Zhang Institute of Modern Physics Chinese Academy of Sciences Lanzhou 730000 China University of Chinese Academy of Sciences Beijing 100049 China Matrosov Institute for System Dynamics and Control Theory SB RAS Lermontov street 134 664033 Irkutsk Russia Bogoliubov Laboratory of Theoretical Physics Joint Institute for Nuclear Research Dubna Moscow Region 141980 Russia

We calculate the electromagnetic Pauli form factor of quark induced by the nontrivial topological fluctuations of QCD vacuum called instantons. It is shown that such a contribution is significant. We discuss the possible implications of our result in the photon-hadron reactions and in the dynamics of quark-photon interactions in the dense/hot quark matter.

关键词： Effective field theory Form factors Instantons Particle interactions Quark model

来源：评论

学校读者我要写书评

暂无评论

Using grid systems for enumerating combinatorial objects on example of diagonal Latin squares 7

Using grid systems for enumerating combinatorial objects on ...

引用

7th International Conference Distributed Computing and Gridtechnologies in Science and Education, GRID 2016

作者： Vatutin, E.I. Zaikin, O.S. Zhuravlev, A.D. Manzyuk, M.O. Kochemazov, S.E. Titov, V.S. Southwest State University Kursk Russia Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia Internet Portal BOINC.ru Moscow Russia

In this paper we consider the problem of enumerating diagonal Latin squares of small order. In particular we discuss possible algorithmic approaches to this problem and show our results in this regard. Surprisingly, our research showed that the best algorithm for enumerating diagonal Latin squares consists of a number of fixed loops, and its effectiveness can be significantly increased by careful tuning and applying special heuristics. We used the constructed algorithm to enumerate all diagonal Latin squares of order 8. Also, it is being used to carry out large-scale computational experiment aimed at enumeration of diagonal Latin squares of order 9. © 2016 Eduard I. Vatutin, Oleg S. Zaikin, Alexey D. Zhuravlev, Maxim O. Manzyuk, Stepan E. Kochemazov, Vitaliy S. Titov.

关键词： Combinatorial mathematics

来源：评论

学校读者我要写书评

暂无评论

Logical-probabilistic analysis of distributed computing reliability

Logical-probabilistic analysis of distributed computing reli...

引用

Proceedings of the International Convention MIPRO

作者： A.G. Feoktistov I.A. Sidorov Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

The aim of the study is to develop tools of increasing a problem solving reliability in a heterogeneous distributed computing environment by applying a diagnostics of computing resources components and using an analysis of problem solving schemes. A scheme (a plan) is an abstract program for a problem solving. A special attention is paid to the calculation of a problem solving scheme reliability on the basis of a logical-probabilistic method. This method is based on transiting from Boolean functions for a reliability description of a problem solving scheme to probability functions for determining indicators of such reliability. Improving a problem solving scheme reliability is carried out by a resource reservation. The resource reservation applied in a problem solving scheme provides obtaining of a reliability indicator that approximates maximally the predetermined criterion of reliability, taking into account limitations on a number of reserve resources. The example of the problem solving scheme and calculating its reliability is represented.

关键词： Reliability Problem-solving Computers Distributed computing Hardware Software Planning

来源：评论

学校读者我要写书评

暂无评论

Conceptual Model of Problem-oriented Heterogeneous Distributed Computing Environment with Multi-agent Management

引用

Procedia Computer Science 2017年 103卷 162-167页

作者： I. Bychkov G. Oparin A. Tchernykh A. Feoktistov V. Bogdanova S. Gorsky Matrosov Institute for System Dynamics and Control Theory SB RAS Lermontov str. 134 Irkutsk Post Box 292 664033 Russia CICESE Research Center Computer Science Department Carretera Ensenada-Tijuana No. 3918 Zona Playitas Codigo Postal 22860 Apdo. Postal 360 Ensenada B.C. Mexico

One of the promising approaches to the efficient management in a heterogeneous distributed computing environment is the use of multi-agent systems. When researchers want to solve tasks in such an environment, they need utilities for the description of the processing in the specific domain, and knowledge about a software-hardware infrastructure. This multi-component knowledge is used for effective decision-making. Practice and experience of multi-agent systems show that knowledge representation is non-trivial problems. We proposed an approach to the design of the conceptual model of a heterogeneous distributed computing environment based on multi-agent management. An important component of the model is algorithmic knowledge, which provides the support of planning, resources allocation and dynamic decomposition of a problem to subproblems. This knowledge is represented as a semantic network, which describe semantic relations between concepts. Unlike to Semantic Web Services and Semantic Grids, our approach provides advanced planning abilities to support parallelism and scalability. We develop specialized high-level tools for designing and using the conceptual models.

关键词： multi-agent systems knowledge representation distributed computing environment.

来源：评论

学校读者我要写书评

暂无评论

A hybrid approach to solve the dynamic patrol routing problem for group of underwater robots

A hybrid approach to solve the dynamic patrol routing proble...

引用

Proceedings of the International Convention MIPRO

作者： M. Yu. Kenzin I. V. Bychkov N. N. Maksimkin Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

We suggest an approach to solve the dynamic patrolling problem as the variation of periodic vehicle routing problem with time windows. In order to do this, firstly a set of waypoints (targets) should be located in space in such way that their spherical neighborhoods, which corresponds to the size of the robots vision/detections fields, would form a complete coverage of the protected perimeter. Regular inspections of each waypoint by robots of the group not less than once during specified period would guarantee the effective perimeter patrolling. Thus, the routing problem is to a feasible group route ensuring well-timed inspections for all waypoints of the mission. To solve the described problem we propose a hybrid approach, based on the combined use of genetic algorithms and methods and heuristics of local search. The proposed approach allows robots to effectively generate required solutions under given constraints and quickly readjust it in unforeseen situations due to the dynamic nature of the problem. A software modeling system implementing all the necessary computational procedures has been developed; the results of computations are given.

关键词： Inspection Vehicle dynamics Routing Robot kinematics Planning Vehicles

来源：评论

学校读者我要写书评

暂无评论

Deep inelastic e - τ and μ - τ conversion in the NA64 experiment at the CERN SPS

arXiv

引用

arXiv 2018年

作者： Gninenko, Sergei Kovalenko, Sergey Kuleshov, Serguei Lyubovitskij, Valery E. Zhevlakov, Alexey S. Institute for Nuclear Research Moscow117312 Russia Departamento de Fisica y Centro Científico Tecnológico de Valparaíso-CCTVal Universidad Técnica Federico Santa María Casilla110-V Chile Institut für Theoretische Physik Universität Tübingen Kepler Center for Astro and Particle Physics Auf der Morgenstelle 14 TübingenD-72076 Germany Department of Physics Tomsk State University Tomsk634050 Russia Tomsk State Pedagogical University Tomsk634061 Russia Matrosov Institute for System Dynamics and Control Theory SB RAS Lermontov str. 134 Irkutsk664033 Russia

We study the Lepton Flavor Violating (LFV) e(μ) - τ conversion in Deep Inelastic Scattering (DIS) of electrons (muons) on fixed-target nuclei. Our model-independent analysis is based on the set of low-energy effective four-fermion LFV operators composed of leptons and quarks with the corresponding mass scales Λkfor each operator. Using the estimated sensitivity of the search for this LFV process in events with large missing energy in the NA64 experiment at the CERN SPS, we derive lower limits for Λkand compared them with the corresponding limits existing in the literature. We show that the DIS e(μ) - τ conversion is able to provide a plenty of new limits as yet nonexisting in the literature. We also analyzed the energy spectrum of the final-state τ and discussed the viability of the observation of this process in the NA64 experiment and ones akin to it. The case of polarized beams and targets is also discussed. Copyright © 2018, The Authors. All rights reserved.

关键词： Distribution functions

来源：评论

学校读者我要写书评

暂无评论

Methods and tools to increase fault tolerance of high-performance computing systems

Methods and tools to increase fault tolerance of high-perfor...

引用

Proceedings of the International Convention MIPRO

作者： I.A. Sidorov Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

This work focuses on the development of models, methods, and tools to increase a fault tolerance of high-performance computing systems. The described models and methods are based on automatic diagnostics of the basic software and hardware components of these systems, the use of automatic localization, correction of faults, and the use of automatic HPC-system reconfiguration mechanisms. The originality and novelty of the offered approach consist of creating the multi-agent system with universal software agents, capable of collecting node state data for analysis and thereby enabling the agent to make the make necessary decisions directly.

关键词： Production Random access memory Monitoring Software Hardware Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：