bluuebunny/crossref_metadata_2025_split huggingface dataset:
Low Power Inductorless LNA using Noise Cancellation Technique for UWB Applications
Authors: Gupta Manish , Kumar Manish 
Published: August 2021

Abstract
This paper deals with the performance analysis of low power (LP) Low noise amplifier (LNA) for Ultra wide band (UWB) applications. The proposed inductorless LNA has two stages, one is complementary common gate (CCG) stage and the other one is body biased common source stage (BBCS). In CCG stage current reused techniques is used to reduce the power consumption and to provide broad band impedance matching in UWB band. Apart from this, CCG stage is also used to reduce the noise of BBCS stage using noise cancellation technique. BBCS stage is used to provide high and flat gain. Biasing voltage is optimized through body voltage. The proposed LNA was successfully simulated in 45-nm CMOS technology. All the simulations have been done for a range of frequency 3GHz to 8GHz in cadence virtuoso. The proposed LNA achieved a peak power gain (S21) of 17.1dB and −16.4dB S11, at frequency 4.1GHz. The bandwidth of proposed LNA is 3.7GHz −5.5 GHz, −9.9dBm IIP3with minimum NF is 1.1dB. The proposed LNA consumes a power of 3.6mW with supply voltage 1V.
The Split and Strong Split Interiordomination of a Graph
Authors: Caroline Selvaraj C. 
Published: August 2021

Abstract
A subset D of the vertex set V(G) of a graph G is said to be a dominating set if every vertex not in D is adjacent to at least one vertex in V-D. A dominating set D is said to be an interior dominating set if every vertex v ∈D, is an interior vertex of G. The minimum of the cardinalities of the interiordominating sets of G is called the interiordomination number γ

I
d
(G) of G.An interior dominating set D of G is a splitinteriordominating set if the induced subgraph <V-D> is disconnected An interior dominating set D of G is a strong split interior dominating set if the induced subgraph <V-D> is totally disconnected with at least two vertices. In this paper, we determine the number and γ
s
I
d and γ
s
s
i
d for some standard graphs and obtain bounds for general graphs.
Gd-Distance of Wreath Product of Graphs
Authors: Thanga Kanniga K. , Maheswari V. , Palani K. 
Published: August 2021

Abstract
Let G = (V, E) be a simple connected graph. The geodesic distance between two vertices u, v in G is the length in terms of the number of edges of the shortest path between the vertices. In this paper, we determine the Gd-distance of wreath product of two graphs. Using the formulae obtained here, we have found the exact value of the geodesic distance of some classes of graphs.
Some Properties of Soft Generalized Open and Closed Sets in Soft Topological Spaces
Authors: Vani S.V. , Bala Deepa Arasi K. , Jackson S. 
Published: August 2021

Abstract
In this present paper, we introduce and study some soft topological properties of soft ℳ-border, soft ℳ-exterior and soft ℳ-boundary of a soft set using the concept of soft ℳ-open sets and soft ℳ-closed sets and also studied the other property of the well known notion of soft ℳ-interior, ℳ-closure.
Guided MAC to Enhance Quality of Experience of Video Data Transmission over Massive MIMO
Authors: Bhardwaj Nitish , Bhardwaj Diwakar 
Published: August 2021

Abstract
Massive MIMO (M-MIMO) system contains hundreds of antennas at base station to achieve large gains in spectral-efficiency when compared with conventional MIMO technology. High speed and Quality of Experience (QoE) of video data over wireless communication has always been a challenge for the researchers due to scarcity of the bandwidth, fading and interference. Noisy channels corrupt the transmitted video and results in poor QoE of at the receiver. Therefore, to maintain the QoE of the video, it is highly desirable to identify noisy channels and avoid transmission over them. In the proposed approach, the channels are categorized into two categories:
good or bad. If SINR value is greater than threshold value a channel is good otherwise bad.
A Guided MAC layer (GMAC) protocol is designed to transmit the video data over
good
channels only and to discard the transmission over bad channels.
Exact solutions of Lifshitz black hole coupled with nonlinear electrodynamics Journal of Physics: Conference Series
Authors: Singh R P , Singh B K , Sharma L K 
Published: August 2021

