Browse Items (16481 total)
Sort by:
-
Victimizing Cyberbullying Mental Illness Through Social Media
With the exponential increase of technologies and the growth of social media users, bullying takes different methods to reach its targets. Cyberbullying has been emerging lately in the form of bullying through voice memos, videos, and most frequently in the form of text messages. Bullies might use the rich and expansive environment that social networks offer to target their victims with their attacks. Cyberbullying has an especially negative impact on younger generations, who value social affirmation above everything. Studies have found a clear link between cyberbullying and suicidal ideation, particularly in teens. This concerning trend needs the development of efficient ways for identifying and combating cyberbullying, thereby protecting young lives. Many techniques can be used to identify the bullies linguistic patterns and create a detection model that will automatically identify instances of cyberbullying and whether it can lead to the happening of suicide or not. This project proposes a hybrid model of BiLSTM and EmoBERTa for detecting cyberbullying and checking the possibilities of it leading to the happenings of suicide. The dataset was run on different models and the proposed model yields the best average performance. By putting such detecting mechanisms in place, we can make the Internet safer. Early detection of cyberbullying enables intervention, which protects vulnerable people and may avoid disasters. The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025. -
Vicarious Trauma in Law Students: Role of Gender, Personality, and Social Support
Law student trainees are exposed to trauma-related work which puts them at higher risk of being adversely affected by it. Since they are not directly related to the event, their distress goes unnoticed. The repetitive account of traumatic instances leads to traumatization of their own which is referred to as vicarious traumatization. The purpose of this paper was to delve into the degree to which the role of gender, personality, and social support impact law students vulnerability to vicarious trauma. For the current research, exploratory design was utilized. All one hundred and twenty participants were selected using purposive sampling. Self-report measures were employed to investigate social support, personality traits, and vicarious trauma in sixty male and sixty female law students. The results revealed that female law students and those law students who are high on Neuroticism and low on Extraversion are more vulnerable to experiencing vicarious trauma. Implications for trainees and educators are discussed and suggestions are provided for future research. 2021 International Journal of Criminal Justice Sciences. All Rights Reserved. -
Vessel turnaround time reduction in ports: An automated lean approach
Vessel turnround time is a vital factor that determines the efficiency of ports and consequently the trade competitiveness of a country. The goal of this research is to identify the factors leading to vessel turnaround time and suggest methods to increase the operational effectiveness. The research involves gathering data, analysis of the procedures for documentation and cargo handling, analysing the historical turnaround time, the reasons or causes contributing to idle time, identifying the root causes and proposing a solution that could contribute to the reduction of turnaround time of vessel so as to improve the efficiency of port operations. Some identified factors that contribute to the idle time include inefficient cargo handling and loading and unloading process, delays in documentation and customs clearance procedures, unplanned maintenance or repairs of vessels, harsh weather conditions, insufficient coordination and communication between stakeholders involved. 2024 by IGI Global. -
Vertex Removal on Perfect Italian Domination and ?pI-Stability of Graphs
Perfect Italian Domination (PID) is a domination concept where all vertices are assigned one of the labels among 0, 1 and 2 such that the sum of the labels in the neighbourhood of every vertex labelled 0 should be exactly 2. We examine a few graph classes of graphs and discuss the criticality of Perfect Italian Domination. We also define ?pI stable graphs and PID critical graphs. Following our definitions of ?pI-stable and PID critical graphs, we have grouped some graph classes. We characterise a family of trees that is ?pI-stable.. MatDer. -
Vertex neighborhood restricted edge achromatic sums of graphs
The vertex induced 2-edge coloring number ?vi2?(G) of a graph G is the highest number of colors that can occur in an edge coloring of a graph G such that not more than two colors can be used to color the edges in the induced subgraph (N[v]) generated by the closed neighborhood N[v] of a vertex v in V (G). The vertex induced 2-edge coloring sum of a graph G denoted as vi2?(G), is the greatest sum among all the vertex induced 2-edge coloring of a graph G which concedes ?vi2?(G) colors. The vertex incident 2-edge coloring number of a graph G is the highest number of colors required to color the edges of a graph G such that not more than two colors can be ceded to the edges incident at the vertex v of G. The vertex incident 2-edge coloring sum of a graph G denoted as vi2?(G), is the maximum sum among all the vertex incident 2-edge coloring of graph G which receives maximum ?vin2?(G) colors. In this paper, we initiate a study on the vertex induced 2-edge coloring sum and vertex incident 2-edge coloring sum concepts and apply the same to some graph classes. Besides finding the exact values of these parameters, we also obtain some bounds and a few comparative results. 2023 World Scientific Publishing Company. -
VERTEX INDUCED k-EDGE COLORING AND VERTEX INCIDENT k-EDGE COLORING OF GRAPHS
Let k ? 2 be a natural number. Then the vertex induced k-edge coloring number ? vik(G) of a simple connected graph G = (V,E) is the highest number of colors needed to color the edges of a graph G such that the edges of the subgraph induced by the closed neighborhood N[v] of the vertex v ? V (G) receives not more than k colors. The vertex incident k-edge coloring number ? vink(G) of a simple connected graph G = (V,E) is the highest number of colors required to color the edges of a graph G such that the edges incident to a vertex v in graph G receives not more than k colors. In this paper, we initiate the study on ? vik(G) and ? vink(G). We also determine the exact values of ? vik(G) and ? vink(G) for k = 2 for some special graphs. 2023 Yarmouk University. All rights reserved. -
VERTEX INDUCED 2-EDGE COLORING AND VERTEX INCIDENT 2-EDGE COLORING OF SOME GRAPH PRODUCTS
Let G = (V, E) be a simple connected graph with vertex set V and edge set E. The vertex induced 2-edge coloring number ?vi2? (G) is the maximum number of colors used in coloring the edges of a graph G such that for each vertex v ? V, at most two edges in the induced subgraph ?N[v]?, generated by the closed neighborhood N[v], receive different colors. The vertex incident 2-edge coloring number ?vin2? (G) of graph G is the maximum number of colors required to color the edges of G such that at most two edges incident to a vertex v in G receive different colors. In this paper, the vertex induced 2-edge coloring number and vertex incident 2-edge coloring number of some graph products such as Cartesian product and strong product are discussed. The ?vi2?(G) and??vin2(G) number in the rooted product of a general connected graphs with some graph classes are also discussed in this paper. Palestine Polytechnic University-PPU 2022. -
VERTEX COLOURING OF FINITE NETWORKS WITH RESPECT TO AVERAGE DISTANCE
For a finite network, represented as a graph G = (V, E) with average distance (G), the average distance colouring of G is a function c from V to the set of non-negative integers, such that for any v ? V, |c(v) ? c(u)| ? 1 for all u ? V such that d(u, v) ? ??. In this paper, we find the average distance colouring number of some special types of networks and present a greedy algorithm to colour any graph with average distance colouring constraint. 2025, Diogenes Co. Ltd.. All rights reserved. -
Verification and validation of Parallel Support Vector Machine algorithm based on MapReduce Program model on Hadoop cluster
From the recent years the large volume of data is growing bigger and bigger. It is difficult to measure the total volume of structured and unstructured data that require machine-based systems and technologies in order to be fully analyzed. Efficient implementation techniques are the key to meeting the scalability and performance requirements entailed in such scientific data analysis. So for the same in this paper the Sequential Support Vector Machine in WEKA and various MapReduce Programs including Parallel Support Vector Machine on Hadoop cluster is analyzed and thus, in this way Algorithms are Verified and Validated on Hadoop Cluster using the Concept of MapReduce. In this paper, the performance of above applications has been shown with respect to execution time/training time and number of nodes. Experimental Results shows that as the number of nodes increases the execution time decreases. This experiment is basically a research study of above MapReduce applications. 2013 IEEE. -
Verification and validation of MapReduce program model for parallel K-means algorithm on Hadoop cluster
With the development of information technology, a large volume of data is growing and getting stored electronically. Thus, the data volumes processing by many applications will routinely cross the petabyte threshold range, in that case it would increase the computational requirements. Efficient processing algorithms and implementation techniques are the key in meeting the scalability and performance requirements in such scientific data analyses. So for the same here, we have p analyzed the various MapReduce Programs and a parallel clustering algorithm (PKMeans) on Hadoop cluster, using the Concept of MapReduce. Here, in this experiment we have verified and validated various MapReduce applications like wordcount, grep, terasort and parallel K-Means Clustering Algorithm. We have found that as the number of nodes increases the execution time decreases, but also some of the interesting cases has been found during the experiment and recorded the various performance change and drawn different performance graphs. This experiment is basically a research study of above MapReduce applications and also to verify and validate the MapReduce Program model for Parallel K-Means algorithm on Hadoop Cluster having four nodes. 2013 IEEE. -
Vehicular Propagation Velocity Forecasting Using Open CV
This work presents a predictive learning driven methodology for recognizing the vehicular velocity. The developed model uses machine vision models to trace and detect vehicular movement in timely manner. It further deploys a machine tested framework for estimation of its velocity on basis of the accumulated information. The technique depends upon a CNN model that is validated with a standardized instances of vehicular scans and corresponding velocity parameters. The proposed model generates good efficiency and robustness in determining velocities across test conditions which encompass various kinds of vehicles and lighting scenarios. An optimal vehicular frequency is noted with heavy-weight vehicles in place in comparison to other vehicles. A mean latency period of 1.25 seconds and an error rate of 0.05 is observed with less road traffic in place. The suggested approach can be of great help in transportation systems, traffic monitoring and enhancing road safety. 2023 IEEE. -
VAST-GCN: An Attention-Driven Graph Convolutional Network (GCN) for Robust Cluster Head Selection in Vehicular Ad-Hoc Networks
Vehicular Ad-Hoc Networks (VANETs) need smart and flexible communication protocols to deal with fast-moving vehicles and ever-changing network structures. Picking the right cluster head (CH) plays a key role to keep connections stable and reduce routing overhead. This paper presents VAST-GCN (Vehicular Attention-based Spatial-Temporal Graph Convolutional Network), a new model that uses attention to make vehicle grouping and CH selection better across different network sizes. VAST-GCN mixes Graph Convolutional Networks (GCNs) with Spatial, Temporal, and Channel Attention systems. Approach in vehicle settings with 100, 500, and 1000 vehicles has been tested using real-time info like speed and place. The design has transformer blocks to model time-based features and attention modules to improve space and feature relationships leading to better vehicle data. Data have been grouped using the K-Means method and checked with modularity score, silhouette score, and group density. At the time of comparison, it has been observed that VAST-GCN does better than regular GCN and MIXHOP GCN models in cutting down loss making better community structures, and keeping CHs stable when there are few vehicles or theyre moving fast. The proposed VAST-GCN framework exhibits clear advantages over existing spatio-temporal GNNs by delivering superior modularity, silhouette scores, and cluster head stability across diverse vehicular scenarios. Its attention-driven architecture not only improves clustering accuracy but also reduces packet delay and enhances throughput, highlighting its excellence as a robust and scalable solution for dynamic VANET environments. The Author(s) 2025. -
Variations in the l-dopa content, phytochemical constituents and antioxidant activity of different germlines of mucuna pruriens (l.) dc.
In this study a 'wonder plant' Mucuna pruriens (L.) DC., which is commercially important medicinal plant of the Fabaceae family known for its treatment in Central Nervous System disorders like Dementia, Parkinson's, Alzheimer's, etc. have been selected. Different germplasms have been collected to analyze the phytochemical variations between them and quantify the L-DOPA in root, stem, leaves and seeds of all the five germlines using HPLC. Along with the biochemical assays, antioxidant activity by DPPH, phosphomolybdneum method, the metal chelating and reductive potential activity of all the germplasms were studied. All parts of the plant have shown the presence of L-DOPA but, seeds have the highest quantity followed by the roots, stem and leaves. Arka Shubra seeds showed high L-DOPA content (51.9 mg/g) while the other germplasms showed L-DOPA ranging from 43-45 mg/g. Highest content of carbohydrates (258.8 mg/g) and phenolics (157.0 mg/g) was seen in the seeds of Arka Aswini. While the seeds and leaves of Arka Charaka showed high protein (332.2 mg/g) and flavonoid (10.2 mg/g) content, respectively. High proline (1.74 mg/g) was observed in the seeds of Arka Shubra. Antioxidant studies revealed that Arka Charaka and Arka Daksha to be having high reductive power and free radical scavenging activity by phosphomolybdate method while high metal chelating activity was observed in Arka Aswini (88.7%) and high antioxidant activity by DPPH method was seen in Arka Shubra (86.5%). 2021 Chemical Publishing Co.. All rights reserved. -
Variations in andrographolide content, phytochemical constituents and antioxidant activity of leaves of andrographis paniculata (L.) nees collected from different locations of Southern India
In present study, the samples collected from different locations of Southern India viz., Yellapur Beltargadde, Siddapur, Joida, Ankola, Sirsi Kangod, Yellapur Shalabail, Sirsi Bairumbe, Karwar of Karnataka and Kasaragod from Kerala were analyzed for the andrographolide content, total phenolic and flavonoid content and screened for their antioxidant potential. The A. paniculata leaves were extracted with three different solvents (chloroform, methanol and water) and methanolic extract of Siddapur showed highest (8.82 0.25 mg/g DW) amount of phenolic content whereas, aqueous extract of Ankola (3.00 1.18 mg/g DW) showed the least amount. Chloroform extract of Yellapur Beltargadde village showed highest quantity i.e. 1.87 0.50 mg/g DW of flavonoid content and aqueous extract of Yellapur Beltargadde showed 0.30 0.20 mg/g DW which was least among all the tested samples. The sample collected from Karwar was found to have highest andrographolide content (9.36 0.02 mg/g DW) followed by Yellapur Beltargadde sample with 7.29 0.01 mg/g DW and Sirsi Kasaragod has the lowest contents of 1.54 0.1 mg/g DW when analyzed through HPLC. Among the nine locations, methanol extract from Joida showed highest percentage of scavenging activity (91.95%) followed by methanol extract of Ankola (90.42%) and chloroform extract of Siddapur (77.31%) which was the lowest value of all samples tested. 2021 Chemical Publishing Co.. All rights reserved. -
Variable viscosity effects on third-grade liquid flow in post-treatment analysis of wire coating in the presence of nanoparticles /
International Journal of Numerical Methods For Heat & Fluid Flow, Vol.28, Issue 10, pp.2425-2441, ISSN No: 0961-5539. -
Variable viscosity effects on third-grade liquid flow in post-treatment analysis of wire coating in the presence of nanoparticles
Purpose: The features of coated wire product are measured by the flow and heat transport occurring in the interior of dies. Therefore, an understanding of characteristics of polymers momentum, heat mass transfer and wall shear stress is of great interest. Enhancement of heat transfer rate is fundamental need of wire coating process. Therefore, this study aims to investigate the effect of suspended nanoparticles in heat and mass transport phenomena of third-grade liquid in post-treatment of wire coating process. Buongiorno model for nanofluid is adopted. Two cases of temperature dependent viscosity are considered. Design/methodology/approach: The governing equations are modelled with the help of steady-state conservation equations of mass, momentum, energy and nanoparticle concentration. Some appropriate dimensionless variables are introduced. Numerical solutions for the nonlinear problem are developed through RungeKuttaFehlberg technique. The outcome of sundry variables for dimensionless flow, thermal and nanoparticle volume fraction fields are scrutinised through graphical illustrations. Findings: The studys numerical results disclose that the force on the total wire surface and shear stress at the surface in case of Reynolds Model dominate Vogels Model case. Impact of nanoparticles is constructive for force on the total wire surface and shear stress at the surface. The velocity of the coating material can be enhanced by the non-Newtonian property. Practical implications: This study may provide useful information to improve the wire coating technology. Originality/value: Effect of nanoparticles in wire coating analysis by using Brownian motion and thermophoresis slip mechanisms is investigated for the first time. Two different models for variable viscosity are used. 2018, Emerald Publishing Limited. -
Variable parametric test to improve the machinability of Inconel-718 using Tungsten Carbide tool
The Inconel-718 is a nickel based super alloy containing an old age hardening alloy of nickel-chromium as addition which provides increased strength without its decrease in ductility. It is known as a difficult to cut material due to certain properties like high thermal resistance, high creep, corrosion resistance having the capability of retaining toughness and strength at high temperatures. Inconel-718 has a large number of applications in the world of manufacturing such as aircraft gas turbines, steam turbine power plants, reheaters and reciprocating engines. Due to such superior quality functions, its machining becomes more challenging for which Tungsten Carbide is one of the tools to improve the machinability to 2.64%. In this paper, parametric tests has been carried out in CNC machining to determine the tool performance and improve the machining conditions. 2021 Elsevier Ltd. All rights reserved. -
Variable initial energy and unequal clustering (VEUC) based multicasting in WSN
Multicast Communication plays an important role in most of the resource constrained networking environments such as Wireless Sensor Networks (WSN), Internet of Things (IOT). Communication in WSN is restricted by energy, computation and memory capabilities of sensor nodes. Designing an efficient routing algorithm to achieve communication between Stationary Base station (BS) and a cluster of sensor nodes in a specific region requires the base station to send individual messages to all sensor nodes. This approach consumes a large amount of energy and bandwidth. A variety of algorithms exist to address this issue by dividing the sensor nodes into clusters. Each cluster is monitored by a Cluster Head (CH), responsible for gathering and aggregating data to send the same to the BS. In this paper, we reviewed existing clustering techniques and propose an unequal clustering based scheme. This allows the BS to communicate a multicast message to cluster members as well as a cluster head to communicate with other cluster members. The results show that our approach improves network lifetime. 2017 IEEE. -
Vappav /
Patent Number: 202241028305, Applicant: Sashi Kumar D.
The primary objective and the motto behind this invention of the device Vappav is for the safety of food items and food parcels which needs to have a minimum contact from people and to make sure that the delivery of these parcels are safe without many people touching it, which further ensures the safety and hygienic of the food items. -
Vappav /
Patent Number: 202241028305, Applicant: Sashi Kumar D.
The primary objective and the motto behind this invention of the device Vappav is for the safety of food items and food parcels which needs to have a minimum contact from people and to make sure that the delivery of these parcels are safe without many people touching it, which further ensures the safety and hygienic of the food items.