Logo Freelancer
Se connecter S'inscrire
Publier un projet
EXPLORER
C Programming
Electronics
Engineering
Raspberry Pi
Wireless
Photo de couverture du profil
Vous suivez désormais
Erreur de suivi de l'utilisateur.
Cet utilisateur n'utilise pas les utilisateurs à le suivre.
Vous suivez déjà cet utilisateur.
Votre plan d'adhésion ne permet que 0 suivis. Améliorez ici.
Ne suit désormais plus
Erreur lors de l'arrêt du suivi de l'utilisateur.
Vous avez désormais recommandé
Erreur lors de la recommendation de l'utilisateur.
Une erreur a eu lieu. Veuillez rafraîchir la page et réessayer.
E-mail désormais vérifié.
Avatar de l'utilisateur

S R.

@srehant

5,0
1
2,6
2,6
100%

Electronics Engineer - Solution Provider

$15 USD / Heure
・
Drapeau de
Pakistan (1:10 PM)
・
Inscrit depuis le janvier 13, 2017
$15 USD / Heure
・
Engineering Graduate and Solution Provider with 18+ years of hands-on in design and development of * NI CRIO and Labview based system automation and control. * System Identification and Adaptive Fuzzy control simulation using MATLAB/SIMULINK * Pattern Recognition using Nueral Network algorithms (SOM SVM etc) using MATLAB * Arduino/Raspberry Pi based Application development * PLC Based Automation and control * Sensor and Track Fusion using Kalman Filtering
Vérifications
Dans les temps
100 %
Dans le budget
100 %
Taux d'acceptation
100 %
Freelancer Electronics Engineers Pakistan
Voir tous les Electronics Engineers en Pakistan

Portfolio

Portfolio

