Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  tree structure
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Complex ramified distribution power networks (DPN) 6-20 kV are characterized by large dimension, development dynamism, insufficient regime information completeness and reliability. Structured hierarchical-multilevel approach to the elementwise calculation of power losses in DPN is proposed. The DPN structural model is described. A substantive description of this approach is given on the example of ramified DPN with n nodes and m sections (transmission line and transformer) with a tree structure.
PL
Złożone rozgałęzione Sieci Elektroenergetyczne (DPN) 6-20 kV charakteryzują się dużym wymiarem, dynamiką rozwoju, niewystarczającą kompletnością informacji o reżimie i niezawodnością. Zaproponowano ustrukturyzowane hierarchiczno-wielopoziomowe podejście do pierwiastkowego obliczania strat mocy w DPN. Opisano model strukturalny DPN. Merytoryczny opis takiego podejścia podano na przykładzie rozgałęzionego DPN z węzłami n i odcinkami m (linia transmisyjna i transformator) o strukturze drzewa.
EN
This paper provides structured hierarchical-multilevel approach to the regimes and power losses calculation in distribution power networks of 35 kV and above at given loads and power source voltage level. It based on hierarchical-multilevel structure form representation of the radial power network initial graph and using of traditional engineering two-step method. This approach usage make it possible to obtain a universal (for arbitrary power network configuration and complexity) and efficient (in terms of the computational operations number and computer memory consumption) algorithm.
PL
W artykule przedstawiono ustrukturyzowane, hierarchiczno-wielopoziomowe podejście do obliczania zakresów i strat mocy w sieciach dystrybucyjnych o napięciu 35 kV i wyższych przy zadanych obciążeniach i poziomie napięcia źródła zasilania. Opiera się on na hierarchicznowielopoziomowej strukturze odwzorowania początkowego wykresu radialnej sieci elektroenergetycznej i zastosowaniu tradycyjnej dwuetapowej metody inżynierskiej. Zastosowanie tego podejścia pozwala na uzyskanie uniwersalnego (dla dowolnej konfiguracji i złożoności sieci elektroenergetycznej) i wydajnego (pod względem liczby operacji obliczeniowych i zajętości pamięci komputera) algorytm.
EN
Purpose: The purpose of the article is to present dependency graphs and parametric game tree structures as tools in generating and acquiring knowledge. Design/methodology/approach: The thematic scope of work concerns the author's method of generating graphs and decision trees. The scope of work includes the analysis of computational assumptions of guidelines supporting knowledge generation and decision making. Findings: The paper presents a method of generating game tree structures that allow to change the values of decision parameters in the issues of decision making and knowledge generation. Research limitations/implications: Further development directions of the presented issues should be conducted in the field of computer implementation of the developed algorithms. Practical implications: The most important in this regard will be the selection of the optimal programming environment with the possibility of installing the program in laboratory room systems for decision support and knowledge management for students. At a later stage, the use of tools in various problems in companies with a managerial and technical profile. Social implications: The application of method can improve the quality of decision alignment and give access to problem solving of various technical problems. Originality/value: A novelty is the use of parametric game tree structures as an alternative method to induction trees and multi-valued logical trees. Because game structures, unlike other methods, are built directly from the graph.
4
Content available remote Tree Structure Based Data Hiding for Progressive Transmission Images
EN
Progressive image transmission (PIT) is supported by several encoders such as SPIHT, JPEG2000 and so on. However, few of data hiding scheme for progressive transmission images is designed. In this paper, tree-structure-based data hiding for set partitioning in hierarchical trees (SPIHT) images is proposed. The bit stream of SPIHT multi-stage encoded was structured of tree. The secret image can be progressively embedded into SPIHT bit trees. Experimental results showed the progressive image data hiding is achieved. The secret image is progressively embedded/extracted in SPIHT encoded images. Furthermore, a higher hiding capacity was provided in an earlier encoding which helped the secret image to be identified earlier. Also, an adaptive hiding capacity could be developed by using different tree structures. In comparison with Tsai et al.'s scheme, the proposed scheme had a higher hiding capacity and a better secret image quality.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.