ABSTRACT: In this paper we find the number of zeros of a polynomial inside the unit disc under certain conditions on the coefficients of the polynomial. Mathematics Subject Classification: 30C10, 30C15.
This document presents three theorems that further generalize previous results on the distribution of zeros of polynomials. Theorem 1 states that if the coefficients of a polynomial satisfy certain monotonicity conditions involving parameters λ, ρ, and μ, then the zeros of the polynomial lie within defined disks. Theorem 2 makes a similar statement about the zeros, but applies the conditions to the imaginary coefficients rather than the real coefficients. Theorem 3 gives disk regions containing the zeros when the coefficients satisfy different monotonicity conditions and the arguments of the coefficients are bounded. The theorems reduce to previous results as special cases when certain parameters are set to 1.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The document presents theorems and corollaries that establish upper bounds for the number of zeros an analytic function can have inside the unit disk, based on restrictions on the function's coefficients. Theorem 1 shows that if the coefficients satisfy certain conditions involving inequalities, then the number of zeros does not exceed a given expression involving the coefficients and disk radius. Several corollaries generalize or simplify the results. The theorems are proved using known results about analytic functions and their zeros.
This document describes extending the Elgamal cryptosystem to work with the second group of units of Zn and Z2[x]/<h(x)>, where h(x) is an irreducible polynomial. It first reviews the definition and construction of the second group of units U2(Zn) and U2(Z2[x]/<h(x)>). It then presents the key generation, encryption, and decryption algorithms for the Elgamal cryptosystem adapted to these new settings. The document evaluates the accuracy, efficiency and security of the modified cryptographic scheme through implementation and testing.
The document presents an optimization problem involving sets N and v. It defines the sets A(v), B(v), and C(v) which are related to feasible and optimal solutions. It gives an example where N = {1,2,3}, v assigns values to various subsets of N, and C(v) contains the single optimal solution (10,0,0). It then discusses using epsilon perturbations to solutions to show that other solutions are not optimal.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
The Ring programming language version 1.10 book - Part 81 of 212Mahmoud Samir Fayed
This document describes a cards game application developed using RingQt. The application deals 5 cards to each of two players. Players take turns clicking cards to reveal them. If a card matches another visible card or is a "5", the player earns points and may eat additional matching cards. The game ends when all cards are revealed, and the player with the most points wins. The application displays the cards, scores, and gameplay logic through a graphical user interface built with RingQt widgets.
The document describes an algorithm for solving maximum weight independent set problems on graphs. It defines several notations and concepts used in the algorithm, including the graph (N, v), the set of feasible solutions A(v), and the optimal solution set C(v). It then provides an example graph with nodes 1, 2, 3 and sets constraints on the node weights and optimal solution. The algorithm works by starting from a feasible but non-optimal solution x, and iteratively finding neighboring solutions (y, S) and (z, T) that improve on x according to the problem constraints until an optimal solution is reached.
This document presents three theorems that further generalize previous results on the distribution of zeros of polynomials. Theorem 1 states that if the coefficients of a polynomial satisfy certain monotonicity conditions involving parameters λ, ρ, and μ, then the zeros of the polynomial lie within defined disks. Theorem 2 makes a similar statement about the zeros, but applies the conditions to the imaginary coefficients rather than the real coefficients. Theorem 3 gives disk regions containing the zeros when the coefficients satisfy different monotonicity conditions and the arguments of the coefficients are bounded. The theorems reduce to previous results as special cases when certain parameters are set to 1.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The document presents theorems and corollaries that establish upper bounds for the number of zeros an analytic function can have inside the unit disk, based on restrictions on the function's coefficients. Theorem 1 shows that if the coefficients satisfy certain conditions involving inequalities, then the number of zeros does not exceed a given expression involving the coefficients and disk radius. Several corollaries generalize or simplify the results. The theorems are proved using known results about analytic functions and their zeros.
This document describes extending the Elgamal cryptosystem to work with the second group of units of Zn and Z2[x]/<h(x)>, where h(x) is an irreducible polynomial. It first reviews the definition and construction of the second group of units U2(Zn) and U2(Z2[x]/<h(x)>). It then presents the key generation, encryption, and decryption algorithms for the Elgamal cryptosystem adapted to these new settings. The document evaluates the accuracy, efficiency and security of the modified cryptographic scheme through implementation and testing.
The document presents an optimization problem involving sets N and v. It defines the sets A(v), B(v), and C(v) which are related to feasible and optimal solutions. It gives an example where N = {1,2,3}, v assigns values to various subsets of N, and C(v) contains the single optimal solution (10,0,0). It then discusses using epsilon perturbations to solutions to show that other solutions are not optimal.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
The Ring programming language version 1.10 book - Part 81 of 212Mahmoud Samir Fayed
This document describes a cards game application developed using RingQt. The application deals 5 cards to each of two players. Players take turns clicking cards to reveal them. If a card matches another visible card or is a "5", the player earns points and may eat additional matching cards. The game ends when all cards are revealed, and the player with the most points wins. The application displays the cards, scores, and gameplay logic through a graphical user interface built with RingQt widgets.
The document describes an algorithm for solving maximum weight independent set problems on graphs. It defines several notations and concepts used in the algorithm, including the graph (N, v), the set of feasible solutions A(v), and the optimal solution set C(v). It then provides an example graph with nodes 1, 2, 3 and sets constraints on the node weights and optimal solution. The algorithm works by starting from a feasible but non-optimal solution x, and iteratively finding neighboring solutions (y, S) and (z, T) that improve on x according to the problem constraints until an optimal solution is reached.
This document discusses game theory and bargaining sets. It begins by reviewing the definitions of objections and counter-objections in bargaining situations. It then proves that the bargaining set of a game is always non-empty using the relationship between the bargaining set and the core. As an example, it calculates the core and examines different allocations to determine which belong to the bargaining set for a specific characteristic function game.
This document discusses RNA secondary structure prediction. It begins by defining RNA and its primary and secondary structures. The problem of predicting secondary structure given a primary sequence is introduced. Approaches include physical/chemical experiments and computational prediction using a single sequence. The Nussinov and Zuker algorithms are described. Nussinov finds the structure with maximum base pairs using dynamic programming. Zuker finds the minimum free energy structure also using dynamic programming. Addressing pseudoknots and other interactions is discussed as future work.
The document discusses RNA secondary structure prediction. It explains that RNA molecules can fold into structures through base pairing, and that the secondary structure provides the scaffold for the tertiary structure. It then describes the Nussinov algorithm for predicting the secondary structure with the maximum number of base pairs in quadratic time and space. The algorithm uses a dynamic programming approach to calculate scores for all substructures and find the optimal structure through backtracking.
The document discusses RNA secondary structure prediction using the Nussinov algorithm. It begins by providing background on RNA structure and representation. It then describes the Nussinov algorithm, which calculates the maximum number of base pairs in a RNA sequence using dynamic programming. The algorithm fills a 2D matrix representing all subsequence scores in O(n^3) time and O(n^2) space. Backtracking through the matrix reconstructs the predicted secondary structure.
This document contains problems related to Boolean algebra and logic gates. It asks the reader to:
- Convert between binary, decimal, hexadecimal, and octal number systems
- Derive truth tables for logic gates and Boolean functions
- Use Boolean algebra to simplify and prove equivalences between Boolean functions
- Express Boolean functions in sum of products and product of sums form
- Write Boolean functions in canonical form using minterms and maxterms
The document defines a model for coalition formation with three players (1, 2, 3). It specifies the values of different coalitions and defines the feasible set and payoff functions. It then calculates the payoff functions sij(x) for each pair of players i,j in terms of the values of the different coalitions and the feasible set constraints.
Brief and overall introduction to Artificial Neural Network (ANN).
-history of ANN
-learning technique (backpropagation)
-Generations of Neural net from 1st to 3rd
The Ring programming language version 1.3 book - Part 17 of 88Mahmoud Samir Fayed
This document discusses various file handling functions in Ring including:
- Tempfile() which creates a temporary file that is deleted when closed
- Tempname() which generates a unique temporary file name
- Fseek(), Ftell(), Rewind() which set/get the file position indicator
- Fgetpos(), Fsetpos() which get/set the file position handle
- Clearerr(), Feof(), Ferror() which clear errors or check end-of-file or errors
- Perror() which prints error messages
- Functions for reading/writing characters and strings to files
- Ungetc() which pushes a character back into the stream
- Fread(), Fwrite() which read/write
The Ring programming language version 1.4.1 book - Part 7 of 31Mahmoud Samir Fayed
This document provides documentation on various file handling, system, and debugging functions in Ring. It describes functions for reading and writing files (Fread(), Fwrite()), checking if a file exists (Fexists()), getting environment variables (SysGet()), determining the operating system (IsWindows(), IsLinux(), etc.), handling errors (Try/Catch), executing code dynamically (Eval()), and more. Examples are provided to demonstrate the usage of each function.
Maximizing the spectral gap of networks produced by node removalNaoki Masuda
Presentation slides for the following two papers (currently available in the pdf format only).
(1) T. Watanabe, N. Masuda.
Enhancing the spectral gap of networks by node removal.
Physical Review E, 82, 046102 (2010).
(2) N. Masuda, T. Fujie, K. Murota.
Semidefinite programming for maximizing the spectral gap.
In: Complex Networks IV, Studies in Computational Intelligence, 476, 155-163 (2013).
Secuencias Recursivas, Sucesiones Recursivas & Progresiones con GeogebraJose Perez
This document discusses using Geogebra to model recursive sequences, recursive successions, and recursive progressions. It provides examples of one-parameter and two-parameter recursive functions defined using Geogebra's sequence, iteration list, and zip functions. The examples include linear, exponential, trigonometric, fractional, and other recursive functions over varying number of terms.
The document discusses the challenges of concurrency and performance issues that can arise. It shows how synchronization methods like volatile, atomic, and locks can increase execution time compared to single-threaded code. Locks performed the worst with two threads slowing down execution over 700x. The document then introduces the disruptor pattern which uses ordering and visibility rules to share data between threads in a contention-free way, achieving much higher throughput and lower latency than traditional queues.
More than fifty years ago, Paul Erd˝os and Alfred R´enyi discovered that the random graph G(n, p) underwent a phase transition (in modern language) near p = 1/n. For p a bit smaller (e.g., 0.99/n) all of the components were very small and had simple structures. But for p a bit bigger (e.g., 1.01/n) a “giant component” had emerged with a complex behavior. We now understand how to slow down this process so as to see the incipient giant component (the dominant component) at an early stage and to define a Critical Window through which the process moves from subcriticality to supercriticality.
This document provides examples of common Lisp functions including:
- Functions to calculate powers and square numbers
- A function to count atoms in a Lisp expression
- A function to count all atoms including in subexpressions
- A function to count the number of occurrences of an item in a tree structure
- Three different implementations of a dot product function
The Ring programming language version 1.10 book - Part 38 of 212Mahmoud Samir Fayed
The document provides information about SQLite and PostgreSQL database functions in Ring programming language. It describes functions for initializing and connecting to databases, executing SQL statements, and retrieving and manipulating result sets. Examples are given showing how to create, insert, and select data from database tables using these functions.
On real examples, I’ll explain how we can interpret imperatively written code into “Graph of dependencies” and then convert it to declarative FRP style. It’s not only about the “states”. It’s about sequences of operations also. I’ll introduce some patterns of asynchronous programming like Future and Stream (aka Signal) and explain how effectively they may work.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The Ring programming language version 1.9 book - Part 69 of 210Mahmoud Samir Fayed
This document contains the source code for a 3D Tic-Tac-Toe game written in Ring using the RingAllegro and RingOpenGL libraries. The code defines classes for the game logic, interface, cubes, background, sounds, and end screens. Methods handle loading resources, drawing the scene, detecting user input, checking for a winner, and refreshing the game state. OpenGL is used to render 3D cube textures that represent the game board positions.
In this paper, restricting the coefficients of a polynomial to certain conditions, we locate a region containing all of its zeros. Our results generalize many known results in addition to some interesting results which can be obtained by choosing certain values of the parameters. Mathematics Subject Classification: 30C10, 30C15
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Location of Regions Containing all or Some Zeros of a Polynomialijceronline
In this paper we locate the regions which contain all or some of the zeros of a polynomial when the coefficients of the polynomial are restricted to certain conditions. Mathematics Subject Classification: 30C10, 30C15.
This document discusses game theory and bargaining sets. It begins by reviewing the definitions of objections and counter-objections in bargaining situations. It then proves that the bargaining set of a game is always non-empty using the relationship between the bargaining set and the core. As an example, it calculates the core and examines different allocations to determine which belong to the bargaining set for a specific characteristic function game.
This document discusses RNA secondary structure prediction. It begins by defining RNA and its primary and secondary structures. The problem of predicting secondary structure given a primary sequence is introduced. Approaches include physical/chemical experiments and computational prediction using a single sequence. The Nussinov and Zuker algorithms are described. Nussinov finds the structure with maximum base pairs using dynamic programming. Zuker finds the minimum free energy structure also using dynamic programming. Addressing pseudoknots and other interactions is discussed as future work.
The document discusses RNA secondary structure prediction. It explains that RNA molecules can fold into structures through base pairing, and that the secondary structure provides the scaffold for the tertiary structure. It then describes the Nussinov algorithm for predicting the secondary structure with the maximum number of base pairs in quadratic time and space. The algorithm uses a dynamic programming approach to calculate scores for all substructures and find the optimal structure through backtracking.
The document discusses RNA secondary structure prediction using the Nussinov algorithm. It begins by providing background on RNA structure and representation. It then describes the Nussinov algorithm, which calculates the maximum number of base pairs in a RNA sequence using dynamic programming. The algorithm fills a 2D matrix representing all subsequence scores in O(n^3) time and O(n^2) space. Backtracking through the matrix reconstructs the predicted secondary structure.
This document contains problems related to Boolean algebra and logic gates. It asks the reader to:
- Convert between binary, decimal, hexadecimal, and octal number systems
- Derive truth tables for logic gates and Boolean functions
- Use Boolean algebra to simplify and prove equivalences between Boolean functions
- Express Boolean functions in sum of products and product of sums form
- Write Boolean functions in canonical form using minterms and maxterms
The document defines a model for coalition formation with three players (1, 2, 3). It specifies the values of different coalitions and defines the feasible set and payoff functions. It then calculates the payoff functions sij(x) for each pair of players i,j in terms of the values of the different coalitions and the feasible set constraints.
Brief and overall introduction to Artificial Neural Network (ANN).
-history of ANN
-learning technique (backpropagation)
-Generations of Neural net from 1st to 3rd
The Ring programming language version 1.3 book - Part 17 of 88Mahmoud Samir Fayed
This document discusses various file handling functions in Ring including:
- Tempfile() which creates a temporary file that is deleted when closed
- Tempname() which generates a unique temporary file name
- Fseek(), Ftell(), Rewind() which set/get the file position indicator
- Fgetpos(), Fsetpos() which get/set the file position handle
- Clearerr(), Feof(), Ferror() which clear errors or check end-of-file or errors
- Perror() which prints error messages
- Functions for reading/writing characters and strings to files
- Ungetc() which pushes a character back into the stream
- Fread(), Fwrite() which read/write
The Ring programming language version 1.4.1 book - Part 7 of 31Mahmoud Samir Fayed
This document provides documentation on various file handling, system, and debugging functions in Ring. It describes functions for reading and writing files (Fread(), Fwrite()), checking if a file exists (Fexists()), getting environment variables (SysGet()), determining the operating system (IsWindows(), IsLinux(), etc.), handling errors (Try/Catch), executing code dynamically (Eval()), and more. Examples are provided to demonstrate the usage of each function.
Maximizing the spectral gap of networks produced by node removalNaoki Masuda
Presentation slides for the following two papers (currently available in the pdf format only).
(1) T. Watanabe, N. Masuda.
Enhancing the spectral gap of networks by node removal.
Physical Review E, 82, 046102 (2010).
(2) N. Masuda, T. Fujie, K. Murota.
Semidefinite programming for maximizing the spectral gap.
In: Complex Networks IV, Studies in Computational Intelligence, 476, 155-163 (2013).
Secuencias Recursivas, Sucesiones Recursivas & Progresiones con GeogebraJose Perez
This document discusses using Geogebra to model recursive sequences, recursive successions, and recursive progressions. It provides examples of one-parameter and two-parameter recursive functions defined using Geogebra's sequence, iteration list, and zip functions. The examples include linear, exponential, trigonometric, fractional, and other recursive functions over varying number of terms.
The document discusses the challenges of concurrency and performance issues that can arise. It shows how synchronization methods like volatile, atomic, and locks can increase execution time compared to single-threaded code. Locks performed the worst with two threads slowing down execution over 700x. The document then introduces the disruptor pattern which uses ordering and visibility rules to share data between threads in a contention-free way, achieving much higher throughput and lower latency than traditional queues.
More than fifty years ago, Paul Erd˝os and Alfred R´enyi discovered that the random graph G(n, p) underwent a phase transition (in modern language) near p = 1/n. For p a bit smaller (e.g., 0.99/n) all of the components were very small and had simple structures. But for p a bit bigger (e.g., 1.01/n) a “giant component” had emerged with a complex behavior. We now understand how to slow down this process so as to see the incipient giant component (the dominant component) at an early stage and to define a Critical Window through which the process moves from subcriticality to supercriticality.
This document provides examples of common Lisp functions including:
- Functions to calculate powers and square numbers
- A function to count atoms in a Lisp expression
- A function to count all atoms including in subexpressions
- A function to count the number of occurrences of an item in a tree structure
- Three different implementations of a dot product function
The Ring programming language version 1.10 book - Part 38 of 212Mahmoud Samir Fayed
The document provides information about SQLite and PostgreSQL database functions in Ring programming language. It describes functions for initializing and connecting to databases, executing SQL statements, and retrieving and manipulating result sets. Examples are given showing how to create, insert, and select data from database tables using these functions.
On real examples, I’ll explain how we can interpret imperatively written code into “Graph of dependencies” and then convert it to declarative FRP style. It’s not only about the “states”. It’s about sequences of operations also. I’ll introduce some patterns of asynchronous programming like Future and Stream (aka Signal) and explain how effectively they may work.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The Ring programming language version 1.9 book - Part 69 of 210Mahmoud Samir Fayed
This document contains the source code for a 3D Tic-Tac-Toe game written in Ring using the RingAllegro and RingOpenGL libraries. The code defines classes for the game logic, interface, cubes, background, sounds, and end screens. Methods handle loading resources, drawing the scene, detecting user input, checking for a winner, and refreshing the game state. OpenGL is used to render 3D cube textures that represent the game board positions.
In this paper, restricting the coefficients of a polynomial to certain conditions, we locate a region containing all of its zeros. Our results generalize many known results in addition to some interesting results which can be obtained by choosing certain values of the parameters. Mathematics Subject Classification: 30C10, 30C15
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Location of Regions Containing all or Some Zeros of a Polynomialijceronline
In this paper we locate the regions which contain all or some of the zeros of a polynomial when the coefficients of the polynomial are restricted to certain conditions. Mathematics Subject Classification: 30C10, 30C15.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
The document presents several theorems that generalize the Enestrom-Kakeya theorem about zero-free regions for polynomials with restricted coefficients. Theorem 1 shows that if the coefficients of a polynomial satisfy certain inequalities involving parameters k and ρ, then the polynomial does not vanish in a specified disk. Theorem 2 gives a similar result involving parameters ρ and τ. Theorem 3 is a special case of Theorem 2. The proofs involve manipulating inequalities involving the coefficients and applying the properties of zeros of polynomials.
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
The document summarizes two theorems regarding the zeros of analytic functions whose coefficients are restricted to certain conditions. Theorem 1 generalizes an earlier result by showing that if the coefficients satisfy certain inequalities, the function does not vanish in a specified region, which reduces to a previous result when certain parameters are set to specific values. Theorem 2 further generalizes the results by considering another set of inequalities on the coefficients and proving the function does not vanish in a different region, which also reduces to an earlier theorem under certain conditions. The proofs of the theorems use a lemma and apply Schwarz's lemma to derive the zero-free regions.
The document discusses bounds on the number of zeros that polynomials can have in ring-shaped regions of the complex plane. It summarizes previous results that provide upper bounds on zeros in disks and annuli when the polynomial coefficients satisfy certain constraints. The author then proves new theorems that generalize previous results by providing bounds on zeros in ring-shaped regions under more generalized coefficient constraints. The bounds depend on the coefficients, degree of the polynomial, and parameters defining the ring-shaped region.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
1) The document presents theorems on the number and location of zeros of polynomials and analytic functions.
2) Theorem 1 shows that if a polynomial's coefficients satisfy certain conditions, it will have at least p zeros within a given region.
3) Theorem 2 generalizes this to the case where the coefficients are complex numbers.
4) Theorem 3 proves a similar result for the zeros of analytic functions within a disk, under conditions on the function's Taylor coefficients.
Stability Result of Iterative procedure in normed spaceKomal Goyal
The document summarizes the stability of Jungck-Noor iterative schemes for maps satisfying a general contractive condition in normed spaces. It defines the Jungck-Noor iterative scheme and establishes that the scheme is (S,T)-stable if S and T satisfy a contractive condition involving a monotone decreasing sequence. The proof uses previous lemmas and shows that if the iterative scheme converges to a point p, and another sequence converges to p, then the other sequence also converges to p, establishing the stability of the iterative scheme.
A Ring-Shaped Region Containing All or A Specific Number of The Zeros of A Po...IJERDJOURNAL
ABSTRACT: According to a Cauchy’s classical result all the zeros of a polynomial n j j j P z a z 0 ( ) of degree n lie in z 1 A , where n j j n a a A max0 1 . In this paper we find a ring-shaped region containing all or a specific number of zeros of P(z). Mathematics Subject Classification: 30C10, 30C15.
International Journal of Computational Engineering Research(IJCER)ijceronline
The document summarizes previous research on bounding the number of zeros of polynomials in certain regions. It presents four theorems (Theorems A-D) from previous works that provide upper bounds on the number of zeros inside circles or annuli based on the coefficients of the polynomials. The paper then proves a new Theorem 1, which establishes that a polynomial P(z) with certain coefficient properties has no zeros in the region z < a0/M1 for R ≥ 1 or z < a0/M2 for R ≤ 1, where M1 and M2 are defined in terms of the polynomial coefficients. Combining this with Theorem D gives a new Theorem 2, which provides upper bounds on the number of zeros inside rings
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
On Convergence of Jungck Type Iteration for Certain Contractive Conditionsresearchinventy
In this article we prove the strong convergence result for a pair of nonself mappings using Jungck S- iterative scheme in Convex metric spaces satisfying certain contractive condition. The results are the generalization of some existing results in the literature
Analytic Solutions of an Iterative Functional Differential Equation with Dela...inventionjournals
ABSTRACT : This This paper is concerned with an iterative functional differential equation with the form
z C
x z
b
x az
x z
,
)
( )
(
1
( ) .By constructing a convergent power series solution of an auxiliary equation
b [ag(z) g( z)] [g( z) ag( z)][ g( z) ag(z)] g(z), zC 2 2 2
the analytic solutions for the original equation are obtained. We not only discuss the constant given in Schröder
transformation at resonance( i.e., at a root of the unity), but also discuss those near resonance (i.e., near a
root of the unity) under Brjuno condition.
The Analytical Nature of the Greens Function in the Vicinity of a Simple Poleijtsrd
It is known that the Green function of a boundary value problem is a meromorphic function of a spectral parameter. When the boundary conditions contain integro differential terms, then the meromorphism of the Greens function of such a problem can also be proved. In this case, it is possible to write out the structure of the residue at the singular points of the Greens function of the boundary value problem with integro differential perturbations. An analysis of the structure of the residue allows us to state that the corresponding functions of the original operator are sufficiently smooth functions. Surprisingly, the adjoint operator can have non smooth eigenfunctions. The degree of non smoothness of the eigenfunction of the adjoint operator to an operator with integro differential boundary conditions is clarified. It is indicated that even those conjugations to multipoint boundary value problems have non smooth eigenfunctions. Ghulam Hazrat Aimal Rasa "The Analytical Nature of the Green's Function in the Vicinity of a Simple Pole" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-6 , October 2020, URL: https://www.ijtsrd.com/papers/ijtsrd33696.pdf Paper Url: https://www.ijtsrd.com/mathemetics/applied-mathamatics/33696/the-analytical-nature-of-the-greens-function-in-the-vicinity-of-a-simple-pole/ghulam-hazrat-aimal-rasa
In this paper, we consider the scaling invariant spaces for fractional Navier-Stokes in the
Lebesgue spaces ( ) p n L R and homogeneous Besov spaces
, ( ) s n
p q B R respectively.
Similar to On the Zeros of A Polynomial Inside the Unit Disc (20)
Predictive Data Mining with Normalized Adaptive Training Method for Neural Ne...IJERDJOURNAL
Abstract:- Predictive data mining is an upcoming and fast-growing field and offers a competitive edge for the benefit of organization. In recent decades, researchers have developed new techniques and intelligent algorithms for predictive data mining. In this research paper, we have proposed a novel training algorithm for optimizing neural networks for prediction purpose and to utilize it for the development of prediction models. Models developed in MATLAB Neural Network Toolbox have been tested for insurance datasets taken from a live data warehouse. A comparative study of the proposed algorithm with other popular first and second order algorithms has been presented to judge the predictive accuracy of the suggested technique. Various graphs have been presented to analyse the convergence behaviour of different algorithms towards point of minimum error.
The development of the Islamic Heritage in Southeast Asia tradition and futur...IJERDJOURNAL
ABSTRACT: This research explores the historical development of Islamic architecture in Southeast Asia from the first idea to design a mosque by the Prophet Mohammad until the development at these days with the various purism passages And as developed up these days with the passages of the development of the traditional type to the postmodern, finally to modern Southeast Asia. The Islamic architecture has been developed in six traditional typologies of types of mosques is renowned throughout the world. Southeast Asia mosques are divided into various types according to the regional culture as Arabic type, Turkish type, the Iranian type, the Indian type, the Chinese type and South East Asian type. This research describes the main characteristics of these types. The main purpose of this research is to draw a correlation between the descriptions of the mosques in Malaysia as presented in the traditional typology that contains in its features in main types, relations in common throughout the Islamic world, however, distinguishes itself with the architectural form according to the local tradition.
An Iot Based Smart Manifold Attendance SystemIJERDJOURNAL
ABSTRACT:- Attendance has been an age old procedure employed in different disciplines of educational institutions. While attendance systems have witnessed growth right from manual techniques to biometrics, plight of taking attendance is undeniable. In fingerprint based attendance monitoring, if fingers get roughed / scratched, it leads to misreading. Also for face recognition, students will have to make a queue and each one will have to wait until their face gets recognised. Our proposed system is employing “manifold attendance” that means employing passive attendance, where at a time, the attendance of multiple people can get captured. We have eliminated the need of queue system / paper-pen system of attendance, and just with a single click the attendance is not only captured, but monitored as well, that too without any human intervention. In the proposed system, creation of database and face detection is done by using the concepts of bounding box, whereas for face recognition we employ histogram equalization and matching technique.
A Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSNIJERDJOURNAL
ABSTRACT: In multi-hop ad hoc networks there exists a problem of identifying and isolating misbehaving nodes which refuses to forward packets. Audit-based Misbehavior Detection (AMD) is a comprehensive system that effectively and efficiently isolates both continuous and selective packet droppers. The AMD system integrates reputation management, trustworthy route discovery, and identification of misbehaving nodes based on behavioral audits. Compared to previous methods, AMD evaluates node behavior on a per-packet basis, without employing energy-expensive overhearing techniques or intensive acknowledgment schemes. Moreover, AMD can detect selective dropping attacks even if end-to-end traffic is encrypted and can be applied to multichannel networks or networks consisting of nodes with directional antennas. This work implements the AMD approach by considering the rushing attack. The analysis of the results confirms that AMD based method with rushing attack performs better as compared to the non rushing attack.
Human Resource Competencies: An Empirical AssessmentIJERDJOURNAL
ABSTRACT: Human beings are the essential part of the process. Today, technology and machines are taking over the human resource, as claimed by many people; but technology and machines can never replace human resource entirely. Humans are required for operating and maintaining these machines. Human resource is extremely important for developing or bringing about new and required changes to these machines and technologies. The study of the history and the current Human Resource Management trends points out some important facts
Prospects and Problems of Non-Governmental Organizations in Poverty Alleviati...IJERDJOURNAL
ABSTRACT: The World Bank sponsored Millennium Development Goals (MDGs), launched in 1990 envisaged a world free of poverty by the year 2015. The North-East (where Gombe State is centrally located) is experiencing significantly higher poverty and lack of progress in poverty reduction efforts. With coming to end of 2015, much still need to be done to attain the MDGs. With over 62.6% Nigerian population still very poor, there is need for a continuous search for alternative planning & development options that would help ameliorate poverty and sustained our dream for a world free of poverty and wants. This study examines the prospects and investigates the constraints of Non-Governmental Organizations (NGOs) in poverty alleviation and community development. Literature review, questionnaire and interview methods were used for the study. The findings revealed that: finance, continuity of projects/programmes, conflicts and insecurity were the major problems confronting the NGOs. An interesting revelation is that majority of the respondents indicated that they wait for the NGOs or Government to initiate poverty alleviation programmes/projects. The implication is that the community dwellers need attitudinal change necessary for self reliance. The prospect of NGOs in poverty alleviation and community development in the study area is very bright due to rapid population growth & increasing poverty levels with the attendant positive effects on urban planning and regional development. The study recommends that NGOs should (1) form an association to enable them work together, and utilize social capital in their operation/services. (2) seek to explore avenues for funding from donor agencies. Finally, the Government needs to address some of its short comings.
Development of Regression Model Using Lasso And Optimisation of Process Param...IJERDJOURNAL
ABSTRACT:- Metal Spinning is a concept of describing the forming of metal into seamless, axisymmetric shapes by a combination of rotational motion and force. Sheet metal spinning is one of the metal forming processes, which a flat metal blank is rotated at a high speed and formed into an axisymmetric part by a roller which gradually forces the blank on to a mandrel, bearing the final shape of the spun part. Over the last few decades, sheet metal spinning has developed significantly and spun products have been used in various industries. Nowadays the process has been expanded to new horizons in industries, since tendency to use minimum tool and equipment costs and also using lower forces with the output of excellent surface quality and good mechanical properties. The automation of the process is of greater importance, due to its wider applications like decorative household‟s goods, rocket nose cones, gas cylinders etc. The objective of the current work is to develop the mathematical model for the spinning process with surface roughness as response and the input parameters as Mandrel speed (rpm), geometry of the Roller and Thickness of sheet (mm). Type of mandrel (EN8 Material) considered in the spinning process has the geometrical profile of parabola and single roller and double roller tools (EN8 Material) are used to deform the Al2024-T3 sheet metal paper aims to understand the process parameters that affect the surface finish of the spun component. Full factorial Design of Experiments technique is used to find the minimum number of experimental trials that are required to develop the regression model. A regression model using Least Absolute Shrinkage and Selection Operator (Lasso) is developed to further deepen the understanding between the input parameters and the surface roughness. The model was optimised using Sequential Quadratic Programming.
Use of Satellite Data for Feasibility Study And Preliminary Design Project Re...IJERDJOURNAL
ABSTRACT: In the developing countries like India, need of infrastructure is very high as compared to the available resources. The various organizations put their demands to state and center government for sanction of their project, government depends upon its various department to provide an approximate cost so that priorities can be assigned. The conventional procedure depends upon the land surveying, collection of data from various departments resulting in delay in necessary decision making or some time shelving due to unreasonable cost estimate due to field data being very old. Survey of India, The National Survey and Mapping Organization single handily taking this responsibility thus up gradation of data is far behind the actual development. From the satellite data, which is available in the form of images and terrains (even in 3d LiDAR points for some areas) is very useful for Feasibility Study, and Preliminary Project Report. In the present study natural drain named „Chai Nala‟ meanders through the prime property of Greater Mohali Area Development Authority (GMADA) thus making a big chunk of commercial land inoperative. It was proposed to straighten and channelize to reclaim the land from drain regime. Being the precious land department wanted the most economical and technically sound design without taking any risk. It was decided to counter check the hydraulic data, ground profile, acquired from the Punjab Irrigation Department with the satellite data and Differential Global Positioning System (DGPS). The data from the Google Earth was acquired using Cad Earth software and water shed analysis was carried out using Autodesk Civil 3D software. Comparison of results shows that this technique is quite useful and can be for preliminary feasibility and project preparation. Thus saving huge money and time.
Microwave Assisted Sol Gel Synthesis of Magnesium Oxide(Mgo)IJERDJOURNAL
ABSTRACT: Magnesium oxide (MgO) nanoparticles have been synthesized by Microwave assisted Sol gel synthesis method by using the precursors citric acid (C2O4H2) and magnesium chloride (Mgcl2.6H2O). It is a simple, novel and cost effective method. The structure, morphology and crystalline phase of the magnesium oxide nanocrystals have been investigated by scanning electron microscopy (SEM), transmission electron microscopy (TEM), X-ray diffraction (XRD).Presence of functional groups and optical characters are analyzed by using FTIR and UV- visible techniques
Development of Enhanced Frequency Drive for 3-Phase Induction Motors Submitte...IJERDJOURNAL
ABSTRACT: Three-phase induction motors produce mechanical power by electromagnetic induction and run on a 3-phase ac supply. They require efficient speed control, to enable them do variable speed operations, save power consumption and reduce machine noise. In this dissertation, a new switching device called MosControlled Thyristor (MCT) for frequency drive is introduced. Based on the new switching device and AT89C52 microcontroller, an enhanced frequency drive for controlling the speed and torque of 3-phase 15kW squirrel cage induction motor is modeled. Different voltages ranging from 342V to 415V and frequencies ranging from 50Hz to 60Hz are used in a systematic manner to simulate the system based on the new switching device. The simulation program is written in C language and tested with Proteus 7.6 simulation software. Voltage and frequency have significant impact on the actual speed and torque of the motor. Simulation results show that with the new model, the torque (56.66Nm) developed by the motor which is constant throughout each speed range is directly proportional to the ratio (6.7:1) of the applied voltage and the frequency of the supply and the selected speeds (1450, 1510, 1570, 1630, 1690 and 1750 rpm) are locked irrespective of change in load. This is unlike other models where magnetic saturation and conduction drop of IGBT lead to voltage/frequency imbalance resulting in excessive drawing of current by the motor and overheating. This new control method has a speed regulation of ±2 to 3% of maximum frequency, speed response of 3Hz, speed control range of 1: 40 and efficiency of 88%, as further advantages. Comparison of the system with other speed control techniques shows improved energy-saving, cost effectiveness and safety in operation. The contributions of this research aim to make Volts per Hertz speed control method based on MCT a reliable better alternative to other well known methods in speed control of three-phase induction motors
Short-Term Load Forecasting Using ARIMA Model For Karnataka State Electrical ...IJERDJOURNAL
ABSTRACT: Short-term load forecasting is a key issue for reliable and economic operation of power systems. This paper aims to develop short-term electric load forecasting ARIMA Model for Karnataka Electrical Load pattern based on Stochastic Time Series Analysis. The logical and organised procedures for model development using Autocorrelation Function and Partial Autocorrelation Function make ARIMA Model particularly attractive. The methodology involves Initial Model Development Phase, Parameter Estimation Phase and Forecasting Phase. To confirm the effectiveness, the proposed model is developed and tested using the historical data of Karnataka Electrical Load pattern (2016). The forecasting error of ARIMA Model is computed and results have shown favourable forecasting accuracy.
Optimal Pricing Policy for a Manufacturing Inventory Model with Two Productio...IJERDJOURNAL
ABSTRACT: When a new product is launched, a manufacturer applies the strategy of offering a quantity incentive initially for some time to boost up the demand of the product. The present paper describes a manufacturing inventory model with price sensitive demand enhanced by a quantity incentive. Later on demand becomes time increasing also. Inventory cycle starts with low production rate which is followed by higher production rate when demand is boosted up. Shortages are not allowed in this model. Presentation of numerical examples, tables, graphs and sensitivity analysis describes the model very well. Lastly case without incentive illustrates that usually the quantity incentive offered initially is beneficial.
Analysis of failure behavior of shear connection in push-out specimen by thre...IJERDJOURNAL
ABSTRACT:- This study analyzes the failure mechanism of shear connection by three-dimensional finite element analysis (FEA) of push-out specimens that was practically unaffordable experimentally or by twodimensional FEA. For the analysis of the failure behavior of the compression strut formed in the loaded concrete member, the three-dimensional principal stress space is transformed into two-dimensional space by means of the relation between the hydrostatic stress and the deviatoric stress. The analysis of the stress state in the compression strut revealed that the deviatoric stress increases with larger load particularly in the concrete surrounding the lower part of the shear stud. Accordingly, bearing failure of concrete occurred locally within a limited region in the slab. The steep increase of the deviatoric stress accompanying the increase of the load resulted in the failure of concrete around the lower part of the shear stud, which in turn provoked the deformation and the development of bending moment of the shear stud. Finally, plastic hinge formed in the shear stud leading it to reach its limit state. The proposed finite element model can also be used to model the shear connection of the composite beam and, the proposed stress analysis method can be applied to analyze its composite action behavior.
Discrete Time Batch Arrival Queue with Multiple VacationsIJERDJOURNAL
ABSTRACT:- In this paper we consider a discrete time batch arrival queueing system with multiple vacations. It is assume that the service of customers arrived in the system between a fixed intervals of time after which the service goes on vacations after completion of one service of cycle is taken up at the boundaries of the fixed duration of time. This is the case of late arrival. In case of early arrival i.e. arrival before the start of next cycles of service. If the customer finds the system empty, it is served immediately. We prove the Stochastic decomposition property for queue length and waiting time distribution for both the models.
Regional Rainfall Frequency Analysis By L-Moments Approach For Madina Region,...IJERDJOURNAL
ABSTRACT:- In arid regions, extreme rainfall event frequency predictions are still a challenging problem, because of the rain gauge stations scarcity and the record length limitation, which are usually short to insure reliable quantile estimates. Regional frequency analysis is one of the popular approaches used to compensate the data limitation. In this paper, regional frequency analysis of maximum daily rainfall is investigated for Madinah province in the Western Kingdom of Saudi Arabia (KSA). The observed maximum daily rainfall records of 20 rainfall stations are selected from 1968 to 2015. The rainfall data is evaluated using four tests, namely, Discordance test (Di), Homogeneity test (H), Goodness of fit test (Zdist) and L-moment ratios diagram (LMRD). The Di of L-moments shows that all the sites belong to one group (Di <3.0).><1). Finally, the Zdist is used to evaluate five probability distribution functions (PDFs) including generalized logistic (GLO), generalized extreme value (GEV), generalized normal (GNO), generalized Pareto (GPA), and Pearson Type III (PE3). Zdist and LMRD both showed that PE3 distribution is the best among the other PDFs. The regional parameters of the candidate PDF are computed using L-moments approach and accordingly the regional dimensionless growth curve is developed. The results enhance the accuracy of extreme rainfall prediction at-sites and also they can be used for ungauged catchment in the region.
Implementing Oracle Utility-Meter Data Management For Power ConsumptionIJERDJOURNAL
ABSTRACT: In this digital mobile world, it‟s need of time to streamline and increase efficiency in business processes like effective data collection, measurement, automatic validation, editing and estimation of measurement data, analysis and dashboard for forecasting and ease in end user accessibility with Just in Time. This paper is following two methodology in this process. CEMLI is an extensive framework for developing and implementing for Oracle whereas OUM is business process and use case driven process which supports products, tool, technologies and documentation. This paper have focused on analytical data, system automation functionality along with prototype designing. For this, analysts and administrators will collect and define calculation rule for data collection and measurement, deployment methods, dashboards and security features. This paper gives measure understanding of cloud technologies and their features like services (SaaS), deployment methods, security and ability to reduce overhead cost, downtime, and automate business processes with 360 degree review and analysis. It consolidates data in one system with volumes of analog and interval data which facilitates new customer with offering and effective program. Also it maximizes return on investments and protects revenue through comprehensive exception management.
Business Intelligence - A Gift for Decision Maker for the Effective Decision ...IJERDJOURNAL
ABSTRACT: Business Intelligence is a socio-technical concept emerged to help managers especially in their decision making tasks. A manager with different decision making styles has been started to make use of business intelligence in their own ways. Are the all managers taking benefits of Business intelligence in the same way? Does Business intelligence give each category what they want in the decision making process? If the answer to these questions is – No, then what is the expectation of managers from BI having different decision making style? Will BI could satisfy their needs? If yes, then how? By using well-formed theory in different styles of decision making and taking BI capabilities into consideration this paper highlights the framework which defines appropriate BI capabilities with each decision making style. Study shows in order to serve each style of decision in which BI capabilities changes with respect to style. It is believed that by making BI customized based on decision making styles; BI would be the much more successful in serving all the categories of managers
Effect of Water And Ethyl Alcohol Mixed Solvent System on the Stability of Be...IJERDJOURNAL
This document discusses the effect of water and ethyl alcohol mixed solvent systems on the stability of metal complexes formed between beta-hydroxy ketone and benzotriazole ligands. The study examines ternary complexes of copper, nickel, zinc, and cobalt ions with different beta-hydroxy ketone and benzotriazole derivatives. The stabilities of the complexes were determined using pH metric titration and found to vary with the solvent composition. Intramolecular interactions between the ligands were found to contribute significantly to complex stability. Copper formed the most stable complexes while cobalt formed the least stable.
Design of Synthesizable Asynchronous FIFO And Implementation on FPGAIJERDJOURNAL
ABSTRACT: This paper presents a design of asynchronous FIFO which, along with the regular status signals, consists of some extra status signals for more user-friendly design and added safety. Gray code pointers are used in the design. For synchronisation purpose, two synchroniser modules are used which contain two D-flip-flops each. The design is implemented and synthesised at register transfer level (RTL) using Verilog HDL. Simulation and implementation is done using Xilinx ISE Design Suite. Further, the design is implemented on Basys 2 Spartan-3E FPGA Board. Asynchronous FIFO is used to carry out steady data transmission at high speeds between two asynchronous clock domains.
Prospect and Challenges of Renewable Energy Resources Exploration, Exploitati...IJERDJOURNAL
ABSTRACT: This paper enumerates the status and challenges of exploration, exploitation and development of renewable energy resources and its roles in sustainable development in Africa. A brief review of energy and renewable energy resources in Africa was succinctly done. The concept of sustainable development as it borders on the Renewable Energy Technologies and their roles were also discussed. The challenges facing the acceptance, deployment and promotion of Renewable Energy Technologies in Africa were also highlighted. The barriers were classified as; policy, regulation and institutional; information and technical capacity and financial. Recommendations were made towards solving problems peculiar to exploration, exploitation and development of Renewable Energy in entirety in Africa.
Open Channel Flow: fluid flow with a free surfaceIndrajeet sahu
Open Channel Flow: This topic focuses on fluid flow with a free surface, such as in rivers, canals, and drainage ditches. Key concepts include the classification of flow types (steady vs. unsteady, uniform vs. non-uniform), hydraulic radius, flow resistance, Manning's equation, critical flow conditions, and energy and momentum principles. It also covers flow measurement techniques, gradually varied flow analysis, and the design of open channels. Understanding these principles is vital for effective water resource management and engineering applications.
Home security is of paramount importance in today's world, where we rely more on technology, home
security is crucial. Using technology to make homes safer and easier to control from anywhere is
important. Home security is important for the occupant’s safety. In this paper, we came up with a low cost,
AI based model home security system. The system has a user-friendly interface, allowing users to start
model training and face detection with simple keyboard commands. Our goal is to introduce an innovative
home security system using facial recognition technology. Unlike traditional systems, this system trains
and saves images of friends and family members. The system scans this folder to recognize familiar faces
and provides real-time monitoring. If an unfamiliar face is detected, it promptly sends an email alert,
ensuring a proactive response to potential security threats.
Applications of artificial Intelligence in Mechanical Engineering.pdfAtif Razi
Historically, mechanical engineering has relied heavily on human expertise and empirical methods to solve complex problems. With the introduction of computer-aided design (CAD) and finite element analysis (FEA), the field took its first steps towards digitization. These tools allowed engineers to simulate and analyze mechanical systems with greater accuracy and efficiency. However, the sheer volume of data generated by modern engineering systems and the increasing complexity of these systems have necessitated more advanced analytical tools, paving the way for AI.
AI offers the capability to process vast amounts of data, identify patterns, and make predictions with a level of speed and accuracy unattainable by traditional methods. This has profound implications for mechanical engineering, enabling more efficient design processes, predictive maintenance strategies, and optimized manufacturing operations. AI-driven tools can learn from historical data, adapt to new information, and continuously improve their performance, making them invaluable in tackling the multifaceted challenges of modern mechanical engineering.
Blood finder application project report (1).pdfKamal Acharya
Blood Finder is an emergency time app where a user can search for the blood banks as
well as the registered blood donors around Mumbai. This application also provide an
opportunity for the user of this application to become a registered donor for this user have
to enroll for the donor request from the application itself. If the admin wish to make user
a registered donor, with some of the formalities with the organization it can be done.
Specialization of this application is that the user will not have to register on sign-in for
searching the blood banks and blood donors it can be just done by installing the
application to the mobile.
The purpose of making this application is to save the user’s time for searching blood of
needed blood group during the time of the emergency.
This is an android application developed in Java and XML with the connectivity of
SQLite database. This application will provide most of basic functionality required for an
emergency time application. All the details of Blood banks and Blood donors are stored
in the database i.e. SQLite.
This application allowed the user to get all the information regarding blood banks and
blood donors such as Name, Number, Address, Blood Group, rather than searching it on
the different websites and wasting the precious time. This application is effective and
user friendly.
Digital Twins Computer Networking Paper Presentation.pptxaryanpankaj78
A Digital Twin in computer networking is a virtual representation of a physical network, used to simulate, analyze, and optimize network performance and reliability. It leverages real-time data to enhance network management, predict issues, and improve decision-making processes.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELijaia
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Sinan KOZAK
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
1. International Journal of Engineering Research and Development
e-ISSN: 2278-067X, p-ISSN: 2278-800X, www.ijerd.com
Volume 13, Issue 2 (February 2017), PP.67-70
67
On the Zeros of A Polynomial Inside the Unit Disc
M.H. Gulzar
Department Of Mathematics, University Of Kashmir, Srinagar
ABSTRACT: In this paper we find the number of zeros of a polynomial inside the unit disc under certain
conditions on the coefficients of the polynomial.
Mathematics Subject Classification: 30C10, 30C15.
Keywords and Phrases: Coefficients, Polynomial, Zeros.
I. INTRODUCTION
In the context of the Enestrom-Kakeya Theorem [4] which states that all the zeros of a polynomial
n
j
j
j zazP
0
)( with 0...... 011 aaaa nn lie in 1z , Q. G. Mohammad [ 5] proved the
following result giving a bound for the number of zeros of P(z) in
2
1
z :
Theorem A: Let
n
j
j
j zazP
0
)( be a polynomial of degree n such that
0...... 011 aaaa nn ,
Then the number of zeros of P(z) in
2
1
z does not exceed
0
log
2log
1
1
a
an
.
Various bounds for the number of zeros of a polynomial with certain conditions on the coefficients were
afterwards given by researchers in the field (e.g. see [1],[2],[3]).
II. MAIN RESULTS
In this paper we find a bound for the number of zeros of a polynomial in a closed disc of radius less
than 1 and prove
Theorem 1: Let
n
j
j
j zazP
0
)( be a polynomial of degree n with ,)Im(,)Re( jjjj aa
nj ,......,2,1,0 such that for some 10, n and for some 1,1 ok ,
11 ......nnk
and
001211 ...... L .
Then the number of zeros of P(z) in 10, z does not exceed
0
0
2)1()1(
log
1
log
1
a
Lkka
n
j
jnnn
.
Taking ja real i.e. njj ,.....,2,1,0,0 , Theorem 1 reduces to the following result:
Corollary 1: Let
n
j
j
j zazP
0
)( be a polynomial of degree n such that for some 10, n and for
some 1,1 ok ,
aaaka nn 11 ......
2. On The Zeros Of A Polynomial Inside The Unit Disc
68
and
001211 ...... aaaaaaaL
Then the number f zeros of P(z) in 10, z does not exceed
0
)1()(
log
1
log
1
a
aLaaak nn
.
Taking 1 in Cor. 1 , we get the following result:
Corollary 2: Let
n
j
j
j zazP
0
)( be a polynomial of degree n such that for some 10, n and for
some ,1k
aaaka nn 11 ......
and
001211 ...... aaaaaaaL
Then the number f zeros of P(z) in 10, z does not exceed
0
)(
log
1
log
1
a
Laaak nn
.
Taking 1k in Cor. 1 , we get the following result:
Corollary 3: Let
n
j
j
j zazP
0
)( be a polynomial of degree n such that for some 10, n and for
some 1 o ,
aaaa nn 11 ......
and
001211 ...... aaaaaaaL
Then the number f zeros of P(z) in 10, z does not exceed
0
)1(
log
1
log
1
a
aLaaa nn
.
Taking 1 in Theorem 1 , we get the following result:
Corollary 4: Let
n
j
j
j zazP
0
)( be a polynomial of degree n with ,)Im(,)Re( jjjj aa
nj ,......,2,1,0 such that for some 10, n and for some ,1k ,
11 ......nnk
and
001211 ...... L .
Then the number f zeros of P(z) in 10, z does not exceed
0
0
2)1(
log
1
log
1
a
Lkka
n
j
jnnn
.
Taking 1k in Theorem 1 , we get the following result:
3. On The Zeros Of A Polynomial Inside The Unit Disc
69
Corollary 5: Let
n
j
j
j zazP
0
)( be a polynomial of degree n with ,)Im(,)Re( jjjj aa
nj ,......,2,1,0 such that for some 10, n and for some 1 o ,
11 ......nn
and
001211 ...... L .
Then the number f zeros of P(z) in 10, z does not exceed
0
0
2)1(
log
1
log
1
a
La
n
j
jnn
.
Similarly for other different values of the parameters, we get many other interesting results.
III. LEMMA
For the proof of Theorem 1, we need the following result:
Lemma: Let f (z) be analytic for 0)0(,1 fz and Mzf )( for 1z . Then the number of zeros of
f(z) in 10, z does not exceed
)0(
log
1
log
1
f
M
.
(for reference see [6] ).
IV. PROOF OF THEOREM 1
Consider the polynomial
)()1()( zPzzF
zaazaazaaza
azazazaz
n
nn
n
n
n
n
n
n
)()(......)(
)......)(1(
1
1
11
1
01
1
1
001 )(...... azaa
1
1
1
211
1
)(......)()()1(
zzzkzkza n
nn
n
nn
n
n
n
n
})(......
){()(......)()1(
001
10011
1
z
zizzz n
nn
For 1z , we have, by using the hypothesis
)1(......)1()( 1211 nnnnnn kkazF
001
2110011 ..............
nnnn
)1(......)1( 1211 nnnnnn kka
001
2110011 ..............
nnnn
n
j
jnnn Lkka
0
2)()1(
Since F(z) is analytic for 1z , 0)0( 0 aF , it follows by the Lemma that the number of zeros
4. On The Zeros Of A Polynomial Inside The Unit Disc
70
of F(z) in 10, z des not exceed
0
0
2)()1(
log
1
log
1
a
Lkka
n
j
jnnn
.
Since the zeros of P(z) are also the zeros of F(z) , it follows that the number of zeros
of P(z) in 10, z des not exceed
0
0
2)()1(
log
1
log
1
a
Lkka
n
j
jnnn
.
That completes the proof of Theorem 1.
REFERENCES
[1]. K.K.Dewan, Extremal Properties and Coefficient Estimates for Polynomials with Restricted
Zeros and on Location of Zeros of Polynomials, Ph.D Thesis IIT Delhi,1980.
[2]. K.K.Dewan, Theory of Polynomials and Applications, Deep & Deep Publications, 2007,
Chapter 17.
[3]. M. H. Gulzar, On the Number of Zeros of a Polynomial in a Prescribed Region, Reseach Journal of
Pure Algebra, Vol.2(2) , 2012, ,35-46.
[4]. M. Marden, Geometry of Polynomials, Math. Surveys No. 3, Amer. Math.Soc.(1966).
[5]. Q. G Mohammad, On the Zeros of Polynomials, Amer. Math. Monthly, Vol.72 , 1965, 631-633
[6]. E. C. Titchmarsh, Theory of Functions, 2nd
Edition, Oxford University Press, 1949.