11590580
Cycloconverters are frequency changers that convert AC power of specific frequency and voltage to different frequency and voltage of AC power without any intermediate DC link. A cycloconverter is a naturally commutated converter in which the output frequency and voltage can be controlled independently and continuously.
3 Phase Cycloconverter Simulation in MATLAB
9957507
Consider relational schema r(A,B,C,D,E,F) Figure attached Proof: AB--> DE Given C-->A Given using pseudo transitivity CB-->DE apply decomposition CB-->D CB-->E CB-->D holds
Using Armstrong axioms
9957480
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
9954640
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
9581052
proof of mathematical Inequalities
proof of mathematical Inequalities
proof of mathematical Inequalities
proof of mathematical Inequalities
9581048
In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. The given system of nonlinear equations converged to desired values of x=1.468 y=0.4 after 6 iterations. The Excel and MATLAB based implementation of Gauss Siedel are also available
GAUSS SIEDEL METHOD FOR SYSTEM OF NONLINEAR EQUATIONS
In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. The given system of nonlinear equations converged to desired values of x=1.468 y=0.4 after 6 iterations. The Excel and MATLAB based implementation of Gauss Siedel are also available
GAUSS SIEDEL METHOD FOR SYSTEM OF NONLINEAR EQUATIONS
In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. The given system of nonlinear equations converged to desired values of x=1.468 y=0.4 after 6 iterations. The Excel and MATLAB based implementation of Gauss Siedel are also available
GAUSS SIEDEL METHOD FOR SYSTEM OF NONLINEAR EQUATIONS
In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. The given system of nonlinear equations converged to desired values of x=1.468 y=0.4 after 6 iterations. The Excel and MATLAB based implementation of Gauss Siedel are also available
GAUSS SIEDEL METHOD FOR SYSTEM OF NONLINEAR EQUATIONS
In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. The given system of nonlinear equations converged to desired values of x=1.468 y=0.4 after 6 iterations. The Excel and MATLAB based implementation of Gauss Siedel are also available
GAUSS SIEDEL METHOD FOR SYSTEM OF NONLINEAR EQUATIONS
11590580
Cycloconverters are frequency changers that convert AC power of specific frequency and voltage to different frequency and voltage of AC power without any intermediate DC link. A cycloconverter is a naturally commutated converter in which the output frequency and voltage can be controlled independently and continuously.
3 Phase Cycloconverter Simulation in MATLAB
9957507
Consider relational schema r(A,B,C,D,E,F) Figure attached Proof: AB--> DE Given C-->A Given using pseudo transitivity CB-->DE apply decomposition CB-->D CB-->E CB-->D holds
Using Armstrong axioms
9957480
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. A system of difference constraints is given in figure. We first model it as a constraint graph. Then we use Bellman-Ford algorithm to either find a feasible solution, or to determine that no feasible solution exists.
Bellman-Ford algorithm on system of diff constraints
9954640
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
An IIR filter is given. Following analytical tasks are performed 1. Calculating difference equation and Z transform. 2. Calculating transfer function H(z) . calculating poles and zeros and filter impulse response. MATLAB tasks 1. Calculating impulse response and compare with the analytic approach. 2. Plotting impulse response, poles and zeros, magnitude and phase of IIR filter
Analysis and simulation of IIR filter
9581052
proof of mathematical Inequalities
proof of mathematical Inequalities
proof of mathematical Inequalities
proof of mathematical Inequalities
9581048
In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. The given system of nonlinear equations converged to desired values of x=1.468 y=0.4 after 6 iterations. The Excel and MATLAB based implementation of Gauss Siedel are also available
GAUSS SIEDEL METHOD FOR SYSTEM OF NONLINEAR EQUATIONS
In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. The given system of nonlinear equations converged to desired values of x=1.468 y=0.4 after 6 iterations. The Excel and MATLAB based implementation of Gauss Siedel are also available
GAUSS SIEDEL METHOD FOR SYSTEM OF NONLINEAR EQUATIONS
In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. The given system of nonlinear equations converged to desired values of x=1.468 y=0.4 after 6 iterations. The Excel and MATLAB based implementation of Gauss Siedel are also available
GAUSS SIEDEL METHOD FOR SYSTEM OF NONLINEAR EQUATIONS
In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. The given system of nonlinear equations converged to desired values of x=1.468 y=0.4 after 6 iterations. The Excel and MATLAB based implementation of Gauss Siedel are also available
GAUSS SIEDEL METHOD FOR SYSTEM OF NONLINEAR EQUATIONS
In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. The given system of nonlinear equations converged to desired values of x=1.468 y=0.4 after 6 iterations. The Excel and MATLAB based implementation of Gauss Siedel are also available
GAUSS SIEDEL METHOD FOR SYSTEM OF NONLINEAR EQUATIONS
Modifications enregistrées
5.0 · 1 Review
Commentaires
Avatar de l'utilisateur
Create Hardware design for Raspberry Pi interacting with an existing machine • €185 EUR
good freelancer who solved my problems
Dominic S.
@sonntagit
•
Drapeau de
Bannewitz, Germany
•
il y a 8 ans
Partager
Expérience
Senior Project Manager
nov., 2001 - Présent
•
23 ans, 2 mois
Zaniel Automation
nov., 2001 - Présent
•
23 ans, 2 mois
Engineering Graduate and Solution Provider with 18+ years of hands-on in design and development of * NI CRIO and Labview based system automation and control.
nov., 2001 - Présent
•
23 ans, 2 mois
Formation
Hamdard University
2014 - 2018
•
4 ans
ME Electrical
Drapeau de
Pakistan
2014 - 2018
•
4 ans
Hamdard University
1995 - 1999
•
4 ans
BE Electronics
Drapeau de
Pakistan
1995 - 1999
•
4 ans
Invitation désormais envoyée !
Merci ! Nous vous avons envoyé un lien par e-mail afin de réclamer votre crédit gratuit.
Une erreur a eu lieu lors de l'envoi de votre e-mail. Veuillez réessayer.
Logo Freelancer France / Français
Aide & Assistance

Freelance

CatégoriesProjetsConcours FreelancesEntreprise Défis d'innovation Développement d'IA AdhésionProgramme de Freelance PréféréGestion de projetEmplois locauxPhoto AnywherePrésentationAPI pour les développeurs Obtenir la certification Application Desktop

À propos

À propos de nousComment cela fonctionneSécuritéInvestisseurPlan du siteHistoiresNouveautésÉquipeRécompensesCommuniqué de presseOffres d'emploi

Termes

Politique de ConfidentialitéTermes et ConditionsPolitique de CopyrightCode de conduiteFrais et charges

Partenaires

Escrow.comLoadshiftWarrior Forum

Applications

Logo d'Apple App StoreLogo Google play
Échec de copie dans le presse-papier, veuillez réessayer après avoir ajuster vos permissions.
Copié dans le presse-papier.

Utilisateurs enregistrés

Total des travaux publiés

Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)

Copyright © 2025 Freelancer Technology Pty Limited (ACN 142 189 759)

Chargement de l'aperçu
Permission donnée pour la géolocalisation.
Votre session de connexion a expiré et vous avez été déconnecté. Veuillez vous connecter à nouveau.