Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "discharging" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-12 z 12
    Tytuł:
    Planar graphs without 4-, 5- and 8-cycles are 3-colorable
    Autorzy:
    Mondal, Sakib
    Powiązania:
    https://bibliotekanauki.pl/articles/743615.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    3-coloring
    planar graph
    discharging
    Opis:
    In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2011, 31, 4; 775-789
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Design and Simulation of Cyclic Battery Tester
    Autorzy:
    Bilansky, Juraj
    Lacko, Milan
    Powiązania:
    https://bibliotekanauki.pl/articles/1193855.pdf
    Data publikacji:
    2020
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    battery
    cell
    charging
    discharging
    Simscape
    Opis:
    The paper presents an approach to the modelling of a cyclic battery tester and contains observations about lithium-ion (Li-ion) batteries, charging/discharging procedures, conditions and protections which must be observed during the testing process. The main goal was to create and simulate a schematic which will be capable of cyclically testing Li-ion battery cells. Regulation of the final schematic is based on cascade connections of operation amplifiers, which work as a voltage source with current-limiting functions. The power part is created by two MOSFETs connected as a half-bridge. This topology allows current to flow in both directions (from and to the battery). Final simulation is supplemented by protections such as reverse polarity protection, short circuit protection and overvoltage protection during charging. Proper operation of the whole connection is demonstrated by the simulation outputs in the final section.
    Źródło:
    Power Electronics and Drives; 2020, 5, 40; 229-241
    2451-0262
    2543-4292
    Pojawia się w:
    Power Electronics and Drives
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Domination Number of Graphs with Minimum Degree Five
    Autorzy:
    Bujtás, Csilla
    Powiązania:
    https://bibliotekanauki.pl/articles/32222697.pdf
    Data publikacji:
    2021-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    dominating set
    domination number
    discharging method
    Opis:
    We prove that for every graph G on n vertices and with minimum degree five, the domination number γ(G) cannot exceed n/3. The proof combines an algorithmic approach and the discharging method. Using the same technique, we provide a shorter proof for the known upper bound 4n/11 on the domination number of graphs of minimum degree four.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2021, 41, 3; 763-777
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords
    Autorzy:
    Sun, Lin
    Wu, Jianliang
    Powiązania:
    https://bibliotekanauki.pl/articles/31343454.pdf
    Data publikacji:
    2019-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    1-planar graphs
    edge coloring
    discharging method
    Opis:
    A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that every 1-planar graph with maximum degree ∆ ≥ 8 is edge-colorable with ∆ colors if each of its 5-cycles contains at most one chord.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2019, 39, 2; 301-312
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Modelling and simulation of repeated charging/discharging cycles for selected nickel-cadmium batteries
    Autorzy:
    Chmielewski, A.
    Szurgott, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/241905.pdf
    Data publikacji:
    2015
    Wydawca:
    Instytut Techniczny Wojsk Lotniczych
    Tematy:
    dynamic simulation
    charging/discharging cycle
    MATLAB Simulink
    Opis:
    The main aim of the paper is to present a developed methodology of simulation of the energy efficiency of a selected energy storage unit. The authors focused their actions on batteries that could be the base for an energy storage system possible to apply in a modernized hybrid-shunting locomotive. Three different nickel-cadmium batteries were selected as representatives for the study. Simulation was focused on repeated cycles of charging and discharging the batteries. The simulation model generally consists of three main components: a specified load cycle, a dynamic model of the DC electrical machine and a model of the Ni-Cd battery. The input data for the battery model is based mostly on the parameters provided by the manufacturer data sheets. However, an internal resistance had to be measured for each battery. Conducted simulations provided information about the electromotive force, state of charge, an average efficiency of the battery, as well as the temperature changes during the cycle. The proposed approach to the battery simulation can be also applied for the loading cycles similar to those that occur during the actual operation of the locomotive. The current study is a part of the project focused on modernization of the diesel-electric shunting locomotive to the hybrid one.
    Źródło:
    Journal of KONES; 2015, 22, 1; 55-62
    1231-4005
    2354-0133
    Pojawia się w:
    Journal of KONES
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Linear List Coloring of Some Sparse Graphs
    Autorzy:
    Chen, Ming
    Li, Yusheng
    Zhang, Li
    Powiązania:
    https://bibliotekanauki.pl/articles/32083756.pdf
    Data publikacji:
    2021-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    linear coloring
    maximum average degree
    planar graphs
    discharging
    Opis:
    A linear $k$-coloring of a graph is a proper $k$-coloring of the graph such that any subgraph induced by the vertices of any pair of color classes is a union of vertex-disjoint paths. A graph $G$ is linearly $L$-colorable if there is a linear coloring $c$ of $G$ for a given list assignment $L = \{L(v) : v ∈ V(G)\}$ such that $c(v) ∈ L(v)$ for all $v ∈ V(G)$, and $G$ is linearly $k$-choosable if $G$ is linearly $L$-colorable for any list assignment with $|L(v)| ≥ k$. The smallest integer $k$ such that $G$ is linearly $k$-choosable is called the linear list chromatic number, denoted by $lc_l(G)$. It is clear that \(lc_l(G)≥\Big\lceil\frac{\Delta(G)}{1}\Big\rceil+1\) for any graph $G$ with maximum degree $\Delta(G)$. The maximum average degree of a graph $G$, denoted by $mad(G)$, is the maximum of the average degrees of all subgraphs of $G$. In this note, we shall prove the following. Let $G$ be a graph, (1) if $mad(G)<\frac{8}{3}$ and $\Delta(G) ≥ 7$, then \(lc_l(G)=\Big\lceil\frac{\Delta(G)}{2}\Big\rceil+1\); (2) if $mad(G)<{18}{7}$ and $\Delta(G) ≥ 5$, then \(lc_l(G)=\Big\lceil\frac{\Delta(G)}{2}\Big\rceil+1\); (3) if $mad(G)<{20}{7}$ and $\Delta(G) ≥ 5$, then \(lc_l(G)≤\Big\lceil\frac{\Delta(G)}{2}\Big\rceil+2\).
    Źródło:
    Discussiones Mathematicae Graph Theory; 2021, 41, 1; 51-64
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Effect of Charging and Discharging Process of PCM with Paraffin and $Al_2O_3$ Additive Subjected to Three Point Temperature Locations
    Autorzy:
    Kumar, Sunil K.
    Muniamuthu, Sumathy
    Mohan, A.
    Amirthalingam, P.
    Anbu Muthuraja, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/2027798.pdf
    Data publikacji:
    2022
    Wydawca:
    Polskie Towarzystwo Inżynierii Ekologicznej
    Tematy:
    paraffin wax
    charging
    discharging
    solar heater
    three point locations
    PCM material behavior
    methods of charging
    methods of discharging
    Al₂O₃
    Opis:
    This analysis focused on investigating thermal storage behaviour on phase change material along with $Al_2O_3$ as an additive. The experimental investigation was performed by three set temperature points, i.e. 40 °C, 50 °C and 60 °C with the mass circulation rate through the tank of 5 kg/min, 3 kg/min and 2 kg/min. The forced circulation method was used to circulate the liquid, water was used as a working medium and $Al_2O_3$ as nano particle. Paraffin acts a phase change material to conduct the experimental procedure. The combination of paraffin with $Al_2O_3$ improves the latent heat storage of the material. The performance, with respect to charging and discharging of the material, was investigated and it was observed that the temperature location point of 50 °C shows the best results in terms of charging and discharging phenomena, compared to other two temperature location points. During the process of charging, the maximum rate of heat transfer can be achieved by $Al_2O_3$ nanofluids. Paraffin along with $Al_2O_3$ are characterized by the best thermal storage behaviour during the latent heat storage at charging process and dissipation of heat during discharge process. The rapid cooling comparison for three set location points has been studied and best solidification was achieved at the point of 60 °C; this is due to the rapid cooling at higher elevation temperatures. The energy that was stored in thermal form is to be transferred with the aid of heat exchanger, a special type heat exchanger employed in this analysis to transfer the heat. From this analysis it is concluded that paraffin with $Al_2O_3$ are characterized by the best performance in terms of the charging and discharging phenomenon.
    Źródło:
    Journal of Ecological Engineering; 2022, 23, 2; 34-42
    2299-8993
    Pojawia się w:
    Journal of Ecological Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Neighbor Sum Distinguishing Total Chromatic Number of Planar Graphs without 5-Cycles
    Autorzy:
    Zhao, Xue
    Xu, Chang-Qing
    Powiązania:
    https://bibliotekanauki.pl/articles/32083807.pdf
    Data publikacji:
    2020-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    neighbor sum distinguishing total coloring
    discharging method
    planar graph
    Opis:
    For a given graph $ G = (V (G), E(G)) $, a proper total coloring $ \phi : V (G) \cup E(G) $ $ \rightarrow {1, 2, . . ., k} $ is neighbor sum distinguishing if $ f(u) \ne f(v) $ for each edge $ uv \in E(G) $, where $ f(v) = \Sigma_{ uv \in E(G) } $ $ \phi (uv) + \phi (v) $, $ v \in V (G) $. The smallest integer $k$ in such a coloring of $G$ is the neighbor sum distinguishing total chromatic number, denoted by $ \chi_\Sigma^{''} (G) $. Pilśniak and Woźniak first introduced this coloring and conjectured that $ \chi_\Sigma^{''}(G) \le \Delta (G)+3 $ for any graph with maximum degree $ \Delta (G) $. In this paper, by using the discharging method, we prove that for any planar graph $G$ without 5-cycles, $ \chi_\Sigma^{''} (G) \le \text{max} \{ \Delta (G)+2, 10 \} $. The bound $ \Delta (G) + 2 $ is sharp. Furthermore, we get the exact value of $ \chi_\Sigma^{''} (G) $ if $ \Delta (G) \ge 9 $.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2020, 40, 1; 243-253
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Additive List Coloring of Planar Graphs with Given Girth
    Autorzy:
    Brandt, Axel
    Jahanbekam, Sogol
    White, Jennifer
    Powiązania:
    https://bibliotekanauki.pl/articles/31525335.pdf
    Data publikacji:
    2020-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    lucky labeling
    additive coloring
    reducible configuration
    discharging method
    Combinatorial Nullstellensatz
    Opis:
    An additive coloring of a graph G is a labeling of the vertices of G from {1, 2, . . ., k} such that two adjacent vertices have distinct sums of labels on their neighbors. The least integer k for which a graph G has an additive coloring is called the additive coloring number of G, denoted χΣ (G). Additive coloring is also studied under the names lucky labeling and open distinguishing. In this paper, we improve the current bounds on the additive coloring number for particular classes of graphs by proving results for a list version of additive coloring. We apply the discharging method and the Combinatorial Nullstellensatz to show that every planar graph G with girth at least 5 has χΣ (G) ≤ 19, and for girth at least 6, 7, and 26, χΣ (G) is at most 9, 8, and 3, respectively. In 2009, Czerwiński, Grytczuk, and Żelazny conjectured that χΣ (G) ≤ χ(G), where χ(G) is the chromatic number of G. Our result for the class of non-bipartite planar graphs of girth at least 26 is best possible and affirms the conjecture for this class of graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2020, 40, 3; 855-873
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The 1,2,3-Conjecture and 1,2-Conjecture for sparse graphs
    Autorzy:
    Cranston, Daniel W.
    Jahanbekam, Sogol
    West, Douglas B.
    Powiązania:
    https://bibliotekanauki.pl/articles/30148718.pdf
    Data publikacji:
    2014-11-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    reducible configuration
    discharging method
    1, 2, 3-Conjecture
    1, 2-Conjecture
    Opis:
    The 1, 2, 3-Conjecture states that the edges of a graph without isolated edges can be labeled from {1, 2, 3} so that the sums of labels at adjacent vertices are distinct. The 1, 2-Conjecture states that if vertices also receive labels and the vertex label is added to the sum of its incident edge labels, then adjacent vertices can be distinguished using only {1, 2}. We show that various configurations cannot occur in minimal counterexamples to these conjectures. Discharging then confirms the conjectures for graphs with maximum average degree less than 8/3. The conjectures are already confirmed for larger families, but the structure theorems and reducibility results are of independent interest.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2014, 34, 4; 769-799
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Charging and Discharging Strategies for Clustered Regional Energy Storage System
    Autorzy:
    Li, Yang
    Janik, Przemysław
    Pfeiffer, Klaus
    Schwarz, Harald
    Powiązania:
    https://bibliotekanauki.pl/articles/2175940.pdf
    Data publikacji:
    2022
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    charging strategy
    discharging strategy
    energy storage system
    energy-to-power ratio
    fuzzy logic control
    Opis:
    With the massive expansion of decentralised renewable energy in electricity grid networks, the power supply system has been changed from centralised to decentralised one and from directional to bi-directional one. However, due to the regional energy structure difference in the power imbalance between electricity generation and consumption is becoming more and more serious. A grid-scale energy storage system (ESS) can be one solution to balance the local difference. In this paper, two charging/discharging strategies for the grid-scale ESS were proposed to decide when and with how much power to charge/discharge the ESS. In order to realise the two strategies, this paper focuses on the application of fuzzy logic control system. The proposed strategies aim to reduce the peak power generation, consumption and the grid fluctuation. In particular, this paper analysis the ratio between energy-capacity and rated power of ESS. The performance of the proposed strategies is evaluated from two aspects, the normalised power of ESS itself and the influence on the power grid. Simulation studies were carried out on the rule-based control systems with different energy-to-power (e2p) ratios, and the results show that the proposed charging strategy with combination of extreme situation of power imbalance and the rest capacity of ESS provides a smooth load curve for the regional power grid system while the external power exchange is reduced effectively.
    Źródło:
    Power Electronics and Drives; 2022, 7, 42; 56--67
    2451-0262
    2543-4292
    Pojawia się w:
    Power Electronics and Drives
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multi-objective coordination optimisation method for DGs and EVs in distribution networks
    Autorzy:
    Tang, Huiling
    Wu, Jiekang
    Powiązania:
    https://bibliotekanauki.pl/articles/141087.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    charging and discharging of electric vehicles
    distribution networks
    distributed generation
    multi-objective coordination optimisation
    SAPSO
    Opis:
    The loss of power and voltage can affect distribution networks that have a significant number of distributed power resources and electric vehicles. The present study focuses on a hybrid method to model multi-objective coordination optimisation problems for distributed power generation and charging and discharging of electric vehicles in a distribution system. An improved simulated annealing based particle swarm optimisation (SAPSO) algorithm is employed to solve the proposed multi-objective optimisation problem with two objective functions including the minimal power loss index and minimal voltage deviation index. The proposed method is simulated on IEEE 33-node distribution systems and IEEE-118 nodes large scale distribution systems to demonstrate the performance and effectiveness of the technique. The simulation results indicate that the power loss and node voltage deviation are significantly reduced via the coordination optimisation of the power of distributed generations and charging and discharging power of electric vehicles.With the methodology supposed in this paper, thousands of EVs can be accessed to the distribution network in a slow charging mode.
    Źródło:
    Archives of Electrical Engineering; 2019, 68, 1; 15-32
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-12 z 12

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies