Semantic representations in computational and theoretical linguistics: the potential for mutual enrichment // Computational linguistics and intellectual technologies. Proceedings of the International Conference "Dialogue 2021". Ïåðåéòè ê ïóáëèêàöèè
New upper bounds on the smallest size of a complete cap in the spaces PG(3,q) and PG(4,q), Ars Combinatoria, vol. 147, Oct. 2019, pp. 87-96 Ïåðåéòè ê ïóáëèêàöèè
Tables, bounds and graphics of sizes of complete arcs in the plane PG(2,q) for all q ≤ 321007 and sporadic q in [323761 ... 430007] obtained by an algorithm with fixed order of points (FOP), electronic publication, arXiv:11404.0469[math.CO], 111 pages, 8 figures, 6 tables, 92 references, January 2018 Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (1.5 MB)
Upper bounds on the smallest size of a
complete cap in PG(3, q) and PG(4, q), Electronic Notes in Discrete Mathematics, vol. 57, Algebraic and Combinatorial Coding Theory, pp. 21–26, 2017 Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (235.5 KB)
Upper bounds on the smallest size of a complete cap in PG(3; q) and PG(4; q), in Proceedings XV Int. Workshop on Algebraic and Combinatorial Coding Theory, ACCT2016, Albena, Bulgaria, June 18--24, 2016,
pp. 19--26. Çàãðóçèòü (283 KB)
Tables, bounds and graphics of the smallest
known sizes of complete caps in the spaces PG(3,q) and PG(4,q), electronic publication, arXiv:1610.09656[math.CO], 26 pages, October 2016 Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (293.8 KB)
Optimal optotype structure for monitoring visual acuity // 1st International Symposium on Visual Physiology, Environment, and Perception. Riga, Latvia. 6-8 october, 2016. Book of abstracts. P. 45. Ïåðåéòè ê ïóáëèêàöèè
K. Khanin, A. Sobolevski, “On Dynamics of Lagrangian Trajectories for Hamilton–Jacobi Equations”, Archive for Rational Mechanics and Analysis, 219:2 (2016) 861-885, arXiv: 1211.7084 Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (739.5 KB)
Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search, DOI: 10.1007/s00022-015-0277-z, Journal of Geometry, vol. 107, no. 1, pp. 89-117, 2016
Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (1.2 MB)
Fréchet Barycenters and a Law of Large Numbers for Measures on the Real Line, e-print arXiv:1512.08421 [math.PR], 17 pp. Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (210.3 KB)
Scientific Activity of Alfred Yarbus: The Stages of Research Work, Senior and Younger Colleagues, Conditions of Investigations // Perception, 2015, 44(8-9), P. 837-850. Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (508 KB)
Tables, bounds and graphics of sizes of complete lexiarcs in the plane PG(2, q) for all q ≤ 301813 and sporadic q in the interval [301897 . . . 430007] obtained by an algorithm
with fixed order of points (FOP), electronic publication, arXiv:1404.0469v2[math.CO], 114 pages, July 2015
Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (1.5 MB)
Accuracy of the body surface potential approximation. In: Measurement 2015, Proceedings of the 10th International Conference on Measurement, Congress Centre of SAS, Smolenice Castle, Slovak Republic, 2015, p. 93-96.
Tables, bounds and graphics of the smallest known sizes of complete arcs in the plane PG(2,q) for all q ≤ 160001 and sporadic q in the interval [160801...430007], electronic publication, arXiv:1312.2155v3 [math.CO], 85 pages, June 2015
Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (1 MB)
Kreshchuk A.A., Zyablov V.V. Generalized concatenated system with embedded space-time codes for MIMO systems // Journal of Communications Technology and Electronics. 2014. Ò. 59. ¹ 12. Ñ. 1489–1500. Ïåðåéòè ê ïóáëèêàöèè
Kreshchuk A., Zyablov V. Embedded space-time block codes for concatenated systems // 2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems. 2014. Ïåðåéòè ê ïóáëèêàöèè
Kreshchuk A., Zyablov V., Ryabinkin E. A new iterative decoder for product codes // Fourteenth International Workshop on Algebraic and Combinatorial Coding Theory ACCT2014. — 2014. — Pp. 211–214.
Çàãðóçèòü (68.6 KB)
Kreshchuk A., Zyablov V. Generalized concatenated MIMO system with GMD decoding // Turbo Codes and Iterative Information Processing (ISTC), 2014 8th International Symposium on. — Aug. 2014. — Pp. 259–263. — DOI: 10.1109/ISTC.2014.6955125.
Ïåðåéòè ê ïóáëèêàöèè
Kreshchuk A., Zyablov V. Embedded space-time block codes for concatenated systems // Problems of Redundancy in Information and Control Systems (REDUNDANCY), 2014 XIV International Symposium on. — June 2014. — Pp. 62–65. — DOI: 10.1109/RED.2014.7016707.
Ïåðåéòè ê ïóáëèêàöèè
Upper bounds on the smallest size of a complete arc in PG(2,q) under a certain probabilistic conjecture,
Problems of Information Transmission, 2014, vol. 50, no. 4, pp 320-339 Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (539.9 KB)
Advantages of employing specially modified 3-bar stimuli for visual acuity monitoring in adults and children: Test-retest reliability// 37th European Conference on Visual Perception 2014. Belgrad, Serbia. 24-28 August. Perception. 2014. V. 43, Suppl. P.34. Ïåðåéòè ê ïóáëèêàöèè
2014 ã.
Àâòîðû: Bartoli D., Davydov A., Faina G., Kreshchuk A., Marcugini S., Pambianco F., Tkachenko I.
Upper bounds on the smallest sizes of a complete arc in PG(2,q) based on computer search, in Proceedings XIV International Workshop on Algebraic and Combinatorial Coding Theory, ACCT2014, Svetlogorsk , Russia, 2014,32-40 Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (363.9 KB)
Conjectural upper bounds on the smallest size of a complete arc in PG(2,q) based on an analysis of step-by-step greedy algorithms, in Proceedings XIV International Workshop on Algebraic and Combinatorial Coding Theory, ACCT2014, Svetlogorsk , Russia, 2014, 24-31 Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (188.6 KB)
Tables of sizes of small complete arcs in the plane PG(2, q), q ≤ 410009, electronic publication, arXiv:1312.2155v2 [math.CO], 89 pages, August 2014 Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (760.3 KB)
Visual acuity measurement: Account of the optotype structure // 36th European Conference on Visual Perception 2013. Bremen, Germany. 25-29 August. Perception. 2013. V. 42, Suppl. P. 69.
Tables of sizes of small complete arcs in the plane
PG(2, q), q ≤ 360007, electronic publication, arXiv:1312.2155v1 [math.CO], 71 pages, December 2013 Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (472.9 KB)
Two types of upper bounds on the smallest size of a complete arc in the plane PG(2,q),
in Proceedings VII International Workshop on Optimal Codes and Related Topics, OC2013, Albena,
Bulgaria, 2013, pp. 19-25 Ïåðåéòè ê ïóáëèêàöèèÇàãðóçèòü (287.1 KB)