Proceedings of the International Conference on Electrical and Computer Systems ICECS'12

?

Proceedings of the International Conference on Electrical and Computer Systems ICECS'12

Ottawa : International ASET Inc, 2012.

The International Academy of Science, Engineering and Technology (International ASET Inc.) is pleased to organize the 2012 International Conference on Electrical and Computer Systems (ICECS'12).

ICECS is a comprehensive conference covering all the various topics of Electrical Engineering, Electronics, Computer Sciences and Engineering, and Information Technologies. The aim of the ICECS 2012 is to gather scholars from all over the world to present advances in the aforementioned fields and to foster an environment conducive to exchanging ideas and information. This conference will also provide a golden opportunity to develop new collaborations and meet experts on the fundamentals, applications, and products of Electrical, Electronics, Computer, and Information Systems. We believe inclusive and wide-ranging conferences such as ICECS can have significant impacts by bringing together experts from the different and often separated fields of Electrical, Electronics, Computer, and Information Systems, creating unique opportunities for collaborations and shaping new ideas for experts and researchers.

Verification of MCU-Based Systems Software on an SDVRP Platform

Shershakov S., , in: Proceedings of the International Conference on Electrical and Computer Systems ICECS'12.: Ottawa: International ASET Inc, 2012. P. 207-1–207-8.

The SLAM-based Static Driver Verifier Research Platform (SDVRP), as a tool that systematically analyzes source code and allows writing custom SLIC rules for various platforms, provided a potent verification mechanism for an embedded software system based on ARM Cortex-M0 microprocessor. The correctness of this software is of particular importance in the sense that there are ...

Added: March 14, 2013

Priority areas: IT and mathematics mathematics engineering science

Language: English

Keywords: SDVRP

Proceedings of the International Conference on Electrical and Computer Systems ICECS'12

Three Algorithms for Merging Hierarchical Navigable Small World Graphs

Ponomarenko A., / Series Computer Science "arxiv.org". 2025.

This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...

Added: July 30, 2026

New bound on S1× S2-setting Bell locality of a nonseparable Werner state

Loubenets E. R., / Series arxiv.org "quant-ph". 2026. No. 2607.18050.

In many quantum applications it is important to know whether or not a Bell nonlocal two-qudit state exhibits its nonlocality under correlation scenarios with some given numbers S1,S2≥1 of generalized quantum measurements at two sites. In the present article, we find analytically a new general locality condition sufficient for a nonseparable Werner state with a ...

Added: July 21, 2026

On functional equations for Chow polylogarithms

Bolbachan V., / Series math "arxiv.org". 2024.

Chow polylogarithms are some special functions arising in explicit description of the Beilinson regulator map. The most interesting functional equation for this function reflects its vanishing on the boundary in the Bloch's cycle complex. We show that this functional equation formally follows from more simple ones, namely skew-symmetry, functoriality and multiplicativity. To prove this, we study ...

Added: July 16, 2026

On Goncharov’s conjecture in next to Milnor degree

Bolbachan V., / Series math "arxiv.org". 2024.

Let K be a field of characteristic zero. We prove that its motivic cohomology in degree m−1 and weight m is rationally isomorphic to the cohomology of the polylogarithmic complex. This gives a partial extension of A. Suslin theorem describing the indecomposable K3 of a field. ...

Added: July 16, 2026

Statistical inference based on band-limited kernels: Rational-infinitely divisible distributions and beyond

Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.

This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...

Added: July 9, 2026

Growth in noncommutative algebras and entropy in derived categories

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

A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...

Added: June 23, 2026

Multilinear nilalgebras and the Jacobian theorem

Piontkovski D., / Series arXiv "math". 2025.

If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...

Added: June 23, 2026

Strong Approximations for Markov Chains Weakly Converging to Diffusions

Konakov V., Kucher D., Mammen E., / Series arXiv "math". 2026. No. 2606.11142v1.

In this paper, we construct strong approximations for discrete-time Markov chains weakly converging to continuous diffusion processes, as well as for their perturbed counterparts. Under the assumption of bounded coefficients, we construct closely coupled versions of these processes on a shared probability space. In particular, for both non-degenerate and degenerate cases, we maximize the probability ...

Added: June 11, 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

Perovskite nanoparticles Cs4PbBr6 and CsPbBr3: synthesis, analysis and peculiar optical properties

Гущина В. А., / Series chemrxiv-2023-vpzhz-v2 "ChemRxiv". 2023.

All-inorganic perovskite CsPbBr3 and Cs4PbBr6 nanoparticles are being intensively studied due to their unique properties and wide range of applications; however, however, the nature of their optical properties is not yet fully understood due to the difficulty of synthesis of singlephase nanoparticles. In this article we describe the features of the synthesis of single-phase particles ...

Added: May 14, 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

Verification of MCU-Based Systems Software on an SDVRP Platform

Shershakov S., , in: Proceedings of the International Conference on Electrical and Computer Systems ICECS'12.: Ottawa: International ASET Inc, 2012. P. 207-1–207-8.

Added: March 14, 2013

An SDVRP Platform Verification Method for Microprocessor-Based Systems Software

Sergey Shershakov, Irina Lomazova, , in: Proceedings of the 6th Spring/Summer Young Researchers’ Colloquium on Software Engineering, SYRCoSE 2012.: Perm: -, 2012. P. 79–84.

The correctness of embedded systems software is of critical importance as invalid states can cause a physical damage to hardware. One of approaches to verification of such systems is using source code analyzers. The Static Driver Verifier Research Platform (SDVRP), which is based on Simultaneous Localization and Mapping (SLAM) and represents a tool that systematically ...

Added: March 14, 2013