Filtry
wszystkich: 871
wybranych: 716
-
Katalog
- Publikacje 716 wyników po odfiltrowaniu
- Czasopisma 15 wyników po odfiltrowaniu
- Konferencje 18 wyników po odfiltrowaniu
- Osoby 15 wyników po odfiltrowaniu
- Projekty 6 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Kursy Online 3 wyników po odfiltrowaniu
- Wydarzenia 1 wyników po odfiltrowaniu
- Dane Badawcze 96 wyników po odfiltrowaniu
Filtry wybranego katalogu
Wyniki wyszukiwania dla: RECTANGULAR GRID GRAPHS
-
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
PublikacjaW pracy rozważamy problem szukania, dla danego grafu prostego, drzewa spinającego, którego uporządkowana liczba chromatyczna jest minimalna. K.~Miyata i inni dowiedli w [Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem,Discrete Appl. Math. 154 (2006) 2402-2410], że odpowiedni problem decyzyjny jest NP-trudny już w przypadku pytania o istnienie uporządkowanego 4-pokolorowania....
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublikacjaWe consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard,...
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublikacjaWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models
Publikacja -
Activity coordination of capacitor banks and power transformer controllers in order to reduce power losses in the MV grid
PublikacjaOne of the main issues related to the optimization of the MV (middle voltage) network is to reduce losses of active and reactive power. Lower losses of active and reactive power give not only economic advantage, but also improvement of energy quality. The object of regulation that can be used for these purposes are transformer with On-Load Tap Changer and capacitor's banks. This paper presents results of analysis of the possibility...
-
The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
PublikacjaW pracy pokazano, że problem L(p,q)-kolorowania przy użyciu ''t'' kolorów jest NP-zupełny nawet w wersji ograniczonej do grafów planarnych dwudzielnych małego stopnia, nawet dla stosunkowo niewielkich wartości ''t''. Jako wniosek z uzyskanych wyników stwierdzono, że problem L(2,1)-kolorowania grafów planarnych przy użyciu 4 kolorów jest NP-zupełny, a także że problem L(p,q)-kolorowania grafów o maksymalnym stopniu 4 jest NP-zupełny...
-
Bond-graphs based modelling of hybrid energy systems with permanent magnet brushless machines
PublikacjaW referacie przedstawiono metodę grafów wiązań (GW) w zastosowaniu do modelowania hybrydowych systemów energetycznych z bezszczotkowymi maszynami elektrycznymi o magnesach trwałych. W części pierwszej referatu omówiono ogólne formalizm GW. Następnie przedstawiono kolejno: ogólną strukturę modelu hybrydowego systemu energetycznego w ujęciu GW; założenia modelowania maszyn elektrycznych w ujęciu GW, model silnika bezszczotkowego...
-
Bond-graphs based modelling of hybrid energy systems with permanent magnet brushless machines
PublikacjaW referacie przedstawiono metodę grafów wiązań (GW) w zastosowaniu do modelowania hybrydowych systemów energetycznych z bezszczotkowymi maszynami elektrycznymi o magnesach trwałych. W części pierwszej referatu omówiono ogólne formalizm GW. Następnie przedstawiono kolejno: ogólną strukturę modelu hybrydowego systemu energetycznego w ujęciu GW; założenia modelowania maszyn elektrycznych w ujęciu GW, model silnika bezszczotkowego...
-
Bond-graphs based modelling of hybrid energy systems with permanent magnet brushless machines
PublikacjaW referacie przedstawiono metodę grafów wiązań (GW) w zastosowaniu do modelowania hybrydowych systemów energetycznych z bezszczotkowymi maszynami o magnesach trwałych (BMMT). W części pierwszej referatu omówiono ogólne formalizm GW. Następnie przedstawiono kolejno: ogólną strukturę modelu hybrydowego systemu energetycznego w ujęciu GW; założenia modelowania maszyn elektrycznych w ujęciu GW, model SBMT w ujęciu GW dla potrzeb modelowania...
-
Modelling of ic engine coolant system with permanent magnet brushless motor - bond graphs approach
PublikacjaW pierwszej części referatu przedstawiono strukturę i podstawy modelowania w ujęciu grafów wiązań nowoczesnego (nowej generacji) systemu chłodzenia silnika spalinowego. Istotną cechą rozważnego systemu chłodzenia jest zastosowanie zintegrowanego układu: pompa cieczy chłodzącej-bezszczotkowy silniki prądu stałego (BSPS, ang. BDCM). W kolejnych częściach referatu przedstawiono: podstawy modelowania całego systemu chłodzenia, model...
-
Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machines
PublikacjaThe goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|p j = 1, G = bisubquartic|Cmax . The second one is Algorithm 3 which is 4-approximate for the problem Qm|p...
-
Artificial Intelligence-Based Weighting Factor Autotuning for Model Predictive Control of Grid-Tied Packed U-Cell Inverter
Publikacja -
Modelling Long‐Term Transition from Coal‐Reliant to Low‐Emission Power Grid and District Heating Systems in Poland
PublikacjaEnergy systems require technological changes towards climate neutrality. In Poland, where the power system is dominated by outdated coal-fired power plants, efforts to minimize the environmental impact are associated with high costs. Therefore, optimal paths for the development of the energy sector should be sought in order to achieve ambitious long-term strategic goals, while minimizing the negative impact on the consumers’ home...
-
Power grid frequency measurement in LabVIEW environment using the least mean squares method to signal phase approximation in the presence of noise
Publikacja -
The influence of the grid density of measurement points on damage detection in an isotropic plate by the use of elastic waves and laser scanning Doppler vibrometry
PublikacjaDamage detection in structural components, especially in mechanical engineering, is an 2 important element of engineering practice. There are many methods of damage detection, in which 3 changes in various parameters caused by the presence of damage are analysed. Recently, methods 4 based on the analysis of changes in dynamic parameters of structures, i.e. frequencies or mode shapes 5 of natural vibrations, as well as changes in...
-
Certified domination
PublikacjaImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Modelling of Objects Behaviour for Their Re-identification in Multi-camera Surveillance System Employing Particle Filters and Flow Graphs
PublikacjaAn extension of the re-identification method of modeling objects behavior in muti-camera surveillance systems, related to adding a particle filter to the decision-making algorithm is covered by the paper. A variety of tracking methods related to a single FOV (Field of Vision) are known, proven to be quite different for inter-camera tracking, especially in case of non-overlapping FOVs. The re-identification methods refer to the...
-
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Decision Support in Selecting a Reliable Strategy for Sustainable Urban Transport Based on Laplacian Energy of T-Spherical Fuzzy Graphs
Publikacja -
MICROSEISMIC EVENT DETECTION USING DIFFERENT ALGORITHMS ON REAL DATA FROM PATCH ARRAY GEOPHONE GRID FROM EASTERN POMERANIA FRACTURING JOB
PublikacjaThe microseismic monitoring is a method of monitoring of fracture propagation during hydraulic fracturing process. Hydraulic fracturing is a method of reservoir stimulation used especially for unconventional gas recovery. A matrix of several thousand geophones is placed on the surface of earth to record every little tremor of ground induced by fracturing process. Afterwards, the signal is analysed and the place of tremor occurrence...
-
Power Grid Frequency Estimation Based on Zero Crossing Technique Using Least Squares Method to Approximate Sampled Voltage Signal Around Zero Level
Publikacja -
Analysis of the Impact of Charging Electric Cars on the Power System Load
PublikacjaThe paper presents ways of integrating electric cars with the power system. In connection with this, daily load curves in the average working day have been developed in the G2V (Grid-to-Vehicle) and V2G (Vehicle-to-Grid) variants. The G2V solution consists in unidirectional energy flow from the power system to a vehicle’s battery. The V2G solution consists in bi-directional energy exchange between the power system and electric...
-
A survey on known values and bounds on the Shannon capacity
PublikacjaIn this survey we present exact values and bounds on the Shannon capacity for different classes of graphs, for example for regular graphs and Kneser graphs. Additionally, we show a relation between Ramsey numbers and Shannon capacity.
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Product Graph Invariants with Applications in the Theory of Information
PublikacjaThere are a large number of graph invariants. In the paper, we consider some of them, e.g. the independence and chromatic numbers. It is well know that we cannot efficiently calculate these numbers for arbitrary graphs. In the paper we present relations between these invariants and concepts from the theory of information. Concepts such as source coding and transmission over a noisy channel with zero probability of error are modeled...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Interval incidence graph coloring
PublikacjaIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Resonant Frequencies in Microstrip Structure with Omega Medium Substrate
PublikacjaThe paper presents the research on a rectangular microstrip structure with multilayer substrate containing dielectric and omega medium layers. The effect of pseudochiral medium layer location in the substrate and its thickness on the resonant frequency of the rectangular microstrip structure is investigated. The numerical analysis of investigated structures is based on expansion of electric and magnetic fields. Utilizing the continuity...
-
Tighter bounds on the size of a maximum P3-matching in a cubic graph
PublikacjaW pracy pokazano, że największe P3-skojarzenie dla dowolnego grafu o n>16 wierzchołkach składa się z przynajmniej 117n/152 wierzchołków.
-
Counting Lattice Paths With Four Types of Steps
Publikacja -
Security information sharing for smart grids: Developing the right data model
PublikacjaThe smart grid raises new security concerns which require novel solutions. It is commonly agreed that to protect the grid the effective collaboration and information sharing between the relevant stakeholders is prerequisite. Developing a security information sharing platform for the smart grid is a new research direction which poses several challenges related to the highly distributed and heterogeneous character of the grid. In...
-
Data Model Development for Security Information Sharing in Smart Grids
PublikacjaThe smart grid raises new security concerns which require novel solutions. It is commonly agreed that to protect the grid, the effective collaboration and information sharing between the relevant stakeholders is prerequisite. Developing a security information sharing platform for the smart grid is a new research direction which poses several challenges related to the highly distributed and heterogeneous character of the grid. In...
-
Compensation of Dead Time Effects for Shunt Active Power Filters
PublikacjaThe paper presents a comprehensive approach to the compensation of the grid current distortion for shunt active power filter systems. Four different sources of current distortion are addressed: imperfect grid synchronization caused by the distortion in the grid voltages, time delays in the estimation of compensating currents and grid voltages, fluctuations of the dc bus voltage, and the distortion of inverter output voltages due...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublikacjaWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Volunteer Computing System Comcute with Smart Scheduler
PublikacjaIn this paper, a volunteer grid called Comcute is studied. Moreover, the harmony search scheduler is proposed. This scheduler has been designed for efficient using some resources of volunteer grid. The harmony search scheduler optimizes both a workload of a bottleneck computer and the cost of grid. Finally, some experiment outcomes have been discussed.
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
A construction for the hat problem on a directed graph
PublikacjaA team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...
-
BeesyBees: A mobile agent-based middleware for a reliable and secure execution of service-based workflow applications in BeesyCluster
PublikacjaIntegrating distributed services into workflows comes with its own set of challenges, including security, coordination, fault tolerance and optimisation of execution time. This paper presents an architecture and implementation - nicknamed BeesyBees - that allows distributed execution of workflow applications in BeesyCluster using agents. BeesyCluster is a middleware that allows users to access distributed resources as well as publish...
-
Power converter interface for urban DC traction substations - solutions and functionality.
PublikacjaThis paper focuses on extending an urban DC traction substation functionality by means of an additional power converter interface (PCI). In particular, by enabling bidirectional energy exchange between LV DC traction grid, AC grid and V2G chargers. Among other things, the presented material compares general attributes of the most promising DC/DC converters that can be used in a PCI, meet the requirements of galvanic isolation and...
-
Enhancing Security of Advanced Metering Infrastructure by Introducing Threshold Attendance Protocol
PublikacjaThe industry pushes towards smart grid systems in order to resolve current limitations of the unidirectional legacy power grid infrastructure. By introducing Advanced Metering Infrastructure (AMI) as an integral part of the smart grid solution, the utility company obtains an invaluable tool to optimize its network, lower the operational costs, and improve quality of service. Unfortunately, introducing two-way communication poses...
-
MONITORING SYSTEM OF THE ROAD EMBANKMENT
PublikacjaThe paper presents the analysis of the monitoring system of the embankment supported on concrete columns and overlaid by a load transfer platform with the embedded steel grid. This field investigation was to study the complex interaction among the columns, the load transfer platform layer, and steel grid via in situ measurements during erection and live loading of the embankment. The study was focused on the behaviour of steel...
-
Prof. Haitham Abu-Rub - A Visit to Poland's Gdansk University of Technology
PublikacjaReport on visit of Prof. Haitham Abu-Rub in Gdansk University of Technology. Speech on the Smart Grid Centre. Visit in the new smart grid laboratory of the GUT, the Laboratory for Innovative Power Technologies and Integration of Renewable Energy Sources (LINTE^2).
-
Development of Domain-Specific Solutions within the Polish Infrastructure for Advanced Scientific Research
PublikacjaThe Polish Grid computing infrastructure was established during the PL-Grid project (2009-2012). The main purpose of this Project was to provide the Polish scientists with an IT basic platform, allowing them to conduct interdisciplinary research on a national scale, and giving them transparent access to international grid resources via international grid infrastructures. Currently, the infrastructure is maintained and extended...
-
Dedicated scheduling of tasks to minimize mean flow time
PublikacjaThis paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.
-
Influence of edge subdivision on the convex domination number
PublikacjaWe study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.
-
Graph classes generated by Mycielskians
PublikacjaIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
INFLUENCE OF WRONGLY ASSUMED PROBABILITY DISTRIBUTION ON THE UNCERTAINTY OF RESISTANCE MEASUREMENT BY TECHNICAL METHOD
PublikacjaThe paper presents studies on the influence of probability distributions on the expanded uncertainty of the resistance measurement. Choosing the correct probability distribution is very important to estimate of measurement uncertainty. The most commonly used distribution is the rectangular distribution. The paper presents the results of analysis of the resistance measurement uncertainty using the technical method of two resistances:...
-
Genetic Programming with Negative Selection for Volunteer Computing System Optimization
PublikacjaVolunteer computing systems like BOINC or Comcute are strongly supported by a great number of volunteers who contribute resources of their computers via the Web. So, the high efficiency of such grid system is required, and that is why we have formulated a multi-criterion optimization problem for a volunteer grid system design. In that dilemma, both the cost of the host system and workload of a bottleneck host are minimized. On...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublikacjaDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Akustyka
PublikacjaW artykule przedstawiono zadania realizowane w ramach projektu PL GRID Plus przez zespół wykonawców Katedry Systemów Multimedialnych. Zadanie te obejmują przygotowanie zestawu usług umożliwiających wykonywanie obliczeń map hałasu i wpływu hałasu na słuch z wykorzystaniem infrastruktury PL GRID.