In this study, we suggest an algorithm for computing minimal and maximal numbers of transversals of diagonal Latin squares. According to this algorithm, we generate all diagonal Latin squares of a particular order, an...
详细信息
We complete our derivation of upper limits on the CP violating ηππ and η′ππ couplings from an analysis of their two-loop contributions to the neutron electric dipole moment (nEDM). We use a phenomenological Lag...
详细信息
We complete our derivation of upper limits on the CP violating ηππ and η′ππ couplings from an analysis of their two-loop contributions to the neutron electric dipole moment (nEDM). We use a phenomenological Lagrangian approach which is formulated in terms of hadronic degrees of freedom—nucleons and pseudoscalar mesons. The essential part of the Lagrangian contains the CP violating couplings between η(η′) and pions. Previously, we included photons using minimal substitution in case of the proton and charged pions. Now we extend our Lagrangian by adding the nonminimal couplings, i.e., anomalous magnetic couplings of nucleons with the photon. The obtained numerical upper limits for the ηππ and η′ππ couplings |fηππ(Mη2)|<4.4×10−11 and |fη′ππ(Mη′2)|<3.8×10−11 can be useful for the related, planned experiments at the JLab Eta Factory. Using present experimental limits on the nEDM, we derive upper limits on the CP violating θ¯ parameter of θ¯<4.7×10−10.
An optimal control problem for the continuity equation is considered. The aim of a controller is to maximize the total mass within a target set at a given time moment. An iterative numerical algorithm for solving this...
详细信息
In the framework of the quasipotential method in quantum electrodynamics we calculate corrections to the nuclear structure proportional to r2Nfrom two-photon exchange amplitudes in the fine and hyperfine structure of ...
详细信息
In this study, a new parallel algorithm for solving Boolean satisfiability problem (SAT) is suggested. This algorithm is based on the Conflict Driven Clause Learning (CDCL) algorithm. Given an original SAT instance, C...
详细信息
In this study, a new parallel algorithm for solving Boolean satisfiability problem (SAT) is suggested. This algorithm is based on the Conflict Driven Clause Learning (CDCL) algorithm. Given an original SAT instance, CDCL is launched on it. Some types of conflict clauses, which are produced by CDCL, are collected. Then the collected clauses are employed to construct a family of different SAT instances. In particular, each SAT instance from a family is produced by adding some subset of the collected conflict clauses to an initial set of clauses (which belong to the original instance). In order to solve the original SAT instance, it is sufficient to solve at least one SAT instance from the constructed family. The proposed algorithm was implemented in the form of a parallel SAT solver. It was compared with two high ranked state-of-the-art parallel solvers. As a test set, we used SAT instances which encode cryptanalysis of three keystream generators: summation generator, threshold generator, and Gifford generator. According to computational experiments, our solver outperforms those two solvers.
We address to the problem of an integration of heterogeneous computational clusters to the united environment applying the OpenStack platform for a cluster resource virtualization. However, this platform does not inte...
详细信息
We address to the problem of an integration of heterogeneous computational clusters to the united environment applying the OpenStack platform for a cluster resource virtualization. However, this platform does not interact with the traditional resource management systems such as the PBS Torque or SLURM that are used in cluster resources. To this end, we developed an additional hypervisor shell to run virtual machines through queues of the aforementioned systems. Thus, we expand the OpenStack capabilities for an application job management and provide a computation scalability for virtualized resources of clusters. In order to show the benefits of our approach to the scalable application management in integrated cluster environments, we developed a parameter sweep application for simulation modeling of warehouse logistics and solved three optimization tasks for the real refrigerated warehouse. We compared the selected criteria of task solving processes with the hypervisor shell applying and without it by means of simulation modeling. Experiments show that the hypervisor shell can significantly improve computation speedup and task solving time through reallocating virtual machines to queues of the resource management systems.
The formation of charged pion condensate under parallel electromagnetic fields is studied within the two-flavor Nambu–Jona-Lasinio model. The technique of Schwinger proper time method is extended to explore the quant...
详细信息
The paper is devoted to the issues of raw binary data documenting, parsing and verifying in astroparticle data lifecycle. The long-term preservation of raw data of astroparticle experiments as originally generated is ...
详细信息
The paper studies a variant of Granovetter’s threshold model of conforming behavior. In this model, a network of agents with binary states (inactive/active) acts in discrete time under the influence of instigators (a...
详细信息
The paper studies a variant of Granovetter’s threshold model of conforming behavior. In this model, a network of agents with binary states (inactive/active) acts in discrete time under the influence of instigators (always active agents). Using special computational method based on algorithms for solving Boolean satisfiability problem, we can find dispositions of small number of instigators among initially inactive agents, which after several time moments force the majority of agents to the active state. Using a large number of networks, both randomly generated, and fragments of real world social networks, we search for the interconnection between static and dynamic characteristics of network vertices: whether or not static centrality measures influence the chances of the vertex to be picked as an instigator.
The BOINC-based volunteer computing project Acoustics@home was employed to study the accuracy of the sound speed profile reconstruction in a shallow-water waveguide using a dispersion-based geoacoustic inversion schem...
详细信息
暂无评论