Rough Sets - International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3-7, 2017, Proceedings, Part II.. Val. 10314.

doi:10.1007/978-3-319-60840-2

?

Rough Sets - International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3-7, 2017, Proceedings, Part II.

Vol. 10314. Springer, 2017.

Academic editor: L. Polkowski, Y. Yao, P. Artiemjew, D. Ciucci, D. Liu, D. Slezak, B. Zielosko

The proceedings contain 94 papers. The special focus in this conference is on Rough Sets. The topics include: Approximations from anywhere and general rough sets; generalized ideals and co-granular rough sets; certainty-based rough sets; the rough membership function on one type of covering-based rough sets and its applications; mereogeometry based approach for behavioral robotics; similarity based rough sets; a topological approximation space based on open sets of topology generated by coverings; actual existence predicate in mereology and mereotopology; path planning based on potential fields from rough mereology; three-way dicision community detection algorithm based on local group information; actionable strategies in three-way decisions with rough sets; rough set approximations in an incomplete information table; two novel decomposition approaches for knowledge acquisition model; three-way decisions with DEA approach; covering-based optimistic multigranulation decision-theoretic rough sets based on maximal descriptors; a three-way decision model based on intuitionistic fuzzy decision systems; sequential three-way decisions in efficient classification of piecewise stationary speech signals; a three-way recommender system for popularity-based costs; three-way decisions based on intuitionistic fuzzy sets; a framework of three-way cluster analysis; a semi-supervised three-way clustering framework for multi-view data; determining thresholds in three-way decisions; three-way decisions cost model based on continuous domain; conflict analysis for Pythagorean fuzzy information systems; attribute reduction in utility-based decision-theoretic rough set models; resolving the conflicts between cuts in a decision tree with verifying cuts and depression behavior detection model based on participation in serious games.

Turning Krimp into a Triclustering Technique on Sets of Attribute-Condition Pairs that Compress

Ignatov D. I., Yurov M., , in: Rough Sets - International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3-7, 2017, Proceedings, Part II.Vol. 10314.: Springer, 2017. P. 558–569.

Mining ternary relations or triadic Boolean tensors is one of the recent trends in knowledge discovery that allows one to take into account various modalities of input object-attribute data. For example, in movie databases like IMBD, an analyst may find not only movies grouped by specific genres but see their common keywords. In the so-called ...

Added: February 9, 2020

Research target: Mathematics Computer Science

Priority areas: IT and mathematics mathematics

Keywords: информационные системы анализ формальных понятий неточные множества information systems Incomplete data Uncertainty Data Uncertainty Data Analysis Rough set theory Vagueness Rough mereology Software systems for rough sets Three-way decision systems Granular computing Multi-agent systems Analysis of Biomedical data Formal concept analysis

Rough Sets - International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3-7, 2017, Proceedings, Part II.

ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ И ТЕХНИЧЕСКИЕ СРЕДСТВА УПРАВЛЕНИЯ (ICCT-2024)

М.: Институт проблем управления им. В.А. Трапезникова РАН, 2024.

В сборник вошли материалы VIII Международной научной конференции «Информационные технологии и технические средства управления» (ICCT-2024). На конференции были рассмотрены вопросы, касающиеся перспектив развития научного приборостроения в телекоммуникационных и управляющих системах, биомедицинской информатики, аппаратного и программного обеспечения информационнокоммуникационных систем, надежности, диагностики и неразрушающего контроля, систем управления и автоматизации, цифровых экосистем, управления производством и логистикой, методов математического ...

Added: May 27, 2026

Non-linear in-band interference cancellation on base of conjugate gradients method

Degtyarev A., Bakhurin S., Yudin N., DSPA 2026 P. 1–6

This paper investigates one possible solution to the problem of self-interference cancellation (SIC) arising in the design of in-band full-duplex (IBFD) communication systems. Self-interference cancellation is performed in the digital domain using multilayer nonlinear models adapted via gradient-based optimization. The presence of local minima and saddle points during the adaptation of multilayer models limits the ...

Added: May 26, 2026

New Numerical Invariants of an Unfolding of a Polycycle “Tears of the Heart”

Ilyashenko Y., Shilin I., Stanislav Minkov, Russian Journal of Mathematical Physics 2026 Vol. 33 No. 1 P. 89–106

In this paper, new numerical invariants of structurally unstable vector fields in the plane are found. One of the main tools is an improved asymptotics of sparkling saddle connections that occur when a separatrix loop of a hyperbolic saddle breaks. Another main tool is a new topological invariant of two arithmetic progressions, both perturbed and unperturbed, on the ...

