University of Chittagong

University of Chittagong
Short name
CU
Country, city
Bangladesh, Chittagong
Publications
3 127
Citations
49 740
h-index
81
Top-3 journals
SSRN Electronic Journal
SSRN Electronic Journal (69 publications)
Heliyon
Heliyon (60 publications)
Journal of Forestry Research (59 publications)
Top-3 foreign organizations
Lulea University of Technology
Lulea University of Technology (72 publications)
Kanazawa University
Kanazawa University (55 publications)
Griffith University
Griffith University (54 publications)

Most cited in 5 years

Found 
from chars
Publications found: 1567
Keyword Generation for Russian-Language Scientific Texts Using the mT5 Model
Glazkova A.V., Morozov D.A., Vorobeva M.S., Stupnikov A.A.
Q3 Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
The authors propose an approach to generate keywords for Russian-language scientific texts using the mT5 (multilingual text-to-text transformer) model, fine-tuned on the Keyphrases CS&Math Russian text corpus. Automatic keyword selection is an urgent task in natural language processing, since keywords help readers search for articles and facilitate the systematization of scientific texts. In this paper, the task of selecting keywords is considered as a task of automatic text abstracting. Additional training of mT5 is carried out on the texts of abstracts of Russian-language scientific articles. The input and output data are abstracts and comma-separated lists of keywords, respectively. The results obtained using mT5 are compared with the results of several basic methods: TopicRank, YAKE!, RuTermExtract, and KeyBERT. The following metrics are used to present the results: F‑measure, ROUGE-1, and BERTScore. The best results on the test sample are obtained using mT5 and RuTermExtract. The highest F-measure is demonstrated by the mT5 model (11.24%), surpassing RuTermExtract by 0.22%. RuTermExtract shows the best result according to the ROUGE-1 metric (15.12%). The best results for BERTScore are also achieved by these two methods: mT5, 76.89% (BERTScore using the mBERT model); RuTermExtract, 75.8% (BERTScore based on ruSciBERT). The authors also assess the ability of mT5 to generate keywords that are not in the source text. The limitations of the proposed approach include the need to form a training sample for additional model training and probably the limited applicability of the additional trained model for texts in other subject areas. The advantages of keyword generation using mT5 are the absence of the need to set fixed values for the length and number of keywords, the need for normalization, which is especially important for inflected languages, and the ability to generate keywords that are not explicitly present in the text.
Algorithms for Asymptotic and Numerical Modeling of Oscillatory Modes in the Simplest Ring of Generators with Asymmetric Nonlinearity
Glyzin S.D., Marushkina E.A.
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
A system of three ring-coupled generators with asymmetric nonlinearity and special nonlinear coupling is considered. The investigated system simulates an electrical circuit of three identical generators. Each generator is an oscillatory circuit with a nonlinear element. The current–voltage characteristic of this element has the S-shape. The nonlinear coupling between the generators is organized in such a way that it has a transmission coefficient close to one in the forward direction and close to zero in the reverse direction. First, the problem of finding the solutions that bifurcate from equilibrium states is investigated by asymptotic methods. Then, the original system is studied by numerical methods. The dependence of the dynamics of the system on the degree of asymmetry of cubic nonlinearity, which describes the characteristic of the nonlinear element, is analyzed.
Application of Deep Neural Networks for Automatic Irony Detection in Russian-Language Texts
Kosterin M.A., Paramonov I.V.
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
This paper examines automatic methods for classifying Russian-language sentences into two classes: ironic and nonironic. The methods under consideration can be divided into three categories: classifiers based on language model embeddings, classifiers based on sentiment information, and classifiers that train embeddings to detect irony. The components of classifiers are neural networks such as BERT, RoBERTa, BiLSTM, and CNN, as well as an attention mechanism and fully connected layers. Experiments to detect irony are carried out using two corpora of Russian-language sentences: the first corpus is composed of journalistic texts from OpenCorpora, while the second corpus is an extension of the first one and is supplemented with ironic sentences from Wiktionary. The best results are demonstrated by a group of classifiers based on pure embeddings of language models with the maximum F-measure value of 0.84, achieved by a combination of RoBERTa, BiLSTM, an attention mechanism, and a pair of fully connected layers in experiments on an extended corpus. In general, using the extended corpus produces results that are 2–5% better than those using the basic corpus. The achieved results are the best for the problem under consideration for the Russian language and are comparable to the best ones for English.
On the Application of the Calculus of Positively Constructed Formulas for the Study of Controlled Discrete-Event Systems
Davydov A.V., Larionov A.A., Nagul N.V.
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
The article is devoted to the development of an approach to solving the main problems of the theory of supervisory control of logical discrete-event systems (DES), based on their representation in the form of positively constructed formulas (PCF). We consider logical DESs in automata form, understood as generators of some regular languages. The PCF language is a complete first-order language, the formulas of which have a regular structure of alternating type quantifiers and do not contain a negation operator in the syntax. It was previously proven that any formula of the classical first-order predicate calculus can be represented as a PCF. PCFs have a visual tree representation and a natural question-and-answer procedure for searching for an inference using a single inference rule. It is shown how the PCF calculus, developed in the 1990s to solve some problems of control of dynamic systems, makes it possible to solve basic problems of the theory of supervisory control, such as checking the criteria for the existence of supervisory control, automatically modifying restrictions on the behavior of the controlled system, and implementing a supervisor. Due to some features of the PCF calculus, it is possible to use a non-monotonic inference. It is demonstrated how the presented PCF-based method allows for additional event processing during inference. The Bootfrost software system, or the so-called prover, designed to refute the obtained PCFs is also presented, and the features of its implementation are briefly described. As an illustrative example, we consider the problem of controlling an autonomous mobile robot.
Tasks in Named Entity Recognition: Technologies and Tools
Lagutina N.S., Vasilyev A.M., Zafievsky D.D.
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
The task of named entity recognition (NER) is to identify and classify words and phrases denoting named entities (NEs), such as people, organizations, geographical names, dates, events, and terms from subject areas. While searching for the best solution, researchers conduct a wide range of experiments with different technologies and input data. A comparison of the results of these experiments shows a significant discrepancy in the quality of NER and poses the problem of determining the conditions and limitations for the application of the used technologies, as well as finding new solutions. An important part in answering these questions is the systematization and analysis of current research and the publication of relevant reviews. In the field of NE recognition, the authors of analytical articles primarily consider mathematical methods of identification and classification and do not pay attention to the specifics of the problem itself. In this survey, the field of NE recognition is considered from the point of view of individual task categories. The authors identify five categories: the classical task of NER, NER subtasks, NER in social media, NER in domain, and NER in natural language processing (NLP) tasks. For each category the authors discuss the quality of the solution, features of the methods, problems, and limitations. Information about current scientific works of each category is given in the form of a table for clarity. This review allows us to draw a number of conclusions. Deep learning methods are the leading methods among state-of-the-art technologies. The main problems are the lack of datasets in open access, strict requirements for computing resources, and the lack of error analysis. A promising area of research in NER is the development of methods based on unsupervised techniques or rule-based learning. Intensively developing language models in existing NLP tools can serve as a possible basis for text preprocessing for NER methods. The article ends with a description and results of experiments with NER tools for Russian-language texts.
Study of a Radar Sensor Transmitter to Optimize a Bipolar Ultrawideband Pulse Used to Excite the Antenna
Aristov V., Greitans M.
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
The desire to increase the energy of the pulses by which the impact excitation of ultrawideband antennas is carried out prompts some authors of equipment (radars) to change the shape of these pulses. In particular, pulses are made bipolar. This article explores the issue of optimizing the shift of the second component of the excitation pulse. Such a shift allows obtaining the maximum level of the spectrum at the frequency of interest, determined by the transmitter-receiver path.
GMM Based Fault Signature Estimation of Electromechanical Machines for Small and Medium-Sized Enterprises in IoT Environment
Verasis Kour, Parveen Kumar Lehana
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
Small and medium sized enterprises (SMEs) form backbone of a nation’s economy. Implementation of technologies like Internet of Things (IoT), however, is a challenge for majority of them as the conventional solution requires a lot of investment. Thus, financially restricted SMEs, especially in developing nations, remain aloof from leveraging the benefits of the technology. Resorting to affordable devices such as low-cost sensors, actuators, processors, servers, and network technologies etc., pose challenges like low memory, low computation power, less transmission power, low data transfer rate, and limited network bandwidth. Consequently, there arises a need to develop IoT based solutions that cater to these challenges so that low budget SMEs are also able to benefit from IoT’s umpteen advantages. This paper proposes an affordable IoT based framework for health status monitoring of machines in SMEs keeping the limitations imposed by low cost IoT devices as centre of the solution. The scope of the present research is limited to monitoring the health status of the electromechanical rotating machines only. Four types of commonly occurring faults in the machines at different rotating speeds are investigated using acoustic signals generated within the machines. Mahalanobis distance and Gaussian mixture model (GMM) have been employed for the analysis of the acoustic signals for estimating the unique fault dependent signatures. GMM works satisfactorily with smaller datasets and requires lesser amount of computational power in comparison to machine learning based algorithms. The investigations have showed that GMM may be effectively used in resource constrained SMEs deploying affordable IoT devices for predictive maintenance.
Erratum to: Cluster Based QOS-Routing Protocol for VANET in Highway Environment
Fatima Belamri, Boulfekhar S., Aissani D.
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
An Erratum to this paper has been published: https://doi.org/10.3103/S0146411624060014
Altitude-Based Dynamics Modulation and Power Analysis in LEO Satellites
Shahid Ali, Bingli Jiao
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
Efficient signal modulation schemes are crucial for optimizing communication performance in low Earth orbit (LEO) satellite systems. Traditionally, uniform modulation methods are applied across the satellite constellation, regardless of variations in satellite distances from ground stations. However, this approach leads to inefficient signal power utilization, particularly for satellites at higher altitudes. This paper proposes a novel solution to this issue by implementing dynamic modulation strategies tailored to specific altitude ranges of LEO satellites. Through dynamic modulation, we utilize binary phase-shift keying (BPSK) and quadrature phase-shift keying (QPSK) for satellites positioned farther from earth, while higher-order constellations are used for satellites in closer proximity. This altitude-dependent modulation scheme aims to improve power efficiency throughout the LEO satellite network. Our results demonstrate a significant enhancement in power efficiency across the LEO satellite system compared to the conventional uniform modulation scheme. The adaptability of this dynamic modulation approach to satellite altitude variations allows for more judicious utilization of signal power, thereby maximizing communication quality and network reliability. We validate the effectiveness of the proposed method through extensive simulations.
Water Quality Assessment for Fishpond via Multisource Information Fusion
Yang Hanhua, Chong Chen
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
Data fusion can effectively process multisource information so as to obtain more accurate and reliable results. The data of water quality in a fishpond comes from various sensors, therefore the data must be fused. In this study, K-nearest interpolation, Grubbs criterion, a fuzzy comprehensive evaluation method, as well as an improved fruit fly optimization algorithm (IFOA) to find optimal parameters γ and σ of least squares support vector regression (LSSVR), were combined to provide accurate data for multisource information fusion modeling. The K-nearest interpolation method and grubbs criterion were employed to process abnormal data gross errors. Besides, a batch estimation adaptive weighted fusion algorithm was employed to, respectively, integrate the data from dissolved oxygen, water temperature, PH, and ammonia nitrogen concentration. A fuzzy comprehensive evaluation method, as well as analytic hierarchy process (AHP) were employed to obtain the true value of water quality grade. In addition, an IFOA-LSSVR model was proposed to predict the future water quality, which can better fit the nonlinear relationship between complex environmental factors and water quality. Experimental results show that the presented method can improve the data accuracy and provide decision results and scientific basis for the precision control of water quality environment.
Joint Simplification of Various Types of Spatial Objects While Preserving Topological Relations
Yakimova O.P., Murin D.M., Gorshkov V.G.
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
Cartographic generalization includes the selection of objects and phenomena, as well as their simplification (generalization), to be shown in the map while preserving the main typical traits, characteristics, and correlations by the criteria set by the user in the request. These criteria include the problem being solved and the scale of the displayed map. Various map transformations can change the relationships between objects, especially since it is common practice to simplify each type of spatial object independently (first the administrative boundaries, then the road network, populated localities, hydrographic network, etc.). The solution of topological conflicts is one of the key problems of generalizing digital map. A great deal of attention has been paid to the solution of this problem since the start of studies in this domain. The consideration of coverings and mesh structures confines the more general problem of managing topological conflicts to solve topological conflicts within a mesh cell. This study proposes a new geometric simplification algorithm. Its feature consists of the joint simplification of a set of spatial objects of various types while preserving their topological relations. The only parameter of the proposed algorithm is the minimal size of the detail shown in the map. Usually, this size is equal to one millimeter in the target map scale. Step one of the algorithm is the construction of a special mesh data structure. This structure is used to form, for each spatial object, a sequence of cells, to which points of this object belong. If a cell contains points of only one object, the object is geometrically simplified within the bounding cell using the sleeve-fitting algorithm. If a cell contains points of several objects, the geometric simplification is done using a special topology-preserving procedure.
Minimal Covering of Generalized Typed Inclusion Dependencies in Databases
Zykin S.V.
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
The theory and algorithms required to construct the minimal covering of generalized typed inclusion dependencies are discussed. Traditionally, the construction of the minimal covering is used for all types of dependencies in order to obtain a nonredundant and consistent database design. Generalized inclusion dependencies correspond to referential integrity constraints, when several main relations and several external relations are involved in one constraint, which corresponds to an ultragraph edge. A system of axioms with proof of consistency and completeness based on the study of dependency properties is presented in the previous study. In this study, closures for generalized typed inclusion dependencies are studied. An algorithm for constructing closures is developed. The correctness of the algorithm is proved. The results are further used to develop an algorithm for constructing the minimum covering. Examples that demonstrate the operation of the algorithms are presented at the end of the article.
On a Geometric Approach to the Estimation of Interpolation Projectors
Nevskii M.V., Ukhalov A.Y.
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
Suppose $$\Omega $$ is a closed bounded subset of $${{\mathbb{R}}^{n}},$$ $$S$$ is an $$n$$ -dimensional nondegenerate simplex, $$\xi (\Omega ;S): = \min \left\{ {\sigma \geqslant 1:\Omega \subset \sigma S} \right\}$$ . Here $$\sigma S$$ is the result of homothety of $$S$$ with respect to the center of gravity with coefficient $$\sigma $$ . Let $$d \geqslant n + 1,$$ $${{\varphi }_{1}}(x), \ldots ,{{\varphi }_{d}}(x)$$ be linearly independent monomials in $$n$$ variables, $${{\varphi }_{1}}(x) \equiv 1,$$ $${{\varphi }_{2}}(x) = {{x}_{1}}, \ldots ,\;{{\varphi }_{{n + 1}}}(x) = {{x}_{n}}.$$ Put $$\Pi : = {\text{lin}}({{\varphi }_{1}}, \ldots ,{{\varphi }_{d}}).$$ The interpolation projector $$P:C(\Omega ) \to \Pi $$ with a set of nodes $${{x}^{{(1)}}}, \ldots ,{{x}^{{(d)}}}$$ $$ \in \Omega $$ is defined by the equalities $$Pf\left( {{{x}^{{(j)}}}} \right) = f\left( {{{x}^{{(j)}}}} \right).$$ Denote by $${{\left\| P \right\|}_{\Omega }}$$ the norm of $$P$$ as an operator from $$C(\Omega )$$ to $$C(\Omega )$$ . Consider the mapping $$T:{{\mathbb{R}}^{n}} \to {{\mathbb{R}}^{{d - 1}}}$$ of the form $$T(x): = ({{\varphi }_{2}}(x), \ldots ,{{\varphi }_{d}}(x)).$$ We have the following inequalities: $$\frac{1}{2}\left( {1 + \frac{1}{{d - 1}}} \right)\left( {{{{\left\| P \right\|}}_{\Omega }} - 1} \right) + 1$$ $$ \leqslant \xi (T(\Omega );S) \leqslant \frac{d}{2}\left( {{{{\left\| P \right\|}}_{\Omega }} - 1} \right) + 1.$$ Here $$S$$ is the $$(d - 1)$$ -dimensional simplex with vertices $$T({{x}^{{(j)}}}).$$ We discuss this and other relations for polynomial interpolation of functions continuous on a segment. The results of numerical analysis are presented.
A Security Scheme for Source-Location Privacy Protection in Wireless Sensor Networks by Selecting Phantom Nodes
Xiaoguang Wei, Qian Zhang
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
Source-location privacy (SLP) is an important concern in wireless sensor networks (WSNs) as it can threaten WSN security. This paper first analyzed the SLP problem and then designed a node energy and distance-based SLP (NEDSLP) scheme from the point of selecting phantom nodes. The selection of phantom nodes occurred beyond the visible range of the source node, and the next hop routing was selected by considering both node energy and distance. This paper first briefly analyzed the SLP problem and then designed a node energy and distance-based SLP (NEDSLP) security scheme from the selection of phantom nodes, which selected phantom nodes outside the visual zone of the source node and selected the next hop routes by considering the node energy and distance together. Simulations on OMNet++ found that, compared with a protocol using source-based restricted flooding (PUSBRF) and a source location privacy protection scheme based on ring-loop routing (SLPRR), the NEDSLP scheme had a safety time of 886 when the number of hops was 50, which was 23% higher than the SLPRR. The energy consumption of the NEDSLP scheme was 72 hops, which was slightly higher than the PUSBRF but slightly lower than the SLPRR. The transmission delay was 46 hops, reduced by 25% compared to the PUSBRF and reduced by 18% compared to the SLPRR. The results demonstrate that the scheme proposed in this paper can effectively improve the security of SLPs for the purpose of protecting monitoring targets and can be further applied in WSNs.
Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem
Vasilchikov V.V.
Q3
Pleiades Publishing
Automatic Control and Computer Sciences 2024 citations by CoLab: 0  |  Abstract
In this paper, we propose an algorithm for solving the maximum common subgraph problem. The sequential and parallel versions of the algorithm and their software implementation are described, and their effectiveness is experimentally studied. This problem is one of the most famous NP-complete problems. Its solution may be required when solving many practical problems related to the study of complex structures. We solve it in a formulation in which we need to find all possible isomorphisms of the found common subgraph. Due to the extremely high complexity of the problem, the desire to speed up its solution by parallelizing the algorithm is quite natural. To organize parallel computing, the RPM_ParLib library is used, which makes it possible to create parallel applications running on a local computer network under the control of the .NET Framework runtime environment. The library supports a recursive-parallel programming style and ensures efficient distribution of work and dynamic load balancing of computing modules during program execution. It can be used for applications written in any programming language supported by the .NET Framework. The purpose of the numerical experiment is to study the acceleration achieved through the recursive-parallel organization of calculations. For the experiment, a special application in C# that is designed to generate various sets of initial data with specified parameters is developed. Here, we describe the characteristics of the generated initial graph pairs and the results obtained during the experiment.