Abstract
In the paper, we find an exact black hole solution in Lifshitz space time coupled with nonlinear electrodynamics and investigate their thermodynamic quantities connected with the black hole in term of horizon radius. This black hole solution interpolates with the Lifshitz black hole in the absence of magnetic monopole charge and Bardeen black hole when z = 0.
The Chess Board Independent Domatic Number Of Queen Graph
Authors: Muthu Kumar S. , Vijaya Xavier Partipan J. 
Published: August 2021

Abstract
The independent domatic queen number of a graph Q

n
is the maximum number of pairwise disjoint minimum independent queen dominating sets of P

n
and it is denoted by i
d(Q

n
) while maximum independent domatic queen number is denoted by I
d(Q

n
). We discuss about in this paper the independent (maximum independent) domatic number of queen graph Q

n
on n × n chess board.
Soft Graphs of Certain Graphs
Authors: Palani K. , Jones T. , Maheswari V. 
Published: August 2021

Abstract
Let G
∗ = (V, E) be a simple graph and A be any nonempty set of parameters. Let subset R of A×V be an arbitrary relation from A to V. A mapping from A to ᵖ(V) written as F:A → ᵖ(V) can be defined as F(x) = { y ∈ V/xRy} and a mapping from A to ᵖ(E) written as K:A → ᵖ(E) can be defined as K(x) = {uv ∈ E/{u, v} ⊆ F(x)}. The pair (F, A) is a soft set over V and the pair (K, A) is a soft set over E. Obviously (F(a), K(a)) is a subgraph of G
∗ for all a ∈ A. The 4-tuple G = ( G
∗, F, K, A) is called a soft graph of G. In this paper we discuss different soft graphs of graphs such as Complete graph, Star graph, Complete bipartite graph, Crown graph, Comb graph, Friendship graph, Bistar graph and Wheel graph.
Logarthmic Corrections to the entropy of Hairy black hole in (2 + 1) dimension gravity Journal of Physics: Conference Series
Authors: Singh B K , Singh R P 
Published: August 2021

Abstract
The entropy recives the logarthanmic corrections in the black hole due to the quantum fluctuation close to the horizon. We study these logarithmic corrections of entropy for hairy BTZ black hole. By applying the WKB approximation calculation of the states is being done which is used to determine free energy of the scalar field. It is seen that the entropy and the free energy are diverging logarithmically in both cut off parameters and these divergences can be engrossed in the renormalized equation of the gravitational constant.
Magnetic, Optical and I-V Characteristics of MoO3 thin films
Authors: Singh Rashmi , Ahmad Faizan , Kumar Surendra , Kumar Naresh , Kumar Rachana , Kumar Pramod 
Published: August 2021

Abstract
Molybdenum trioxide (MoO3) thin films with cobalt concentration were grown on quartz and n-type Si (100) by thermal evaporation deposition technique. Then the films were thermally annealed for 2 hours under normal environment. The structure is analyzed by X-Ray Diffraction (XRD) to confirm the orthorhombic α-MoO3 phase confirming the crystallinity of thin films. Furthermore, the morphological study is done by Scanning Electron Microscope (SEM) to confirm granular shaped interconnected films. Thicknesses of films are determined by Ellipsometry which vary from 40nm to 140nm with the decrease in Cobalt concentration of thin films. Modifications in optical properties due to the doping of Cobalt in MoO3 thin films are studied in terms of transmittance data and Taucs plot. All films represent direct band gap transitions. The band-gap of MoO3 comes out be 3.32eV from the Taucs plot. A slight change in the band-gaps is found for various films with different concentration. Vibrating Sample Magnetometer (VSM) results studied at the room temperature confirm the introduced magnetic property as well as the hysteresis loop for the Cobalt doped MoO3 thin films.
A Numerical Study on MHD Mixed Convection in an inclined Lid Driven Enclosure
Authors: Thangavelu Mahalakshmi 
Published: August 2021

