Filters
total: 2732
filtered: 1708
displaying 1000 best results Help
Search results for: CONVEX DOMINATING SET
-
Gene set enrichment for reproducible science: comparison of CERNO and eight other algorithms
Publication -
Determination of magnetisation conditions in a Double-Core Barkhausen Noise measurement set-up
PublicationThe magnetic Barkhausen effect is useful forassessing 1D and 2D stress states of ferromagnetic steelobjects. However, its extension to technically importantmaterials, such as duplex anisotropic steels, remains challenging. The determination of magnetisation inside the studied object and the electromagnet for various geometries, materials and magnetisation angles is a key issue.Three-dimensional, dynamic finite element analysis...
-
Intelligent acquisition of audio signals, employing neutral networks and rough set algorithms
PublicationAlgorytmy oparte na sztucznych sieciach neuronowych i metodzie zbiorówprzybliżonych zostały zastosowane do lokalizacji sygnałów fonicznych obar-czonych pasożytniczym szumem i rewerberacjami. Informacja o kierunku napły-wania dźwięku była uzyskiwana na wyjściach tych algorytmów na podstawie re-prezentacji parametrycznej. Przedstawiono wyniki eksperymentalne i przepro-wadzono ich dyskusję.
-
Investigation of some taste substances using a set of electrodes with lipid-modified membranes.
PublicationSkonstruowano 5-cio kanałaowy sensor smaku oparty na elektordach jonoselektywnych z membranami polimerowymi modyfikowanymi lipidem. Badano potencjał elektrod w roztworach kwaśnych zawierających różne stężenie kwasu cytrynowego, solnego i octowego. Sensor jest czuły na stężenia substancji kwaśnych z wyjątkiem kwasu octowego. Testowano nowy typ elektrod zawierających polimer przewodzący PEDT/PSS i kwas oleinowy. Stwierdzono, że...
-
Sensitivity, Specificity and Prioritization of Gene Set Analysis When Applying Different Ranking Metrics
Publication -
Affymetrix Chip Definition Files Construction Based on Custom Probe Set Annotation Database
Publication -
Local properties of the solution set of the operator equation in Banach spaces in a neighbourhood of a bifurcation point.
PublicationW niniejszej pracy badamy problem istnienia bifurkacji w zbiorze rozwiązań równania F(x,p)=0, gdzie F jest odwzorowaniem klasy C^2z iloczynu kartezjańskiego X i R^k do Y, X i Y są przestrzeniami Banacha takimi, że X jest podprzestrzenią liniową Y. Co więcej, dany jest iloczyn skalarny w Y, ciągły względem norm w X i Y. Pokazujemy, że pod pewnymi warunkami (0,p) jest punktem bifurkacji i opisujemyzbiór rozwiązań równania F(x,p)=0...
-
A framework for accelerated optimization of antennas using design database and initial parameter set estimation
PublicationThe purpose of this paper is to exploit a database of pre-existing designs to accelerate parametric optimization of antenna structures is investigated. Design/methodology/approach The usefulness of pre-existing designs for rapid design of antennas is investigated. The proposed approach exploits the database existing antenna base designs to determine a good starting point for structure optimization and its response sensitivities....
-
CPLFD-GDPT5: High-resolution gridded daily precipitation and temperature data set for two largest Polish river basins
PublicationThe CHASE-PL (Climate change impact assessment for selected sectors in Poland) Forcing Data–Gridded Daily Precipitation & Temperature Dataset–5 km (CPLFD-GDPT5) consists of 1951–2013 daily minimum and maximum air temperatures and precipitation totals interpolated onto a 5 km grid based on daily meteorological observations from the Institute of Meteorology and Water Management (IMGW-PIB; Polish stations), Deutscher Wetterdienst...
-
Potentiometric sensor containing set of ion selective electrodes with lipid modified membranes for quality assessment of tested non-alcoholic beverages
PublicationPotentiometric sensors may be a good tool for fast quality control of commercial drinks. In this work, such a sensor, containing a set of ion-selective electrodes with lipid-modified membranes (benzylhexadecyldimethylammonium chloride monohydrate, hexadecylamine, 1-dodecanol, elaidic acid, cholesterol) was used for discrimination and quality control of non-alcoholic beverages, mainly composed of sugar and citric acid. It was found...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Impact of Movement Tempo Distribution on Bar Velocity During a Multi-Set Bench Press Exercise
Publication -
AN EXPERIMENTAL STUDY OF THE PHOTOCATALYTIC HYDROGEN PRODUCTION IN THE LABORATORY-SCALE SET-UP DEPENDING ON THE PROCESS CONDITIONS
Publication -
Emplying set of experience knowledge structure and decisional DNA to enhance industrial design: conceptual approach
PublicationZaprezentowano koncepcje wspomagania projektowania przemyslowego przy pomocy nowoczenego podejscia do reprezentacji wiedzy w postaci SOEKS oraz Decyzyjnego DNA
-
Enhancing set of experiance knowledge structure (SOEKS) with w nearest neighbour algorithm Relief-F
PublicationPrzedstawiono koncepcje uzupelnienia i wpsomagania struktury wiedzy opartej na SOEKS przy pomocy algorytmu przypisujacego wagi atrybutow.
-
Advances in analysis, quantification and modelling of N2O emission in SBRs under various DO set points
PublicationNitrous oxide (N2O), considered a major greenhouse gas (GHG) in wastewater treatment plants (WWTPs), is produced during both nitrification and denitrification processes; hence, it needs to be controlled by internal and external strategies. Various factors, such as DO, temperature, and pH, could be incorporated into the mitigation of emissions in WWTPs. In this research, potential operational strategies were investigated in order...
-
Mass spectrometry reveals the presence of specific set of epigenetic DNA modifications in the Norway spruce genome
Publication -
How Good Is My Project? Experiences from Projecting Software Quality Using a Reference Set
Publication -
Creating neural models using an adaptive algorithm for optimal size of neural network and training set.
PublicationZaprezentowano adaptacyjny algorytm generujący modele neuronowe liniowych układów mikrofalowych, zdolny do oszacowania optymalnego rozmiaru zbiory uczącego i sieci neuronowej. Stworzono kilka modeli nieciągłości falowodowych i mokropaskowych, a następnie zweryfikowano ich poprawność porównując wyniki analiz metodą dopasowania rodzajów i metodą momentów filtrów pasmowo-przepustowych.
-
Why set of experience knowledge structure can be considered a knowledge representattion for formal decision events?
PublicationOmówiono zasady reprezentacji wiedzy przy pomocy zbioru dośwadczeń. Uzasadniono wybór takiej reprezentacji na tle badańliteraturowych.
-
SELECTING A REPRESENTATIVE DATA SET OF THE REQUIRED SIZE USING THE AGENT-BASED POPULATION LEARNING ALGORITHM
Publication -
Set membership estimation of parameters and variables in dynamic networks by recursive algorithms with moving measurment window
PublicationW artykule rozważana jest łączna estymacja przedziałowa zmiennych i parametrów w złożonej sieci dynamicznej w oparciu niepewne modele parametryczne i ograniczoną liczbę pomiarów. Opracowany został rekursywny algorytm estymacji z przesuwnym oknem pomiarowym, odpowiedni dla monitorowania sieci on-line. Okno pomiarowe pozwala na stabilizowanie klasycznego algorytmu rekurencyjnego estymacji i znacznie poprawienie obcisłości estymat....
-
Data set generation at novel test-rig for validation of numerical models for modeling granular flows
PublicationSignificant effort has been exerted on developing fast and reliable numerical models for modeling particulate flow; this is challenging owing to the complexity of such flows. To achieve this, reliable and high-quality experimental data are required for model development and validation. This study presents the design of a novel test-rig that allows the visualization and measurement of particle flow patterns during the collision...
-
Total Domination Versus Domination in Cubic Graphs
PublicationA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Set-Bounded joined parameter and state estimation for model predictive control of integrated wastewater treatment plant systems at medium time scale.
PublicationW artykule opisano moduł łącznej estymacji w postaci zbiorów ograniczonych (ang. set-bounded) parametrów i stanu systemu dla potrzeb sterowania predykcyjnego zintegrowanym systemem ściekowym w średniej skali czasu. Jest to jeden ze składowych elementów Inteligentnej Hierarchicznej Struktury Sterowania opracowanej w celu pokonania następujących problemów, które występują w kontrolowanym systemie: różne skale czasowe procesów, silnie...
-
Weakly connected Roman domination in graphs
PublicationA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
Comparison of hydrogen bonds and diverse weak interactions of the nitro group in 2-methyl-4-nitroanilinium nitrate, bisulfate and two hexafluoridosilicates: elementary graph-set approach
PublicationCrystal structures of (H2m4na)NO3 (1), (H2m4na)HSO4 (2), (H2m4na)2SiF6 (3) and (H2m4na)2SiF6*2H2O (4), where 2m4na = 2-methyl-4-nitroaniline, are presented. Two layers of interactions occur in the structures, N—H...O/F hydrogen bonds and interactions with the nitro group. Although diverse, hydrogen-bonding patterns are compared with each other by means of interrelations among elementary graph-set descriptors and descriptors of hydrogen-bonding...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
On trees with equal domination and total outer-independent domination numbers
PublicationFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublicationFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
Graphs with equal domination and certified domination numbers
PublicationA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
Rediscovering Automatic Detection of Stuttering and Its Subclasses through Machine Learning—The Impact of Changing Deep Model Architecture and Amount of Data in the Training Set
PublicationThis work deals with automatically detecting stuttering and its subclasses. An effective classification of stuttering along with its subclasses could find wide application in determining the severity of stuttering by speech therapists, preliminary patient diagnosis, and enabling communication with the previously mentioned voice assistants. The first part of this work provides an overview of examples of classical and deep learning...
-
Comprehensive Analysis of MILE Gene Expression Data Set Advances Discovery of Leukaemia Type and Subtype Biomarkers
Publication -
Support interlinking of design and process planning by set of experience knowledge structure and decisional DNA: Conceprual Approach
PublicationKoncepcja wspomagania planowania procesow p-rzy pomocy SOEKS oraz Decyzjnego DNA.
-
A Text as a Set of Research Data. A Number of Aspects of Data Acquisition and Creation of Datasets in Neo-Latin Studies
PublicationIn this paper, the authors, who specialise in part in neo-Latin studies and the his-tory of early modern education, share their experiences of collecting sources for Open Research Data sets under the Bridge of Data project. On the basis of inscription texts from St. Mary’s Church in Gdańsk, they created 29 Open Research Data sets. In turn, the text of the lectures of the Gdańsk scholar Michael Christoph Hanow, Praecepta de arte...
-
LED Light Sources and Their Complex Set-Up for Visually and Biologically Effective Illumination for Ornamental Indoor Plants
PublicationOrnamental plants are often used in indoor environments as part of biophilic design to improve the health and wellbeing of occupants, and to support sustainable, green architecture. Unfortunately, many plants do not thrive and need to be continuously replaced, which is economically unsustainable. The wavelengths and spectrum ratio of commonly used light sources such as light emitting diode (LED), and the lack of an appropriate...
-
Description of the solution set of the von Karman equations for a circular plate in a small neighbourhood of a simple bifurcation point
PublicationW niniejszej pracy badamy równania von Karmana dla cienkiej, sprężystej, kołowej płyty na sprężystym podłożu, poddawanej działaniu sił ściskających wzdłuż brzegu. Są to równania różniczkowe cząstkowe IV rzędu. Stosując metody analizy nieliniowej, opisujemy zbiór rozwiązań równań von Karmana w małym otoczeniu jednokrotnego punktu bifurkacji.Badania były finansowane przez grant nr 1 P03A 042 29.
-
On trees with double domination number equal to 2-domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
On trees with double domination number equal to total domination number plus one
PublicationA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Rapid multi-objective antenna design using point-by-point Pareto set identification and local surrogate models
PublicationAntenna design is inherently a multicriterial problem.Determination of the best possible tradeoffs between conflicting objectives (a so-called Pareto front), such as reflection response, gain, and antenna size, is indispensable from the designer’s point of view, yet challenging when high-fidelity electromagnetic (EM) simulations are utilized for performance evaluation. Here, a novel and computationally...
-
Total domination in versus paired-domination in regular graphs
PublicationA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Automatic music set organizatio based on mood of music / Automatyczna organizacja bazy muzycznej na podstawie nastroju muzyki
PublicationThis work is focused on an approach based on the emotional content of music and its automatic recognition. A vector of features describing emotional content of music was proposed. Additionally, a graphical model dedicated to the subjective evaluation of mood of music was created. A series of listening tests was carried out, and results were compared with automatic mood recognition employing SOM (Self Organizing Maps) and ANN (Artificial...
-
Towards a universal embedded-atom method: empirically adjusted and consistent set of atomic densities for all elements of the periodic table
PublicationModel atomu HFS został zmodyfikowany poprzez wyznaczenie indywidualnych parametrów αex dla atomów. Parametry αex wyznaczono w oparciu o energię jonizacji atomów. W oparciu o tak zmodyfikowaną metodę HFS wyznaczono rozkłady gęstości elektronów w atomach.
-
Global defensive sets in graphs
PublicationIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublicationA 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...
-
A lower bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
An upper bound on the 2-outer-independent domination number of a tree
PublicationA 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 a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
Softly switched robustly feasible mpc for constrained linear systems under set bounded uncertainty- LQ-MPC with IC action
PublicationNie jest możliwe efektywne sterowanie procesem w szerokim zakresie zmian warunków operacyjnych przy użyciu jednego uniwersalnego regulatora. W pracy zaproponowano koncepcję sposobu regulacji polegającego na przełączaniu wielu regulatorów uzależnionego od stanu operacyjnego systemu. Często twarde przełączanie regulatorów nie jest pożądane lub wręcz możliwe, alternatywą jest ich miękkie przełączanie. W pracy rozważany jest problem...
-
Financial impact analysis of going public at the Warsaw Stock Exchange: Using Fuzzy Set Theory to understand behaviours of mature companies
Publication