Search on the enumeration tree in the multiprocessor job-shop problem
We present an approach based on a two-stage ltration of the set of feasible solutions for the multiprocessor job-shop scheduling problem. On the rst stage we use extensive dominance relations, whereas on the second stage we use lower bounds. We show that several lower bounds can eciently be obtained and implemented.
In this paper, we consider the asymmetric capacitated vehicle routing problem (ACVRP). We compare the search tree size and computational time for the bottleneck tolerance-based and cost-based branching rules within a branch-and-bound algorithm on the FTV benchmark instances. Our computational experiments show that the tolerance-based branching rule reduces the search tree size by 45 times and the CPU time by 2.8 times in average.
At the particular article we provide a methodological approach to selection of companies for horizontal cooperation in procurement logistics. In context of modern logistics (globalization, high customer expectations, high transportation costs), and changes regarding Russia’s plans to join WTO, this topic is highly relevant from a practical point of view. The purpose of this article is to provide single methodological approach to selection of companies for horizontal cooperation.
Classical approaches to the construction of hash function modes, based on the using of iterative procedures, do not allow efficient processing of large amounts of data and can’t be adapted to parallel computing architectures. It applies to both the Russian cryptographic standard GOST R 34.11-2012, which determines the algorithm and procedure for calculating the hash function, as well as many other foreign standards (for example, SHA-3). The absence of standards for parallelized modes for the hash functions of GOST R 34.11-2012 creates an urgent need for the development of the domestic standard of the parallelized mode of hash code.
This article is devoted to the research and development of new modes of hash code generation that allow efficient parallelization of the computation process and provide cryptographic resistance satisfying modern requirements. This work continues the research carried out by the authors, and offers a fundamentally new tree mode of hash code generation ("FT-mode"), based on l-ary hash trees and allowed to use any compression mapping for a mechanism of forming tree nodes. The resistance of the mode is completely determined by the resistance of the corresponding compressive mapping. In particular, the FT-mode allows using block ciphers and substitution transformations to form nodes of a hash tree along with compression functions and hash functions. In addition, the FT-mode excludes the main functional disadvantages of the known tree modes of hash code generation that affect their operational, technical and cryptographic quality.Within the framework of the present research a number of characteristics of FT-mode are calculated, and a comparative analysis of the time and computational complexity of implementations of FT-mode and some foreign tree hash modes is carried out. The corresponding results showed that the developed mode is not inferior to any of the considered modes.
1. Description of the problem. Instrumental analysis makes it possible to find the arguments of adjudication on the bounders and structure of corpus delicti, its correlation to criminal and filling-up legislation. 2. Initial theses. Corpus delicti is regarded as that expressed in criminal law doctrine result of reorganization of orders of criminal law into other practically necessary form. That happens in the process of theory and practical experience accumulation. The construction of corpus delicti is transformed for practical needs, textually expressed system of features, regulated by criminal law and characterizing deeds as a crime of a definite type. Correlation of construction of corpus delicti with law and doctrine. Corpus delicti, its algorithm. Transition from law regulations to corpus delicti can be done: 1) prog-nostically; 2) within constant analysis of law; 3) in the process of law application. 3. Stages of instrumental building of corpus delicti: prognostic, doctrinal, law applicatory. Instrumental approach to corpus delicti includes within each stage: 1) based on criminal law decision of classification of corpus delicti and its borders; 2) objective description of a factual model; 3) acception of meaning correlated with legal notions and constructions; 4) choice of the construction of the corpus delicti and disposal of characteristics; 5) verification of legitimacy, necessity and adequacy of foundation. 4. Instrumental analysis of disputable questions of understanding and application of constructions of corpus delicti. A. Functions and purposes of application of construction of corpus delicti. Functions of corpus delicti: a) modeling; b) communicative; c) identificatory; d) technological. B. Contents of corpus delicti. Contents of corpus delicti as it is traditionally regarded does not correspond to indications of crime, does not characterize features of social danger; sign of danger of penalty also does go into corpus delicti. Two variants are proposed for the discussion: widening of the borders of corpus delicti by means of introduction of signs of social danger and signs, defining individualization of penalty and to limitate corpus delicti by characteristic of criminally punished act, separating it from contents of guilt and contents of social danger. C. Structure of corpus delicti. There are two problems: division of elements of crime seems to be extremely harsh and inadequate - it is expedient to include signs of special and time limits of act, causal links, crossing signs of objective and subjective sides, first of all consequences and an object of crime, into the structure of corpus delicti. Forms of committing a criminally punished act is a crime commitment in complicity, ideal system, not finished crime.