Abstract
In this work, MHD mixed convection flow and heat transfer in an inclined lid driven enclosure with different angles (φ = 0° to 90°) for two cases has been studied numerically. Simulations are carried out over a range of parameters: Prandtl numbers (Pr = 0.7 and 7.2), Hartmann number(0≤Ha≤100), Richardson number (Ri = 0.01,1.0,100) and Reynolds number (Re = 100). The governing equations are solved by the finite volume method with a SIMPLE algorithm. It has been found that the average Nusselt number decreases with increasing Hartmann number. It is concluded that on increasing the Richardson number, the overall heat transfer is increased. Also, it is found that existence of the magnetic field suppresses the convective heat transfer and fluid flow in enclosure.
Design Thinking on δ-Dynamic Coloring of Central Vertex Join of Graphs
Authors: Nandini G. , Sandhya V. , Viswanathan A. 
Published: August 2021

Abstract
An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min {r, d(v)}, for each v ∈ V(G). The r-dynamic chromatic number of a graph G is the minimum k such that G has an r-dynamic coloring with k colors. In this paper, we obtain the δ-dynamic chromatic number of the central vertex join of two graphs.
Combinatory Least Slack and Kuhn Tucker Optimization for Multiobjective Flexible Job Shop Scheduling
Authors: Hemamalini T. , Geetha G. 
Published: August 2021

Abstract
The Multi-objective Flexible Job Shop Scheduling (MFJSS) problem, in which the order or processing sequence for a set of jobs through several machines is assigned in an optimal patterns have accepted sizeable attentiveness. Different types of scheduling rules and procedures for certain types of MFJSS have made progress from these endeavors. The scheduling problem is cumbersome to be made consistent due to different types of criteria involved. This is because in MFJSS, after the completion of a job on a machine, it may be transited between different machines and transit time may affect scheduling. However, the transit times are frequently ignored in the literature. In this paper, the transit time and the processing time are considered as the independent time into the MFJSS. In this paper, we propose Combinatory Least Slack and Kuhn Tucker Optimization (CLS-KTO) for the MFJSS problem with the objectives to minimize the mean tardiness, makespan and job completion time. The problem is addressed via assignment and scheduling model. First, by using well-designed processing and transit time and least slack variable, Combinatory Least Slack (CLS) algorithm is adapted for the CLS-KTO. Then, an Additive function is formulated by incorporating Combinatory Dispatching Rules into the adapted CLS, where some good machines are assigned for the corresponding job, therefore reducing mean tardiness. Furthermore, in the proposed sequencing part, an optimization model based on the Kuhn Tucker conditions and Lagrange Multiplier is adopted to handle the three objectives. In the experimental studies, the influence of mean tardiness on the performance of the proposed CLS-KTO is first examined. Afterwards, the effectiveness of makespan and job completion time in CLS-KTO is verified. Finally, extensive comparisons are carried out with the state-of-the-art methods for the MFJSSon benchmark OR instances. The results show that CLS-KTO performs better than other algorithms.
Study on reuse of grey water – A Review
Authors: Anuja J , Darshan B , Saraswathi G , Meyyappan N 
Published: August 2021

Abstract
Water scarcity is a huge problem and is been consistently increasing every year. Many of the water systems that keep ecosystems flourishing and feed a growing human population became stressed. Ocean, river, lake, streams are too much polluted. A lot of technologies are available on water recycling. Greywater is around 50% of household water usage but unfailing information relating to both the characteristics of greywater and the variety of recycling technologies are not available. In this review paper we have discussed the relative merits of different options available in greywater recycling and viability of onsite recycling systems.
Bioconversion of Food Waste with Cosubstrate to Electricity using Microbial Fuel Cell
Authors: Sambavi S.M. , Vishali S. , Asthika M. , Sriraaman M. , Mullai P. 
Published: August 2021

Abstract
Bioelectricity generation from canteen based food waste in microbial fuel cell (MFC) is an interesting alternative energy producing technology. In this research work, an equal proportion of confectionery wastewater and hostel food waste was homogenised and used as substrate. Agar salt bridge was used as proton exchange membrane (PEM). At the end of 212th h of the experiment, the COD concentration decreased to 2800 mg COD/L with the COD removal efficiency of 85.86 %. A maximum potential of 2250 mV and current of 22.50 mA with external resistance of 100Ω at the end of 65th hour was generated.
An Effective Analysis of Data Clustering using Distance-based K- Means Algorithm
Authors: Ramkumar P. , Kalamani P. , Valarmathi C. , Sheela Devi M. 
Published: August 2021

