236 research outputs found

    The Essence Of Logistics And Its Barter Lbp-Provider

    Get PDF
    At the moment, the highest level of supply chain management is 5PL providers, but 6 or 7 PL providers will be needed for logistics barter, or they need to be called logistics barter providers because there must be a completely different, predominant view of the role of logistics and logistics barter in the new economy system. Logistic barter is a some kind of web (system), a spider (operator) is a LBP provider.The theory of the proposed economy scheme on the basis of logistic barter assumes a developed infrastructure, i.e. a supersystem for supply chain management based on LBP - providers. Yes, there is a question of the "maturity" of logistics functional areas (procurement, production, distribution, transportation and information), i.e. Their ability to adopt new rules of the game in the sphere of another operator of the economy. Logistic barter will be the central unifying link, and the main operators will be the LBP-provider (Gabdullinet al., 2017).E-commerce, e-auctions, e-sourcing, and e-markets are better integrated under the auspices of logistics barter into an e-integrator, which will be the serving element (one of the tools) of the LBP-provider. E-integrator is an integrator of information and communication technologies for supply chains of logistics barter in the form of electronic means taking into account the closing link - e-commerce and the reverse distribution of added value

    On the stochasticity parameter of quadratic residues

    Full text link
    Following V. I. Arnold, we define the stochasticity parameter S(U)S(U) of a set UZMU\subseteq \mathbb{Z}_M to be the sum of squares of the consecutive distances between elements of UU. We study the stochasticity parameter of the set RMR_M of quadratic residues modulo MM. Denote by s(k)=s(k,ZM)s(k)=s(k,\mathbb{Z}_M) the average value of S(U)S(U) over all subsets UZMU\subseteq \mathbb{Z}_M of size kk, which can be thought of as the stochasticity parameter of a random set of size kk. We prove that a) limMS(RM)s(RM)<1<limMS(RM)s(RM)\varliminf_{M\to\infty}\frac{S(R_M)}{s(|R_M|)}<1<\varlimsup_{M\to\infty}\frac{S(R_M)}{s(|R_M|)}; b) the set {MN:S(RM)<s(RM)}\{ M\in \mathbb{N}: S(R_M)<s(|R_M|) \} has positive lower density

    Prime avoiding numbers is a basis of order 22

    Full text link
    For a positive integer nn, we denote by F(n)F(n) the distance from nn to the nearest prime number. We prove that every sufficiently large positive integer NN can be represented as the sum N=n1+n2N=n_1+n_2, where F(ni)(logN)(loglogN)1/325565, F(n_i) \geqslant (\log N)(\log\log N)^{1/325565}, for i=1,2i=1,2. This improves the corresponding "trivial" statement where only F(ni)logNF(n_i)\gg \log N is required

    Google Coral-based edge computing person reidentification using human parsing combined with analytical method

    Full text link
    Person reidentification (re-ID) is becoming one of the most significant application areas of computer vision due to its importance for science and social security. Due to enormous size and scale of camera systems it is beneficial to develop edge computing re-ID applications where at least part of the analysis could be performed by the cameras. However, conventional re-ID relies heavily on deep learning (DL) computationally demanding models which are not readily applicable for edge computing. In this paper we adapt a recently proposed re-ID method that combines DL human parsing with analytical feature extraction and ranking schemes to be more suitable for edge computing re-ID. First, we compare parsers that use ResNet101, ResNet18, MobileNetV2, and OSNet backbones and show that parsing can be performed using compact backbones with sufficient accuracy. Second, we transfer parsers to tensor processing unit (TPU) of Google Coral Dev Board and show that it can act as a portable edge computing re-ID station. We also implement the analytical part of re-ID method on Coral CPU to ensure that it can perform a complete re-ID cycle. For quantitative analysis we compare inference speed, parsing masks, and re-ID accuracy on GPU and Coral TPU depending on parser backbone. We also discuss possible application scenarios of edge computing in re-ID taking into account known limitations mainly related to memory and storage space of portable devices.Comment: 11 pages, 3 figures, 3 table
    corecore