Wyszukiwarka
Filtry
wszystkich: 2905
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: SCATTERING NUMBER, MATCHING NUMBER
-
Preserving Trees in Automata
PublikacjaWe present a method to store additional information in a minimal automaton so that it is possible to compute a corresponding tree node number for a state. The number can then be used to retrieve additional information. The method works for minimal (and any other) deterministic acyclic finite state automata (DFAs). We also show how to compute the inverse mapping.
-
2-outer-independent domination in graphs
PublikacjaWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
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|...
-
Free Convection Heat Transfer from Horizontal Cylinders
PublikacjaThe results of experimental investigation of free convection heat transfer in a rectangular container are presented. The ability of the commonly accepted correlation equations to reproduce present experimental data was tested as well. It was assumed that the examined geometry fulfils the requirement of no-interaction between heated cylinder and bounded surfaces. In order to check this assumption recently published correlation equations...
-
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...
-
2-bondage in graphs
PublikacjaA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
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...
-
Local-Global Space Mapping for Rapid EM-Driven Design of Compact RF Structures
PublikacjaIn this work, we introduce a robust and efficient technique for rapid design of compact RF circuits. Our approach exploits two-level space mapping (SM) correction of an equivalent circuit model of the structure under design. The first SM layer (local correction) is utilized to ensure good matching between the equivalent circuit and the electromagnetic model at the component level. On the other hand, the global correction allows...
-
Tagged images with LEGO bricks part 2
Dane BadawczeThe data set conatins tagged images conatining LEGO bricks used for traning LEGO bricks detecting network. The images contain random number of the same LEGO bricks on white background. Only the whole bricks are labeled.
-
The structure of the Polish banking sector in 2004-2018
Dane BadawczeDynamic changes in the banking system in the 1990s contributed to the relative stability of the number of banks in all sectors (state-owned, private, cooperative) after 2004. The total number of banks (including credit institutions) has decreased since 2004 from 653 to 612 in 2018 - it should therefore be noted that in the analyzed period the Polish...
-
Auditory Brainstem Responses recorded employing Audio ABR device
Dane BadawczeThe dataset consists of ABR measurements employing click, burst and speech stimuli. Parameters of the particular stimuli were as follows:
-
THREE-DIMENSIONAL numerical investigation of MHD nanofluid convective heat transfer inside a CUBIC porous container with corrugated bottom wall
PublikacjaSimultaneous use of porous media and nanofluid as a heat transfer improvement method has recently captivated a great deal of attention. The heat transfer and entropy production of the Cu-water nanofluid inside a cubic container with a heated bottom wavy wall and an elliptic inner cylinder were numerically analyzed in this study. The container is partitioned into two sections: the left side is filled with permeable media and...
-
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...
-
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...
-
Józef Kotus dr hab. inż.
Osoby -
History of urban planning I
Kursy OnlineThe course is aimed to the Erasmus students in the summer term. During he course students learn the principles and conditions of development of urban settlements in the time periods from ancient times to the 18th century (ancient Greece, Rome, Middle Ages, Renaissance, Baroque and Classicism). The students prepare 3 excercises: Task 1 - Cities of ancient Greece and Rome; Task 2 - Medieval Cities; Task 3 - Cities of Renaissance,...
-
STARZEJĄCY SIĘ PRZEDSIĘBIORCA W POLSCE I NA ŚWIECIE
PublikacjaPoniższy artykuł wskazuje na rosnącą liczbę przedsiębiorców w wieku okołoemerytalnym, tak w krajach europejskich, w tym w Polsce, jak i w USA. Wzrost ten wynika zarówno z rosnącej liczby osób w tej grupie wiekowej, które zakładają swoje firmy, jak i z rosnącej liczby osób, które prowadząc od wielu lat swoje firmy, nie zamierzają przejść na emeryturę. Z nielicznych badań wśród osób starszych prowadzących własne firmy wynika, że...
-
Paweł Burdziakowski dr inż.
Osobydr inż. Paweł Burdziakowski jest specjalista w zakresie fotogrametrii i teledetekcji lotniczej niskiego pułapu, nawigacji morskiej i lotniczej. Jest również licencjonowanym instruktorem lotniczym oraz programistą. Głównymi obszarami zainteresowania jest fotogrametria cyfrowa, nawigacja platform bezzałogowych oraz systemy bezzałogowe, w tym lotnicze, nawodne, podwodne. Prowadzi badania w zakresie algorytmów i metod poprawiających...
-
Tomasz Maria Boiński dr inż.
OsobyZ uczelnią jestem związany już od 2000r kiedy to rozpocząłem studia na kierunku Informatyka wydziału Elektroniki, Telekomunikacji i Informatyki. Po ich ukończeniu z wyróżnieniem, w 2005 roku rozpocząłem studia doktoranckie. W trakcie studiów i bezpośrednio po ich zakończeniu zaangażowany byłem, we współpracy z firmą Hogart z Warszawy, we wdrażanie rozwiązań biznesowych w gdyńskiej firmie Elektronia S.A. (Infor FMS SunSystems) oraz...
-
Micelle formation of Tween 20 nonionic surfactant in imidazolium ionic liquids
PublikacjaAggregation behavior of polyoxyethylene (POE)-type nonionic surfactant Tween 20 in imidazolium ionic liquids with varying chain length and different anions, such as tetrafluoroborate, hexafluorophosphate, bis(trifluoromethanesulfonyl)imide, and trifluoromethanesulfonate, was investigated by means of surface tension, conductivity and dynamic light scattering measurements. The role of the chain length, anion size as well as interactions...
-
Józef Woźniak prof. dr hab. inż.
OsobyProf. dr hab. inż. Józef Woźniak prof. zw. Politechniki Gdańskiej ukończył studia na Wydziale Elektroniki Politechniki Gdańskiej w 1971 r. W 1976 r. uzyskał stopień doktora nauk technicznych, a w 1991 r. stopień doktora habilitowanego w dyscyplinie telekomunikacja i specjalności teleinformatyka. W styczniu roku 2002 otrzymał tytuł profesora nauk technicznych. W 1994 r. został mianowany na stanowisko profesora nadzwyczajnego w Politechnice...
-
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...
-
Thermal visualization of Ostwald-de Waele liquid in wavy trapezoidal cavity: Effect of undulation and amplitude
PublikacjaThe present study is concerned with the numerical simulations of Ostwald-de Waele fluid flow in a wavy trapezoidal cavity in the presence of a heated cylinder situated at the center of the cavity. The work consists in characterizing the mixed convection as a function of the intensity of heat flow. The flow behaviour and temperature distribution in a cavity are the main focus of this study. The lower wall of the cavity is fixed...
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
VIBRATION PARAMETERS FOR DAMAGE DETECTION IN STRUCTURES
PublikacjaThe aim of this paper is to examine how damage indicators are sensitive to changing number of frequencies and mode shapes and also to number and location of measurement points. The influence of measurement errors was also analyzed for all cases. For the analysis, those damage indicators are chosen which use changes in such modal parameters as natural frequencies and mode shapes and also differences between the curvatures of the damaged...
-
Paweł Filipkowski dr inż.
Osobymgr inż - Uniwersytet Przyrodniczy we Wrocławiu, Wydział Nauk o Żywności, Katedra Mikrobiologii Technicznej i Żywnosci, Prof. Maria Wojtatowicz/ Prof. Waldemar Rymowicz, adiunkt - Uniwersytet Ekonomiczny we Wrocławiu, Wydział Inzynieryjno-Ekonomiczny, Katedra Inżynierii Bioprocesowej, Prof. Tadeusz Miśkiewicz/ Prof. Edward Cybis, dr - Politechnika Gdańska, Wydział Chemiczny, Katedra Mikrobiologii, ś.p. Prof. Józef Kur, Staże w...
-
Conditions for Multiple Acquisition of Echoes from Stationary Targets in Successive Transmissions of Active Sonars
PublikacjaIn echolocation, the highest possible number of contacts with a detected target is clearly decisive on the possibilities of echo processing to optimise the estimation of distinctive characteristics of the observed target. In hydrolocation, the slow propagation of acoustic waves in water reduces the number of contacts of echosounders and sonars with detected targets. The article considers model conditions for acquiring multiple...
-
Damage detection in plates based on Lamb wavefront shape reconstruction
PublikacjaMany of the current studies in the area of damage detection using elastic wave propagation are based on deploying sensor networks with a large number of piezoelectric transducers to detect small-size cracks. A major limitation of these studies is that cracks are usually larger and have different shapes in real cases. Moreover, using a large number of sensing nodes for damage detection is both costly and computationally intensive....
-
Promocja zasobów Pomorskiej Biblioteki Cyfrowej na przykładzie XVIII-wiecznego rękopisu
PublikacjaCelem artykułu jest przedstawienie sposobu udostępniania i promocji zbiorów rękopiśmiennych na przykładzie XVIII-wiecznego rękopisu Christiana Gabriela Fishera dostępnego w Pomorskiej Bibliotece Cyfrowej (dalej: PBC). Rękopis ten stał się inspiracją do podjęcia współpracy Biblioteki Politechniki Gdańskiej oraz Instytutu Kultury Miejskiej w Gdańsku. Dzięki wspólnej inicjatywie rozpoczęto prace nad transkrypcją niemieckiego tekstu...
-
Three-dimensional numerical investigation of hybrid nanofluids in chain microchannel under electrohydrodynamic actuator
PublikacjaEnergy efficiency enhancement methods have received considerable attentionwithin the industry and scientific community, owing to the rising concern ofglobal energy sustainability. The present article attempts to scrutinize the effectsof electrohydrodynamics and nanofluids on the rate of heat transfer and fluidflow in the 3-D chain microchannels. Improved heat exchangers (e.g., chainmicrochannel) would have a key role in increasing...
-
On Tradeoffs Between Width- and Fill-like Graph Parameters
PublikacjaIn this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...
-
Improving depth maps of plants by using a set of five cameras
PublikacjaObtaining high-quality depth maps and disparity maps with the use of a stereo camera is a challenging task for some kinds of objects. The quality of these maps can be improved by taking advantage of a larger number of cameras. The research on the usage of a set of five cameras to obtain disparity maps is presented. The set consists of a central camera and four side cameras. An algorithm for making disparity maps called multiple...
-
Rozwój polskiego winiarstwa w latach 2000–2017
PublikacjaW artykule przedstawiono historie polskiego winiarstwa. Na podstawie danych zawartych w raportach Agencji Rynku Rolnego przedstawiono kształtowanie się liczby winnic oraz powierzchni upraw winorośli i zbioru winogron w latach 2009–2018. Dane z portalu winogrodnicy.pl posłużyły do scharakteryzowania liczby winnic wraz z ich lokalizacją oraz powierzchnią. Z przeprowadzonej analizy wynika, że polskie winiarstwo od ponad 20 lat przeżywa...
-
An automatic system for identification of random telegraph signal (RTS) noise in noise signals
PublikacjaIn the paper the automatic and universal system for identification of Random Telegraph Signal (RTS) noise as a non-Gaussian component of the inherent noise signal of semiconductor devices is presented. The system for data acquisition and processing is described. Histograms of the instantaneous values of the noise signals are calculated as the basis for analysis of the noise signal to determine the number of local maxima of histograms...
-
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.
-
Market Structure and Market Power in Selected Sectors of The Polish Economy Based on COICOP Classification
PublikacjaThis paper present new and simple measures of market structure and market power. Based on the classical models of market structures, where a given structure is determined by the number of enterprises, indexes of degree of monopoly have been estimated, representing an average number of entities per branch. Additionally, market power indexes have been determined as an average revenue per an enterprise in a given branch. This approach...
-
The Impact of Homogeneity of High Modulus Asphalt Concrete Layer on Low-Temperature Cracking
PublikacjaDuring winter season of 2012 numerous transverse cracks developed in high-modulus asphalt concrete (HMAC) base of newly constructed motorway. Pavement cracked both in transverse joint locations and in the area between them. Research which was conducted during investigation of the causes and mechanisms of cracking consisted of: field examination, laboratory testing of specimens cored out of the existing pavement, computational analyses...
-
Tight bounds on global edge and complete alliances in trees
PublikacjaIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
Integration of brood units in game universe
PublikacjaAn access to a great number of various services allows for decomposition of complex problems Developing a game universe usually involves creation of various units which can be encountered by a player. Those can be lonely or organized in broods animals and monsters wandering around the game world. In order to provide natural gaming experience those units should behave variously depending on the world situation. Those behaviours...
-
Universities as Part of the Urban Transport System—Analysis Using the Example of the Gdansk University of Technology and Medical University of Gdansk
PublikacjaMany cities perceive academic function as a distinctive feature, representing the rank and prestige of the city. Universities provide places for work and learning for a high number of people and represent a significant proportion compared to the total city population (even 22%). Many of Polish universities are located in the urban structure in the form of spatially concentrated campuses, where the number of people working and studying...
-
A taxonomy of challenges to resilient message dissemination in VANETs
PublikacjaInter-vehicular communications is seen as a promising solution to a number of issues related with public road safety, road congestion management, and infotainment. However, Vehicular Ad-hoc NETworks (VANETs) characterized by high mobility of vehicles and facing a number of other issues related with high frequency wireless communications and network disconnections, encounter major challenges related with reliability of message delivery....
-
Application of genetic algorithms in graph searching problem
PublikacjaGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
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...
-
Infinite chromatic games
PublikacjaIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
A Simulative Comparison of Ship Domains and Their Polygonal Approximations
PublikacjaThe paper investigates the impact of a precise ship domain shape on the size of collision avoidance manoeuvres. The considered collision avoidance manoeuvres include both course and speed alterations. Various ship domains are compared with their polygonal approximations, which vary in the number of points of a domain contour and placement of these points. The best of all considered approximations is determined in the course of...
-
Robert Jankowski prof. dr hab. inż.
OsobyUrodził się 26 grudnia 1968 r. w Gdyni. Absolwent Liceum Ogólnokształcącego przy Konsulacie PRL w Benghazi, Libia (1987), student Politechniki Gdańskiej (studia magisterskie jednolite, 1987-1991 i 1992-1993), Uniwersytetu w Sheffield, Anglia (studia inżynierskie, 1991-1992), Uniwersytetu w Roskilde, Dania (kurs magisterski, 1993) oraz Uniwersytetu Tokijskiego, Japonia (studia doktoranckie, 1994-1997). Od początku pracy zawodowej...
-
Asking Data in a Controlled Way with Ask Data Anything NQL
PublikacjaWhile to collect data, it is necessary to store it, to understand its structure it is necessary to do data-mining. Business Intelligence (BI) enables us to make intelligent, data-driven decisions by the mean of a set of tools that allows the creation of a potentially unlimited number of machine-generated, data-driven reports, which are calculated by a machine as a response to queries specified by humans. Natural Query Languages...
-
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...
-
Numerical Study of Turbulent Flow and Heat Transfer of Nanofluids in Pipes
PublikacjaIn this work, Nusselt number and friction factor are calculated numerically for turbulent pipe flow (Reynolds number between 6000 and 12000) with constant heat flux boundary condition using nanofluids. The nanofluid is modelled with the single-phase approach and the simulation results are compared with experimental data. Ethylene glycol and water, 60:40 EG/W mass ratio, as base fluid and SiO2 nanoparticles are used as nanofluid...
-
Pipelined Two-Operand Modular Adders
PublikacjaPipelined two-operand modular adder (TOMA) is one of basic components used in digital signal processing (DSP) systems that use the residue number system (RNS). Such modular adders are used in binary/residue and residue/binary converters, residue multipliers and scalers as well as within residue processing channels. The structure of pipelined TOMAs is usually obtained by inserting an appropriate number of pipeline register layers within...