Abstract
Real-world data sets are regularly provides different and complementary features of information in an unsupervised way. Different types of algorithms have been proposed recently in the genre of cluster analysis. It is arduous to the user to determine well in advance which algorithm would be the most suitable for a given dataset. Techniques with respect to graphs are provides excellent results for this task. However, the existing techniques are easily vulnerable to outliers and noises with limited idea about edges comprised in the tree to divide a dataset. Thus, in some fields, the necessacity for better clustering algorithms it uses robust and dynamic methods to improve and simplify the entire process of data clustering has become an important research field. In this paper, a novel distance-based clustering algorithm called the entropic distance based K-means clustering algorithm (EDBK) is proposed to eradicate the outliers in effective way. This algorithm depends on the entropic distance between attributes of data points and some basic mathematical statistics operations. In this work, experiments are carry out using UCI datasets showed that EDBK method which outperforms the existing methods such as Artificial Bee Colony (ABC), k-means.
Review Paper on Development of Mobile Wireless Technology
Authors: Kumar Pardeep , Sumit  
Published: August 2021

Abstract
Wireless technology these days is very quickly becoming crescent. A network that was recently wired to get online was required. Just wired phones have been a thing of the past. In the past four decades, mobile networks have thrived immensely. The starting point was the 1G cellular concept where ‘G’ stances for generation linkages. This had fully developed very rapidly, generating 1G, 2G, 3G and gradually transferring into 4G from generation to generation. And now people are utilizing the 4G networks. 5G network will nearly stretch its wings to conquer this complex world of cell technology. Integrated 5G work is continuing, with complete service planned in 2020. The development of 5G technology is the perfect solution for the many problems facing us today with today’s innovations. 5G will become an intelligent technology that will limit to a single global uniform body the number of different innovations. This paper is mostly about the evolution of mobile wireless networks like 1G and 5G as well as how they vary and their benefits and drawbacks.
Securing VANET Using Blockchain Technology
Authors: Ravi Nikhil , Verma Sahil , Kavita  , Jhanjhi NZ , Talib M N 
Published: August 2021

Abstract
VANET permits communication from V2V or in this specific communication which is generated by the vehicle. Because of this to a broad range of technologies and facilities, like protection for travelers, improved traffic capacity, and infotainment, It’s has been closely researched. In this paper, we implement the algorithm for security while rewarded will be added to the client. we also analyze the VANET through the blockchain technologies and IOV with blockchain. IOV has improved traffic safety. A period now is ripening for paving the way for a new wave of autonomous cars with modern technologies and creative protection initiatives by integrating smart cars on the Internet of Vehicles (IoV).
A Comprehensive Survey on Load and Resources Management Techniques in the Homogeneous and Heterogeneous Cloud Environment
Authors: Kaur Ramanpreet , Verma Sahil , Kavita  , Jhanjhi NZ , Talib M N 
Published: August 2021

Abstract
Resource scheduling is a challenging job in multi-cloud environments. The multi-cloud technology attracted much research to work on it and look forward to solving the problems of vendors lock-in, reliability, interoperability, etc. The uncertainty in the multi-cloud environments with heterogeneous user demands made it a challenging job to dispense the resources on demand of the user. Researchers still focused on predicting efficient optimized resource allocation management from the existing resource allocation policies in multi-cloud environments. The research aims to provide a broad systematic literature analysis of resource management in the area of multi-cloud environments. The numbers of optimization techniques have been discussed among the open issues and future challenges in consideration due to flexibility and reliability in present environments. To analyses the literature work, it is necessary to cover the existing homogenous/heterogeneous user demands and cloud applications, and algorithms to manage it in multi-clouds. In this paper, we present the definition and classification of resource allocation techniques in multi-clouds and generalized taxonomy for resource management in cloud environments. In the last, we explore the open challenges and future directions of resource management in a multi-cloud environment.
Accurate Detection of Multi-layer Packet Dropping Attacks Using Distributed Mobile Agents in MANET
Authors: Boopathi Mythili , Seetha R. 
Published: August 2021

