On Polymers Nanocomposites: Electrical Treeing, Breakdown models and Related Simulations
Journal Title: Engineering, Technology & Applied Science Research - Year 2018, Vol 8, Issue 2
Abstract
This paper deals with polymer nanocomposites and their related breakdown mechanisms. Polymer nanocomposites seem to be a very promising alternative to conventional polymers regarding high voltage applications. Some developed breakdown models are discussed as well as the mechanism of treeing in such materials. Treeing simulation results are presented.
Authors and Affiliations
G. Melissinos, M. Danikas
Keywords
Related Articles
- EP ID EP156274
- DOI -
- Views 220
- Downloads 0
Fatigue Life Prediction of Composite Under Two Block Loading
The damage evolution mechanism is one of the important focuses of fatigue behaviour investigation of composite materials and also the foundation to predict fatigue life of composite structures for engineering application...
An Enhanced Binary Classifier Incorporating Weighted Scores
In this study, an approach is being proposed which will predict the output of an observation based on several parameters which employ the weighted score classification method. We will use the weighted scores concept for...
Developing an Algorithm to Consider Mutliple Demand Response Objectives
Due to technological improvement and changing environment, energy grids face various challenges, which, for example, deal with integrating new appliances such as electric vehicles and photovoltaic. Managing such grids ha...
Variable Speed Limits: Strategies to Improve Safety and Traffic Parameters for a Bottleneck
The primary purpose of the speed limit system is to enforce reasonable and safe speed. To reduce secondary problems such as accidents and queuing, Variable Speed Limits (VSL) has been suggested. In this paper VSL is used...
An Enhanced Genetic Algorithm for the Generalized Traveling Salesman Problem
The generalized traveling salesman problem (GTSP) deals with finding the minimum-cost tour in a clustered set of cities. In this problem, the traveler is interested in finding the best path that goes through all clusters...