Added: May 26, 2026

Comparative Study of Training Methods and Architectures of Echo State Networks

Androsov I., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 3 P. 87–114

This paper examines echo state networks (ESNs), one of the most prevalent approaches to implementing reservoir computing. An ESN consists of a recurrent neural network with fixed (untrained) weights and a readout layer that is typically linear and trainable. This approach enables the creation of energyefficient and computationally efficient neural networks capable of real-time learning. However, since ...

Added: May 26, 2026

ADDITIVE AUTOMORPHISMS OF REGULAR MATRIX GRAPH

Gusev I., Maksaev A., Promyslov V., Journal of Mathematical Sciences 2025 Vol. 299 No. 6

The regular graph of the space of n × m matrices over a field F is defined as the undirected graph whose vertices are matrices of rank min(n, m), and distinct matrices A and B are connected by an edge if and only if rk(A + B) < min(n, m). In this paper, for |F| ...

Added: May 25, 2026

Рефакторинг исходного кода на основе LLM и расширения UML

Караваева Е. А., Кулигин Л. А., Rezunik L. et al., Труды Института системного программирования РАН 2026 Т. 38 № 3 С. 67–94

В статье представлен метод рефакторинга исходного кода на основе интеграции большой языковой модели (LLM) и расширенной UML-модели программного кода. Предложенный подход позволяет выявлять проблемные участки кода с использованием функций тревожности и структурных метрик классов, а затем выполнять автоматизированный рефакторинг. Ключевой особенностью метода является использование LLM для генерации формальных спецификаций на языке OCL (Object Constraint Language), ...

Added: May 24, 2026

Coping with AI errors with provable guarantees

Tyukin I., Tyukina T., van Helden D. P. et al., Information Sciences 2024 Vol. 678 Article 120856

AI errors pose a significant challenge, hindering real-world applications. This work introduces a novel approach to cope with AI errors using weakly supervised error correctors that guarantee a specific level of error reduction. Our correctors have low computational cost and can be used to decide whether to abstain from making an unsafe classification. We provide ...

Added: May 23, 2026

Overcoming the Curse of Dimensionality with Synolitic AI

Zaikin A., Sviridov I., Sosedka A. et al., Technologies 2026 Vol. 14 No. 2 Article 84

High-dimensional tabular data are common in biomedical and clinical research, yet conventional machine learning methods often struggle in such settings due to data scarcity, feature redundancy, and limited generalization. In this study, we systematically evaluate Synolitic Graph Neural Networks (SGNNs), a framework that transforms high-dimensional samples into sample-specific graphs by training ensembles of low-dimensional pairwise ...

Added: May 23, 2026

Stable On-the-Fly Learning for Dynamic Neural Networks With Delayed Inputs

Kibkalo Vladislav, Chertopolokhov V., Mukhamedov A. et al., IEEE Access 2026 Vol. 14 P. 14369–14392

This study presents on-the-fly identification and multi-step prediction of nonlinear systems with delayed inputs using a dynamic neural network combined with a smooth projection onto ellipsoids. The projection enforces parameter constraints that guarantee stability, while a Lyapunov–Krasovskii analysis yields computable ultimate error bounds. Riccati-type matrix inequalities are derived, providing an efficient vectorization–projection–devectorization implementation suitable for ...

Added: May 22, 2026

Analysis of the alternating minimization method for low-rank canonical polyadic decomposition in the Chebyshev norm

Морозов С. В., Calcolo 2026 Vol. 63 No. 2 Article 23

The approximation of tensors in a low-para metric format is a crucial component in many mathematical modelling and data analysis tasks. Among the widely used low-parametric representations, the canonical polyadic (CP) decomposition is known to be very efficient. Nowadays, most algorithms for CP approximation aim to construct the approximation in the Frobenius norm; however, some ...

Added: May 22, 2026

Опыт применения сетевого анализа (SNA) в историческом нарративе полисубъектного региона (на примере валлийской хроники Brut y Tywysogyon)

Loshkareva M. E., Matveeva N., Вестник Томского государственного университета. История 2026 № 100 С. 112–118

This research is an endeavor to apply social network analysis (SNA) to the study of a medieval narrative source. The authors suppose that the use of network analysis may offer new possibilities in the study of the history of regions characterized by some political fragmentation. Authors tried to construct networks of historical interactions from 1193 ...

Added: May 22, 2026

B-facets in Dimension 4

Селянин Ф. И., Journal of Dynamical and Control Systems 2026 Vol. 32 No. 2 Article 18

