This document discusses parallel communicating flip pushdown automata systems, which are systems of multiple flip pushdown automata that can communicate by sending stack contents to each other. The key points are:
- Parallel communicating flip pushdown automata systems of degree 2 or more are shown to be able to recognize all recursively enumerable languages.
- Two variants of transition relations are defined for these systems - one where stack contents are preserved after communication ("non-returning") and one where stacks return to their initial state ("returning").
- It is proven that the families of languages recognized by returning and non-returning systems of all types (centralized, parallel, etc.) are equal to the family of recursively enumerable languages
The document describes Turing machines and formal languages. It defines a Turing machine as a mathematical model of computation that consists of an infinite tape divided into cells, a head that reads and writes symbols, internal states, and a transition function. It then discusses Turing machine components like states, tape alphabet, transition function, initial/final states. It also covers time/space complexity, deterministic/non-deterministic TMs, linear bounded automata, recursively enumerable vs recursive languages, Turing machines as enumerators, and universal Turing machines.
This document summarizes key concepts about minimum spanning trees from a lecture by Dr. Muhammad Hanif Durad. It discusses motivation for finding minimum spanning trees, properties of MSTs, and algorithms like Kruskal's algorithm and Prim's algorithm for finding an MST in polynomial time. Kruskal's algorithm finds the MST by greedily adding the minimum weight edge that connects two components in a forest. Prim's algorithm finds the MST by growing a tree by greedily adding the minimum weight edge connecting the growing tree to a vertex not yet included.
This document provides an overview of the key topics covered in Lecture 9 of an Artificial Intelligence course on fuzzy logic. The lecture introduces fuzzy sets and membership functions as a way to represent ambiguous or uncertain values. It covers fuzzy set operations, fuzzy numbers, fuzzy rules for reasoning, and fuzzy inference. An example is provided to illustrate how fuzzy logic can be applied to control the speed of a vehicle based on road curvature. The homework assignments involve problems working with the concepts introduced in the lecture.
Simulating Turing Machines Using Colored Petri Nets with Priority Transitionsidescitation
In this paper, we present a new way to simulate
Turing machines using a specific form of Petri nets such that
the resulting nets are capable of thoroughly describing
behavior of the input Turing machines. We model every
element of a Turing machine’s tuple (i.e., Q, Γ, b, Σ, δ, q0, F) with
an equivalent translation in Colored Petri net’s set of elements
with priority transitions such that the resulting translation
(is a Petri net that) accepts the same language as the original
Turing machine. In the second part of the paper we analyze
time complexity of Turing machine’s input in the resulting
Petri net and show that it is a polynomial coefficient of time
complexity in the Turing machine.
Computational Complexity: Oracles and the Polynomial HierarchyAntonis Antonopoulos
This document outlines a graduate course on computational complexity and discusses oracles and the polynomial hierarchy. It defines oracle Turing machines and how they are used to define oracle complexity classes. It proves some foundational results about oracles, including that there exists oracles A and B such that PA = NPA and PB ≠ NPB. It also discusses random oracles and proves that the probability a random oracle B satisfies PB ≠ NPB is 1. The document provides context and definitions to introduce students to the concepts of oracles and the polynomial hierarchy in computational complexity theory.
The document introduces algorithms and complexity results for problems on strings that are compressed using Straight Line Programs (SLPs). SLPs provide a mathematical model for compressed string representations that can capture many real-world compression schemes. The document discusses the smallest grammar problem, algorithms for problems like compressed pattern matching and equality checking, and complexity results. It shows that computing the Hamming distance between SLP-compressed strings is #P-complete, and the subsequence problem is PSPACE-complete and PP-hard. The algorithms exploit properties of SLPs like arithmetic progressions to achieve subquadratic time bounds.
The document describes Turing machines and formal languages. It defines a Turing machine as a mathematical model of computation that consists of an infinite tape divided into cells, a head that reads and writes symbols, internal states, and a transition function. It then discusses Turing machine components like states, tape alphabet, transition function, initial/final states. It also covers time/space complexity, deterministic/non-deterministic TMs, linear bounded automata, recursively enumerable vs recursive languages, Turing machines as enumerators, and universal Turing machines.
This document summarizes key concepts about minimum spanning trees from a lecture by Dr. Muhammad Hanif Durad. It discusses motivation for finding minimum spanning trees, properties of MSTs, and algorithms like Kruskal's algorithm and Prim's algorithm for finding an MST in polynomial time. Kruskal's algorithm finds the MST by greedily adding the minimum weight edge that connects two components in a forest. Prim's algorithm finds the MST by growing a tree by greedily adding the minimum weight edge connecting the growing tree to a vertex not yet included.
This document provides an overview of the key topics covered in Lecture 9 of an Artificial Intelligence course on fuzzy logic. The lecture introduces fuzzy sets and membership functions as a way to represent ambiguous or uncertain values. It covers fuzzy set operations, fuzzy numbers, fuzzy rules for reasoning, and fuzzy inference. An example is provided to illustrate how fuzzy logic can be applied to control the speed of a vehicle based on road curvature. The homework assignments involve problems working with the concepts introduced in the lecture.
Simulating Turing Machines Using Colored Petri Nets with Priority Transitionsidescitation
In this paper, we present a new way to simulate
Turing machines using a specific form of Petri nets such that
the resulting nets are capable of thoroughly describing
behavior of the input Turing machines. We model every
element of a Turing machine’s tuple (i.e., Q, Γ, b, Σ, δ, q0, F) with
an equivalent translation in Colored Petri net’s set of elements
with priority transitions such that the resulting translation
(is a Petri net that) accepts the same language as the original
Turing machine. In the second part of the paper we analyze
time complexity of Turing machine’s input in the resulting
Petri net and show that it is a polynomial coefficient of time
complexity in the Turing machine.
Computational Complexity: Oracles and the Polynomial HierarchyAntonis Antonopoulos
This document outlines a graduate course on computational complexity and discusses oracles and the polynomial hierarchy. It defines oracle Turing machines and how they are used to define oracle complexity classes. It proves some foundational results about oracles, including that there exists oracles A and B such that PA = NPA and PB ≠ NPB. It also discusses random oracles and proves that the probability a random oracle B satisfies PB ≠ NPB is 1. The document provides context and definitions to introduce students to the concepts of oracles and the polynomial hierarchy in computational complexity theory.
The document introduces algorithms and complexity results for problems on strings that are compressed using Straight Line Programs (SLPs). SLPs provide a mathematical model for compressed string representations that can capture many real-world compression schemes. The document discusses the smallest grammar problem, algorithms for problems like compressed pattern matching and equality checking, and complexity results. It shows that computing the Hamming distance between SLP-compressed strings is #P-complete, and the subsequence problem is PSPACE-complete and PP-hard. The algorithms exploit properties of SLPs like arithmetic progressions to achieve subquadratic time bounds.
This document describes a graduate course on computational complexity taught by Antonis Antonopoulos. It includes the course syllabus, which covers topics like Turing machines, complexity classes, randomized computation, interactive proofs, and derandomization of complexity classes. It also provides recommended textbooks and lecture notes. The document lists some of the major complexity classes like P, NP, BPP, and includes definitions of time-constructible and space-constructible functions, which are used to formally define complexity classes. It also discusses the relationships between different complexity classes and proves theorems like the time hierarchy theorem.
Stability of adaptive random-walk Metropolis algorithmsBigMC
The document discusses adaptive MCMC algorithms and their stability. It introduces the stochastic approximation framework that is commonly used to construct adaptive MCMC algorithms. It then discusses issues with stability as the adaptive parameters are updated, and how enforced stability or adaptive reprojections can help address this. Finally, it provides examples of the adaptive Metropolis algorithm and adaptive scaling Metropolis algorithm, which aim to automatically tune the proposal distribution scale parameter.
Quantum Algorithms and Lower Bounds in Continuous TimeDavid Yonge-Mallo
A poster presented at the Quantum Computing & Quantum Algorithms Program Review, in Buckhead, Atlanta, Georgia, 2008.
Abstract: "Many models of quantum computation, such as the Turing machine model or the circuit model, treat time as a discrete quantity and describe algorithms as discrete sequences of steps. However, this is not the only way to view quantum computational processes, as algorithms based on such ideas as continuous-time quantum walks show. By studying the properties of quantum computation in a continuous-time framework, we hope to discover new algorithms, develop better intuitions into existing algorithms, and gain further insights into the power and limitations of quantum computation."
NP completeness. Classes P and NP are two frequently studied classes of problems in computer science. Class P is the set of all problems that can be solved by a deterministic Turing machine in polynomial time.
DLT stands for Direct Linear Transformation. It is an algorithm that estimates the camera matrix P by minimizing the algebraic error between measured image points xi and projected 3D points PXi. Specifically, DLT finds P by solving the equation Ap=0, where A is constructed from point correspondences and p contains the entries of P. This minimizes the sum of squared algebraic distances between the points. For affine cameras, the algebraic and geometric distances are equivalent. DLT provides an initial estimate of P that can be refined using nonlinear optimization techniques.
P, NP, NP-Complete, and NP-Hard
Reductionism in Algorithms
NP-Completeness and Cooks Theorem
NP-Complete and NP-Hard Problems
Travelling Salesman Problem (TSP)
Travelling Salesman Problem (TSP) - Approximation Algorithms
PRIMES is in P - (A hope for NP problems in P)
Millennium Problems
Conclusions
This document provides an outline and overview of a lecture on elementary graph algorithms. It begins with contact information for the lecturer, Dr. Muhammad Hanif Durad. It then outlines topics to be covered, including definition and representation of graphs, breadth-first search, depth-first search, topological sort, and strongly connected components. The document discusses the importance of graphs and examples of problems that can be modeled with graphs. It provides definitions and descriptions of basic graph terminology like vertices, edges, types of graphs. It also covers representations of graphs using adjacency lists and adjacency matrices. The document dives deeper into breadth-first search and depth-first search algorithms, providing pseudocode and examples. It discusses applications and analysis of the algorithms.
This document chapter discusses manipulator kinematics. It covers forward kinematics, which is determining the end effector position from joint angles. Inverse kinematics is determining the joint angles required for a desired end effector position. The manipulator Jacobian relates joint velocities to end effector velocities. Redundant manipulators have more degrees of freedom than required to perform a task. The chapter provides the procedure for determining the forward kinematics, including using the product of exponentials formula. An example of calculating forward kinematics for a SCARA manipulator is also presented.
This document outlines the all-pairs shortest path problem and the Floyd-Warshall algorithm. It begins with an introduction to the problem and notes that naively running single-source shortest path algorithms would have a complexity of O(V4) or O(V3logV). It then provides an outline of the lecture which will cover all-pairs shortest paths, extending shortest paths, the Floyd-Warshall algorithm, analyzing shortest paths, and Johnson's algorithm for sparse graphs. The document provides examples and definitions to explain the representation of graphs, shortest path lengths, and predecessor matrices used in the algorithm. It also describes the recursive structure of shortest paths and how the Floyd-Warshall algorithm works by iteratively extending paths by one
Performance analysis of bangla speech recognizer model using hmmAbdullah al Mamun
This document outlines a study on performance analysis of a Bangla speech recognizer model using Hidden Markov Models (HMMs). It includes sections on what speech recognition is, the structure of automatic speech recognition systems, creating a speech database with 1200 keywords, feature extraction using MFCCs, an explanation of HMMs including the forward, backward, and Viterbi algorithms, training and recognition, results, and conclusions. The document provides details on building components of an ASR system for Bangla speech and evaluating the performance of the HMM model.
The document discusses the theory of NP-completeness. It begins by defining the complexity classes P, NP, NP-hard, and NP-complete. It then explains the concepts of reduction and how none of the NP-complete problems can be solved in polynomial time deterministically. The document provides examples of NP-complete problems like satisfiability (SAT), vertex cover, and the traveling salesman problem. It shows how nondeterministic algorithms can solve these problems and how they can be transformed into SAT instances. Finally, it proves that SAT is the first NP-complete problem by showing it is in NP and NP-hard.
This document provides an overview of the Bellman-Ford algorithm for finding single-source shortest paths in a weighted graph. It begins with an outline of the lecture topics, then provides context on weighted graphs and shortest path problems. The key properties of shortest paths and edge relaxation are described. The Bellman-Ford algorithm is presented as performing relaxation of all edges |V|-1 times to find shortest paths of length up to |V|-1, to account for all possible path lengths without cycles. Examples are provided and it is shown that the algorithm runs in O(VE) time and O(V+E) space. Correctness of the algorithm is discussed based on earlier theorems regarding shortest path properties.
The document contains 8 questions pertaining to signals and systems. It covers topics like Fourier series, Fourier transforms, Laplace transforms, Z-transforms, continuous and discrete time linear time-invariant systems, sampling, and more. Students are required to answer any 5 out of the 8 questions, with all questions carrying equal marks. The questions involve theoretical concepts as well as mathematical problems to test the understanding of fundamental signals and systems concepts.
Inversion Theorem for Generalized Fractional Hilbert Transforminventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Introduction to Fourier transform and signal analysis宗翰 謝
The document discusses Fourier analysis techniques. It introduces continuous and discrete Fourier transforms, and covers properties like orthogonality, completeness of basis functions (e.g. cosines and sines), and Fourier series representations of periodic functions like step functions. It also defines the Fourier transform and its properties like linearity, translation, modulation, scaling, and conjugation. Concepts like Dirac delta functions and convolution theory are explained in relation to Fourier analysis.
A brief introduction to Hartree-Fock and TDDFTJiahao Chen
The document provides an overview of time-dependent density functional theory (TDDFT) for computing molecular excited states. It begins with an introduction to the Born-Oppenheimer approximation and variational principle. It then discusses the Hartree-Fock and Kohn-Sham equations as self-consistent field methods for calculating ground states, and linear response theory for calculating excited states within TDDFT. The contents section outlines the topics to be covered, including basis functions, Hartree-Fock theory, density functional theory, and time-dependent DFT.
Face recognition across pose with estimation of pose parametersIAEME Publication
This document summarizes research on face recognition across pose using the eigenface and fisherface approaches. It compares the two methods on databases with different amounts of training data and levels of pose variation. Fisherface is shown to outperform eigenface when training data is sparse across pose. The work also presents a method to estimate face pose parameters using a patch-based representation, achieving promising results on uncontrolled images.
This document discusses facial expression analysis using 3D animation. It begins by introducing facial expression and the challenges of 2D analysis. It then discusses developing a system to generate facial animation from novel text or speech input using motion capture data. Tools for studying facial expression like the Facial Action Coding System and a 3D expression database are also introduced. The document concludes that expressions can be represented numerically and measured to understand correlations with basic expressions.
This document describes a graduate course on computational complexity taught by Antonis Antonopoulos. It includes the course syllabus, which covers topics like Turing machines, complexity classes, randomized computation, interactive proofs, and derandomization of complexity classes. It also provides recommended textbooks and lecture notes. The document lists some of the major complexity classes like P, NP, BPP, and includes definitions of time-constructible and space-constructible functions, which are used to formally define complexity classes. It also discusses the relationships between different complexity classes and proves theorems like the time hierarchy theorem.
Stability of adaptive random-walk Metropolis algorithmsBigMC
The document discusses adaptive MCMC algorithms and their stability. It introduces the stochastic approximation framework that is commonly used to construct adaptive MCMC algorithms. It then discusses issues with stability as the adaptive parameters are updated, and how enforced stability or adaptive reprojections can help address this. Finally, it provides examples of the adaptive Metropolis algorithm and adaptive scaling Metropolis algorithm, which aim to automatically tune the proposal distribution scale parameter.
Quantum Algorithms and Lower Bounds in Continuous TimeDavid Yonge-Mallo
A poster presented at the Quantum Computing & Quantum Algorithms Program Review, in Buckhead, Atlanta, Georgia, 2008.
Abstract: "Many models of quantum computation, such as the Turing machine model or the circuit model, treat time as a discrete quantity and describe algorithms as discrete sequences of steps. However, this is not the only way to view quantum computational processes, as algorithms based on such ideas as continuous-time quantum walks show. By studying the properties of quantum computation in a continuous-time framework, we hope to discover new algorithms, develop better intuitions into existing algorithms, and gain further insights into the power and limitations of quantum computation."
NP completeness. Classes P and NP are two frequently studied classes of problems in computer science. Class P is the set of all problems that can be solved by a deterministic Turing machine in polynomial time.
DLT stands for Direct Linear Transformation. It is an algorithm that estimates the camera matrix P by minimizing the algebraic error between measured image points xi and projected 3D points PXi. Specifically, DLT finds P by solving the equation Ap=0, where A is constructed from point correspondences and p contains the entries of P. This minimizes the sum of squared algebraic distances between the points. For affine cameras, the algebraic and geometric distances are equivalent. DLT provides an initial estimate of P that can be refined using nonlinear optimization techniques.
P, NP, NP-Complete, and NP-Hard
Reductionism in Algorithms
NP-Completeness and Cooks Theorem
NP-Complete and NP-Hard Problems
Travelling Salesman Problem (TSP)
Travelling Salesman Problem (TSP) - Approximation Algorithms
PRIMES is in P - (A hope for NP problems in P)
Millennium Problems
Conclusions
This document provides an outline and overview of a lecture on elementary graph algorithms. It begins with contact information for the lecturer, Dr. Muhammad Hanif Durad. It then outlines topics to be covered, including definition and representation of graphs, breadth-first search, depth-first search, topological sort, and strongly connected components. The document discusses the importance of graphs and examples of problems that can be modeled with graphs. It provides definitions and descriptions of basic graph terminology like vertices, edges, types of graphs. It also covers representations of graphs using adjacency lists and adjacency matrices. The document dives deeper into breadth-first search and depth-first search algorithms, providing pseudocode and examples. It discusses applications and analysis of the algorithms.
This document chapter discusses manipulator kinematics. It covers forward kinematics, which is determining the end effector position from joint angles. Inverse kinematics is determining the joint angles required for a desired end effector position. The manipulator Jacobian relates joint velocities to end effector velocities. Redundant manipulators have more degrees of freedom than required to perform a task. The chapter provides the procedure for determining the forward kinematics, including using the product of exponentials formula. An example of calculating forward kinematics for a SCARA manipulator is also presented.
This document outlines the all-pairs shortest path problem and the Floyd-Warshall algorithm. It begins with an introduction to the problem and notes that naively running single-source shortest path algorithms would have a complexity of O(V4) or O(V3logV). It then provides an outline of the lecture which will cover all-pairs shortest paths, extending shortest paths, the Floyd-Warshall algorithm, analyzing shortest paths, and Johnson's algorithm for sparse graphs. The document provides examples and definitions to explain the representation of graphs, shortest path lengths, and predecessor matrices used in the algorithm. It also describes the recursive structure of shortest paths and how the Floyd-Warshall algorithm works by iteratively extending paths by one
Performance analysis of bangla speech recognizer model using hmmAbdullah al Mamun
This document outlines a study on performance analysis of a Bangla speech recognizer model using Hidden Markov Models (HMMs). It includes sections on what speech recognition is, the structure of automatic speech recognition systems, creating a speech database with 1200 keywords, feature extraction using MFCCs, an explanation of HMMs including the forward, backward, and Viterbi algorithms, training and recognition, results, and conclusions. The document provides details on building components of an ASR system for Bangla speech and evaluating the performance of the HMM model.
The document discusses the theory of NP-completeness. It begins by defining the complexity classes P, NP, NP-hard, and NP-complete. It then explains the concepts of reduction and how none of the NP-complete problems can be solved in polynomial time deterministically. The document provides examples of NP-complete problems like satisfiability (SAT), vertex cover, and the traveling salesman problem. It shows how nondeterministic algorithms can solve these problems and how they can be transformed into SAT instances. Finally, it proves that SAT is the first NP-complete problem by showing it is in NP and NP-hard.
This document provides an overview of the Bellman-Ford algorithm for finding single-source shortest paths in a weighted graph. It begins with an outline of the lecture topics, then provides context on weighted graphs and shortest path problems. The key properties of shortest paths and edge relaxation are described. The Bellman-Ford algorithm is presented as performing relaxation of all edges |V|-1 times to find shortest paths of length up to |V|-1, to account for all possible path lengths without cycles. Examples are provided and it is shown that the algorithm runs in O(VE) time and O(V+E) space. Correctness of the algorithm is discussed based on earlier theorems regarding shortest path properties.
The document contains 8 questions pertaining to signals and systems. It covers topics like Fourier series, Fourier transforms, Laplace transforms, Z-transforms, continuous and discrete time linear time-invariant systems, sampling, and more. Students are required to answer any 5 out of the 8 questions, with all questions carrying equal marks. The questions involve theoretical concepts as well as mathematical problems to test the understanding of fundamental signals and systems concepts.
Inversion Theorem for Generalized Fractional Hilbert Transforminventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Introduction to Fourier transform and signal analysis宗翰 謝
The document discusses Fourier analysis techniques. It introduces continuous and discrete Fourier transforms, and covers properties like orthogonality, completeness of basis functions (e.g. cosines and sines), and Fourier series representations of periodic functions like step functions. It also defines the Fourier transform and its properties like linearity, translation, modulation, scaling, and conjugation. Concepts like Dirac delta functions and convolution theory are explained in relation to Fourier analysis.
A brief introduction to Hartree-Fock and TDDFTJiahao Chen
The document provides an overview of time-dependent density functional theory (TDDFT) for computing molecular excited states. It begins with an introduction to the Born-Oppenheimer approximation and variational principle. It then discusses the Hartree-Fock and Kohn-Sham equations as self-consistent field methods for calculating ground states, and linear response theory for calculating excited states within TDDFT. The contents section outlines the topics to be covered, including basis functions, Hartree-Fock theory, density functional theory, and time-dependent DFT.
Face recognition across pose with estimation of pose parametersIAEME Publication
This document summarizes research on face recognition across pose using the eigenface and fisherface approaches. It compares the two methods on databases with different amounts of training data and levels of pose variation. Fisherface is shown to outperform eigenface when training data is sparse across pose. The work also presents a method to estimate face pose parameters using a patch-based representation, achieving promising results on uncontrolled images.
This document discusses facial expression analysis using 3D animation. It begins by introducing facial expression and the challenges of 2D analysis. It then discusses developing a system to generate facial animation from novel text or speech input using motion capture data. Tools for studying facial expression like the Facial Action Coding System and a 3D expression database are also introduced. The document concludes that expressions can be represented numerically and measured to understand correlations with basic expressions.
A design procedure for active rectangular microstrip patch antennaIAEME Publication
This document presents a design procedure for an active rectangular microstrip patch antenna operating in the X-band frequency range. It begins with the design of the passive antenna element using standard equations. Appropriate input and output matching circuits are then examined and an amplifier is designed. The passive antenna is connected to the amplifier input to form the overall active antenna structure, which is simulated using ADS software. The results show improvements in characteristics like gain and bandwidth for the active antenna compared to the passive design alone. A comparison of the key characteristics of passive versus active antenna designs is also provided.
Knowledge management strategies in higher educationIAEME Publication
The document discusses knowledge management strategies in higher education. It begins by explaining the concepts of explicit and implicit knowledge and how knowledge works in higher education. Some key trends in knowledge management practices for higher education are emerging technology solutions, a movement from conventional teaching to knowledge management-oriented systems, and applying implicit knowledge. The document also discusses how technology solutions like portals can help support knowledge exchange. It explores applying knowledge management in areas like research, curriculum development, and administrative services to improve processes and leverage best practices. The overall aim is to discuss how knowledge management concepts used in business can also be applied in higher education institutions.
Early detection of adult valve disease mitral stenosisIAEME Publication
The document discusses using an Elman artificial neural network (ENN) to classify the degree of mitral valve stenosis in ultrasound images. The ENN is trained on M-mode echocardiography images labeled as mild, moderate, or severe stenosis. Kernel principal component analysis is used to extract features from the images by reducing the pixel dimensions. The ENN architecture includes input, hidden, connecting, and output layers to classify new images based on the training. The algorithm involves calculating network outputs and errors to update weights between layers and improve classification accuracy. In summary, the ENN is designed and tested to automatically detect and diagnose the severity of mitral valve stenosis from ultrasound images.
O documento apresenta vários poemas de diferentes autores sobre a natureza. No primeiro poema, José de Almada Negreiros reflete sobre as relações entre as partes da natureza como flores, sementes e frutos. Os outros poemas de Alberto Caeiro e Ricardo Reis descrevem a beleza da natureza e a brevidade da vida das rosas. O último poema, sem autor identificado, fala sobre a calma do olhar do poeta diante da natureza.
Job satisfaction in banking a study of private and public sector banksIAEME Publication
This study examines job satisfaction among employees in public and private sector banks in India. The document provides background on definitions of job satisfaction and factors that influence it. It outlines the study's objectives to measure and compare job satisfaction levels and contributing factors between public and private bank employees. The methodology section notes that surveys were conducted with 400 employees total across 6 banks to collect data on job satisfaction and its relationship to other variables. Prior literature found job satisfaction correlated with organizational commitment, justice perceptions, benefits offered, workforce size, and more.
This educational session document provides information about an upcoming training. The session will cover topics related to leadership and management best practices. Attendees will learn strategies to improve team performance and productivity through effective communication, goal setting, and professional development.
This document summarizes a research paper on parallel communicating extended finite automata systems. The key points are:
1) Parallel communicating extended finite automata systems allow multiple extended finite automata to work independently in parallel while communicating with each other by request.
2) These systems are shown to be more powerful than existing models in terms of the computational languages they can accept, such as recursively enumerable languages.
3) An example system is provided to demonstrate how a non-context free language can be accepted by reading an input word using this model of parallel communicating extended finite automata.
The document describes a parallel communicating extended finite automata system. It introduces the concept of multiple extended finite automata working in parallel and communicating with each other by requesting state information. The system consists of several extended finite automata that operate independently but can communicate their current states. This model increases computational power through cooperation and communication compared to existing models. The system is formally defined and its deterministic and centralized variants are described.
Parallel communicating extended finite automata systems communicating by statesIAEME Publication
This document summarizes a research paper on parallel communicating extended finite automata systems. The key points are:
1) Parallel communicating extended finite automata systems allow multiple extended finite automata to work independently in parallel while communicating with each other by request.
2) These systems are shown to be more powerful than existing models in terms of the computational languages they can accept, such as recursively enumerable languages.
3) An example system is provided to demonstrate how a non-context free language can be accepted by reading an input word using this model of parallel communicating extended finite automata.
Some properties of m sequences over finite field fpIAEME Publication
1) The document discusses properties of M-sequences over finite fields Fp when p is an odd prime.
2) Some key properties discussed are: the set of cyclic permutations of a non-zero period is not closed under addition; the matrix of these permutations is symmetric about the second diagonal; and the sum of any two rows with one translated by half the period is the zero sequence.
3) The document also presents theorems about the characteristics and representations of M-sequences over finite fields, including their relation to irreducible polynomials and representation as matrices.
Chapter10. Realization of Digital Filter.pptxRajGopalMishra4
This document discusses different methods for realizing digital filters from their system functions, including FIR, IIR, and pole-zero filters. It describes the difference equation representation and how to obtain the difference equation from the system function. It also covers various filter structures for implementing digital filters, including direct form, cascade form, and linear phase structures. The basic building blocks of digital filters and properties of canonical and transposed structures are also summarized.
In this article, we propose a new approach to solve intuitionistic fuzzy assignment
problem. Classical assignment problem deals with deterministic cost. In practical
situations it is not easy to determine the parameters. The parameters can be modeled
to fuzzy or intuitionistic fuzzy parameters. This paper develops an approach based on
diagonal optimal algorithm to solve an intuitionistic fuzzy assignment problem. A new
ranking procedure based on combined arithmetic mean is used to order the
intuitionistic fuzzy numbers so that Diagonal optimal algorithm [22] can be applied to
solve the intuitionistic fuzzy assignment problem. To illustrate the effectiveness of the
algorithm numerical examples were given..
On the principle of optimality for linear stochastic dynamic systemijfcstjournal
In this work, processes represented by linear stochastic dynamic system are investigated and by
considering optimal control problem, principle of optimality is proven. Also, for existence of optimal
control and corresponding optimal trajectory, proofs of theorems of necessity and sufficiency condition are
attained.
On the Principle of Optimality for Linear Stochastic Dynamic System ijfcstjournal
In this work, processes represented by linear stochastic dynamic system are investigated and by
considering optimal control problem, principle of optimality is proven. Also, for existence of optimal
control and corresponding optimal trajectory, proofs of theorems of necessity and sufficiency condition are
attained.
Abstract— To be able to control a robot manipulator as.docxaryan532920
Abstract— To be able to control a robot manipulator as required
by its operation, it is important to consider the kinematic model in
design of the control algorithm. In robotics, the kinematic
descriptions of manipulators and their assigned tasks are utilized to
set up the fundamental equations for dynamics and control.. The
objective of this paper is to derive the complete forward kinematic
model (analytical and numerical) of a 6 DOF robotic arm (LR Mate
200iC from Fanuc Robotics) and validate it with the data provided by
robot’s software.
Keywords — forward kinematic, Denavit-Hartenberg parameters,
Robotic Toolbox
I. INTRODUCTION
Kinematics is the science of geometry in motion. It is
restricted to a pure geometrical description of motion by
means of position, orientation, and their time derivatives. In
robotics, the kinematic descriptions of manipulators and their
assigned tasks are utilized to set up the fundamental equations
for dynamics and control [1]. These non-linear equations are
used to map the joint parameters to the configuration of the
robot system. The Denavit and Hartenberg notation [2],[3]
gives us a standard methodology to write the kinematic
equations of a manipulator. This is especially useful for serial
manipulators where a matrix is used to represent the pose
(position and orientation) of one body with respect to another.
There are two important aspects in kinematic analysis of
robots: the Forward Kinematics problem and the Inverse
Kinematics problem. Forward kinematics refers to the use of
the kinematic equations of a robot to compute the position of
the end-effector from specified values for the joint parameters
Inverse kinematics refers to the use of the kinematics equations
of a robot to determine the joint parameters that provide a
desired position of the end-effector.
The purpose of this paper is to obtain the forward
kinematic analysis for the Fanuc LR Mate 200iC Robot, to
make model of robot using Robotic Toolbox® for MATLAB®
and validate it with the data provided by robot’s software. The
information can be use in the future design and production of
Daniel Constantin is with Military Technical Academy, Bucharest,
Romania; 39-49 George Cosbuc Blv., 050141, phone +40213354660; fax:
+40213355763; e-mail: [email protected]
Marin Lupoae is with Military Technical Academy, Bucharest, Romania;
e-mail: [email protected]
Cătălin Baciu is with Military Technical Academy, Bucharest, Romania;
e-mail: [email protected]
Dan-Ilie Buliga is with Military Technical Academy, Bucharest, Romania;
e-mail: [email protected]
the robot to make it faster and more accurate postwar period
for the defensive works executed in different countries around
the globe.
II. THEORETICAL ASPECTS
The forward kinematics problem is concerned with the
relationship between the individual joints of the robot
manipulator and the position and orientation of the tool or end-
effector.
A s ...
This study deals with the active control of the dynamic response of a string with fixed ends and mass
loaded by a point mass. It has been controlled actively by means of a feed forward control method. A point mass of a
string is considered as a vibrating receiver which be forced to vibrate by a vibrating source being positioned on the
string. By analyzing the motion of a string, the equation of motion for a string was derived by using a method of
variation of parameters. To define the optimal conditions of a controller, the cost function, which denotes the dynamic
response at the point mass of a string was evaluated numerically. The possibility of reduction of a dynamic response
was found to depend on the location of a control force, the magnitude of a point mass and a forcing frequency
A C OMPREHENSIVE S URVEY O N P ERFORMANCE A NALYSIS O F C HAOTIC C OLOU...IJITCA Journal
This document summarizes a paper that proposes enhancements to an existing software tool for synthesizing minimally restrictive liveness enforcing supervisory policies (LESPs) for Petri net (PN) models of manufacturing systems. The first enhancement broadens the scope of the tool to a larger class of PNs called class H. The second enhancement improves the tool's running time by exploiting a property identified in the paper related to the convergence of the iterative synthesis procedure. The paper defines relevant PN concepts and reviews existing literature on supervisory control of PNs for livelock avoidance.
C OMPREHENSIVE S URVEY O N P ERFORMANCE A NALYSIS O F C HAOTIC C OLOUR...IJITCA Journal
There is a significant increase in the number of mu
ltimedia transmission over the internet is beyond o
ur
dreams. Thus, the increased risk of losing or alte
ring the data during transit is more. Protection o
f this
multimedia data becomes one of the key security con
cerns, because millions of Internet users worldwide
are infringing digital rights daily, by downloading
multimedia content illegally from the Internet. T
he
image protection is very important, as the image tr
ansmission covers the highest percentage of the
multimedia data. Image encryption is one of the ef
fective ways out to achieve this. Our world, built
upon the concept of progression and advancement, ha
s entered a new scientific realm known as Chaos
theory. Chaotic encryption is one of the best alte
rnative ways to ensure security. Many image
encryption schemes using chaotic maps have been pro
posed, because of its extreme sensitivity to initia
l
conditions, unpredictability and random like behavi
ors. Each one of them has its own strength and
weakness. In this paper, some existing chaos based
colour image encryption algorithms are considered
with respect to various parameters like implementat
ion, key management, security analysis and channel
issues to satisfy some basic cryptographic requirem
ents for chaos based colour image encryption
algorithms.
PROTOTYPE APPLICATION IN ANDROID PLATFORM FOR SYSTEM ADMINISTRATION OF HPC ...IJITCA Journal
As the number of
HPC
systems across the globe is booming at a rapid pac
e.The task of system
administration is turning out to be tedious. Using
a computer for every petty work can be cumbersome.
In recent times there has been a paradigm shift fro
m PC to mobile on a rapid scale. So a need has
risen for such paradigm shift in system administrat
ion too. To solve this problem, an android
application has been developed which allows the adm
in to monitor the system statistics remotely using
his cell phone
A S OFTWARE T OOL FOR L IVE - LOCK A VOIDANCE IN S YSTEMS M ODELLED USIN...IJCSEA Journal
If a manufacturing system enters into a state where
a task enters into a state of suspended animation
for
perpetuity, we say it is in a livelocked state. In
contrast, all tasks of the system remain suspended
for
perpetuity in a deadlocked state of the system. A l
ivelock-free manufacturing system can never experie
nce
deadlocks, but the converse is not necessarily true
. A livelock-prone manufacturing system can be
regulated using a supervisory policy such that the
resulting supervised system is livelock-free. If a
liveness
enforcing supervisory policy (LESP) prevents the oc
currence of an event at given state of the
manufacturing system, and every other LESP, irrespe
ctive of the implementation paradigm, prescribes the
same control for that state, we say the original LE
SP is minimally restrictive.
A SOFTWARE TOOL FOR LIVE-LOCK AVOIDANCE IN SYSTEMS MODELLED USING A CLASS OF ...IJCSEA Journal
perpetuity, we say it is in a livelocked state. In contrast, all tasks of the system remain suspended for perpetuity in a deadlocked state of the system. A livelock-free manufacturing system can never experience deadlocks, but the converse is not necessarily true. A livelock-prone manufacturing system can be regulated using a supervisory policy such that the resulting supervised system is livelock-free. If a liveness enforcing supervisory policy (LESP) prevents the occurrence of an event at given state of the manufacturing system, and every other LESP, irrespective of the implementation paradigm, prescribes the same control for that state, we say the original LESP is minimally restrictive.
A C LOUD -B ASED P ROTOTYPE I MPLEMENTATION OF A D ISEASE O UTBREAK N O...IJCSEA Journal
This paper describes the design, prototype implemen
tation and performance characteristics of a Disease
Outbreak Notification System (DONS). The prototype
was implemented in a hybrid cloud environment as
an online/real-time system. It detects potential ou
tbreaks of both listed and unknown diseases. It use
s data
mining techniques to choose the correct algorithm t
o detect outbreaks of unknown diseases. Our
experiments showed that the proposed system has ver
y high accuracy rate in choosing the correct detect
ion algorithm. To our best knowledge, DONS is the first of its kind to detect outbreaks of unknown diseases using data mining techniques.
signals and systems chapter3-part3_signals and systems chapter3-part3.pdfislamsharawneh
1. The document discusses the Fourier series representation of periodic signals. Fourier series represents a periodic signal as a sum of complex exponentials that are harmonically related.
2. For a periodic signal x(t) with period T0, its Fourier series representation is x(t) = Σak*e^j*k*ω0*t, where ω0 = 2π/T0.
3. If the signal x(t) is real, its Fourier coefficients ak satisfy the condition that ak = a-k*. This leads to alternative forms of the Fourier series using only cosine or sine terms.
An improved ant colony algorithm based onIJCI JOURNAL
This paper presents an improved chaotic ant colony system algorithm (ICACS) for solving combinatorial
optimization problems. The existing algorithms still have some imperfections, we use a combination of two
different operators to improve the performance of algorithm in this work. First, 3-opt local search is used
as a framework for the implementation of the ACS to improve the solution quality; Furthermore, chaos is
proposed in the work to modify the method of pheromone update to avoid the algorithm from dropping into
local optimum, thereby finding the favorable solutions. From the experimental results, we can conclude
that ICACS has much higher quality solutions than the original ACS, and can jump over the region of the
local optimum, and escape from the trap of a local optimum successfully and achieve the best solutions.
Therefore, it’s better and more effective algorithm for TSP.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
The document summarizes a queueing model with two component mixture of doubly truncated exponential service times. The service time distribution is a two component mixture of doubly truncated exponential distributions, which can characterize heterogeneous and finite range service times. Assuming Poisson arrivals, the embedded Markov chain technique is used to analyze the system. Explicit expressions are derived for performance measures like average number of customers, average waiting time, throughput, and probability of idleness. Numerical analysis studies the sensitivity of performance measures to parameter changes. The model includes two component mixture of exponential, doubly truncated exponential, and exponential service time models as special cases.
Similar to Parallel communicating flip pushdown automata systems communicating by stacks (20)
Submission Deadline: 30th September 2022
Acceptance Notification: Within Three Days’ time period
Online Publication: Within 24 Hrs. time Period
Expected Date of Dispatch of Printed Journal: 5th October 2022
MODELING AND ANALYSIS OF SURFACE ROUGHNESS AND WHITE LATER THICKNESS IN WIRE-...IAEME Publication
White layer thickness (WLT) formed and surface roughness in wire electric discharge turning (WEDT) of tungsten carbide composite has been made to model through response surface methodology (RSM). A Taguchi’s standard Design of experiments involving five input variables with three levels has been employed to establish a mathematical model between input parameters and responses. Percentage of cobalt content, spindle speed, Pulse on-time, wire feed and pulse off-time were changed during the experimental tests based on the Taguchi’s orthogonal array L27 (3^13). Analysis of variance (ANOVA) revealed that the mathematical models obtained can adequately describe performance within the parameters of the factors considered. There was a good agreement between the experimental and predicted values in this study.
A STUDY ON THE REASONS FOR TRANSGENDER TO BECOME ENTREPRENEURSIAEME Publication
The study explores the reasons for a transgender to become entrepreneurs. In this study transgender entrepreneur was taken as independent variable and reasons to become as dependent variable. Data were collected through a structured questionnaire containing a five point Likert Scale. The study examined the data of 30 transgender entrepreneurs in Salem Municipal Corporation of Tamil Nadu State, India. Simple Random sampling technique was used. Garrett Ranking Technique (Percentile Position, Mean Scores) was used as the analysis for the present study to identify the top 13 stimulus factors for establishment of trans entrepreneurial venture. Economic advancement of a nation is governed upon the upshot of a resolute entrepreneurial doings. The conception of entrepreneurship has stretched and materialized to the socially deflated uncharted sections of transgender community. Presently transgenders have smashed their stereotypes and are making recent headlines of achievements in various fields of our Indian society. The trans-community is gradually being observed in a new light and has been trying to achieve prospective growth in entrepreneurship. The findings of the research revealed that the optimistic changes are taking place to change affirmative societal outlook of the transgender for entrepreneurial ventureship. It also laid emphasis on other transgenders to renovate their traditional living. The paper also highlights that legislators, supervisory body should endorse an impartial canons and reforms in Tamil Nadu Transgender Welfare Board Association.
BROAD UNEXPOSED SKILLS OF TRANSGENDER ENTREPRENEURSIAEME Publication
Since ages gender difference is always a debatable theme whether caused by nature, evolution or environment. The birth of a transgender is dreadful not only for the child but also for their parents. The pain of living in the wrong physique and treated as second class victimized citizen is outrageous and fully harboured with vicious baseless negative scruples. For so long, social exclusion had perpetuated inequality and deprivation experiencing ingrained malign stigma and besieged victims of crime or violence across their life spans. They are pushed into the murky way of life with a source of eternal disgust, bereft sexual potency and perennial fear. Although they are highly visible but very little is known about them. The common public needs to comprehend the ravaged arrogance on these insensitive souls and assist in integrating them into the mainstream by offering equal opportunity, treat with humanity and respect their dignity. Entrepreneurship in the current age is endorsing the gender fairness movement. Unstable careers and economic inadequacy had inclined one of the gender variant people called Transgender to become entrepreneurs. These tiny budding entrepreneurs resulted in economic transition by means of employment, free from the clutches of stereotype jobs, raised standard of living and handful of financial empowerment. Besides all these inhibitions, they were able to witness a platform for skill set development that ignited them to enter into entrepreneurial domain. This paper epitomizes skill sets involved in trans-entrepreneurs of Thoothukudi Municipal Corporation of Tamil Nadu State and is a groundbreaking determination to sightsee various skills incorporated and the impact on entrepreneurship.
DETERMINANTS AFFECTING THE USER'S INTENTION TO USE MOBILE BANKING APPLICATIONSIAEME Publication
The banking and financial services industries are experiencing increased technology penetration. Among them, the banking industry has made technological advancements to better serve the general populace. The economy focused on transforming the banking sector's system into a cashless, paperless, and faceless one. The researcher wants to evaluate the user's intention for utilising a mobile banking application. The study also examines the variables affecting the user's behaviour intention when selecting specific applications for financial transactions. The researcher employed a well-structured questionnaire and a descriptive study methodology to gather the respondents' primary data utilising the snowball sampling technique. The study includes variables like performance expectations, effort expectations, social impact, enabling circumstances, and perceived risk. Each of the aforementioned variables has a major impact on how users utilise mobile banking applications. The outcome will assist the service provider in comprehending the user's history with mobile banking applications.
ANALYSE THE USER PREDILECTION ON GPAY AND PHONEPE FOR DIGITAL TRANSACTIONSIAEME Publication
Technology upgradation in banking sector took the economy to view that payment mode towards online transactions using mobile applications. This system enabled connectivity between banks, Merchant and user in a convenient mode. there are various applications used for online transactions such as Google pay, Paytm, freecharge, mobikiwi, oxygen, phonepe and so on and it also includes mobile banking applications. The study aimed at evaluating the predilection of the user in adopting digital transaction. The study is descriptive in nature. The researcher used random sample techniques to collect the data. The findings reveal that mobile applications differ with the quality of service rendered by Gpay and Phonepe. The researcher suggest the Phonepe application should focus on implementing the application should be user friendly interface and Gpay on motivating the users to feel the importance of request for money and modes of payments in the application.
VOICE BASED ATM FOR VISUALLY IMPAIRED USING ARDUINOIAEME Publication
The prototype of a voice-based ATM for visually impaired using Arduino is to help people who are blind. This uses RFID cards which contain users fingerprint encrypted on it and interacts with the users through voice commands. ATM operates when sensor detects the presence of one person in the cabin. After scanning the RFID card, it will ask to select the mode like –normal or blind. User can select the respective mode through voice input, if blind mode is selected the balance check or cash withdraw can be done through voice input. Normal mode procedure is same as the existing ATM.
IMPACT OF EMOTIONAL INTELLIGENCE ON HUMAN RESOURCE MANAGEMENT PRACTICES AMONG...IAEME Publication
There is increasing acceptability of emotional intelligence as a major factor in personality assessment and effective human resource management. Emotional intelligence as the ability to build capacity, empathize, co-operate, motivate and develop others cannot be divorced from both effective performance and human resource management systems. The human person is crucial in defining organizational leadership and fortunes in terms of challenges and opportunities and walking across both multinational and bilateral relationships. The growing complexity of the business world requires a great deal of self-confidence, integrity, communication, conflict and diversity management to keep the global enterprise within the paths of productivity and sustainability. Using the exploratory research design and 255 participants the result of this original study indicates strong positive correlation between emotional intelligence and effective human resource management. The paper offers suggestions on further studies between emotional intelligence and human capital development and recommends for conflict management as an integral part of effective human resource management.
VISUALISING AGING PARENTS & THEIR CLOSE CARERS LIFE JOURNEY IN AGING ECONOMYIAEME Publication
Our life journey, in general, is closely defined by the way we understand the meaning of why we coexist and deal with its challenges. As we develop the "inspiration economy", we could say that nearly all of the challenges we have faced are opportunities that help us to discover the rest of our journey. In this note paper, we explore how being faced with the opportunity of being a close carer for an aging parent with dementia brought intangible discoveries that changed our insight of the meaning of the rest of our life journey.
A STUDY ON THE IMPACT OF ORGANIZATIONAL CULTURE ON THE EFFECTIVENESS OF PERFO...IAEME Publication
The main objective of this study is to analyze the impact of aspects of Organizational Culture on the Effectiveness of the Performance Management System (PMS) in the Health Care Organization at Thanjavur. Organizational Culture and PMS play a crucial role in present-day organizations in achieving their objectives. PMS needs employees’ cooperation to achieve its intended objectives. Employees' cooperation depends upon the organization’s culture. The present study uses exploratory research to examine the relationship between the Organization's culture and the Effectiveness of the Performance Management System. The study uses a Structured Questionnaire to collect the primary data. For this study, Thirty-six non-clinical employees were selected from twelve randomly selected Health Care organizations at Thanjavur. Thirty-two fully completed questionnaires were received.
Living in 21st century in itself reminds all of us the necessity of police and its administration. As more and more we are entering into the modern society and culture, the more we require the services of the so called ‘Khaki Worthy’ men i.e., the police personnel. Whether we talk of Indian police or the other nation’s police, they all have the same recognition as they have in India. But as already mentioned, their services and requirements are different after the like 26th November, 2008 incidents, where they without saving their own lives has sacrificed themselves without any hitch and without caring about their respective family members and wards. In other words, they are like our heroes and mentors who can guide us from the darkness of fear, militancy, corruption and other dark sides of life and so on. Now the question arises, if Gandhi would have been alive today, what would have been his reaction/opinion to the police and its functioning? Would he have some thing different in his mind now what he had been in his mind before the partition or would he be going to start some Satyagraha in the form of some improvement in the functioning of the police administration? Really these questions or rather night mares can come to any one’s mind, when there is too much confusion is prevailing in our minds, when there is too much corruption in the society and when the polices working is also in the questioning because of one or the other case throughout the India. It is matter of great concern that we have to thing over our administration and our practical approach because the police personals are also like us, they are part and parcel of our society and among one of us, so why we all are pin pointing towards them.
A STUDY ON TALENT MANAGEMENT AND ITS IMPACT ON EMPLOYEE RETENTION IN SELECTED...IAEME Publication
The goal of this study was to see how talent management affected employee retention in the selected IT organizations in Chennai. The fundamental issue was the difficulty to attract, hire, and retain talented personnel who perform well and the gap between supply and demand of talent acquisition and retaining them within the firms. The study's main goals were to determine the impact of talent management on employee retention in IT companies in Chennai, investigate talent management strategies that IT companies could use to improve talent acquisition, performance management, career planning and formulate retention strategies that the IT firms could use. The respondents were given a structured close-ended questionnaire with the 5 Point Likert Scale as part of the study's quantitative research design. The target population consisted of 289 IT professionals. The questionnaires were distributed and collected by the researcher directly. The Statistical Package for Social Sciences (SPSS) was used to collect and analyse the questionnaire responses. Hypotheses that were formulated for the various areas of the study were tested using a variety of statistical tests. The key findings of the study suggested that talent management had an impact on employee retention. The studies also found that there is a clear link between the implementation of talent management and retention measures. Management should provide enough training and development for employees, clarify job responsibilities, provide adequate remuneration packages, and recognise employees for exceptional performance.
ATTRITION IN THE IT INDUSTRY DURING COVID-19 PANDEMIC: LINKING EMOTIONAL INTE...IAEME Publication
Globally, Millions of dollars were spent by the organizations for employing skilled Information Technology (IT) professionals. It is costly to replace unskilled employees with IT professionals possessing technical skills and competencies that aid in interconnecting the business processes. The organization’s employment tactics were forced to alter by globalization along with technological innovations as they consistently diminish to remain lean, outsource to concentrate on core competencies along with restructuring/reallocate personnel to gather efficiency. As other jobs, organizations or professions have become reasonably more appropriate in a shifting employment landscape, the above alterations trigger both involuntary as well as voluntary turnover. The employee view on jobs is also afflicted by the COVID-19 pandemic along with the employee-driven labour market. So, having effective strategies is necessary to tackle the withdrawal rate of employees. By associating Emotional Intelligence (EI) along with Talent Management (TM) in the IT industry, the rise in attrition rate was analyzed in this study. Only 303 respondents were collected out of 350 participants to whom questionnaires were distributed. From the employees of IT organizations located in Bangalore (India), the data were congregated. A simple random sampling methodology was employed to congregate data as of the respondents. Generating the hypothesis along with testing is eventuated. The effect of EI and TM along with regression analysis between TM and EI was analyzed. The outcomes indicated that employee and Organizational Performance (OP) were elevated by effective EI along with TM.
INFLUENCE OF TALENT MANAGEMENT PRACTICES ON ORGANIZATIONAL PERFORMANCE A STUD...IAEME Publication
By implementing talent management strategy, organizations would have the option to retain their skilled professionals while additionally working on their overall performance. It is the course of appropriately utilizing the ideal individuals, setting them up for future top positions, exploring and dealing with their performance, and holding them back from leaving the organization. It is employee performance that determines the success of every organization. The firm quickly obtains an upper hand over its rivals in the event that its employees having particular skills that cannot be duplicated by the competitors. Thus, firms are centred on creating successful talent management practices and processes to deal with the unique human resources. Firms are additionally endeavouring to keep their top/key staff since on the off chance that they leave; the whole store of information leaves the firm's hands. The study's objective was to determine the impact of talent management on organizational performance among the selected IT organizations in Chennai. The study recommends that talent management limitedly affects performance. On the off chance that this talent is appropriately management and implemented properly, organizations might benefit as much as possible from their maintained assets to support development and productivity, both monetarily and non-monetarily.
A STUDY OF VARIOUS TYPES OF LOANS OF SELECTED PUBLIC AND PRIVATE SECTOR BANKS...IAEME Publication
Banking regulations act of India, 1949 defines banking as “acceptance of deposits for the purpose of lending or investment from the public, repayment on demand or otherwise and withdrawable through cheques, drafts order or otherwise”, the major participants of the Indian financial system are commercial banks, the financial institution encompassing term lending institutions. Investments institutions, specialized financial institution and the state level development banks, non banking financial companies (NBFC) and other market intermediaries such has the stock brokers and money lenders are among the oldest of the certain variants of NBFC and the oldest market participants. The asset quality of banks is one of the most important indicators of their financial health. The Indian banking sector has been facing severe problems of increasing Non- Performing Assets (NPAs). The NPAs growth directly and indirectly affects the quality of assets and profitability of banks. It also shows the efficiency of banks credit risk management and the recovery effectiveness. NPA do not generate any income, whereas, the bank is required to make provisions for such as assets that why is a double edge weapon. This paper outlines the concept of quality of bank loans of different types like Housing, Agriculture and MSME loans in state Haryana of selected public and private sector banks. This study is highlighting problems associated with the role of commercial bank in financing Small and Medium Scale Enterprises (SME). The overall objective of the research was to assess the effect of the financing provisions existing for the setting up and operations of MSMEs in the country and to generate recommendations for more robust financing mechanisms for successful operation of the MSMEs, in turn understanding the impact of MSME loans on financial institutions due to NPA. There are many research conducted on the topic of Non- Performing Assets (NPA) Management, concerning particular bank, comparative study of public and private banks etc. In this paper the researcher is considering the aggregate data of selected public sector and private sector banks and attempts to compare the NPA of Housing, Agriculture and MSME loans in state Haryana of public and private sector banks. The tools used in the study are average and Anova test and variance. The findings reveal that NPA is common problem for both public and private sector banks and is associated with all types of loans either that is housing loans, agriculture loans and loans to SMES. NPAs of both public and private sector banks show the increasing trend. In 2010-11 GNPA of public and private sector were at same level it was 2% but after 2010-11 it increased in many fold and at present there is GNPA in some more than 15%. It shows the dark area of Indian banking sector.
EXPERIMENTAL STUDY OF MECHANICAL AND TRIBOLOGICAL RELATION OF NYLON/BaSO4 POL...IAEME Publication
An experiment conducted in this study found that BaSO4 changed Nylon 6's mechanical properties. By changing the weight ratios, BaSO4 was used to make Nylon 6. This Researcher looked into how hard Nylon-6/BaSO4 composites are and how well they wear. Experiments were done based on Taguchi design L9. Nylon-6/BaSO4 composites can be tested for their hardness number using a Rockwell hardness testing apparatus. On Nylon/BaSO4, the wear behavior was measured by a wear monitor, pinon-disc friction by varying reinforcement, sliding speed, and sliding distance, and the microstructure of the crack surfaces was observed by SEM. This study provides significant contributions to ultimate strength by increasing BaSO4 content up to 16% in the composites, and sliding speed contributes 72.45% to the wear rate
ROLE OF SOCIAL ENTREPRENEURSHIP IN RURAL DEVELOPMENT OF INDIA - PROBLEMS AND ...IAEME Publication
The majority of the population in India lives in villages. The village is the back bone of the country. Village or rural industries play an important role in the national economy, particularly in the rural development. Developing the rural economy is one of the key indicators towards a country’s success. Whether it be the need to look after the welfare of the farmers or invest in rural infrastructure, Governments have to ensure that rural development isn’t compromised. The economic development of our country largely depends on the progress of rural areas and the standard of living of rural masses. Village or rural industries play an important role in the national economy, particularly in the rural development. Rural entrepreneurship is based on stimulating local entrepreneurial talent and the subsequent growth of indigenous enterprises. It recognizes opportunity in the rural areas and accelerates a unique blend of resources either inside or outside of agriculture. Rural entrepreneurship brings an economic value to the rural sector by creating new methods of production, new markets, new products and generate employment opportunities thereby ensuring continuous rural development. Social Entrepreneurship has the direct and primary objective of serving the society along with the earning profits. So, social entrepreneurship is different from the economic entrepreneurship as its basic objective is not to earn profits but for providing innovative solutions to meet the society needs which are not taken care by majority of the entrepreneurs as they are in the business for profit making as a sole objective. So, the Social Entrepreneurs have the huge growth potential particularly in the developing countries like India where we have huge societal disparities in terms of the financial positions of the population. Still 22 percent of the Indian population is below the poverty line and also there is disparity among the rural & urban population in terms of families living under BPL. 25.7 percent of the rural population & 13.7 percent of the urban population is under BPL which clearly shows the disparity of the poor people in the rural and urban areas. The need to develop social entrepreneurship in agriculture is dictated by a large number of social problems. Such problems include low living standards, unemployment, and social tension. The reasons that led to the emergence of the practice of social entrepreneurship are the above factors. The research problem lays upon disclosing the importance of role of social entrepreneurship in rural development of India. The paper the tendencies of social entrepreneurship in India, to present successful examples of such business for providing recommendations how to improve situation in rural areas in terms of social entrepreneurship development. Indian government has made some steps towards development of social enterprises, social entrepreneurship, and social in- novation, but a lot remains to be improved.
OPTIMAL RECONFIGURATION OF POWER DISTRIBUTION RADIAL NETWORK USING HYBRID MET...IAEME Publication
Distribution system is a critical link between the electric power distributor and the consumers. Most of the distribution networks commonly used by the electric utility is the radial distribution network. However in this type of network, it has technical issues such as enormous power losses which affect the quality of the supply. Nowadays, the introduction of Distributed Generation (DG) units in the system help improve and support the voltage profile of the network as well as the performance of the system components through power loss mitigation. In this study network reconfiguration was done using two meta-heuristic algorithms Particle Swarm Optimization and Gravitational Search Algorithm (PSO-GSA) to enhance power quality and voltage profile in the system when simultaneously applied with the DG units. Backward/Forward Sweep Method was used in the load flow analysis and simulated using the MATLAB program. Five cases were considered in the Reconfiguration based on the contribution of DG units. The proposed method was tested using IEEE 33 bus system. Based on the results, there was a voltage profile improvement in the system from 0.9038 p.u. to 0.9594 p.u.. The integration of DG in the network also reduced power losses from 210.98 kW to 69.3963 kW. Simulated results are drawn to show the performance of each case.
APPLICATION OF FRUGAL APPROACH FOR PRODUCTIVITY IMPROVEMENT - A CASE STUDY OF...IAEME Publication
Manufacturing industries have witnessed an outburst in productivity. For productivity improvement manufacturing industries are taking various initiatives by using lean tools and techniques. However, in different manufacturing industries, frugal approach is applied in product design and services as a tool for improvement. Frugal approach contributed to prove less is more and seems indirectly contributing to improve productivity. Hence, there is need to understand status of frugal approach application in manufacturing industries. All manufacturing industries are trying hard and putting continuous efforts for competitive existence. For productivity improvements, manufacturing industries are coming up with different effective and efficient solutions in manufacturing processes and operations. To overcome current challenges, manufacturing industries have started using frugal approach in product design and services. For this study, methodology adopted with both primary and secondary sources of data. For primary source interview and observation technique is used and for secondary source review has done based on available literatures in website, printed magazines, manual etc. An attempt has made for understanding application of frugal approach with the study of manufacturing industry project. Manufacturing industry selected for this project study is Mahindra and Mahindra Ltd. This paper will help researcher to find the connections between the two concepts productivity improvement and frugal approach. This paper will help to understand significance of frugal approach for productivity improvement in manufacturing industry. This will also help to understand current scenario of frugal approach in manufacturing industry. In manufacturing industries various process are involved to deliver the final product. In the process of converting input in to output through manufacturing process productivity plays very critical role. Hence this study will help to evolve status of frugal approach in productivity improvement programme. The notion of frugal can be viewed as an approach towards productivity improvement in manufacturing industries.
A MULTIPLE – CHANNEL QUEUING MODELS ON FUZZY ENVIRONMENTIAEME Publication
In this paper, we investigated a queuing model of fuzzy environment-based a multiple channel queuing model (M/M/C) ( /FCFS) and study its performance under realistic conditions. It applies a nonagonal fuzzy number to analyse the relevant performance of a multiple channel queuing model (M/M/C) ( /FCFS). Based on the sub interval average ranking method for nonagonal fuzzy number, we convert fuzzy number to crisp one. Numerical results reveal that the efficiency of this method. Intuitively, the fuzzy environment adapts well to a multiple channel queuing models (M/M/C) ( /FCFS) are very well.