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

Gaussian polymer chains in a harmonic potential: The path integral approach

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Paradezhenko, G.V. Gascoigne, C. Brilliantov, N.V. Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow121205 Russia Department of Mathematical Sciences University of Bath Claverton Down BathBA2 7AY United Kingdom

We study conformations of the Gaussian polymer chains in d-dimensional space in the presence of an external field with the harmonic potential. We apply a path integral approach to derive an explicit expression for the probability distribution function of the gyration radius. We calculate this function using Monte Carlo simulations and show that our numerical and theoretical results are in a good agreement for different values of the external *** Codes 82D60, 82M31 Copyright © 2020, The Authors. All rights reserved.

关键词： Monte Carlo methods

Duplication with transposition distance to the root for q-ary strings

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Polyanskii, Nikita Vorobyev, Ilya Institute for Communications Engineering Technical University of Munich Munich80333 Germany Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow121205 Russia Advanced Combinatorics and Complex Networks Lab Moscow Institute of Physics and Technology Dolgoprudny141701 Russia

We study the duplication with transposition distance between strings of length n over a q-ary alphabet and their roots. In other words, we investigate the number of duplication operations of the form x = (abcd) → y = (abcbd), where x and y are strings and a, b, c and d are their substrings, needed to get a q-ary string of length n starting from the set of strings without duplications. For exact duplication, we prove that the maximal distance between a string of length at most n and its root has the asymptotic order n/ log n. For approximate duplication, where a β-fraction of symbols may be duplicated incorrectly, we show that the maximal distance has a sharp transition from the order n/ log n to log n at β = (q - 1)/q. The motivation for this problem comes from genomics, where such duplications represent a special kind of mutation and the distance between a given biological sequence and its root is the smallest number of transposition mutations required to generate the sequence. Copyright © 2020, The Authors. All rights reserved.

关键词： DNA sequences

New lower bound on the rate of traceability set systems

学校读者我要写书评

暂无评论

New lower bound on the rate of traceability set systems

International Symposium on Problems of Redundancy in Information and Control Systems (RED)

作者： Elena Egorova Ilya Vorobyev Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow Russia 127051

In this paper a new lower bound on the rate of IPP set systems with traceability property is proved. The new bound outperforms the previously known bounds.

ISBN: (数字)9781728119441

ISBN: (纸本)9781728119458

In this paper a new lower bound on the rate of IPP set systems with traceability property is proved. The new bound outperforms the previously known bounds.

关键词： Decoding Redundancy Encryption Control systems Hamming distance

Towards Understanding of eSports Athletes' Potentialities: The Sensing System for data Collection and Analysis

学校读者我要写书评

暂无评论

Towards Understanding of eSports Athletes' Potentialities: T...

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, UIC-ATC

作者： Alexander Korotin Nikita Khromov Anton Stepanov Andrey Lange Evgeny Burnaev Andrey Somov Center for Computational and Data-Intensive Science and Engineering (CDISE) Skolkovo Institute of Science and Technology Moscow Russia

ISBN: (数字)9781728140346

ISBN: (纸本)9781728140353

eSports is a developing multidisciplinary research area. At present, there is a lack of relevant data collected from real eSports athletes and lack of platforms which could be used for the data collection and further analysis. In this paper, we present a sensing system for enabling the data collection from professional athletes. Also, we report on the case study about collecting and analyzing the gaze data from Monolith professional eSports team specializing in Counter-Strike: Global Offensive (CS:GO) discipline. We perform a comparative study on assessing the gaze of amateur players and professional athletes. The results of our work are vital for ensuring eSports data collection and the following analysis in the scope of scouting or assessing the eSports players and athletes.

关键词： Games Sensors Measurement data collection Weapons Mice Affective computing

Trivariate Lifted Codes with Disjoint Repair Groups

学校读者我要写书评

暂无评论

Trivariate Lifted Codes with Disjoint Repair Groups

International Symposium on Problems of Redundancy in Information and Control Systems (RED)

作者： Nikita Polyanskii Ilya Vorobyev Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow Russia 121205

ISBN: (数字)9781728119441

ISBN: (纸本)9781728119458

Guo, Kopparty, and Sudan introduced the notion of lifted Reed-Solomon codes in the context of locally correctable codes. We continue the study of lifted codes with the application for so-called t-disjoint-repair-group property (t-DRGP) codes. A code is said to have the t-DRGP if every symbol in a codeword from the code has t mutually disjoint recovering sets of coordinates in the codeword. In some parameter regimes, our proposed t-DRGP codes based on lifted codes have lower redundancy than previously known t-DRGP codes.

关键词： Redundancy Upper bound Control systems Maintenance engineering Reed-Solomon codes Frequency modulation

Sensors and Game Synchronization for data Analysis in eSports

学校读者我要写书评

暂无评论

Sensors and Game Synchronization for Data Analysis in eSport...

IEEE International Conference on Industrial Informatics (INDIN)