Abstract
Detecting multi-layer packet drop attacks may result in extraordinary computational overhead in Mobile Ad Hoc Networks (MANET). Most of the existing works consider only data packet drop ignoring the routing packets drops. In this paper, a technique for accurate detection of malicious multi-layer packet drop attacks using mobile agents (MPDDMA) is proposed. In this technique, mobile agents are deployed in each node to detect selective dropping of routing and data packets by the malicious nodes. The source node identities the nodes whose route request and route reply count significantly differs from others by a margin. Similarly, the source node identifies the nodes whose packet received count significantly differs from others by another margin. The source then applies Fuzzy logic decision model with these margin values and MAC layer packet drop value as input variables and returns the output as probability of maliciousness (PrM). Experimental results show that MPDDMA technique achieves better detection accuracy and reduced packet drops.
Optimization Of Adsorption Of Congo Red By Corn Cob Powder Using Support Vector Machine
Authors: Murugeswari R. , Kannan R. , Ananthakumar K. 
Published: August 2021

Abstract
Escalating environmental information is compelling waste initiators to bear in mind new alternatives like adsorption for the removal of dye in tinted waste water. Owing to outstanding expenses of commercially activated carbon (CAC), inexpensive adsorbent with high adsorption capacity have achieved growing consideration. The current study offers with exploitation of an inexpensive, waste adsorbent material of corn cob powder and enhancing the situations for removing the Congo red dye from an aqueous solution with the help of central composite design (CCD) experiment. UV-Visible Spectrophotometer is applied to establish the concentration of dye within the waste water. The surface uptake capability (SUC) of corn cob powder will increase when the initial concentration of dye, contact time and temperature becomes increased. The SUC decreases with increase in measure of adsorbent and pH level of the medium. Support Vector Machine (SVM) employing central composite design turned into used at the required mixtures of five self determining factors (dye attention, adsorbent dosage, contact time, pH and temperature). By using these subsequent circumstances, dye concentration 80 mg/L, adsorbent dosage 0.05 g/L, contact time 15 min, pH 7.0 and temperature 300C, we have achieved the maximum level of adsorption capacity as 50.0 mg/g. This research procedure will take long time to analyze and it is prolonged manner. But growing pollutants will motive severe harm to the environment. So it’s miles vital to pick out on fastest answer for this problem. In this proposed approach a Support Vector Machine based online solution is achieved for eliminating the Congo red dye from the aqueous solution. The SVM expected SUC is as compared with an experimental result. The accuracy of the proposed SVM Model has been predicted by the simulation result. The study specifies the corn cob powder becomes efficient and also an inexpensive opportunity for removing the Congo red dye.
Classification of Admission Data Using Classification Learner Toolbox
Authors: Senthamil Selvi M. , Jansi Rani S. 
Published: August 2021

Abstract
The analysis of data useful for further process and find the usefulness for the futher. In education sector, Admission is hottest topic. For the counselling of the admission in reputed institution or foreign university, the past data of the person are taken into the consideration. In this Paper, Admission data taken from the reputed Website (Dataset Weblink) and conduct the study of classification methods like Naïve bayes and its accuracy using Matlab. The performance of different classification methods from MATLAB classifier learner toolbox for admission data. Finally, the paper choosen the suitable classification method for the admission data set.
Privacy Preserving On Remote Sensing Data Using Reversible Data Hiding
Authors: Saravanan K , Suganthi K , Kalaiselvi R , Divya B , Dilip Kumar S 
Published: August 2021

Abstract
The method of steganography covers message in the cover file and forms a stego file. Imagery needs a method that will boost protection, minimise distortion in the stego file and recover data without failure. There is a need for reducing transmitting time in the age of multimedia and the Internet. The main purpose of this project is to create safe contact between the sender and the recipient through emails and other modes of communication. A reversible data hiding algorithm was proposed in the integer wavelet transformation (IWT) domain to resolve the image distortion problem. This strategy aims to incorporate data into IWT coefficients of higher frequencies. After wavelet coefficients are collected by converting the integer wavelet data into high-frequency subbands HL, LH and HH, the human eyes would have fewer recognisable objects. After data is incorporated in such IWT coefficients, reverse integral wavelet transformation can occur following application. The stegno image was further encrypted by using Elliptic Curve Cryptography (ECC). The process of encryption enhances the image security during data transmission. In our proposed work inverse wavelet transformation (IWT) and Elliptic Curve Cryptography (ECC) algorithms are effectively utilized to achieve highly secure communication.