Since 1978

Total publications
3127
Total citations
49740
Citations per publication
15.91
Average publications per year
66.53
Average authors per publication
5.47
h-index
81
Metrics description

Top-30

Fields of science

50
100
150
200
250
300
General Medicine, 290, 9.27%
Condensed Matter Physics, 205, 6.56%
Electronic, Optical and Magnetic Materials, 155, 4.96%
Electrical and Electronic Engineering, 147, 4.7%
Physical and Theoretical Chemistry, 142, 4.54%
Management, Monitoring, Policy and Law, 139, 4.45%
Forestry, 138, 4.41%
Geography, Planning and Development, 137, 4.38%
General Chemistry, 136, 4.35%
Materials Chemistry, 127, 4.06%
General Materials Science, 119, 3.81%
Multidisciplinary, 118, 3.77%
Pollution, 114, 3.65%
Renewable Energy, Sustainability and the Environment, 112, 3.58%
Ecology, Evolution, Behavior and Systematics, 112, 3.58%
Aquatic Science, 108, 3.45%
Ecology, 98, 3.13%
Environmental Chemistry, 95, 3.04%
Biochemistry, 90, 2.88%
Analytical Chemistry, 86, 2.75%
Atomic and Molecular Physics, and Optics, 85, 2.72%
General Environmental Science, 83, 2.65%
Environmental Engineering, 81, 2.59%
Health, Toxicology and Mutagenesis, 81, 2.59%
Molecular Biology, 78, 2.49%
Inorganic Chemistry, 76, 2.43%
Water Science and Technology, 75, 2.4%
Drug Discovery, 74, 2.37%
Organic Chemistry, 71, 2.27%
Public Health, Environmental and Occupational Health, 69, 2.21%
50
100
150
200
250
300