作者： Anton Stepanov Andrey Lange Nikita Khromov Alexander Korotin Evgeny Burnaev Andrey Somov Center for Computational and Data-Intensive Science and Engineering (CDISE) Skolkovo Institute of Science and Technology Moscow Russia

eSports industry has greatly progressed within the last decade in terms of audience and fund rising, broadcasting, networking and hardware. Since the number and quality of professional team has evolved too, there is a reasonable need in improving skills and training process of professional eSports athletes. In this work, we demonstrate a system able to collect heterogeneous data (physiological, environmental, video, telemetry) and guarantying synchronization with 10 ms accuracy. In particular, we demonstrate how to synchronize various sensors and ensure post synchronization, i.e. logged video, a so-called demo file, with the sensors data. Our experimental results achieved on the CS:GO game discipline show up to 3 ms accuracy of the time synchronization of the gaming computer.

关键词：

A Consensus Privacy Metrics Framework for Synthetic data

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Pilgram, Lisa Dankar, Fida K. Drechsler, Jörg Elliot, Mark Domingo-Ferrer, Josep Francis, Paul Kantarcioglu, Murat Kong, Linglong Malin, Bradley Muralidhar, Krishnamurty Myles, Puja Prasser, Fabian Raisaro, Jean Louis Yan, Chao El Emam, Khaled School of Epidemiology and Public Health University of Ottawa ON Canada CHEO Research Institute ON Canada Department of Nephrology and Medical Intensive Care Charité – Universitätsmedizin Berlin Berlin Germany Department for Statistical Methods Institute for Employment Research Nuernberg Germany Institute for Statistics Ludwig-Maximilians-Universität Munich Germany Joint Program in Survey Methodology University of Maryland United States The Cathie Marsh Institute Research School of Social Sciences University of Manchester Manchester United Kingdom Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Catalonia Tarragona Spain Max Planck Institute for Software Systems Germany Department of Computer Science Virginia Tech United States Department of Mathematical and Statistical Sciences University of Alberta Alberta Canada Department of Biomedical Informatics Vanderbilt University Medical Center NashvilleTN United States Department of Biostatistics Vanderbilt University Medical Center NashvilleTN United States Department of Computer Science Vanderbilt University NashvilleTN United States Department of Marketing and Supply Chain Management University of Oklahoma Oklahoma United States Medicines and Healthcare products Regulatory Agency London United Kingdom Berlin Institute of Health at Charité Universitätsmedizin Berlin Medical Informatics Group Berlin Germany Biomedical Data Science Center University Hospital Lausanne Lausanne Switzerland

Synthetic data generation is one approach for sharing individual-level data. However, to meet legislative requirements, it is necessary to demonstrate that the individuals’ privacy is adequately protected. There is no consolidated standard for measuring privacy in synthetic data. Through an expert panel and consensus process, we developed a framework for evaluating privacy in synthetic data. Our findings indicate that current similarity metrics fail to measure identity disclosure, and their use is discouraged. For differentially private synthetic data, a privacy budget other than close to zero was not considered interpretable. There was consensus on the importance of membership and attribute disclosure, both of which involve inferring personal information about an individual without necessarily revealing their identity. The resultant framework provides precise recommendations for metrics that address these types of disclosures effectively. Our findings further present specific opportunities for future research that can help with widespread adoption of synthetic data. © 2025, CC BY.

关键词： Differential privacy

Financial Instruments Generation via Tokenization into Commodity

学校读者我要写书评

暂无评论

Financial Instruments Generation via Tokenization into Commo...

Blockchain, Robotics and AI for Networking Security Conference (BRAINS)

作者： Vyacheslav Davydov Yury Yanovich Moscow Institute of Electronics and Mathematics National Research University Higher School of Economics 123458 Moscow Russia Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology (Skoltech) 121205 Moscow Russia Laboratory of Data Mining and Predictive Modeling Institute for Information Transmission Problems (IITP RAS) 127051 Moscow Russia

ISBN: (数字)9781728170916

ISBN: (纸本)9781728170923

The diversification is a classic approach to reduce investor risks. Blockchain and smart contracts allow tokenizing heterogeneous assets into a commodity and open a new tool for it. The authors describe how to apply the approach to the various finance cases from peer-to-peer lending to real estate and leases, and theoretically estimate minimum token package size to ensure the given reliability parameter.

关键词： commodities LEASING REAL PROPERTY diversification packet size lease token peer to peer EQUIPMENT contract

Quantum voting and its physical interpretation∗

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Yoo, Woong-seon Seoul 06642 Korea Republic of Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow Russia

Voting is a game with a no-go theorem. New proofs of Arrow’s impossibility theorem are given based on quantum information theory. We show that the Arrowian dictator is equivalent to the perfect cloning circuit. We present Gedankenexperiment of voting and Bell-like inequalities of voting. We provide the thermodynamic interpretation of voting with Landauer’s principle. Copyright © 2019, The Authors. All rights reserved.

关键词： Quantum optics