Wyniki wyszukiwania dla: greedy algorithm, independence number, shannon capacity, strong product
-
On the independence number of some strong products of cycle-powers
PublikacjaIn the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers alpha((C^2_10)^⊠3) = 30 and alpha((C^4 _14)^⊠3) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm used to establish the independence number of the third strong power of cycle-powers. Moreover, our results establish...
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
New potential functions for greedy independence and coloring
PublikacjaA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Graphs hard-to-process for greedy algorithm MIN
PublikacjaWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
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.
-
A Note on Shannon Capacity for Invariant and Evolving Channels
PublikacjaIn the paper we discuss the notion of Shannon capacity for invariant and evolving channels. We show how this notion is involved in information theory, graph theory and Ramsey theory.
-
Some Exact Values of Shannon Capacity for Evolving Systems
PublikacjaWe describe the notion of Shannon Capacity for evolving channels. Furthermore, using a computer search together with some theoretical results we establish some exact values of the measure.
-
Colorings of the Strong Product of Circulant Graphs
PublikacjaGraph coloring is one of the famous problems in graph theory and it has many applications to information theory. In the paper we present colorings of the strong product of several circulant graphs.
-
Shannon Capacity and Ramsey Numbers
PublikacjaRamsey-type theorems are strongly related to some results from information theory. In this paper we present these relations.
-
Characterizing the Performance of <span class="sc">xor</span> Games and the Shannon Capacity of Graphs
PublikacjaIn this Letter we give a set of necessary and sufficient conditions such that quantum players of a two-party xor game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the parametrization of new families of games...
-
Average distance is submultiplicative and subadditive with respect to the strong product of graphs
PublikacjaWe show that the average distance is submultiplicative and subadditive on the set of non-trivial connected graphs with respect to the strong product. We also give an application of the above-mentioned result.
-
On the super domination number of lexicographic product graphs
PublikacjaThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Determination of the total number of microorganisms in a model food product preserved by CS-2a and CS-2b.
Dane BadawczeThe dataset contains the results of determination of the total number of microorganisms in a model food product after the use of the innovative preservatives: CS-2a and CS-2b and control (K) after seven days of refrigerated storage of the product. The test was performed using the surface inoculation method.
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublikacjaW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm znajdowania drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm dla tego problemu z gwarantowaną wielomianową liczbą ruchów.
-
High-order compact difference algorithm on half-staggered meshes for low Mach number flows
Publikacja -
The chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used for the computations. The results we got using the model have been compared to the results obtained from real computational environment.
PublikacjaThe chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used...
-
The Potential of Greed for Independence
PublikacjaThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
On Computational Aspects of Greedy Partitioning of Graphs
PublikacjaIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
Computational aspects of greedy partitioning of graphs
PublikacjaIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
On zero-error codes produced by greedy algorithms
PublikacjaWe present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.
-
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...
-
Bondage number of grid graphs
PublikacjaThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
Rzadka reprezentacja sygnału niestacjonarnego w technice oszczędnego próbkowania
PublikacjaPrzedstawiono zastosowanie techniki oszczędnego próbkowania do rekonstrukcji sygnału niestacjonarnego na podstawie skompresowanych próbek w dziedzinie czas-częstotliwość. Zastosowano nadmiarowy algorytm z różnymi słownikami aby znaleźć rzadką reprezentację sygnału. Wyniki symulacji potwierdzają, że zastosowanie oszczędnego próbkowania pozwala na rekonstrukcję sygnału niestacjonarnego z małej liczby losowo pobranych próbek, z niewielką...
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Detailed results of shaping personnel risk factors in enterprise A
Dane BadawczeThe data presents the shape of all the researched personnel risk factors in the A enterprise (which was tested by the author). Further considerations should be started with the presentation of the synthesis of the obtained results, which is presented in this research data.
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
On practical application of Shannon theory to character recognition and more
PublikacjaLet us consider an optical character recognition system, which in particular can be used for identifying objects that were assigned strings of some length. The system is not perfect, for example, it sometimes recognizes wrongly the characters "Y" and "V". What is the largest set of strings of given length for the system under consideration, which can be mutually correctly recognized, and the corresponding objects correctly identified?...
-
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Independence in uniform linear triangle-free hypergraphs
PublikacjaThe independence number a(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show a new lower bound for a(H) for an r-uniform linear triangle-free hypergraph H with r>=2.
-
Common Independence in Graphs
PublikacjaAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Reliable Greedy Multipoint Model-Order Reduction Techniques for Finite-Element Analysis
PublikacjaA new greedy multipoint model-order reduction algorithm for fast frequency-domain finite-element method simulations of electromagnetic problems is proposed. The location of the expansion points and the size of the projection basis are determined based on a rigorous error estimator. Compared to previous multipoint methods, the quality of the error estimator is significantly improved by ensuring the orthogonality of the projection...
-
Dynamical description of quantum computing: generic nonlocality of quantumnoise
PublikacjaWe develop a dynamical non-Markovian description of quantum computing in the weak-coupling limit, in the lowest-order approximation. We show that the long-range memory of the quantum reservoir (such as the 1/t4 one exhibited by electromagnetic vacuum) produces a strong interrelation between the structure of noise and the quantum algorithm, implying nonlocal attacks of noise. This shows that the implicit assumption of quantum error...
-
Greedy Multipoint Model-Order Reduction Technique for Fast Computation of Scattering Parameters of Electromagnetic Systems
PublikacjaThis paper attempts to develop a new automated multipoint model-order reduction (MOR) technique, based on matching moments of the system input–output function, which would be suited for fast and accurate computation of scattering parameters for electromagnetic (EM) systems over a wide frequency band. To this end, two questions are addressed. Firstly, the cost of the wideband reduced model generation is optimized by automating a...
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublikacjaA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...
-
Wojciech Litwin dr hab. inż.
Osoby1992÷1996 – Studia na Wydziale Mechanicznym Politechniki Gdańskiej1996 – Zatrudniony na Wydziale Oceanotechniki i Okrętownictwa PG2004 – Obrona pracy doktorskiej2014 – obrona rozprawy habilitacyjnej2012 – obejmuje funkcję prodziekan ds. Nauki na Wydziale Oceanotechniki i OkrętownictwaUczestniczył w wielu projektach badawczych oraz pracach zleconych przez przemysł związanych z łożyskowaniem ślizgowym wałów głównych oraz niekonwencjonalnymi...
-
Subadditivity of the minimum output entropy and superactivation of the classical capacity of quantum multiple access channels
PublikacjaWe study subadditivity of the minimum output entropy (Hmin) of quantum multiple access channels (MACs). We provide an example of violation of the additivity theorem for Hmin known in classical information theory. Our result is based on a fundamental property of MACs, i.e., independence of each sender. The channels used in the example can be constructed explicitly. On the basis of subadditivity of Hmin we also provide an example...
-
Deep convolutional neural network for predicting kidney tumour malignancy
PublikacjaPurpose: According to the statistics, up to 15-20% of removed solid kidney tumors turn out to be benign in postoperative histopathological examination, despite having been identified as malignant by a radiologist. The aim of the research was to limit the number of unnecessary nephrectomies of benign tumors. Methods or Background: We propose a machine-aided diagnostic system for kidney...
-
Directed percolation effects emerging from superadditivity of quantum networks
PublikacjaEntanglement-induced nonadditivity of classical communication capacity in networks consisting of quantum channels is considered. Communication lattices consisting of butterfly-type entanglement-breaking channels augmented, with some probability, by identity channels are analyzed. The capacity superadditivity in the network is manifested in directed correlated bond percolation which we consider in two flavors: simply directed and...
-
Experimental test of nonclassicality with arbitrarily low detection efficiency
PublikacjaWe theoretically introduce and experimentally demonstrate the realization of a nonclassicality test that allows for arbitrarily low detection efficiency without invoking an extra assumption of independence of the devices. Our test and its implementation is set in a prepare-and-measure scenario with an upper limit on the classical communication capacity of the channel through which the systems are communicated. The essence for our...
-
Automatic evaluation of information credibility in Semantic Web and Knowledge Grid
PublikacjaThis article presents a novel algorithm for automatic estimation of information credibility. It concerns information collected in Knowledge Grid and Semantic Web. Possibilities to evaluate the credibility of information in such structures are much greater than those available for WWW sites which use natural language. The rating system presented in this paper estimates credibility automatically on the basis of the following metrics:...
-
The impact of end-user participation in IT projects on product usability
PublikacjaMany companies implementing new IT projects encounter numerous problems with ensuring good final product usability. The strong market competition they experience often results in necessity of undertaking difficult decisions with regard to cost minimization. This may force cuts in usability expertise and consulting, most often by limiting end-user participation in the project. However, it may also result in serious consequences...
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublikacjaThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
A New Type of Macro-Elements for Efficient Two-Dimensional FEM Analysis
PublikacjaThis letter deals with a model order reduction technique applicable for driven and eigenvalue problems solved using the finite element method (FEM). It allows one to efficiently compute electromagnetic parameters of structures comprising small features that require strong local mesh refinement. The subdomains of very fine mesh are separated from the global domain as so called macro-elements that undergo model reduction. The macro-elements...
-
Cobalt(II) and Cobalt(III) Tri‐tert‐butoxysilanethiolates. Synthesis, Properties, Crystal and Molecular Structures of [Co{μ‐SSi(OBut)3}{SSi(OBut)3}(NH3)]2 and [Co{SSi(OBut)3}2(NH3)4][SSi(OBut)3] Complexes
PublikacjaThe heteroleptic neutral tri‐tert‐butoxysilanethiolate of cobalt(II) incorporating ammonia as additional ligand (1) has been prepared by the reaction of a cobalt(II) ammine complex with tri‐tert‐butoxysilanethiol in water. Complex 1, dissolved in hexane, undergoes oxidation in an ammonia saturated atmosphere to the ionic cobalt(III) compound 2. Molecular and...
-
JamesBot - an intelligent agent playing StarCraft II
PublikacjaThe most popular method for optimizing a certain strategy based on a reward is Reinforcement Learning (RL). Lately, a big challenge for this technique are computer games such as StarCraft II which is a real-time strategy game, created by Blizzard. The main idea of this game is to fight between agents and control objects on the battlefield in order to defeat the enemy. This work concerns creating an autonomous bot using reinforced...
-
Thermodynamic Characteristics of Phenacetin in Solid State and Saturated Solutions in Several Neat and Binary Solvents
PublikacjaThe thermodynamic properties of phenacetin in solid state and in saturated conditions in neat and binary solvents were characterized based on differential scanning calorimetry and spectroscopic solubility measurements. The temperature-related heat capacity values measured for both the solid and melt states were provided and used for precise determination of the values for ideal solubility, fusion thermodynamic functions, and...
-
Implementation of discrete convolution using polynomial residue representation
PublikacjaConvolution is one of the main algorithms performed in the digital signal processing. The algorithm is similar to polynomial multiplication and very intensive computationally. This paper presents a new convolution algorithm based on the Polynomial Residue Number System (PRNS). The use of the PRNS allows to decompose the computation problem and thereby reduce the number of multiplications. The algorithm has been implemented in Xilinx...
-
Towards Emotion Acquisition in IT Usability Evaluation Context
PublikacjaThe paper concerns extension of IT usability studies with automatic analysis of the emotional state of a user. Affect recognition methods and emotion representation models are reviewed and evaluated for applicability in usability testing procedures. Accuracy of emotion recognition, susceptibility to disturbances, independence on human will and interference with usability testing procedures are...
-
Export diversification and economic development: a dynamic spatial data analysis
PublikacjaThis paper contributes to the empirical literature on the relationship between ‘export variety’ (export diversification) and economic development by relaxing the assumption of cross-country independence and allowing for spatial diffusion of shocks in observed and unobserved factors. Export variety is measured for a balanced panel of 114 countries (1992-2012) using very detailed information on their exports (HS 6-digit product...
-
Parity vertex colouring of graphs
PublikacjaA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
Discrimination of Apple Liqueurs (Nalewka) Using a Voltammetric Electronic Tongue, UV-Vis and Raman Spectroscopy
PublikacjaThe capability of a phthalocyanine-based voltammetric electronic tongue to analyze strong alcoholic beverages has been evaluated and compared with the performance of spectroscopic techniques coupled to chemometrics. Nalewka Polish liqueurs prepared from five apple varieties have been used as a model of strong liqueurs. Principal Component Analysis has demonstrated that the best discrimination between liqueurs prepared from different...
-
UAV Survey Images - DTM - Sopot Tombolo (Salient) Measurement - MP2
Dane BadawczeDataset description: Raw images from photogrammetric survey. Object: littoral zone in SopotLocation: Sopot, Pomerania, PolandDrone type: DJI Mavic Pro 2Flight plan: Single GridTarget Product: Digital Terrain ModelDate: 23.11.2019Direct georeferencing: yesMetadata data: yes/GPSGCP: YESGCP Quality: RTKCamera Name: Hasselblad L1D-20cModel type: PerspectiveImage...
-
UAV Survey Images - 3D Model - GUT Water Tower MP2
Dane BadawczeDataset description: Raw images from photogrammetric survey. Object: Water Tower at Gdansk University Of Technology CampusLocation: Gdansk, Pomerania, PolandDrone type: DJI Mavic Pro 2Flight plan: CircleTarget Product: 3D ModelDate: 08.11.2019Direct georeferencing: yesMetadata data: yes/GPSGCP: NoGCP Quality: N/ACamera Name: Hasselblad L1D-20cModel...
-
Towards a Smart Sustainable City Roadmap
PublikacjaThis workshop of the CAP4CITY (Erasmus+ Strengthening Governance Capacity for Smart Sustainable Cities) project is to promote and stimulate the discussion and networking in the area of Digital Government. Smart Sustainable Cities and related concepts of Digital, Intelligent and Smart Cities represent a progression of how cities around the world apply digital technology to serve their populations, pursue sustainable socio-economic...
-
UAV Survey Images - 3D Model - Gdansk Church Pw. Św. Wojciecha - MP2
Dane BadawczeDataset description: Raw images from photogrammetric survey. Object: Kościół Rzymskokatolicki Pw. Św. WojciechaLocation: Gdansk, Pomerania, PolandDrone type: DJI Mavic Pro 2Flight plan: Circle (Point Of Interest) + Free flightTarget Product: 3D ModelDate: 02.04.2022Direct georeferencing: yesMetadata data: yes/GPSGCP: YESGCP Quality: RTKCamera Name:...
-
UAV Survey Images - DTM- Gdansk Church Pw. Św. Wojciecha - MP2
Dane BadawczeDataset description: Raw images from photogrammetric survey. Object: Kościół Rzymskokatolicki Pw. Św. WojciechaLocation: Gdansk, Pomerania, PolandDrone type: DJI Mavic Pro 2Flight plan: Double GridTarget Product: Digital Terrain ModelDate: 02.04.2022Direct georeferencing: yesMetadata data: yes/GPSGCP: YESGCP Quality: RTKCamera Name: Hasselblad L1D-20cModel...
-
UAV Survey Images - 3D Model - Allegory of science figure - on the tower of the main building of Gdansk University of Technology - MP2
Dane BadawczeDataset description: Raw images from photogrammetric survey. Object: Golden figure at the top of the main bulding of Gdansk University Of TechnologyLocation: Gdansk, Pomerania, PolandDrone type: DJI Mavic Pro 2Flight plan: CircleTarget Product: 3D ModelDate: 08.11.2019Direct georeferencing: yesMetadata data: yes/GPSGCP: NoGCP Quality: N/ACamera Name:...
-
UAV Survey Images - orthophotomap- Gdansk University of Technology campus photogrametry test field- MP2
Dane BadawczeDataset description: Raw images from photogrammetric survey. Object: The photogrametry test field within Gdansk University Of Technology CampusLocation: Gdansk, Pomerania, PolandDrone type: DJI Mavic Pro 2Flight plan: Single GridTarget Product: 3D ModelDate: 17.05.2022Direct georeferencing: yesMetadata data: yes/GPSGCP: YESGCP Quality: RTKCamera Name:...
-
Database of the estimations of the numbers of simplices of triangulation of some classical Lie groups
Dane BadawczeIt is know that any smooth manifold can be triangulated. The number of simplices of triangulation of a given manifold depends on its topological and combinatorial structure. The data consists of the lower bounds for the numbers of simplices of each dimension of any triangulation of classical Lie groups U(n), SU(n), Sp(n), and SO(n) for n up to 25. Each...
-
A Novel Trust-Region-Based Algorithm with Flexible Jacobian Updates for Expedited Optimization of High-Frequency Structures
PublikacjaSimulation-driven design closure is mandatory in the design of contemporary high-frequency components. It aims at improving the selected performance figures through adjustment of the structure’s geometry (and/or material) parameters. The computational cost of this process when employing numerical optimization is often prohibitively high, which is a strong motivation for the development of more efficient methods. This is especially...
-
UAV Survey Images - orthophotomap - Gdynia Chwaszczyno - PH4 - AGL 50 m
Dane BadawczeDataset description: Raw images from photogrammetric survey. Object: Parking place near by Gdynia Chwaszczyno district Location: Gdynia, Pomerania, PolandDrone type: DJI Phantom 4 ProFlight plan: Single GridTarget Product: OrthophotoDate: 11.07.2019Direct georeferencing: yesMetadata data: yes/GPSGCP: Yes - Description and position includedGCP Quality:...
-
UAV Survey Images - orthophotomap - Gdynia Container Terminal Day Light- MP2
Dane BadawczeDataset description: Raw images from photogrammetric survey. Object: Parking place near by Gdynia Container Terminal - day light photosLocation: Gdynia, Pomerania, PolandDrone type: DJI Mavic Pro 2Flight plan: Single GridTarget Product: OrthophotoDate: 15.10.2020Direct georeferencing: yesMetadata data: yes/GPSGCP: Yes - Description and position includedGCP...
-
UAV Survey Images - orthophotomap - Gdynia Container Terminal Night Time- MP2
Dane BadawczeDataset description: Raw images from photogrammetric survey. Object: Parking place near by Gdynia Container Terminal - night artificial photosLocation: Gdynia, Pomerania, PolandDrone type: DJI Mavic Pro 2Flight plan: Single GridTarget Product: OrthophotoDate: 14.10.2020Direct georeferencing: yesMetadata data: yes/GPSGCP: Yes - Description and position...
-
UAV Survey Images - orthophotomap - Gdynia Chwaszczyno - PH4 - AGL 100 m
Dane BadawczeDataset description: Raw images from photogrammetric survey. Object: Parking place near by Gdynia Chwaszczyno district Location: Gdynia, Pomerania, PolandDrone type: DJI Phantom 4 ProFlight plan: Single GridTarget Product: OrthophotoDate: 11.07.2019Direct georeferencing: yesMetadata data: yes/GPSGCP: Yes - Description and position includedGCP Quality:...
-
Report of Eurocode 7 application for pile foundation design in Poland
PublikacjaThe EC7 rules of geotechnical design are in use in Poland for several years, even though there is no National annex. With regard to pile foundations, there are valid EC7 recommendations concerning design approaches, load partial coefficients, correlation coefficients and capacity partial coefficients. Polish designers can be quite flexible when it comes to choose a method for static, bearing capacity and settlement calculations....
-
LOCAL E-MARKETING AND PHARAMACY SELECTION PROCESS AMONG CURRENT AND PROSPECTIVE CONSUMERS
PublikacjaWORK OBJECTIVES: To examine whether and to what extent a company's presence in Google Search mobile results, and Google Maps service search results, affects pharmacies' acquisition of new consumers RESEARCH QUESTIONS: Does the presence of pharmacies in Google MyBusiness increase the number of their customers ? Is the increase in the...
-
Export diversification and economic development: A dynamic spatial data analysis
PublikacjaThis paper contributes to the empirical literature on the relationship between “export variety” (export diversification) and economic development by relaxing the assumption of cross-country independence and allowing for spatial diffusion of shocks in observed and unobserved factors. Export variety is measured for a balanced panel of 114 countries (1992–2012) using very detailed information on their exports (HS 6-digit product level)....
-
Modular power converter topologies for energy storage and electric power distribution systems
PublikacjaThis paper describes selected issues concerning realization of energy storage system (ESS) designed to operate in power distribution system. In order to achieve scalability of the system a modular approach is proposed. In addition to this different configuration of the system are analyzed, where depending on requirements and application a scalability in power, in energy capacity of energy storage resource and both in power and...
-
Termination functions for evolutionary path planning algorithm
PublikacjaIn this paper a study of termination functions (stop criterion) for evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Five...
-
On-line ranking of split graphs
PublikacjaA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
LIGHT POLLUTION IN THE CONTEXT OF THREATS TO THE WILDLIFE CORRIDORS
PublikacjaAccess to remote sensing night-time imagery allows for modeling of light pollution Increasingly, data on the propagation of artificial light are a source of interesting information for different fields of science and affect the planning of economic development. The article presents the problem of light pollution in the context of threats to the wildlife corridors in Poland. Wildlife corridors are areas that allow safe migration...
-
Performance of the Direct Sequence Spread Spectrum Underwater Acoustic Communication System with Differential Detection in Strong Multipath Propagation Conditions
PublikacjaThe underwater acoustic communication (UAC) operating in very shallow-water should ensure reliable transmission in conditions of strong multipath propagation, significantly disturbing the received signal. One of the techniques to achieve this goal is the direct sequence spread spectrum (DSSS) technique, which consists in binary phase shift keying (BPSK) according to a pseudo-random spreading sequence. This paper describes the DSSS...
-
Multi-objective Tabu-based Differential Evolution for Teleportation of Smart Virtual Machines in Private Computing Clouds
PublikacjaWe propose a multi-objective approach for using differential evolution algorithm with tabu search algorithm as an additional mutation for live migration (teleportation) of virtual machines. This issue is crucial in private computing clouds. Teleportation of virtual machines is supposed to be planned to determine Pareto-optimal solutions for several criteria such as workload of the bottleneck host, communication capacity of the...
-
Minimization of the number of periodic points for smooth self-maps of closed simply-connected 4-manifolds
PublikacjaLet M be a smooth closed simply-connected 4-dimensional manifold, f be a smooth self-map of M with fast grow of Lefschetz numbers and r be a product of different primes. The authors calculate the invariant equal to the minimal number of r-periodic points in the smooth homotopy class of f.
-
A novel degree-hour method for rational design loading
PublikacjaCooling degree-hours (CDH) received the broadest application in evaluation of the ambient air cooling efficiency in power engineering (engine intake air cooling systems) and air conditioning. The current CDH numbers are defined as a drop in air temperature multiplied by associated time duration of performance and their summarized annual number is used to estimate the annual effect achieved due to sucked air cooling in power plants...
-
Statistics of AFM current-voltage curves
Dane BadawczeMapping surface electrical conductivity offers enormous cognitive possibilities regarding the structure and properties of modern materials. The technique invented for this purpose (Conductive AFM) by Murrel's team and colleagues allows independent monitoring of the local conductivity of materials in correlation with the topographic profile. The mentioned...
-
METHOD OF ROUTING SHIPS SAILING IN DEDICATED ENVIRONMENT
PublikacjaThe method for determining the suboptimal route of sailing vessels operating in a restricted area of the sea are proposed in the paper. The dynamics of the environment including weather conditions and speed characteristics of ships sailing are considered. As optimiza-tion criterion, measure sailing time T, and the number of maneuvers performed ω, are taken into account. An heuristic algorithm, and the appropriate application routing...
-
Proximal primal–dual best approximation algorithm with memory
PublikacjaWe propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous...
-
Brief Announcement: Energy Constrained Depth First Search
PublikacjaDepth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...
-
A study of jet impingement cooling enhancement by concave and convex heat sink shape modifications
PublikacjaThe rising demand for efficient cooling technologies is a strong driver of extensive research in this area. This trend is particularly strong in turbines and microprocessors technology. Presented study is focused on the jet impingement cooling concept, which is used in various configurations for many years. The potential of the heat sink shape modification is not yet fully explored. Available literature suggests that average Nusselt...
-
Fast Calibration-Free Single-Anchor Indoor Localization Based on Limited Number of ESPAR Antenna Radiation Patterns
Publikacja— In this article, we investigate how the calibrationfree single-anchor indoor localization algorithm developed for base stations equipped with electronically steerable parasitic array radiator (ESPAR) antennas can further be improved. By reducing the total number of ESPAR antenna radiation patterns used in localization process, one can significantly reduce the time needed for an object localization. Performed localization measurements...
-
Minimising the Churn Out of the Service by Using a Fairness Mechanism
PublikacjaThe paper proposes an algorithm of bandwidth distribution, ensuring fairness to end-users in computer networks. The proposed algorithm divides users into satisfied and unsatisfied users. It provides fairness in terms of quality of experience (QoE) for satisfied users and quality of service (QoS) for unsatisfied users. In this paper, we present detailed comparisons relevant to service providers to show the advantages of the proposed...
-
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
PublikacjaWe study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the objective is to minimize the size of this team. The agents start at a single node, the designated root of the tree and the height of the tree is assumed to be less than the energy...
-
Comparison of the Efficiency of Turbo Codes with Mechanisms of Reducing the Number of Iterations
PublikacjaThe paper presents the construction of encoders and decoders turbo codes with different number of states. Simulation results of the transmission quality of the turbo codes were presented. Decoders for turbo codes have worked with a fixed number of iterations and with the mechanisms reducing the number of iterations. Data were transmitted in Outdoor to Indoor & Pedestrian B environment for data rate 384 kbps. The SOVA algorithm...
-
Strong-coupling superconductivity of SrIr2 and SrRh2 : Phonon engineering of metallic Ir and Rh
PublikacjaExperimental and theoretical studies on superconductivity in SrIr2 and SrRh2 Laves phases are presented. The measured resistivity, heat capacity, and magnetic susceptibility confirm the superconductivity of these compounds with Tc = 6.07 and 5.41 K, respectively. Electronic structure calculations show that the Fermi surface is mostly contributed by 5d (4d) electrons of Ir (Rh), with Sr atoms playing the role of electron donors....
-
Overheating of underground power cable line due to its partial exposition to solar radiation
PublikacjaCurrent-carrying capacity of underground power cable lines depends, among others, on thermal resistivity of the soil and cables layout: trefoil formation, flat formation with or without spacing. If conditions for heat transfer in the ground are favorable, the current-carrying capacity is relatively high. Therefore, it generates risk of the power cables overheating, if part of the cable line is located vertically in the air, to...
-
Quaternion encryption methods for multimedia transmission, a survey of existing approaches
PublikacjaIn this paper we review quaternion encryption methods for multimedia transmission. We explain their weak and strong properties as well as suggest possible modifications. Our main focus is an algorithm QFC presented in paper by Dzwonkowski et al. (2015). All encryption methods, presented in this paper, use special properties of quaternions to perform rotations of data sequences in 3D space. Each method uses a common key generation...
-
Equitable coloring of corona multiproducts of graphs
PublikacjaWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
-
Data obtained by numerical simulation for X-ray focusing using a finite difference method
Dane BadawczeThe propagation of X-ray waves through an optical system consisting of many X-ray refractive lenses is considered. For solving the problem for an electromagnetic wave, a finite-difference method is applied.
-
Efficient algorithm for blinking LED detection dedicated to embedded systems equipped with high performance cameras
PublikacjaThis paper presents the concept and implementation of an efficient algorithm for detection of blinking LED or similar signal sources. Algorithm is designed for embedded devices equipped with high performance cameras being a part of an indoor positioning embedded system. An algorithm to be implemented in such a system should be efficient in terms of computational power what is hard to be achieved when large amount of data from camera...
-
Efektywna metoda wyznaczania trasy statków żaglowych
PublikacjaZaproponowano metodę wyznaczania suboptymalnej trasy statków żaglowych poruszających się w ograniczonym akwenie morskim. Uwzględniono przy tym dynamikę tego środowiska w tym warunki pogodowe oraz charakterystyki prędkościowe statków żaglowych. Jako kryterium optymalizacji przyjęto czas żeglugi T oraz liczbę wykonanych manewrów ω. Zaprojektowano heurystyczny algorytm oraz odpowiednią aplikację wyznaczania trasy dla ustalonych punktów...
-
Acoustic journal bearing - A search for adequate configuration
PublikacjaClassical non-contact bearings are already used in a number of specialist applications but there are somespecialist areas where they cannot be used for variety of reasons and acoustic sliding bearings could be an alternative. The paper presents the quest for a configuration of an acoustic journal bearing and shows that the overall shape of the bearing and its geometry are of a vital importance for the load capacity oft he bearing....
-
Cheap Cancellation of Strong Echoes for Digital Passive and Noise Radars
PublikacjaThe problem of cancellation of strong, potentially nonstationary,echoes in noise radars and passive radars utilizing digitaltransmissions is considered. The proposed solution is a multi-stage procedure.Initial clutter estimates, obtained using the least mean squares(LMS) algorithm, are refined using specially designed filters, "matched"to spectral densities of targets and clutter. When the postprocessing filtersare noncausal, the...
-
WIKI-WS as a C2 NIWA Web Service Management Platform
PublikacjaThe Wiki-WS platform was implemented within the C2 NIWA project for production purposes. Wiki-WS stands for developing, managing and maintaining web services. The production deployment needed implementation of several functional improvements and establishing a strong security 7 safety policy. The WikiWS platform has to be used as an educational environmement for developing web sevices and production environment for execution of...
-
Simultaneous voltammetric determination of Cd2+, Pb2+, and Cu2+ ions captured by Fe3O4@SiO2 core-shell nanostructures of various outer amino chain length
PublikacjaIn the present study, we examined a novel functionalised magnetic nanoparticles Fe3O4@SiO2-Nn as a nano adsorbent for binding of Cd2+, Pb2+, Cu2+ ions in an aqueous solution. First, we obtained the nanoparticles functionalised with various carbon chains containing different number of amino groups: (3-amino)propyltriethoxysilane (Fe3O4@SiO2-N1), N-(2-aminoethyl)-3-aminopropyltrimethoxysilane (Fe3O4@SiO2-N2) and N1-(3-trimethoxysilylpropyl)diethylenetriamine...
-
Self-Adaptive Mesh Generator for Global Complex Roots and Poles Finding Algorithm
PublikacjaIn any global method of searching for roots and poles, increasing the number of samples increases the chances of finding them precisely in a given area. However, the global complex roots and poles finding algorithm (GRPF) (as one of the few) has direct control over the accuracy of the results. In addition, this algorithm has a simple condition for finding all roots and poles in a given area: it only requires a sufficiently dense...
-
Neural Network-Based Sequential Global Sensitivity Analysis Algorithm
PublikacjaPerforming global sensitivity analysis (GSA) can be challenging due to the combined effect of the high computational cost, but it is also essential for engineering decision making. To reduce this cost, surrogate modeling such as neural networks (NNs) are used to replace the expensive simulation model in the GSA process, which introduces the additional challenge of finding the minimum number of training data samples required to...
-
Organizacja systemu opieki nad seniorami wyzwaniem dla samorządów lokalnych
PublikacjaA significant part of the activities undertaken so far under the senior policy, also at the local level, have been focused on seniors’ social (physical and educational) activation. The growing number of the oldest seniors, with limited independence, living alone in single‑person households, away from their families, will force the policy priorities to be reoriented in such a way as to develop efforts to provide different types...