A B-facet is a lattice -dimensional polytope in the positive octant with a positive normal covector, such that every -dimensional simplex with vertices in it is a B-simplex (i.e., a pyramid of height one with base on a coordinate hyperplane). B-facets were introduced in [2] in the context of the monodromy conjecture. In this paper, we complete the ...

Added: May 21, 2026

The VCG Mechanism, the Core, and Assignment Stages in Auctions

Ausubel L., Baranov O., Journal of Economic Theory 2026 Vol. 235 No. 106192

The Vickrey-Clarke-Groves (VCG) mechanism is one of the most compelling constructs in mechanism design, but the presence of complementary goods creates the possibility of non-core and even zero-revenue outcomes. In this article, we show that joint feasibility constraints on allocations offer a second pathway to ill-behaved outcomes in the VCG mechanism, even when all bidders ...

Added: May 20, 2026

Upper bounds for Steklov eigenvalues of a hypersurface of revolution

Denis Seliutskii, Russian Journal of Mathematical Physics 2025 Vol. 32 No. 2 P. 399–407

In this paper, we find an upper bound for the first Steklov eigenvalue for a surface of revolution with boundary consisting of two spheres of different radii. Moreover, we prove that, in some cases, this boundary is sharp. ...

Added: May 19, 2026

ML-based Fast Simulation of FARICH Responses

Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.

A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...

Added: May 19, 2026

Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (Volume 3: System Demonstrations)

Rabat: Association for Computational Linguistics, 2026.

Added: May 19, 2026

Dataset of solubility values for organic compounds in binary mixtures of solvents at various temperatures

Bezzubov S., Malikov D., Krasnov L. et al., Scientific data 2026 Vol. 13 Article 727

Solubility is a crucial property of organic compounds, impacting their potential applications in synthetic chemistry, materials science and drug design. Moreover, in technological processes mixtures of solvents are often utilized, making the solubility assessment more complicated. Predicting solubility values in mixtures of solvents from a molecular structure can help to address this issue, although a ...

Added: May 19, 2026

Aerokinesis: An IoT-Based Vision-Driven Gesture Control System for Quadcopter Navigation Using Deep Learning and ROS2

Kondratev S., Yulia Dyrchenkova, Georgiy Nikitin et al., Technologies 2026 Vol. 14 No. 1 Article 69

This paper presents Aerokinesis, an IoT-based software–hardware system for intuitive gesture-driven control of quadcopter unmanned aerial vehicles (UAVs), developed within the Robot Operating System 2 (ROS2) framework. The proposed system addresses the challenge of providing an accessible human–drone interaction interface for operators in scenarios where traditional remote controllers are impractical or unavailable. The architecture comprises ...

Added: May 19, 2026

Bifurcations and Structural Stability of Generic PC-HC Families

Dorovskiy A., / Series arXiv "math". 2026.

In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. ...

Added: May 14, 2026

On the minimum number of maximal distance-k independent sets in trees

Taletskii D., / Series arXiv "math". 2026.

A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...

Added: May 1, 2026

On Arithmetic Mirror Symmetry for smooth Fano fourfolds

Ovcharenko M., / Series arXiv "math". 2026.

We introduce an explicit class of tempered Laurent polynomials in the sense of Villegas and Doran--Kerr in n⩽4 variables including all Landau--Ginzburg models for smooth Fano threefolds with very ample anticanonical class. We check that it contains Landau--Ginzburg models for various Fano fourfolds which are complete intersections in smooth toric varieties and Grassmannians of planes, ...

Added: April 30, 2026

Natural hazard database from Internet publications: text mining with a large language model

Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.

Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...

Added: April 28, 2026

Caspian Pipeline Consortium Equipment Monitoring System

Belov A. V., Irina V. Arutyunova, , in: Proceedings of the 2025 INTERNATIONAL CONFERENCE "QUALITY MANAGEMENT, DIGITAL SECURITY, INFORMATION TECHNOLOGIES" (2025 QM&DS&IT).: IEEE, 2025. P. 169–173.

The equipment condition assessment system of the Caspian Pipeline Consortium is purposed to enhance the efficiency of monitoring and to manage the operation of pipeline systems. The primary objective of this initiative is to develop an information system that enables continuous monitoring of pipeline conditions, thereby minimizing maintenance costs and reducing risks associated with potential ...

Added: April 21, 2026

Algorithmic overlaps as thermodynamic variables: from local to cluster Monte Carlo dynamics in critical phenomena

Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.

We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...

Added: April 20, 2026