This document discusses the quasi-hyperbolic Kac-Moody algebra QHA2(1). It begins with an abstract that introduces the algebra and states that the paper aims to classify the Dynkin diagrams associated with QHA2(1) and study properties of strictly and purely imaginary roots. It then provides background on Kac-Moody algebras, roots, and related concepts. The main results are a classification theorem stating there are 212 connected, non-isomorphic Dynkin diagrams for QHA2(1) and a discussion of strictly and purely imaginary roots for this algebra.
In insight into QAC2(1) : Dynkin diagrams and properties of rootsIRJET Journal
The document discusses properties of quasi affine Kac-Moody algebras QAC2(1). It begins by providing background on Kac-Moody algebras and defining key terms. It then presents a classification theorem stating there are 909 non-isomorphic connected Dynkin diagrams associated with QAC2(1). These diagrams are divided into three cases based on how the fourth vertex connects to the first three vertices of the affine C2(1) diagram. The theorem proves there are 18 diagrams for case i), 162 for case ii), and 729 for case iii), totaling 909 diagrams.
Numerical approach of riemann-liouville fractional derivative operatorIJECEIAES
The document presents two theorems that provide new formulas for approximating the Riemann-Liouville fractional derivative operator in the form of power series. Theorem 8 derives an expression for the operator when 0 < α ≤ 1 that represents it as a fractional series involving the function and its derivatives up to order n+1, plus a remainder term involving the (n+1)th derivative. Theorem 9 generalizes this to the case when m - 1 < α < m, where m is a positive integer. These formulas are useful for establishing new approaches to solve linear and nonlinear fractional differential equations in series form.
This document describes an undergraduate research project on iterative methods for computing eigenvalues and eigenvectors of matrices. It introduces the standard eigenvalue problem and defines key terms like eigenvalues, eigenvectors, and dominant eigenpairs. The body of the document reviews three iterative methods - the power method, inverse power method, and shifted inverse power method. It explains how these methods use repeated matrix-vector multiplications to approximate dominant, smallest, and intermediate eigenvalues and their corresponding eigenvectors. The document is structured with chapters on introduction, literature review, applications, and conclusion.
1. Hash tables are good for random access of elements but not sequential access. When records need to be accessed sequentially, hashing can be problematic because elements are stored in random locations instead of consecutively.
2. To find the successor of a node in a binary search tree, we take the right child. This operation has a runtime complexity of O(1).
3. When comparing operations like insertion, deletion, and searching between different data structures, arrays generally have the best performance for insertion and searching, while linked lists have better performance for deletion and allow for easy insertion/deletion anywhere. Binary search trees fall between these two.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy NumberIJERA Editor
In this paper a general fuzzy maximal flow problem is discussed . A crisp maximal flow problem can be solved
in two methods : linear programming modeling and maximal flow algorithm . Here I tried to fuzzify the
maximal flow algorithm using octagonal fuzzy numbers introduced by S.U Malini and Felbin .C. kennedy [26].
By ranking the octagonal fuzzy numbers it is possible to compare them and using this we convert the fuzzy
valued maximal flow algorithm to a crisp valued algorithm . It is proved that a better solution is obtained when
it is solved using fuzzy octagonal number than when it is solved using trapezoidal fuzzy number . To illustrate
this a numerical example is solved and the obtained result is compared with the existing results . If there is no
uncertainty about the flow between source and sink then the proposed algorithm gives the same result as in crisp
maximal flow problems.
This document summarizes algorithms for solving the Range 1 Query (R1Q) problem. The R1Q problem involves preprocessing a d-dimensional binary matrix to answer queries about whether a given range contains a 1. The document presents:
1) A deterministic linear-space data structure that solves orthogonal R1Qs in constant time for any dimension d.
2) Randomized sublinear-space data structures that solve orthogonal R1Qs and provide a tradeoff between query time and error probability.
3) Deterministic near-linear space data structures that solve non-orthogonal R1Qs (e.g. for axis-parallel triangles and spheres) in constant time.
Stability Analysis and Controller Synthesis for a Class of Piecewise Smooth S...Behzad Samadi
The document outlines a PhD thesis defense for Behzad Samadi at Concordia University. The thesis examines stability analysis and controller synthesis for piecewise smooth systems, which are systems with piecewise continuous and bounded dynamics. Some key contributions of the thesis include developing a two-step method to design controllers for uncertain nonlinear systems modeled as piecewise affine differential inclusions, introducing a duality-based interpretation to enable convex optimization techniques for controller synthesis, and proposing a nonsmooth backstepping approach for piecewise polynomial systems.
In insight into QAC2(1) : Dynkin diagrams and properties of rootsIRJET Journal
The document discusses properties of quasi affine Kac-Moody algebras QAC2(1). It begins by providing background on Kac-Moody algebras and defining key terms. It then presents a classification theorem stating there are 909 non-isomorphic connected Dynkin diagrams associated with QAC2(1). These diagrams are divided into three cases based on how the fourth vertex connects to the first three vertices of the affine C2(1) diagram. The theorem proves there are 18 diagrams for case i), 162 for case ii), and 729 for case iii), totaling 909 diagrams.
Numerical approach of riemann-liouville fractional derivative operatorIJECEIAES
The document presents two theorems that provide new formulas for approximating the Riemann-Liouville fractional derivative operator in the form of power series. Theorem 8 derives an expression for the operator when 0 < α ≤ 1 that represents it as a fractional series involving the function and its derivatives up to order n+1, plus a remainder term involving the (n+1)th derivative. Theorem 9 generalizes this to the case when m - 1 < α < m, where m is a positive integer. These formulas are useful for establishing new approaches to solve linear and nonlinear fractional differential equations in series form.
This document describes an undergraduate research project on iterative methods for computing eigenvalues and eigenvectors of matrices. It introduces the standard eigenvalue problem and defines key terms like eigenvalues, eigenvectors, and dominant eigenpairs. The body of the document reviews three iterative methods - the power method, inverse power method, and shifted inverse power method. It explains how these methods use repeated matrix-vector multiplications to approximate dominant, smallest, and intermediate eigenvalues and their corresponding eigenvectors. The document is structured with chapters on introduction, literature review, applications, and conclusion.
1. Hash tables are good for random access of elements but not sequential access. When records need to be accessed sequentially, hashing can be problematic because elements are stored in random locations instead of consecutively.
2. To find the successor of a node in a binary search tree, we take the right child. This operation has a runtime complexity of O(1).
3. When comparing operations like insertion, deletion, and searching between different data structures, arrays generally have the best performance for insertion and searching, while linked lists have better performance for deletion and allow for easy insertion/deletion anywhere. Binary search trees fall between these two.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy NumberIJERA Editor
In this paper a general fuzzy maximal flow problem is discussed . A crisp maximal flow problem can be solved
in two methods : linear programming modeling and maximal flow algorithm . Here I tried to fuzzify the
maximal flow algorithm using octagonal fuzzy numbers introduced by S.U Malini and Felbin .C. kennedy [26].
By ranking the octagonal fuzzy numbers it is possible to compare them and using this we convert the fuzzy
valued maximal flow algorithm to a crisp valued algorithm . It is proved that a better solution is obtained when
it is solved using fuzzy octagonal number than when it is solved using trapezoidal fuzzy number . To illustrate
this a numerical example is solved and the obtained result is compared with the existing results . If there is no
uncertainty about the flow between source and sink then the proposed algorithm gives the same result as in crisp
maximal flow problems.
This document summarizes algorithms for solving the Range 1 Query (R1Q) problem. The R1Q problem involves preprocessing a d-dimensional binary matrix to answer queries about whether a given range contains a 1. The document presents:
1) A deterministic linear-space data structure that solves orthogonal R1Qs in constant time for any dimension d.
2) Randomized sublinear-space data structures that solve orthogonal R1Qs and provide a tradeoff between query time and error probability.
3) Deterministic near-linear space data structures that solve non-orthogonal R1Qs (e.g. for axis-parallel triangles and spheres) in constant time.
Stability Analysis and Controller Synthesis for a Class of Piecewise Smooth S...Behzad Samadi
The document outlines a PhD thesis defense for Behzad Samadi at Concordia University. The thesis examines stability analysis and controller synthesis for piecewise smooth systems, which are systems with piecewise continuous and bounded dynamics. Some key contributions of the thesis include developing a two-step method to design controllers for uncertain nonlinear systems modeled as piecewise affine differential inclusions, introducing a duality-based interpretation to enable convex optimization techniques for controller synthesis, and proposing a nonsmooth backstepping approach for piecewise polynomial systems.
The document describes directed graphs and algorithms for analyzing them, including:
- Representing directed graphs using adjacency matrices and relations
- Determining reachability between nodes using the transitive closure of the adjacency relation or powers of the adjacency matrix
- Warshall's algorithm, which computes the transitive closure and reachability by taking the disjunction of the adjacency matrix with its powers up to the number of nodes.
This document discusses fractional calculus and its applications. It begins with an introduction to fractional calculus, which involves defining derivatives and integrals of arbitrary real or complex order. Naive approaches to defining fractional derivatives are inconsistent. The document then motivates a rigorous definition by generalizing the formula for differentiation to non-integer orders. This generalized formula reduces to the standard formula when the order is a positive integer.
Exact Matrix Completion via Convex Optimization Slide (PPT)Joonyoung Yi
Slide of the paper "Exact Matrix Completion via Convex Optimization" of Emmanuel J. Candès and Benjamin Recht. We presented this slide in KAIST CS592 Class, April 2018.
- Code: https://github.com/JoonyoungYi/MCCO-numpy
- Abstract of the paper: We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys
𝑚≥𝐶𝑛1.2𝑟log𝑛
for some positive numerical constant C, then with very high probability, most n×n matrices of rank r can be perfectly recovered by solving a simple convex optimization program. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Similar results hold for arbitrary rectangular matrices as well. Our results are connected with the recent literature on compressed sensing, and show that objects other than signals and images can be perfectly reconstructed from very limited information.
The document describes sparse matrix reconstruction using a matrix completion algorithm. It begins with an overview of the matrix completion problem and formulation. It then describes the algorithm which uses soft-thresholding to impose a low-rank constraint and iteratively finds the matrix that agrees with the observed entries. The algorithm is proven to converge to the desired solution. Extensions to noisy data and generalized constraints are also discussed.
Quadratic Programming : KKT conditions with inequality constraintsMrinmoy Majumder
In the case of Quadratic Programming for optimization, the objective function is a quadratic function. One of the techniques for solving quadratic optimization problems is KKT Conditions which is explained with an example in this tutorial.
A method for solving quadratic programming problems having linearly factoriz...IJMER
A new method namely, objective separable method based on simplex method is proposed for
finding an optimal solution to a quadratic programming problem in which the objective function can be
factorized into two linear functions. The solution procedure of the proposed method is illustrated with the
numerical example.
1. The document describes a heuristic approach for solving the cluster traveling salesman problem (CTSP) using genetic algorithms.
2. The proposed algorithm divides nodes into pre-specified clusters, uses GA to find a Hamiltonian path for each cluster, then combines the optimized cluster paths to form a full tour.
3. The algorithm was tested on symmetric TSPLIB instances and shown to find high quality solutions faster than two other metaheuristic approaches for CTSP.
AN ALPHA -CUT OPERATION IN A TRANSPORTATION PROBLEM USING SYMMETRIC HEXAGONAL...ijfls
In this paper we introduce a new operation on alpha cut for a symmetric hexagonal fuzzy numbers. We considered a transportation problem where the fuzzy demand and supply are in symmetric hexagonal fuzzy numbers and the minimum optimal cost is arrived .Transportation problems have various purposes in logistics and supply process for reducing the transportation cost’s The advantages of the proposed alpha
cut operations over existing methods is simpler and computationally more efficient in day to day applications.
Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...IJERA Editor
This paper presents a solution methodology for transportation problem in an intuitionistic fuzzy environment in
which cost are represented by pentagonal intuitionistic fuzzy numbers. Transportation problem is a particular
class of linear programming, which is associated with day to day activities in our real life. It helps in solving
problems on distribution and transportation of resources from one place to another. The objective is to satisfy
the demand at destination from the supply constraints at the minimum transportation cost possible. The problem
is solved using a ranking technique called Accuracy function for pentagonal intuitionistic fuzzy numbers and
Russell’s Method
Solution of N Queens Problem genetic algorithm MohammedAlKazal
Artificial Intelligence
Supervised by
Dr. Fawzia R.
Mosul university
Computer Sciences Department
Masters Students 2018 - 2019
Mohammed Al-Gazal
and
Aalaa Alrashidy
Muna Mohammah Saeed
Mustafa Ameen
Mayada Al-Obaidy
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
icml2004 tutorial on spectral clustering part Izukun
This document provides a tutorial on spectral clustering. It discusses the history and foundations of spectral clustering including graph partitioning, ratio cut, normalized cut and minmax cut objectives. It also covers properties of the graph Laplacian matrix and how to recover partitions from eigenvectors. The document compares different clustering objectives and shows their performance on example datasets. Finally, it discusses extensions of spectral clustering to bipartite graphs.
The document describes a study that investigated the effect of using computer simulations in teaching physics concepts related to oscillations at the undergraduate level. The study aimed to identify difficulties students face in learning oscillations, develop a computer simulation package and assessment tool, and measure the impact of the simulations compared to traditional teaching methods. Results showed that students who used the simulations had significantly higher normalized learning gains compared to the control group on a post-test of oscillations concepts.
AN EFFICIENT PARALLEL ALGORITHM FOR COMPUTING DETERMINANT OF NON-SQUARE MATRI...ijdpsjournal
One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time
complexity of its algorithm. Among all definitions of determinant of rectangular matrices, Radic’s
definition has special features which make it more notable. But in this definition, C(N
M
) sub matrices of the
order m×m needed to be generated that put this problem in np-hard class. On the other hand, any row or
column reduction operation may hardly lead to diminish the volume of calculation. Therefore, in this paper
we try to present the parallel algorithm which can decrease the time complexity of computing the
determinant of non-square matrices to O(N).
Iterative methods for the solution of saddle point problemIAEME Publication
This document summarizes an iterative method for solving saddle point problems that arise in mixed finite element approximations of Stokes fluid flow problems. It presents classical solution methods like primal-dual conjugate gradient algorithms. It then proposes a general primal-dual algorithm that combines these classical methods to solve the coupled primal and dual problems simultaneously. The algorithm defines descent directions as solutions to preconditioned residual equations to minimize both the primal and dual residuals at each iteration.
This document describes an experimental evaluation of combinatorial preconditioners for solving linear systems. It compares Vaidya's algorithm for constructing combinatorial preconditioners to newer algorithms presented by Spielman, including a low-stretch spanning tree constructor and tree augmentation approach. The algorithms were implemented in Java and experimentally evaluated using a test framework on various matrices. The main results found that the new augmentation algorithm did not consistently outperform Vaidya's algorithm, though it did sometimes have significantly better performance. Using low-stretch trees as a basis for augmentation provided a consistent but modest improvement over Vaidya.
Numerical Solutions of Second Order Boundary Value Problems by Galerkin Resid...iosrjce
IOSR Journal of Mathematics(IOSR-JM) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of mathemetics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in mathematics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
IRJET- Classification of Dynkin diagrams & imaginary roots of Quasi hyperboli...IRJET Journal
This document discusses quasi-hyperbolic Kac-Moody algebras, which are a subclass of indefinite Kac-Moody algebras. It begins with background on Kac-Moody algebras and previous work studying different classes. The main results are a classification theorem showing there are 5 * (8C1 + 92C2 + ... + 98C8) possible connected Dynkin diagrams associated with rank 9 quasi-hyperbolic Kac-Moody algebras. It then examines one specific rank 9 quasi-hyperbolic algebra in more detail, providing its generalized Cartan matrix and properties of the root system.
On the Odd Gracefulness of Cyclic Snakes With Pendant EdgesGiselleginaGloria
Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one or both of these or neither. We present four new families of odd graceful graphs. In particular we show an odd graceful labeling of the linear 4 1 kC snake mK − e and therefore we introduce the odd graceful labeling of 4 1 kC snake mK − e ( for the general case ). We prove that the subdivision of linear 3 kC snake − is odd graceful. We also prove that the subdivision of linear 3 kC snake − with m-pendant edges is odd graceful. Finally, we present an odd graceful labeling of the crown graph P mK n 1 e .
The document is an academic paper that discusses odd harmonious labelings of cyclic snake graphs. It contains the following key points:
1) It generalizes previous results by showing that the -nkC snake graph with a string of all 1s is odd harmonious when n is congruent to 0 modulo 4.
2) It proves that the -4kC snake graph with m pendant edges attached to each vertex, for m ≥ k, is odd harmonious for both the linear and general cases.
3) It shows that all subdivisions of the 2kmΔ snake graph are odd harmonious for m ≥ k. Examples are provided to illustrate the theories.
A Quadripartitioned Neutrosophic Pythagorean (QNP) set is a powerful general format framework that generalizes the concept of Quadripartitioned Neutrosophic Sets and Neutrosophic Pythagorean Sets. In this paper, we apply the notion of quadripartitioned Neutrosophic Pythagorean sets to Lie algebras. We develop the concept of QNP Lie subalgebras and QNP Lie ideals. We describe some interesting results of QNP Lie ideals.
In [8] Liang and Bai have shown that the - 4 kC snake graph is an odd harmonious graph for each k ³ 1.
In this paper we generalize this result on cycles by showing that the - n kC snake with string 1,1,…,1 when
n º 0 (mod 4) are odd harmonious graph. Also we show that the - 4 kC snake with m-pendant edges for
each k,m ³ 1 , (for linear case and for general case). Moreover, we show that, all subdivision of 2 k mD -
snake are odd harmonious for each k,m ³ 1 . Finally we present some examples to illustrate the proposed
theories.
The document describes directed graphs and algorithms for analyzing them, including:
- Representing directed graphs using adjacency matrices and relations
- Determining reachability between nodes using the transitive closure of the adjacency relation or powers of the adjacency matrix
- Warshall's algorithm, which computes the transitive closure and reachability by taking the disjunction of the adjacency matrix with its powers up to the number of nodes.
This document discusses fractional calculus and its applications. It begins with an introduction to fractional calculus, which involves defining derivatives and integrals of arbitrary real or complex order. Naive approaches to defining fractional derivatives are inconsistent. The document then motivates a rigorous definition by generalizing the formula for differentiation to non-integer orders. This generalized formula reduces to the standard formula when the order is a positive integer.
Exact Matrix Completion via Convex Optimization Slide (PPT)Joonyoung Yi
Slide of the paper "Exact Matrix Completion via Convex Optimization" of Emmanuel J. Candès and Benjamin Recht. We presented this slide in KAIST CS592 Class, April 2018.
- Code: https://github.com/JoonyoungYi/MCCO-numpy
- Abstract of the paper: We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys
𝑚≥𝐶𝑛1.2𝑟log𝑛
for some positive numerical constant C, then with very high probability, most n×n matrices of rank r can be perfectly recovered by solving a simple convex optimization program. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Similar results hold for arbitrary rectangular matrices as well. Our results are connected with the recent literature on compressed sensing, and show that objects other than signals and images can be perfectly reconstructed from very limited information.
The document describes sparse matrix reconstruction using a matrix completion algorithm. It begins with an overview of the matrix completion problem and formulation. It then describes the algorithm which uses soft-thresholding to impose a low-rank constraint and iteratively finds the matrix that agrees with the observed entries. The algorithm is proven to converge to the desired solution. Extensions to noisy data and generalized constraints are also discussed.
Quadratic Programming : KKT conditions with inequality constraintsMrinmoy Majumder
In the case of Quadratic Programming for optimization, the objective function is a quadratic function. One of the techniques for solving quadratic optimization problems is KKT Conditions which is explained with an example in this tutorial.
A method for solving quadratic programming problems having linearly factoriz...IJMER
A new method namely, objective separable method based on simplex method is proposed for
finding an optimal solution to a quadratic programming problem in which the objective function can be
factorized into two linear functions. The solution procedure of the proposed method is illustrated with the
numerical example.
1. The document describes a heuristic approach for solving the cluster traveling salesman problem (CTSP) using genetic algorithms.
2. The proposed algorithm divides nodes into pre-specified clusters, uses GA to find a Hamiltonian path for each cluster, then combines the optimized cluster paths to form a full tour.
3. The algorithm was tested on symmetric TSPLIB instances and shown to find high quality solutions faster than two other metaheuristic approaches for CTSP.
AN ALPHA -CUT OPERATION IN A TRANSPORTATION PROBLEM USING SYMMETRIC HEXAGONAL...ijfls
In this paper we introduce a new operation on alpha cut for a symmetric hexagonal fuzzy numbers. We considered a transportation problem where the fuzzy demand and supply are in symmetric hexagonal fuzzy numbers and the minimum optimal cost is arrived .Transportation problems have various purposes in logistics and supply process for reducing the transportation cost’s The advantages of the proposed alpha
cut operations over existing methods is simpler and computationally more efficient in day to day applications.
Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...IJERA Editor
This paper presents a solution methodology for transportation problem in an intuitionistic fuzzy environment in
which cost are represented by pentagonal intuitionistic fuzzy numbers. Transportation problem is a particular
class of linear programming, which is associated with day to day activities in our real life. It helps in solving
problems on distribution and transportation of resources from one place to another. The objective is to satisfy
the demand at destination from the supply constraints at the minimum transportation cost possible. The problem
is solved using a ranking technique called Accuracy function for pentagonal intuitionistic fuzzy numbers and
Russell’s Method
Solution of N Queens Problem genetic algorithm MohammedAlKazal
Artificial Intelligence
Supervised by
Dr. Fawzia R.
Mosul university
Computer Sciences Department
Masters Students 2018 - 2019
Mohammed Al-Gazal
and
Aalaa Alrashidy
Muna Mohammah Saeed
Mustafa Ameen
Mayada Al-Obaidy
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
icml2004 tutorial on spectral clustering part Izukun
This document provides a tutorial on spectral clustering. It discusses the history and foundations of spectral clustering including graph partitioning, ratio cut, normalized cut and minmax cut objectives. It also covers properties of the graph Laplacian matrix and how to recover partitions from eigenvectors. The document compares different clustering objectives and shows their performance on example datasets. Finally, it discusses extensions of spectral clustering to bipartite graphs.
The document describes a study that investigated the effect of using computer simulations in teaching physics concepts related to oscillations at the undergraduate level. The study aimed to identify difficulties students face in learning oscillations, develop a computer simulation package and assessment tool, and measure the impact of the simulations compared to traditional teaching methods. Results showed that students who used the simulations had significantly higher normalized learning gains compared to the control group on a post-test of oscillations concepts.
AN EFFICIENT PARALLEL ALGORITHM FOR COMPUTING DETERMINANT OF NON-SQUARE MATRI...ijdpsjournal
One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time
complexity of its algorithm. Among all definitions of determinant of rectangular matrices, Radic’s
definition has special features which make it more notable. But in this definition, C(N
M
) sub matrices of the
order m×m needed to be generated that put this problem in np-hard class. On the other hand, any row or
column reduction operation may hardly lead to diminish the volume of calculation. Therefore, in this paper
we try to present the parallel algorithm which can decrease the time complexity of computing the
determinant of non-square matrices to O(N).
Iterative methods for the solution of saddle point problemIAEME Publication
This document summarizes an iterative method for solving saddle point problems that arise in mixed finite element approximations of Stokes fluid flow problems. It presents classical solution methods like primal-dual conjugate gradient algorithms. It then proposes a general primal-dual algorithm that combines these classical methods to solve the coupled primal and dual problems simultaneously. The algorithm defines descent directions as solutions to preconditioned residual equations to minimize both the primal and dual residuals at each iteration.
This document describes an experimental evaluation of combinatorial preconditioners for solving linear systems. It compares Vaidya's algorithm for constructing combinatorial preconditioners to newer algorithms presented by Spielman, including a low-stretch spanning tree constructor and tree augmentation approach. The algorithms were implemented in Java and experimentally evaluated using a test framework on various matrices. The main results found that the new augmentation algorithm did not consistently outperform Vaidya's algorithm, though it did sometimes have significantly better performance. Using low-stretch trees as a basis for augmentation provided a consistent but modest improvement over Vaidya.
Numerical Solutions of Second Order Boundary Value Problems by Galerkin Resid...iosrjce
IOSR Journal of Mathematics(IOSR-JM) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of mathemetics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in mathematics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
IRJET- Classification of Dynkin diagrams & imaginary roots of Quasi hyperboli...IRJET Journal
This document discusses quasi-hyperbolic Kac-Moody algebras, which are a subclass of indefinite Kac-Moody algebras. It begins with background on Kac-Moody algebras and previous work studying different classes. The main results are a classification theorem showing there are 5 * (8C1 + 92C2 + ... + 98C8) possible connected Dynkin diagrams associated with rank 9 quasi-hyperbolic Kac-Moody algebras. It then examines one specific rank 9 quasi-hyperbolic algebra in more detail, providing its generalized Cartan matrix and properties of the root system.
On the Odd Gracefulness of Cyclic Snakes With Pendant EdgesGiselleginaGloria
Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one or both of these or neither. We present four new families of odd graceful graphs. In particular we show an odd graceful labeling of the linear 4 1 kC snake mK − e and therefore we introduce the odd graceful labeling of 4 1 kC snake mK − e ( for the general case ). We prove that the subdivision of linear 3 kC snake − is odd graceful. We also prove that the subdivision of linear 3 kC snake − with m-pendant edges is odd graceful. Finally, we present an odd graceful labeling of the crown graph P mK n 1 e .
The document is an academic paper that discusses odd harmonious labelings of cyclic snake graphs. It contains the following key points:
1) It generalizes previous results by showing that the -nkC snake graph with a string of all 1s is odd harmonious when n is congruent to 0 modulo 4.
2) It proves that the -4kC snake graph with m pendant edges attached to each vertex, for m ≥ k, is odd harmonious for both the linear and general cases.
3) It shows that all subdivisions of the 2kmΔ snake graph are odd harmonious for m ≥ k. Examples are provided to illustrate the theories.
A Quadripartitioned Neutrosophic Pythagorean (QNP) set is a powerful general format framework that generalizes the concept of Quadripartitioned Neutrosophic Sets and Neutrosophic Pythagorean Sets. In this paper, we apply the notion of quadripartitioned Neutrosophic Pythagorean sets to Lie algebras. We develop the concept of QNP Lie subalgebras and QNP Lie ideals. We describe some interesting results of QNP Lie ideals.
In [8] Liang and Bai have shown that the - 4 kC snake graph is an odd harmonious graph for each k ³ 1.
In this paper we generalize this result on cycles by showing that the - n kC snake with string 1,1,…,1 when
n º 0 (mod 4) are odd harmonious graph. Also we show that the - 4 kC snake with m-pendant edges for
each k,m ³ 1 , (for linear case and for general case). Moreover, we show that, all subdivision of 2 k mD -
snake are odd harmonious for each k,m ³ 1 . Finally we present some examples to illustrate the proposed
theories.
1) The document presents two theorems regarding the absolute weighted mean |,|kAδ-summability of orthogonal series.
2) Theorem 1 states that if a certain series involving the coefficients of the orthogonal series converges, then the orthogonal series is summable |,|kAδ almost everywhere.
3) Theorem 2 is more general, introducing a positive weight sequence ω(n). It states that if another series involving the coefficients and ω(n) converges, then the orthogonal series is summable |,|kAδ almost everywhere.
Abstract Quadripartitioned single valued neutrosophic (QSVN) set is a powerful structure where we have four components Truth-T, Falsity-F, Unknown-U and Contradiction-C. And also it generalizes the concept of fuzzy, initutionstic and single valued neutrosophic set. In this paper we have proposed the concept of K-algebras on QSVN, level subset of QSVN and studied some of the results. In addition to this we have also investigated the characteristics of QSVN Ksubalgebras under homomorphism.
This document discusses using neuro-fuzzy networks to identify parameters for mathematical models of geofields. It proposes a new technique using fuzzy neural networks that can be applied even when data is limited and uncertain in the early stages of modeling. A numerical example is provided to demonstrate the identification of parameters for a regression equation model of a geofield using a fuzzy neural network structure. The network is trained on experimental fuzzy statistical data to determine values for the regression coefficients that satisfy the data. The technique is concluded to have advantages over traditional statistical methods as it can be applied regardless of the parameter distribution and is well-suited for cases with insufficient data in early modeling stages.
This document studies module-algebra structures of the quantum universal enveloping algebra Uq(sl(m+1)) on the coordinate algebra of quantum n-dimensional vector spaces Aq(n). The main results are:
1) A complete classification is given of Uq(sl(m+1)) module-algebra structures on Aq(3) when m ≥ 2 and ki acts as an automorphism of Aq(3).
2) All module-algebra structures of Uq(sl(m+1)) on Aq(2) are characterized with the same method.
3) The module-algebra structures of Uq(sl(m+1)) on Aq(n)
Algorithmic Aspects of Vertex Geo-dominating Sets and Geonumber in GraphsIJERA Editor
In this paper we study about x-geodominating set, geodetic set, geo-set, geo-number of a graph G. We study the
binary operation, link vectors and some required results to develop algorithms. First we design two algorithms
to check whether given set is an x-geodominating set and to find the minimum x-geodominating set of a graph.
Finally we present another two algorithms to check whether a given vertex is geo-vertex or not and to find the
geo-number of a graph.
Algorithmic Aspects of Vertex Geo-dominating Sets and Geonumber in GraphsIJERA Editor
In this paper we study about x-geodominating set, geodetic set, geo-set, geo-number of a graph G. We study the
binary operation, link vectors and some required results to develop algorithms. First we design two algorithms
to check whether given set is an x-geodominating set and to find the minimum x-geodominating set of a graph.
Finally we present another two algorithms to check whether a given vertex is geo-vertex or not and to find the
geo-number of a graph.
The document provides information about a test for candidates applying for an M.Tech in Computer Science. It describes:
1) The test will have two parts - a morning objective test (Test MIII) and an afternoon short answer test (Test CS).
2) The CS test booklet will have two groups - Group A covering analytical ability and mathematics at the B.Sc. pass level, and Group B covering advanced topics in mathematics, statistics, physics, computer science, and engineering at the B.Sc. Hons. and B.Tech. levels.
3) Sample questions are provided for both Group A (mathematical reasoning and basic concepts) and Group B (advanced topics in real analysis
The document describes a test for candidates applying for an M.Tech. in Computer Science. [The test consists of two parts - an objective test in the morning and a short answer test in the afternoon. The short answer test has two groups - Group A covers analytical ability and mathematics at the B.Sc. level, while Group B covers additional topics in mathematics, statistics, physics, computer science, or engineering depending on the candidate's choice.] The document provides sample questions testing concepts in mathematics including algebra, calculus, number theory, and logic.
LADDER AND SUBDIVISION OF LADDER GRAPHS WITH PENDANT EDGES ARE ODD GRACEFULFransiskeran
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireless
communication areas. The aim of this work is to present a new class of odd graceful labeling for the ladder
graph. In particular, we show that the ladder graph Ln with m-pendant Ln mk1 is odd graceful. We also
show that the subdivision of ladder graph Ln with m-pendant S(Ln) mk1 is odd graceful. Finally, we
prove that all the subdivision of triangular snakes ( k snake ) with pendant edges
1
( ) k S snake mk are odd graceful.
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy NumberIJERA Editor
In this paper a general fuzzy maximal flow problem is discussed . A crisp maximal flow problem can be solved
in two methods : linear programming modeling and maximal flow algorithm . Here I tried to fuzzify the
maximal flow algorithm using octagonal fuzzy numbers introduced by S.U Malini and Felbin .C. kennedy [26].
By ranking the octagonal fuzzy numbers it is possible to compare them and using this we convert the fuzzy
valued maximal flow algorithm to a crisp valued algorithm . It is proved that a better solution is obtained when
it is solved using fuzzy octagonal number than when it is solved using trapezoidal fuzzy number . To illustrate
this a numerical example is solved and the obtained result is compared with the existing results . If there is no
uncertainty about the flow between source and sink then the proposed algorithm gives the same result as in crisp
maximal flow problems.
On algorithmic problems concerning graphs of higher degree of symmetrygraphhoc
Since the ancient determination of the five platonic solids the study of symmetry and regularity has always
been one of the most fascinating aspects of mathematics. One intriguing phenomenon of studies in graph
theory is the fact that quite often arithmetic regularity properties of a graph imply the existence of many
symmetries, i.e. large automorphism group G. In some important special situation higher degree of
regularity means that G is an automorphism group of finite geometry. For example, a glance through the
list of distance regular graphs of diameter d < 3 reveals the fact that most of them are connected with
classical Lie geometry. Theory of distance regular graphs is an important part of algebraic combinatorics
and its applications such as coding theory, communication networks, and block design. An important tool
for investigation of such graphs is their spectra, which is the set of eigenvalues of adjacency matrix of a
graph. Let G be a finite simple group of Lie type and X be the set homogeneous elements of the associated
geometry. The complexity of computing the adjacency matrices of a graph Gr on the vertices X such that
Aut GR = G depends very much on the description of the geometry with which one starts. For example, we
can represent the geometry as the totality of 1 cosets of parabolic subgroups 2 chains of embedded
subspaces (case of linear groups), or totally isotropic subspaces (case of the remaining classical groups), 3
special subspaces of minimal module for G which are defined in terms of a G invariant multilinear form.
The aim of this research is to develop an effective method for generation of graphs connected with classical
geometry and evaluation of its spectra, which is the set of eigenvalues of adjacency matrix of a graph. The
main approach is to avoid manual drawing and to calculate graph layout automatically according to its
formal structure. This is a simple task in a case of a tree like graph with a strict hierarchy of entities but it
becomes more complicated for graphs of geometrical nature. There are two main reasons for the
investigations of spectra: (1) very often spectra carry much more useful information about the graph than a
corresponding list of entities and relationships (2) graphs with special spectra, satisfying so called
Ramanujan property or simply Ramanujan graphs (by name of Indian genius mathematician) are important
for real life applications (see [13]). There is a motivated suspicion that among geometrical graphs one
could find some new Ramanujan graphs.
Graph theoretic approach to solve measurement placement problem for power systemIAEME Publication
This document summarizes a research paper that proposes a new graph theoretic approach to solve the measurement placement problem for power system state estimation. The proposed method allows measurement placement without iterative addition by ensuring each branch is incident to power injection measurements at either end or a flow measurement and injection at one end. It was tested on the IEEE 14 bus system and produced a measurement set that maintained observability even after removing a detected bad data point. State estimates using the proposed method were more accurate than two other measurement placement methods according to testing on voltage magnitude and angle errors. The developed method can help design measurement systems to meet state estimator requirements like observability and bad data processing.
EXACT SOLUTIONS OF SCHRÖDINGER EQUATION WITH SOLVABLE POTENTIALS FOR NON PT/P...ijrap
We have obtained explicitly the exact solutions of the Schrodinger equation with Non PT/PT symmetric
Rosen Morse II, Scarf II and Coulomb potentials. Energy eigenvalues and the corresponding
unnormalized wave functions for these systems for both Non PT and PT symmetric are also obtained using
the Nikiforov-Uvarov (NU) method.
ON ALGORITHMIC PROBLEMS CONCERNING GRAPHS OF HIGHER DEGREE OF SYMMETRYFransiskeran
Since the ancient determination of the five platonic solids the study of symmetry and regularity has always
been one of the most fascinating aspects of mathematics. One intriguing phenomenon of studies in graph
theory is the fact that quite often arithmetic regularity properties of a graph imply the existence of many
symmetries, i.e. large automorphism group G. In some important special situation higher degree of
regularity means that G is an automorphism group of finite geometry. For example, a glance through the
list of distance regular graphs of diameter d < 3 reveals the fact that most of them are connected with
classical Lie geometry. Theory of distance regular graphs is an important part of algebraic combinatorics
and its applications such as coding theory, communication networks, and block design. An important tool
for investigation of such graphs is their spectra, which is the set of eigenvalues of adjacency matrix of a
graph. Let G be a finite simple group of Lie type and X be the set homogeneous elements of the associated
geometry.
1) There are two types of vectors - contravariant vectors whose components transform according to Equation 1, and covariant vectors whose components transform according to Equation 2.
2) The dot product of two contravariant or two covariant vectors is not independent of the coordinate system.
3) The dot product of a contravariant and a covariant vector is independent of the coordinate system.
Similar to A Study on the Root Systems and Dynkin diagrams associated with QHA2(1) (20)
TUNNELING IN HIMALAYAS WITH NATM METHOD: A SPECIAL REFERENCES TO SUNGAL TUNNE...IRJET Journal
1) The document discusses the Sungal Tunnel project in Jammu and Kashmir, India, which is being constructed using the New Austrian Tunneling Method (NATM).
2) NATM involves continuous monitoring during construction to adapt to changing ground conditions, and makes extensive use of shotcrete for temporary tunnel support.
3) The methodology section outlines the systematic geotechnical design process for tunnels according to Austrian guidelines, and describes the various steps of NATM tunnel construction including initial and secondary tunnel support.
STUDY THE EFFECT OF RESPONSE REDUCTION FACTOR ON RC FRAMED STRUCTUREIRJET Journal
This study examines the effect of response reduction factors (R factors) on reinforced concrete (RC) framed structures through nonlinear dynamic analysis. Three RC frame models with varying heights (4, 8, and 12 stories) were analyzed in ETABS software under different R factors ranging from 1 to 5. The results showed that displacement increased as the R factor decreased, indicating less linear behavior for lower R factors. Drift also decreased proportionally with increasing R factors from 1 to 5. Shear forces in the frames decreased with higher R factors. In general, R factors of 3 to 5 produced more satisfactory performance with less displacement and drift. The displacement variations between different building heights were consistent at different R factors. This study evaluated how R factors influence
A COMPARATIVE ANALYSIS OF RCC ELEMENT OF SLAB WITH STARK STEEL (HYSD STEEL) A...IRJET Journal
This study compares the use of Stark Steel and TMT Steel as reinforcement materials in a two-way reinforced concrete slab. Mechanical testing is conducted to determine the tensile strength, yield strength, and other properties of each material. A two-way slab design adhering to codes and standards is executed with both materials. The performance is analyzed in terms of deflection, stability under loads, and displacement. Cost analyses accounting for material, durability, maintenance, and life cycle costs are also conducted. The findings provide insights into the economic and structural implications of each material for reinforcement selection and recommendations on the most suitable material based on the analysis.
Effect of Camber and Angles of Attack on Airfoil CharacteristicsIRJET Journal
This document discusses a study analyzing the effect of camber, position of camber, and angle of attack on the aerodynamic characteristics of airfoils. Sixteen modified asymmetric NACA airfoils were analyzed using computational fluid dynamics (CFD) by varying the camber, camber position, and angle of attack. The results showed the relationship between these parameters and the lift coefficient, drag coefficient, and lift to drag ratio. This provides insight into how changes in airfoil geometry impact aerodynamic performance.
A Review on the Progress and Challenges of Aluminum-Based Metal Matrix Compos...IRJET Journal
This document reviews the progress and challenges of aluminum-based metal matrix composites (MMCs), focusing on their fabrication processes and applications. It discusses how various aluminum MMCs have been developed using reinforcements like borides, carbides, oxides, and nitrides to improve mechanical and wear properties. These composites have gained prominence for their lightweight, high-strength and corrosion resistance properties. The document also examines recent advancements in fabrication techniques for aluminum MMCs and their growing applications in industries such as aerospace and automotive. However, it notes that challenges remain around issues like improper mixing of reinforcements and reducing reinforcement agglomeration.
Dynamic Urban Transit Optimization: A Graph Neural Network Approach for Real-...IRJET Journal
This document discusses research on using graph neural networks (GNNs) for dynamic optimization of public transportation networks in real-time. GNNs represent transit networks as graphs with nodes as stops and edges as connections. The GNN model aims to optimize networks using real-time data on vehicle locations, arrival times, and passenger loads. This helps increase mobility, decrease traffic, and improve efficiency. The system continuously trains and infers to adapt to changing transit conditions, providing decision support tools. While research has focused on performance, more work is needed on security, socio-economic impacts, contextual generalization of models, continuous learning approaches, and effective real-time visualization.
Structural Analysis and Design of Multi-Storey Symmetric and Asymmetric Shape...IRJET Journal
This document summarizes a research project that aims to compare the structural performance of conventional slab and grid slab systems in multi-story buildings using ETABS software. The study will analyze both symmetric and asymmetric building models under various loading conditions. Parameters like deflections, moments, shears, and stresses will be examined to evaluate the structural effectiveness of each slab type. The results will provide insights into the comparative behavior of conventional and grid slabs to help engineers and architects select appropriate slab systems based on building layouts and design requirements.
A Review of “Seismic Response of RC Structures Having Plan and Vertical Irreg...IRJET Journal
This document summarizes and reviews a research paper on the seismic response of reinforced concrete (RC) structures with plan and vertical irregularities, with and without infill walls. It discusses how infill walls can improve or reduce the seismic performance of RC buildings, depending on factors like wall layout, height distribution, connection to the frame, and relative stiffness of walls and frames. The reviewed research paper analyzes the behavior of infill walls, effects of vertical irregularities, and seismic performance of high-rise structures under linear static and dynamic analysis. It studies response characteristics like story drift, deflection and shear. The document also provides literature on similar research investigating the effects of infill walls, soft stories, plan irregularities, and different
This document provides a review of machine learning techniques used in Advanced Driver Assistance Systems (ADAS). It begins with an abstract that summarizes key applications of machine learning in ADAS, including object detection, recognition, and decision-making. The introduction discusses the integration of machine learning in ADAS and how it is transforming vehicle safety. The literature review then examines several research papers on topics like lightweight deep learning models for object detection and lane detection models using image processing. It concludes by discussing challenges and opportunities in the field, such as improving algorithm robustness and adaptability.
Long Term Trend Analysis of Precipitation and Temperature for Asosa district,...IRJET Journal
The document analyzes temperature and precipitation trends in Asosa District, Benishangul Gumuz Region, Ethiopia from 1993 to 2022 based on data from the local meteorological station. The results show:
1) The average maximum and minimum annual temperatures have generally decreased over time, with maximum temperatures decreasing by a factor of -0.0341 and minimum by -0.0152.
2) Mann-Kendall tests found the decreasing temperature trends to be statistically significant for annual maximum temperatures but not for annual minimum temperatures.
3) Annual precipitation in Asosa District showed a statistically significant increasing trend.
The conclusions recommend development planners account for rising summer precipitation and declining temperatures in
P.E.B. Framed Structure Design and Analysis Using STAAD ProIRJET Journal
This document discusses the design and analysis of pre-engineered building (PEB) framed structures using STAAD Pro software. It provides an overview of PEBs, including that they are designed off-site with building trusses and beams produced in a factory. STAAD Pro is identified as a key tool for modeling, analyzing, and designing PEBs to ensure their performance and safety under various load scenarios. The document outlines modeling structural parts in STAAD Pro, evaluating structural reactions, assigning loads, and following international design codes and standards. In summary, STAAD Pro is used to design and analyze PEB framed structures to ensure safety and code compliance.
A Review on Innovative Fiber Integration for Enhanced Reinforcement of Concre...IRJET Journal
This document provides a review of research on innovative fiber integration methods for reinforcing concrete structures. It discusses studies that have explored using carbon fiber reinforced polymer (CFRP) composites with recycled plastic aggregates to develop more sustainable strengthening techniques. It also examines using ultra-high performance fiber reinforced concrete to improve shear strength in beams. Additional topics covered include the dynamic responses of FRP-strengthened beams under static and impact loads, and the performance of preloaded CFRP-strengthened fiber reinforced concrete beams. The review highlights the potential of fiber composites to enable more sustainable and resilient construction practices.
Survey Paper on Cloud-Based Secured Healthcare SystemIRJET Journal
This document summarizes a survey on securing patient healthcare data in cloud-based systems. It discusses using technologies like facial recognition, smart cards, and cloud computing combined with strong encryption to securely store patient data. The survey found that healthcare professionals believe digitizing patient records and storing them in a centralized cloud system would improve access during emergencies and enable more efficient care compared to paper-based systems. However, ensuring privacy and security of patient data is paramount as healthcare incorporates these digital technologies.
Review on studies and research on widening of existing concrete bridgesIRJET Journal
This document summarizes several studies that have been conducted on widening existing concrete bridges. It describes a study from China that examined load distribution factors for a bridge widened with composite steel-concrete girders. It also outlines challenges and solutions for widening a bridge in the UAE, including replacing bearings and stitching the new and existing structures. Additionally, it discusses two bridge widening projects in New Zealand that involved adding precast beams and stitching to connect structures. Finally, safety measures and challenges for strengthening a historic bridge in Switzerland under live traffic are presented.
React based fullstack edtech web applicationIRJET Journal
The document describes the architecture of an educational technology web application built using the MERN stack. It discusses the frontend developed with ReactJS, backend with NodeJS and ExpressJS, and MongoDB database. The frontend provides dynamic user interfaces, while the backend offers APIs for authentication, course management, and other functions. MongoDB enables flexible data storage. The architecture aims to provide a scalable, responsive platform for online learning.
A Comprehensive Review of Integrating IoT and Blockchain Technologies in the ...IRJET Journal
This paper proposes integrating Internet of Things (IoT) and blockchain technologies to help implement objectives of India's National Education Policy (NEP) in the education sector. The paper discusses how blockchain could be used for secure student data management, credential verification, and decentralized learning platforms. IoT devices could create smart classrooms, automate attendance tracking, and enable real-time monitoring. Blockchain would ensure integrity of exam processes and resource allocation, while smart contracts automate agreements. The paper argues this integration has potential to revolutionize education by making it more secure, transparent and efficient, in alignment with NEP goals. However, challenges like infrastructure needs, data privacy, and collaborative efforts are also discussed.
A REVIEW ON THE PERFORMANCE OF COCONUT FIBRE REINFORCED CONCRETE.IRJET Journal
This document provides a review of research on the performance of coconut fibre reinforced concrete. It summarizes several studies that tested different volume fractions and lengths of coconut fibres in concrete mixtures with varying compressive strengths. The studies found that coconut fibre improved properties like tensile strength, toughness, crack resistance, and spalling resistance compared to plain concrete. Volume fractions of 2-5% and fibre lengths of 20-50mm produced the best results. The document concludes that using a 4-5% volume fraction of coconut fibres 30-40mm in length with M30-M60 grade concrete would provide benefits based on previous research.
Optimizing Business Management Process Workflows: The Dynamic Influence of Mi...IRJET Journal
The document discusses optimizing business management processes through automation using Microsoft Power Automate and artificial intelligence. It provides an overview of Power Automate's key components and features for automating workflows across various apps and services. The document then presents several scenarios applying automation solutions to common business processes like data entry, monitoring, HR, finance, customer support, and more. It estimates the potential time and cost savings from implementing automation for each scenario. Finally, the conclusion emphasizes the transformative impact of AI and automation tools on business processes and the need for ongoing optimization.
Multistoried and Multi Bay Steel Building Frame by using Seismic DesignIRJET Journal
The document describes the seismic design of a G+5 steel building frame located in Roorkee, India according to Indian codes IS 1893-2002 and IS 800. The frame was analyzed using the equivalent static load method and response spectrum method, and its response in terms of displacements and shear forces were compared. Based on the analysis, the frame was designed as a seismic-resistant steel structure according to IS 800:2007. The software STAAD Pro was used for the analysis and design.
Cost Optimization of Construction Using Plastic Waste as a Sustainable Constr...IRJET Journal
This research paper explores using plastic waste as a sustainable and cost-effective construction material. The study focuses on manufacturing pavers and bricks using recycled plastic and partially replacing concrete with plastic alternatives. Initial results found that pavers and bricks made from recycled plastic demonstrate comparable strength and durability to traditional materials while providing environmental and cost benefits. Additionally, preliminary research indicates incorporating plastic waste as a partial concrete replacement significantly reduces construction costs without compromising structural integrity. The outcomes suggest adopting plastic waste in construction can address plastic pollution while optimizing costs, promoting more sustainable building practices.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...shadow0702a
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
Null Bangalore | Pentesters Approach to AWS IAMDivyanshu
#Abstract:
- Learn more about the real-world methods for auditing AWS IAM (Identity and Access Management) as a pentester. So let us proceed with a brief discussion of IAM as well as some typical misconfigurations and their potential exploits in order to reinforce the understanding of IAM security best practices.
- Gain actionable insights into AWS IAM policies and roles, using hands on approach.
#Prerequisites:
- Basic understanding of AWS services and architecture
- Familiarity with cloud security concepts
- Experience using the AWS Management Console or AWS CLI.
- For hands on lab create account on [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
# Scenario Covered:
- Basics of IAM in AWS
- Implementing IAM Policies with Least Privilege to Manage S3 Bucket
- Objective: Create an S3 bucket with least privilege IAM policy and validate access.
- Steps:
- Create S3 bucket.
- Attach least privilege policy to IAM user.
- Validate access.
- Exploiting IAM PassRole Misconfiguration
-Allows a user to pass a specific IAM role to an AWS service (ec2), typically used for service access delegation. Then exploit PassRole Misconfiguration granting unauthorized access to sensitive resources.
- Objective: Demonstrate how a PassRole misconfiguration can grant unauthorized access.
- Steps:
- Allow user to pass IAM role to EC2.
- Exploit misconfiguration for unauthorized access.
- Access sensitive resources.
- Exploiting IAM AssumeRole Misconfiguration with Overly Permissive Role
- An overly permissive IAM role configuration can lead to privilege escalation by creating a role with administrative privileges and allow a user to assume this role.
- Objective: Show how overly permissive IAM roles can lead to privilege escalation.
- Steps:
- Create role with administrative privileges.
- Allow user to assume the role.
- Perform administrative actions.
- Differentiation between PassRole vs AssumeRole
Try at [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
Software Engineering and Project Management - Introduction, Modeling Concepts...Prakhyath Rai
Introduction, Modeling Concepts and Class Modeling: What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modeling history. Modeling
as Design technique: Modeling, abstraction, The Three models. Class Modeling: Object and Class Concept, Link and associations concepts, Generalization and Inheritance, A sample class model, Navigation of class models, and UML diagrams
Building the Analysis Models: Requirement Analysis, Analysis Model Approaches, Data modeling Concepts, Object Oriented Analysis, Scenario-Based Modeling, Flow-Oriented Modeling, class Based Modeling, Creating a Behavioral Model.