Mikhail Sergeevich Shupletsov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mikhail Sergeevich Shupletsov has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Liubov I. Golubeva
The Closed Joint-Stock Company Ajinomoto-Genetika
3 shared publications - Sergey V. Mashko
Ajinomoto-Genetika Research Institute, Moscow, Russian Federation
2 shared publications 117545 The Closed Joint-Stock Company Ajinomoto-Genetika
1 shared publicationBoris Radislavovich Danilov
Lomonosov Moscow State University, Moscow
1 shared publicationDmitry A Podvyaznikov
Department of Theoretical and Experimental Physics, Moscow Physical Engineering Institute (Technical University), Moscow, 115409, Russian Federation
1 shared publication- Dmitry A Podvyaznikov
Ajinomoto-Genetika Research Institute, 117545, Moscow, Russian Federation.
1 shared publication
Latest Publications
- 28 February 2023
- Published by Steklov Mathematical Institute
- Vol. 35 (1) , 71-81
О соотношениях между активностью схем из функциональных элементов и положительной чувствительностью функций алгебры логики
Рассматривается связь между нижними оценками статической активности $E(\Sigma)$ и динамической активности $S(\Sigma)$ приведенной схемы из функциональных элементов $\Sigma$ и положительной чувствительностью $\operatorname{ps}(f)$ функции алгебры логики $f$, реализуемой данной схемой. Для достаточно широкого класса базисов, состоящих из монотонных функций алгебры логики от не более чем $m$ переменных, элемента отрицания и булевских констант $0$ и $1$, доказана нижняя оценка $E(\Sigma)\geqslant \lfloor\frac{\operatorname{ps}(f)-1}{m}\rfloor$. Для динамической активности схем построен контрпример, показывающий, что для стандартного базиса из элементов дизъюнкции, конъюнкции и отрицания не существует линейной по $\operatorname{ps}(f)$ нижней оценки динамической активности.- 28 February 2023
- Published by Steklov Mathematical Institute
- Vol. 35 (1) , 71-81
О соотношениях между активностью схем из функциональных элементов и положительной чувствительностью функций алгебры логики
Рассматривается связь между нижними оценками статической активности $E(\Sigma)$ и динамической активности $S(\Sigma)$ приведенной схемы из функциональных элементов $\Sigma$ и положительной чувствительностью $\operatorname{ps}(f)$ функции алгебры логики $f$, реализуемой данной схемой. Для достаточно широкого класса базисов, состоящих из монотонных функций алгебры логики от не более чем $m$ переменных, элемента отрицания и булевских констант $0$ и $1$, доказана нижняя оценка $E(\Sigma)\geqslant \lfloor\frac{\operatorname{ps}(f)-1}{m}\rfloor$. Для динамической активности схем построен контрпример, показывающий, что для стандартного базиса из элементов дизъюнкции, конъюнкции и отрицания не существует линейной по $\operatorname{ps}(f)$ нижней оценки динамической активности.- 19 July 2017
- Published by Steklov Mathematical Institute
- Vol. 8 (2) , 87-96
Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference
Предлагаются методы синтеза асимптотически оптимальных по сложности схем из функциональных элементов, которые реализуют произвольные функции алгебры логики от заданного числа переменных и обладают заданным уровнем защищенности от раскрытия их функциональности при сокрытии определенного числа локальных соединений. Эти методы опираются на особенности структуры схем из функциональных элементов в произвольном базисе, построенных с использованием методов обобщенного разложения и универсальных систем функций алгебры логики.
- 19 July 2017
- Published by Steklov Mathematical Institute
- Vol. 8 (2) , 87-96
Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference
Предлагаются методы синтеза асимптотически оптимальных по сложности схем из функциональных элементов, которые реализуют произвольные функции алгебры логики от заданного числа переменных и обладают заданным уровнем защищенности от раскрытия их функциональности при сокрытии определенного числа локальных соединений. Эти методы опираются на особенности структуры схем из функциональных элементов в произвольном базисе, построенных с использованием методов обобщенного разложения и универсальных систем функций алгебры логики.
- 1 January 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1032-1035
Dynamic programming algorithms for large-scale equivalence checking and functional correction
Equivalence Checking (EC) and functional Engineering Change Order (ECO) are indispensable techniques in modern Very-Large-Scale Integrated circuits (VLSI) design flow. But analyzing an entire design is not always practical for large-scale designs because of their size and complexity. The international contest “2015 CAD Contest at ICCAD” (ICCAD) participants were requested to investigate the problem of partitioning large designs into corresponding smaller designs in order to reduce their equivalence checking and functional correction problems. This paper proposes a three-phase approach to the contest problem solution: a global decomposition phase for original circuits partitioning into smaller ones, a matching phase for corresponding pairs identification and the best pairs selection and a local decomposition phase of the remaining subcircuits using dynamic programming algorithm. Experimental results indicate, that proposed approach is very efficient in practice. It shows improvement for the ECO benchmarks results compared to the results of the prize winning entries of the ICCAD entries and to the results recently published in literature.
- 1 January 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1032-1035
Dynamic programming algorithms for large-scale equivalence checking and functional correction
Equivalence Checking (EC) and functional Engineering Change Order (ECO) are indispensable techniques in modern Very-Large-Scale Integrated circuits (VLSI) design flow. But analyzing an entire design is not always practical for large-scale designs because of their size and complexity. The international contest “2015 CAD Contest at ICCAD” (ICCAD) participants were requested to investigate the problem of partitioning large designs into corresponding smaller designs in order to reduce their equivalence checking and functional correction problems. This paper proposes a three-phase approach to the contest problem solution: a global decomposition phase for original circuits partitioning into smaller ones, a matching phase for corresponding pairs identification and the best pairs selection and a local decomposition phase of the remaining subcircuits using dynamic programming algorithm. Experimental results indicate, that proposed approach is very efficient in practice. It shows improvement for the ECO benchmarks results compared to the results of the prize winning entries of the ICCAD entries and to the results recently published in literature.
- 1 January 2016
- Published by Ob'edinennaya Redakcya OOO in Biotekhnologiya
- Vol. 32 (5)
Metabolic Flux Analysis using 13C Isotopes. I. Experimental Basis of the Method and Present State of Investigations
- 1 January 2016
- Published by Ob'edinennaya Redakcya OOO in Biotekhnologiya
- Vol. 32 (5)
Metabolic Flux Analysis using 13C Isotopes. I. Experimental Basis of the Method and Present State of Investigations
- 1 October 2015
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 36 (4) , 450-460
Switching activity of Boolean circuits and synthesis of Boolean circuits with asymptotically optimal complexity and linear switching activity
- 1 October 2015
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 36 (4) , 450-460
Switching activity of Boolean circuits and synthesis of Boolean circuits with asymptotically optimal complexity and linear switching activity
- Open Access
- 19 November 2014
- Published by Springer Nature in Microbial Cell Factories
- Vol. 13 (1) , 152
OpenFLUX2: 13C-MFA modeling software package adjusted for the comprehensive analysis of single and parallel labeling experiments
Steady-state 13C-based metabolic flux analysis (13C-MFA) is the most powerful method available for the quantification of intracellular fluxes. These analyses include concertedly linked experimental and computational stages: (i) assuming the metabolic model and optimizing the experimental design; (ii) feeding the investigated organism using a chosen 13C-labeled substrate (tracer); (iii) measuring the extracellular effluxes and detecting the 13C-patterns of intracellular metabolites; and (iv) computing flux parameters that minimize the differences between observed and simulated measurements, followed by evaluating flux statistics. In its early stages, 13C-MFA was performed on the basis of data obtained in a single labeling experiment (SLE) followed by exploiting the developed high-performance computational software. Recently, the advantages of parallel labeling experiments (PLEs), where several LEs are conducted under the conditions differing only by the tracer(s) choice, were demonstrated, particularly with regard to improving flux precision due to the synergy of complementary information. The availability of an open-source software adjusted for PLE-based 13C-MFA is an important factor for PLE implementation. The open-source software OpenFLUX, initially developed for the analysis of SLEs, was extended for the computation of PLE data. Using the OpenFLUX2, in silico simulation confirmed that flux precision is improved when 13C-MFA is implemented by fitting PLE data to the common model compared with SLE-based analysis. Efficient flux resolution could be achieved in the PLE-mediated analysis when the choice of tracer was based on an experimental design computed to minimize the flux variances from different parts of the metabolic network. The analysis provided by OpenFLUX2 mainly includes (i) the optimization of the experimental design, (ii) the computation of the flux parameters from LEs data, (iii) goodness-of-fit testing of the model’s adequacy, (iv) drawing conclusions concerning the identifiability of fluxes and construction of a contribution matrix reflecting the relative contribution of the measurement variances to the flux variances, and (v) precise determination of flux confidence intervals using a fine-tunable and convergence-controlled Monte Carlo-based method. The developed open-source OpenFLUX2 provides a friendly software environment that facilitates beginners and existing OpenFLUX users to implement LEs for steady-state 13C-MFA including experimental design, quantitative evaluation of flux parameters and statistics.
- 19 November 2014
- Published by Springer Nature in Microbial Cell Factories
- Vol. 13 (1) , 152
Open AccessOpenFLUX2: 13C-MFA modeling software package adjusted for the comprehensive analysis of single and parallel labeling experiments
Steady-state 13C-based metabolic flux analysis (13C-MFA) is the most powerful method available for the quantification of intracellular fluxes. These analyses include concertedly linked experimental and computational stages: (i) assuming the metabolic model and optimizing the experimental design; (ii) feeding the investigated organism using a chosen 13C-labeled substrate (tracer); (iii) measuring the extracellular effluxes and detecting the 13C-patterns of intracellular metabolites; and (iv) computing flux parameters that minimize the differences between observed and simulated measurements, followed by evaluating flux statistics. In its early stages, 13C-MFA was performed on the basis of data obtained in a single labeling experiment (SLE) followed by exploiting the developed high-performance computational software. Recently, the advantages of parallel labeling experiments (PLEs), where several LEs are conducted under the conditions differing only by the tracer(s) choice, were demonstrated, particularly with regard to improving flux precision due to the synergy of complementary information. The availability of an open-source software adjusted for PLE-based 13C-MFA is an important factor for PLE implementation. The open-source software OpenFLUX, initially developed for the analysis of SLEs, was extended for the computation of PLE data. Using the OpenFLUX2, in silico simulation confirmed that flux precision is improved when 13C-MFA is implemented by fitting PLE data to the common model compared with SLE-based analysis. Efficient flux resolution could be achieved in the PLE-mediated analysis when the choice of tracer was based on an experimental design computed to minimize the flux variances from different parts of the metabolic network. The analysis provided by OpenFLUX2 mainly includes (i) the optimization of the experimental design, (ii) the computation of the flux parameters from LEs data, (iii) goodness-of-fit testing of the model’s adequacy, (iv) drawing conclusions concerning the identifiability of fluxes and construction of a contribution matrix reflecting the relative contribution of the measurement variances to the flux variances, and (v) precise determination of flux confidence intervals using a fine-tunable and convergence-controlled Monte Carlo-based method. The developed open-source OpenFLUX2 provides a friendly software environment that facilitates beginners and existing OpenFLUX users to implement LEs for steady-state 13C-MFA including experimental design, quantitative evaluation of flux parameters and statistics.
- Open Access
- 1 January 2014
- Published by Springer Nature in Microbial Cell Factories
- Vol. 13 (1) , 152
OpenFLUX2: 13 C-MFA modeling software package adjusted for the comprehensive analysis of single and parallel labeling experiments
- 1 January 2014
- Published by Springer Nature in Microbial Cell Factories
- Vol. 13 (1) , 152
Open AccessOpenFLUX2: 13 C-MFA modeling software package adjusted for the comprehensive analysis of single and parallel labeling experiments
- 26 November 2010
- Published by Allerton Press in Moscow University Computational Mathematics and Cybernetics
- Vol. 34 (4) , 172-178
One Approach to synthesizing predicate circuits on the basis of generalized variables
The asymptotic behavior of the Shannon’s function L B(n) is studied for complexity of n-variable predicate implementation with the use of predicate circuits over arbitrary complete basis B. A new definition of the reduced weight of the predicate is introduced, regarding it as a solution of a specific linear programming problem based on a system of predicate’s generalized variables. New, more exact upper elements for L B(n) in a number of bases are acquired by the means of special decompositions of initial predicates using universal sets of predicates constructed for circuits consisting of bases elements with minimal reduced weight.
- 26 November 2010
- Published by Allerton Press in Moscow University Computational Mathematics and Cybernetics
- Vol. 34 (4) , 172-178
One Approach to synthesizing predicate circuits on the basis of generalized variables
The asymptotic behavior of the Shannon’s function L B(n) is studied for complexity of n-variable predicate implementation with the use of predicate circuits over arbitrary complete basis B. A new definition of the reduced weight of the predicate is introduced, regarding it as a solution of a specific linear programming problem based on a system of predicate’s generalized variables. New, more exact upper elements for L B(n) in a number of bases are acquired by the means of special decompositions of initial predicates using universal sets of predicates constructed for circuits consisting of bases elements with minimal reduced weight.