Shortest and minimal disjunctive normal forms of complete functions
Computational Mathematics and Mathematical Physics. 2015. Vol. 55. No. 7. P. 1242-1255.
, Computational Mathematics and Mathematical Physics 2013 Vol. 53 No. 9 P. 1569-1588
Added: October 30, 2015
, , / Cornell University. Series math "arxiv.org". 2015.
The minimum number on NOT gates in a Boolean circuits computing a Boolean function f is called inversion complexity of f. In 1957, A.A. Markov determined inversion complexity of every Boolean function. In the paper we consider circuits over arbitrary basis that consist of all monotone functions (with zero weight) and finite nonempty set of nonmonotone functions (with ...
Added: June 15, 2015
, Doklady Mathematics 2012 Vol. 86 No. 3 P. 854-856
Added: October 30, 2015
, Doklady Mathematics 2012 Vol. 86 No. 1 P. 480-482
Added: October 30, 2015
Correct algebras over estimation algorithms in the set of regular recognition problems with nonoverlapping classes
, Computational Mathematics and Mathematical Physics 2015 Vol. 49 No. 7 P. 1327
Added: October 30, 2015
, , Russian Journal of Mathematical Physics 2021 Vol. 28 No. 2 P. 179-187
In this paper, we show how to construct an asymptotic representation of the fundamental solution to the Cauchy problem for degenerate linear parabolic equations. ...
Added: June 6, 2021
Agent-based modelling of interactions between air pollutants and greenery using a case study of Yerevan, Armenia
, , , Environmental Modelling and Software 2019 Vol. 116 P. 7-25
Urban greenery such as trees can effectively reduce air pollution in a natural and eco-friendly way. However, how to spatially locate and arrange greenery in an optimal way remains as a challenging task. We developed an agent-based model of air pollution dynamics to support the optimal allocation and configuration of tree clusters in a city. The Pareto ...
Added: February 24, 2019
Lanham : University Press of America, 2012
The history of logic and analytic philosophy in Central and Eastern Europe is still known to very few people. As an exception to the rule, only two scientific schools became internationally popular: the Vienna Circle and the Lvov-Warsaw School. Nevertheless, the countries included in this region have not only joint history, but also joint cultural ...
Added: February 13, 2013
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs
, Discrete Mathematics 2015 Vol. 338 No. 11 P. 1860-1865
We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. ...
Added: April 7, 2014
Fast reconfiguration of high frequency brain networks in response to surprising changes in auditory input
, , et al., Journal of Neurophysiology (США) 2012 Vol. 107 No. 5 P. 1421-1430
How do human brain networks react to dynamic changes in the sensory environment? We measured rapid changes in brain network organization in response to brief, discrete, salient auditory stimuli. We estimated network topology and distance parameters in the immediate central response period, <1 s following auditory presentation of standard tones interspersed with occasional deviant tones ...
Added: October 23, 2014
, , Bernoulli: a journal of mathematical statistics and probability 2013 Vol. 19 No. 4 P. 1268-1293
Motivated by a problem arising when analysing data from quarantine searches, we explore properties of distributions of sums of independent means of independent lattice-valued random variables. The aim is to determine the extent to which approximations to those sums require continuity corrections. We show that, in cases where there are only two different means, the ...
Added: September 29, 2014
P. : Université Paris 13 - Paris Sorbonne Cité, 2013
In this workshop we will bring together participants who have solutions for one or more of the following problems: How can mutual understanding be optimized with the help of technology in hospitals where both patients and professionals have varying language skills, cultural backgrounds and cognitive capacities? Can domain ontologies, natural language processing tools, multilingual knowledge-based ...
Added: December 18, 2014
, , Дискретный анализ и исследование операций 2008 Т. 15 № 1 С. 3-10
Доказывается полиномиальная разрешимость задачи о независимом множестве для бесконечного семейства подмножеств класса планарных графов. ...
Added: August 31, 2012
, Journal of Applied and Industrial Mathematics 2020 Vol. 14 No. 4 P. 706-721
The edge coloring problem for a graph is to minimize the number of colors that are sufficient to color all edges of the graph so that all adjacent edges receive distinct colors. The computational complexity of the problem is known for all graph classes defined by forbidden subgraphs with at most 6 edges. We improve ...
Added: January 30, 2021
, , Дифференциальные уравнения 2019 Т. 55 № 9 С. 1209-1217
В работе изучается нелинейное интегральное уравнение, возникающее в результате параметрического замыкания третьего пространственного момента в модели У. Дикмана и Р. Лоу. Исследуется вопрос о существовании неподвижной точки интегрального оператора, задаваемого данным уравнением. Доказывается некомпактность полученного оператора. Формулируются условия, при которых уравнение имеет нетривиальное решение. ...
Added: November 7, 2019
, , et al., ACM Transactions on Computation Theory 2018 Vol. 10 No. 2 P. 1-32
The H-free Edge Deletion problem asks, for a given graph G and integer k, whether it is possible to delete at most k edges from G to make it H-free—that is, not containing H as an induced subgraph. The H-free Edge Completion problem is defined similarly, but we add edges instead of deleting them. The study of these two problem families has recently been the subject of intensive studies from the point of ...
Added: October 30, 2018
, , Математический сборник 2015 Т. 206 № 9 С. 3-20
We formulate some term rewriting systems in which the number of computation steps is finite for each output, but this number cannot be bounded by a provably total computable function in Peano arithmetic PA. Thus, the termination of such systems is unprovable in PA. These systems are derived from an independent combinatorial result known as the Worm ...
Added: March 13, 2016
Пятая Международная конференция «Системный анализ и информационные технологии» САИТ-2013 (19–25 сентября 2013 г., г.Красноярск, Россия): Труды конференции. В 2-х т.
Красноярск : ИВМ СО РАН, 2013
Труды Пятой Международной конференции «Системный анализ и информационные технологии» САИТ-2013 (19–25 сентября 2013 г., г.Красноярск, Россия): ...
Added: November 18, 2013
Влияние проницаемости поясков Каспари для воды и растворенных веществ на величину корневого давления: математическое моделирование
, , Российский журнал биомеханики 2013 Т. 17 № 4 С. 47-57
The mathematical modelling is performed to study the effect of the permeability of the Casparian bands to water and solutes on the formation of the root pressure. It is shown that the pressure in the xylem vessels which stops the flow across a root cut (root pressure) decreases with increase in the permeability of the ...
Added: January 30, 2014
, , et al., International Journal of Applied Mechanics 2016 Vol. 8 No. 2 P. 1650016-01-1650016-18
We present a method for evaluating elastic properties of a composite material produced by molding a resin filled with short elastic fibers. A flow of the filled resin is simulated numerically using a mesh-free method. After that, assuming that spatial distribution and orientation of fibers are not significantly changed during polymerization, effective elastic moduli of ...
Added: May 22, 2016
, , Risk Analysis: An International Journal 2013 Vol. 33 No. 12 P. 2142-2153
We propose a new modeling approach for inspection data that provides a more useful interpretation of the patterns of detections of invasive pests, using cargo inspection as a motivating example. Methods that are currently in use generally classify shipments according to their likelihood of carrying biosecurity risk material, given available historical and contextual data. Ideally, ...
Added: September 29, 2014
Algorithms and methods for solving scheduling problems and other extremum problems on large-scale graphs
, , et al., Journal of Mathematical Sciences 2005 Vol. 128 No. 6 P. 3487-3495
Added: January 27, 2014
, , , Russian Meteorology and Hydrology 2014 No. 5 P. 283-291
The evaluations of the forecasts of surface air temperature and precipitation for the period July 2010 - June 2013 are presented. The forecasting of surface air temperature at 5 days and precipitation at 3 days are considered. Our complex statistical scheme uses the results of the best foreign global schemes, regional scheme COSMO-RU7. The joint ...
Added: December 7, 2013
Совершенствование преподавания дисциплин математического цикла на основе инвариантов, необходимых для преподавания курса «Эконометрика» экономистам-бакалаврам
, , Вестник Нижегородского университета им. Н.И. Лобачевского. Серия: Социальные науки 2019 Т. 55 № 3 С. 183-189
The article describes a method that allows to improve the content of disciplines of the mathematical cycle by dividing them into invariant (general) and variable parts. The invariants were identified for such disciplines as «Linear algebra», «Mathematical analysis», «Probability theory and mathematical statistics» delivered to Bachelors program students of economics at several universities. Based on ...
Added: January 28, 2020