
| Pengarang | : | Ali Sharida, et. al. |
| Nama Majalah/Jurnal | : | Proceedings of the IEEE |
| Volume / Edisi | : | 113 (No. 12) |
| Halaman | : | 1352-1382 |
| Abstrak | : | The rapid advancement in electric vehicle (EV) technology stimulated the development of fast chargers, with innovative solutions in power electronics (PEs), communication, protection, and control. This literature review explores the evolving landscape of fast EV charging infrastructures, and focuses on their topologies, advanced PEs solutions, and associated challenges. In addition, this article explores the multifaceted aspects of fast charging systems. In addition, the article discusses the protection systems, communication systems, and control techniques for facilitating seamless, safe, and reliable interaction between the grid, fast EV chargers (FEVCs), and the EV. Furthermore, the review investigates the interaction between the grid and FEVCs through ancillary services, and highlights their potential to enhance grid stability and reliability. Although a significant research is conducted in the literature and a significant progress is achieved, a notable gap persists between the available academic literature and commercially deployed solutions. Investigating this gap is crucial for accelerating the adoption of FEVC technologies and maximizing their benefits for both consumers and grid operators. Therefore, a reference design is synthesized that combines the recommended elements identified throughout the literature. The rapid advancement in electric vehicle (EV) technology stimulated the development of fast chargers, with innovative solutions in power electronics (PEs), communication, protection, and control. This literature review explores the evolving landscape of fast EV charging infrastructures, and focuses on their topologies, advanced PEs solutions, and associated challenges. In addition, this article explores the multifaceted aspects of fast charging systems. In addition, the article discusses the protection systems, communication systems, and control techniques for facilitating seamless, safe, and reliable interaction between the grid, fast EV chargers (FEVCs), and the EV. Furthermore, the review investigates the interaction between the grid and FEVCs through ancillary services, and highlights their potential to enhance grid stability and reliability. Although a significant research is conducted in the literature and a significant progress is achieved, a notable gap persists between the available academic literature and commercially deployed solutions. Investigating this gap is crucial for accelerating the adoption of FEVC technologies and maximizing their benefits for both consumers and grid operators. Therefore, a reference design is synthesized that combines the recommended elements identified throughout the literature. |
| Pengarang | : | Slobodan N. Vukosavic |
| Nama Majalah/Jurnal | : | Proceedings of the IEEE |
| Volume / Edisi | : | 113 (No. 12) |
| Halaman | : | 1345-1351 |
| Abstrak | : | Abstrak tidak tersedia. |
| Pengarang | : | Kathryn Altman, Alleen Koenig, Magdalena Julkowska, Guillame Lobet, Arjun Chandrasekhar & Kendall Richards |
| Nama Majalah/Jurnal | : | Mathematics Magazine |
| Volume / Edisi | : | 99 (No. 3) |
| Halaman | : | 287-298 |
| Abstrak | : | The roots of a plant can be viewed as a graph, with vertices representing points in Euclidean space and edges representing the connective material. Such graphs will ideally be designed in order to optimize one or more relevant objectives. Two objectives that are particularly important for biological reasons include minimizing the total length of the edges in the graph (wiring cost), and minimizing the total lengths of the shortest paths from each point to the root of the graph (conduction delay). These two objectives compete with each other, as optimizing for one objective generally results in poorer performance of the other. Additionally, sensitivity to gravitational forces constrains the curvature of edges in the graph, and by extension how well these objectives can be optimized. In this paper we show how ideas from economics can be used to resolve the tradeoff between competing objectives, and we define a concrete optimization problem that accounts for the role of gravity in constraining the solution space. We then show two techniques for solving this seemingly impossible optimization problem, both of which will be accessible to undergraduate math students. |
| Pengarang | : | Nandan Sai Dasireddy |
| Nama Majalah/Jurnal | : | Mathematics Magazine |
| Volume / Edisi | : | 99 (No. 3) |
| Halaman | : | 284-286 |
| Abstrak | : | The Ionescu–Weitzenböck inequality in triangle geometry is a classic result relating the sides and area of a triangle. Many proofs of this result have been discovered, the oldest dating back to the late 1890s and the newest from the 21st century. The proofs are widely varied, some of them are algebraic in nature, some of them are geometrical, and, in fact, there are some which use principles of linear algebra to prove this result. In this paper, we offer a novel proof of this result by using the triangle inequality of 2?????2≥27????????? by Co?ni?? and Turtoiu. |
| Pengarang | : | Stepan Paul |
| Nama Majalah/Jurnal | : | Mathematics Magazine |
| Volume / Edisi | : | 99 (No. 3) |
| Halaman | : | 277-283 |
| Abstrak | : | We present interactive 3D printed models of the graphs of three different functions of two variables that each exhibit some kind of unexpected behavior with respect to a concept learned in multivariable calculus. The interactivity of each model is meant to help a learner make geometric sense of the pathological properties of each function and illustrate the need for the technical conditions for the relevant theorems. |
| Pengarang | : | L. Colzani, A. De Luca & D.L. Ferrario |
| Nama Majalah/Jurnal | : | Mathematics Magazine |
| Volume / Edisi | : | 99 (No. 3) |
| Halaman | : | 263-276 |
| Abstrak | : | This paper is a faithful presentation of Euler’s proof of the continued fraction expansion of the number e, with more details than in the original memoir E71. As remarked by Sandifer (2006) and Cretney (2014), Euler’s proofs are considerably detailed, and easy to follow by readers familiar with the mathematical literature of the time. Since not many modern readers are familiar with this literature, and requirements for formal details in proofs are stricter now than in Euler’s time, in this article we fill the gaps that a modern reader would likely find in the original source. |
| Pengarang | : | Benjamin Richeson & David Richeson |
| Nama Majalah/Jurnal | : | Mathematics Magazine |
| Volume / Edisi | : | 99 (No. 3) |
| Halaman | : | 252-262 |
| Abstrak | : | Left, Center, Right is a popular dice game. We analyze the game using Markov chain and Monte Carlo methods. We compute the expected game length for two to eight players and determine the probability of winning for each player in the game. We discuss the surprising conclusions of which players have the highest and lowest chance of winning, and we propose a small rule change that makes the game a little more fair. |
| Pengarang | : | Roger B. Nelsen |
| Nama Majalah/Jurnal | : | Mathematics Magazine |
| Volume / Edisi | : | 99 (No. 3) |
| Halaman | : | 250-251 |
| Abstrak | : | We use Ptolemy’s theorem to prove Apollonius’s theorem for the length of a triangle median. |
| Pengarang | : | Regula? Krapf |
| Nama Majalah/Jurnal | : | Mathematics Magazine |
| Volume / Edisi | : | 99 (No. 3) |
| Halaman | : | 237-249 |
| Abstrak | : | This article demonstrates, using numerous examples of varying complexity, how one can visually prove summation formulas involving binomial coefficients by exclusively using the recurrence relation for binomial coefficients and its illustration through arrows in Pascal’s triangle. The method developed for this purpose, which we call “arrow-chasing,” is elementary and it is accessible to a very broad audience. |
| Pengarang | : | Steven C. Althoen & Kenneth Schilling |
| Nama Majalah/Jurnal | : | Mathematics Magazine |
| Volume / Edisi | : | 99 (No. 3) |
| Halaman | : | 233-236 |
| Abstrak | : | Infinite sequences of automorphic numbers in different bases are introduced via a simple construction. |