Journals

10
20
30
40
50
60
70
10
20
30
40
50
60
70

Publishers

100
200
300
400
500
600
700
800
100
200
300
400
500
600
700
800

With other organizations

20
40
60
80
100
120
140
20
40
60
80
100
120
140

With foreign organizations

10
20
30
40
50
60
70
80
10
20
30
40
50
60
70
80

With other countries

50
100
150
200
250
300
350
Japan, 332, 10.62%
China, 282, 9.02%
Australia, 280, 8.95%
USA, 276, 8.83%
Malaysia, 234, 7.48%
Saudi Arabia, 195, 6.24%
United Kingdom, 191, 6.11%
India, 156, 4.99%
Republic of Korea, 122, 3.9%
Canada, 112, 3.58%
Sweden, 111, 3.55%
Germany, 88, 2.81%
Italy, 68, 2.17%
UAE, 67, 2.14%
Thailand, 55, 1.76%
Spain, 52, 1.66%
Indonesia, 38, 1.22%
Finland, 36, 1.15%
Pakistan, 35, 1.12%
France, 33, 1.06%
Egypt, 27, 0.86%
Norway, 26, 0.83%
Russia, 25, 0.8%
Portugal, 25, 0.8%
Brunei, 24, 0.77%
Brazil, 23, 0.74%
Turkey, 23, 0.74%
Iraq, 22, 0.7%
Denmark, 20, 0.64%
50
100
150
200
250
300
350
  • We do not take into account publications without a DOI.
  • Statistics recalculated daily.
  • Publications published earlier than 1978 are ignored in the statistics.
  • The horizontal charts show the 30 top positions.
  • Journals quartiles values are relevant at the moment.