Browse Items (16481 total)
Sort by:
-
On Automatic Target Recognition (ATR) using Inverse Synthetic Aperture Radar Images
Inverse Synthetic Aperture Radar (ISAR) is used to image sea surface targets during day/night and all-weather capabilities for applications such as coastal surveillance, ship self-defense, suppression of drug trafficking etc. Hence automating classification of ships by means of machine learning methods has become more significant. Typical classification approaches consist of pre-processing, feature extraction and processing by classifiers. Image processing techniques are applied for pre-processing ISAR images. Transformation invariant features are then extracted to which classifiers such as SVM, Neural Networks (NNs) are applied. The performance of these algorithms depend on the manually chosen features and is trained to perform well for different target profiles. The target image (profile of target) varies depending on the target type, aspect angle and motion introduced due to different sea states. In addition, Deep learning methods are also being explored for classification of ships. The challenge is to classify ships for different sea conditions and image acquisition parameters with limited database and processing resource. 2023 IEEE. -
On becoming a demanding Community: Neelam and its March for Justice
The Neelam Panpattu Maiyam (Neelam Cultural Centre), an anti-caste socio-cultural movement based in Tamil Nadu, has emerged as a political force following its March for Justice rally in response to the murder of Dalit leader, K. Armstrong of Bahujan Samaj Party (BSP). The rally caused unease not only among mainstream political parties but also within certain Dalit political factions, with the media claiming it created divisions within Dalit politics. However, the movement, with strong Dalit assertions, confronts the Dravidian political power of the state head-on, which chose to remain silent about the murder. In contrast to those Dalit leaders who appease the state apparatus by compromising Dalit rights, Neelam demanded elected Dalit leaders to firmly stand for the Dalit cause. Given this recent political upheaval, this study delves into Neelams evolving political role in becoming a more vocal and influential force in contemporary political discourse against caste-based injustices, highlighting the significant impact of the March for Justice rally within and beyond the Dalit politics in the state. 2025 Informa UK Limited, trading as Taylor & Francis Group. -
On bivariate Teissier model using Copula: dependence properties, and case studies
To precisely represent bivariate continuous variables, this work presents an innovative approach that emphasizes the interdependencies between the variables. The technique is based on the Teissier model and the Farlie-Gumbel-Morgenstern (FGM) copula and seeks to create a complete framework that captures every aspect of associated occurrences. The work addresses data variability by utilizing the oscillatory properties of the FGM copula and the flexibility of the Teissier model. Both theoretical formulation and empirical realization are included in the evolution, which explains the joint cumulative distribution function F(z1,z2), the marginals F(z1) and F(z2), and the probability density function (PDF) f(z1,z2). The novel modeling of bivariate lifetime phenomena that combines the adaptive properties of the Teissier model with the oscillatory characteristics of the FGM copula represents the contribution. The study emphasizes the effectiveness of the strategy in controlling interdependencies while advancing academic knowledge and practical application in bivariate modelling. In parameter estimation, maximum likelihood and Bayesian paradigms are employed through the use of the Markov Chain Monte Carlo (MCMC). Theorized models are examined closely using rigorous model comparison techniques. The relevance of modern model paradigms is demonstrated by empirical findings from the Burr dataset. The Author(s) under exclusive licence to The Society for Reliability Engineering, Quality and Operations Management (SREQOM), India and The Division of Operation and Maintenance, Lulea University of Technology, Sweden 2024. -
ON BLOCK-RELATED DERIVED GRAPHS
This paper introduces and analyses the block-degree of a vertex and the cut-degree of a block. The block-degree of a vertex v is the number of blocks containing v. The cut-degree of a block b is the number of cut vertices of G contained in b. The block-degree sequence of cut vertices of the graph and the cut-degree sequence of the graph are defined. A few characterizations of the block-degree and cut-degree sequence of the graph are established. Given a graph, its block graph (B(G)) is a graph where each vertex represents a block, and two vertices are connected if their blocks intersect. The number of cut vertices of B(G) is determined. Further, an investigation is carried out on the traversability of B(G). A block cutpoint graph (BC(G)) of a graph represents a graph where each vertex corresponds to either a block or a cut vertex, and two vertices are connected if one represents a block and the other represents a cut vertex contained within that block. The properties of BC(G) and its iterations are studied. The graph G for which BC(G) is a perfect m-ary tree is characterized. 2024, Canadian University of Dubai. All rights reserved. -
On building up a closer psychic distance as a fundamental ground of relationship between India and Korea: Focusing on Jeonlanam-Do in Korea
The Uppsala model (Johanson and Wiedersheim-Paul, 1975) identifies cultural differences, market attractiveness, and core competence of nations or firms as the key factors affecting international market selection. Among these three factors, psychic distance caused by cultural differences is regarded as the most important factor. However, the psychic distance between India and Korea is not very close. The main objective of this paper is to examine the ways to boost economic relationships between India and Korea by building up a closer relationship of psychic distance. We suggest Jeonlanam-Do including Gwangju Metropolitan City (JDGC) in Korea as a stepping stone to make both countries' psychic distance closer as JD has several common grounds of intangible assets with India which includes its adherence to democracy, human rights and peace; the diverse food culture; and the religious zeal to Buddhism. We propose these common interests as a way to enhance the awareness of national brand 'India' in Korea which will attribute to a strategically developed economic relationship between Korea and India. 2022 Inderscience Enterprises Ltd.. All rights reserved. -
On C-Perfection of Modular Product of Graphs
A graph G is said to be C-perfect if, for all induced subgraphs H of G, the induced cycle independence number is equal to its corresponding induce cycle covering number, where every vertex in H belongs to at least one cycle in H. This article deals with the study on C-perfection of modular product of graphs. Through this article, we study various structural properties of C-perfect modular product of graphs and also characterize them. The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025. -
On C-Perfection of Tensor Product of Graphs
A graph G is C-perfect if, for each induced subgraph H in G, the induced cycle independence number of H is equal to its induced cycle covering number. Here, the induced cycle independence number of a graph G is the cardinality of the largest vertex subset of G, whose elements do not share a common induced cycle, and induced cycle covering number is the minimum number of induced cycles in G that covers the vertex set of G. C-perfect graphs are characterized as series-parallel graphs that do not contain any induced subdivisions of K2,3, in literature. They are also isomorphic to the class of graphs that has an IC-tree. In this article, we examine the C-perfection of tensor product of graphs, also called direct product or Kronecker product. The structural properties of C-perfect tensor product of graphs are studied. Further, a characterization for C-perfect tensor product of graphs is obtained. The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024. -
On certain chromatic topological indices of some Mycielski graphs
As a coloring analogue of different Zagreb indices, in the recent literature, the notion of chromatic Zagreb indices has been introduced and studied for some basic graph classes in trees. In this paper, we study the chromatic Zagreb indices and chromatic irregularity indices of some special classes of graphs called Mycielski graphs of paths and cycles. 2020 Yarmouk University. All rights reserved. -
On Certain J-Colouring Parameters of Graphs
In this paper, a new type of colouring called J-colouring is introduced. This colouring concept is motivated by the newly introduced invariant called the rainbow neighbourhood number of a graph. The study ponders on maximal colouring opposed to minimum colouring. An upper bound for a connected graph is presented, and a number of explicit results are presented for cycles, complete graphs, wheel graphs and for a complete l-partite graph. 2019, The National Academy of Sciences, India. -
On certain topological indices of signed graphs
The first Zagreb index of a graph G is the sum of squares of the vertex degrees in a graph and the second Zagreb index of G is the sum of products of degrees of adjacent vertices in G. The imbalance of an edge in G is the numerical difference of degrees of its end vertices and the irregularity of G is the sum of imbalances of all its edges. In this paper, we extend the concepts of these topological indices for signed graphs and discuss the corresponding results on signed graphs. 2020 the author(s). -
On Circulant Completion of Graphs
A graph G with vertex set as {v0, v1, v2,.., vn-1} corresponding to the elements of Zn, the group of integers under addition modulo n, is said to be a circulant graph if the edge set of G consists of all edges of the form {vi, vj} where (i-j)(modn)?S?{1,2,,n-1}, that is, closed under inverses. The set S is known as the connection set. In this paper, we present some techniques and characterisations which enable us to obtain a circulant completion graph of a given graph and thereby evaluate the circulant completion number. The obtained results provide the basic eligibilities for a graph to have a particular circulant completion graph. 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. -
On Combinatorial Handoff Strategies for Spectrum Mobility in Ad Hoc Networks: A Comparative Review
Technological advancements have made communication on-the-go seamless. Spectrum mobility is a networking concept that involves access technologies that allow highly mobile nodes to communicate with each other. Ad-hoc networks are formed between mobile nodes where fixed infrastructure is not used. Due to the lack of such fixed access points for connectivity, the nodes involved make use of the best network available to transmit data. Due to heterogeneous networks involvement, the mobile nodes may face trouble finding the most optimal network for transmission. Existing technologies allow the nodes to select available networks, but the selection process is not optimized, leading to frequent switching. This leads to packet loss, low data rates, high delay, etc. Many researchers have proposed optimal strategies for performing handoff in wireless networks. This paper reviews combinatorial strategies that make use of multiple techniques to perform a handoff. 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. -
On degree product induced signed graphs of graphs
A signed graph is a graph with positive or negative signs assigned to edges. An induced signed graph is a signed graph constructed from a given graph according to some pre-defined protocols. An induced signed graph of a graph G is a signed graph in which each edge uv receives a sign (-1)|?(v)-?(u)|, where ?: V(G) ? ?. In this paper, we discuss degree product induced signed graphs and determine the structural properties of these signed graphs such as balancing, clustering, regularity and co-regularity. 2020 Author(s). -
On Degree Sequence of Total Graphs and the Order of the Graphs
In this dissertation we discuss about the degree sequence of total graphs of some general graphs. A total graph of G, denoted by T(G) has vertex set as the union of vertices and edges in G and vertices are adjacent in T(G) if they are adjacent or incident in G. We try to obtain the degree sequence of total graphs of particular graphs like complete graph, path, cycle, wheel and star, from the number of vertices of the given graph (without directly drawing the total graph). We also explain the decomposition of T(G) into G and K_(d_i )s where dis are degrees of each of the vertices in G, moreover discuss about the degree sequence of T(G)??T(Ge). -
On Equitable Chromatic Completion of Some Graph Classes
An edge of a properly vertex-colored graph is said to be a good edge if it has end vertices of different color. The chromatic completion graph of a graph G is a graph obtained by adding all possible good edges to G. The chromatic completion number of G is the maximum number of new good edges added to G. An equitable coloring of a graph G is a proper vertex coloring of G such that the difference of cardinalities of any two color classes is at most 1. In this paper, we discuss the chromatic completion graphs and chromatic completion number of certain graph classes, with respect to their equitable coloring. 2022 American Institute of Physics Inc.. All rights reserved. -
On equitable chromatic topological indices of some Mycielski graphs
In recent years, the notion of chromatic Zagreb indices has been introduced and studied for certain basic graph classes, as a coloring parallel of different Zagreb indices. A proper coloring C of a graph G, which assigns colors to the vertices of G such that the numbers of vertices in any two color classes differ by at most one, is called an equitable coloring of G. In this paper, we introduce the equitable chromatic Zagreb indices and equitable chromatic irregularity indices of some special classes of graphs called Mycielski graphs of paths and cycles. 2020, SINUS Association. All rights reserved. -
On Equitable Near Proper Coloring of Certain Graph Classes
The non-availability of sufficient number of colors to color a graph leads to defective coloring problems. Coloring a graph with insufficient number of colors cause the end vertices of some edges receive the same color. Such edges with same colored end vertices are called as bad edges. The minimum number of bad edges obtained from an equitable near proper coloring of a graph G is known as equitable defective number. In this paper, we discuss the equitable near proper coloring of some families of graphs and we also determine the equitable defective number for the same. 2022 American Institute of Physics Inc.. All rights reserved. -
On equitable near proper coloring of graphs
A defective vertex coloring of a graph is a coloring in which some adjacent vertices may have the same color. An edge whose adjacent vertices have the same color is called a bad edge. A defective coloring of a graph G with minimum possible number of bad edges in G is known as a near proper coloring of G. In this paper, we introduce the notion of equitable near proper coloring of graphs and determine the minimum number of bad edges obtained from an equitable near proper coloring of some graph classes. 2024 Azarbaijan Shahid Madani University. -
On Equitable Near Proper Coloring of Mycielski Graph of Graphs
When the available number of colors are less than that of the equitable chromatic number, there may be some edges whose end vertices receive the same color. These edges are called as bad edges. An equitable near-proper coloring of a graph G is a defective coloring in which the number of vertices in any two color classes differ by at most one and the resulting bad edges is minimized by restricting the number of color classes that can have adjacency among their own elements. In this paper, we investigate the equitable near-proper coloring of Mycielski graph of graphs and determine the equitable defective number of those graphs. 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. -
On equitable near-proper coloring of some derived graph classes
An equitable near-proper coloring of a graph G is a defective coloring in which the number of vertices in any two color classes differ by at most one and the bad edges obtained is minimized by restricting the number of color classes that can have adjacency among their own elements. This paper investigates the equitable near-proper coloring of some derived graph classes like Mycielski graphs, splitting graphs and shadow graphs. Jose S., Naduvath S., 2022.