Filtry
wszystkich: 5548
wybranych: 2504
-
Katalog
- Publikacje 2504 wyników po odfiltrowaniu
- Czasopisma 44 wyników po odfiltrowaniu
- Konferencje 20 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 169 wyników po odfiltrowaniu
- Wynalazki 14 wyników po odfiltrowaniu
- Projekty 29 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Zespoły Badawcze 8 wyników po odfiltrowaniu
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 745 wyników po odfiltrowaniu
- Wydarzenia 57 wyników po odfiltrowaniu
- Dane Badawcze 1955 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: corona graph
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(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 tree T of order n >= 4, with l leaves and s support vertices we have...
-
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...
-
Panax quinquefolium L. Ginsenosides from Hairy Root Cultures and Their Clones Exert Cytotoxic, Genotoxic and Pro-Apoptotic Activity towards Human Colon Adenocarcinoma Cell Line Caco-2
Publikacja -
Preface
PublikacjaThis special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 13th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 18-23 September 2009 in Szklarska Poręba, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, and 2003-2007 in Karpacz. The meeting was organized by the Faculty of Mathematics, Computer...
-
Collision-Free Network Exploration
PublikacjaA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublikacjaWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
The hat problem on cycles on at least nine vertices
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublikacjaOne of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...
-
The effect of corn or beet pulp silage supplemented diet on production parameters, oxidative stability of muscles and fatty acid composition of abdominal fat in geese
Publikacja -
The International Trade of Ware Vegetables and Orna-Mental Plants—An Underestimated Risk of Accelerated Spreading of Phytopathogenic Bacteria in the Era of Globalisation and Ongoing Climatic Changes
Publikacja -
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublikacjaWe consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublikacjaThe problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes...
-
Using the social return on investment (SROI) as a measure of the effectiveness of social innovation projects implemented under public policies
Publikacja -
Counting Lattice Paths With Four Types of Steps
Publikacja -
Wordventure - cooperative wordnet editor. Architecture for lexical semantic aquisition
PublikacjaThis article presents architecture for acquiring lexical semanticsin a collaborative approach paradigm. The system enablesfunctionality for editing semantic networks in a wikipedia-like style. The core of the system is a user-friendly interface based on interactive graph navigation.It has been used for semantic network presentation,and brings simultaneously modification functionality.
-
WordVenture - COOPERATIVE WordNet EDITOR Architecture for Lexical Semantic Acquisition
PublikacjaThis article presents architecture for acquiring lexical semantics in a collaborative approach paradigm. The system enables functionality for editing semantic networks in a wikipedia-like style. The core of the system is a user-friendly interface based on interactive graph navigation. It has been used for semantic network presentation, and brings simultaneously modification functionality.
-
Distributed NVRAM Cache – Optimization and Evaluation with Power of Adjacency Matrix
PublikacjaIn this paper we build on our previously proposed MPI I/O NVRAM distributed cache for high performance computing. In each cluster node it incorporates NVRAMs which are used as an intermediate cache layer between an application and a file for fast read/write operations supported through wrappers of MPI I/O functions. In this paper we propose optimizations of the solution including handling of write requests with a synchronous mode,...
-
Turán numbers for odd wheels
PublikacjaThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
A Systematic Search for New Coupling Schemes of Cross-Coupled Resonator Bandpass Filters
PublikacjaIn this paper, a systematic approach to an extensive search for topologies of cross-coupled filters with generalized Chebyshev response is presented. The technique applies graph theory to find unique, nonisomorphic filter configurations, and tests whether a specific frequency response can be realized in a given set of topologies. The results of the search are then stored in a database of possible filter configurations.
-
Influence of edge subdivision on the convex domination number
PublikacjaWe study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.
-
Dedicated scheduling of tasks to minimize mean flow time
PublikacjaThis paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.
-
Tax Policy Tools of Selected European Countries as a Mechanism for Counteracting the Effects of the Crisis Caused by the COVID-19 Disease Pandemic
PublikacjaCrises play an important role in a economics life. They are common and it is impossible to omit them. This following study investigates the concept of ‘crisis’ in the context of economic situation. This text describes the most important financial crises that took place in the past. After that authors passes on a detailed analysis of the actual corona-crisis and the way that it affects the economy globally. The main goal of this...
-
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...
-
Weakly connected domination subdivision numbers
PublikacjaLiczba podziału krawędzi dla dominowania słabo spójnego to najmniejsza liczba krawędzi jaką należy podzielić, aby wzrosła liczba dominowania słabo wypukłego. W pracy przedstawione są własności liczby podziału krawędzi dla dominowania słabo spójnego dla różnych grafów.
-
Trees with equal restrained domination and total restrained domination numbers
PublikacjaW publikacji scharakteryzowano wszystkie drzewa, w których liczby dominowania powściągniętego oraz podwójnie totalnego są sobie równe.
-
T-colorings, divisibility and circular chromatic number
PublikacjaLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
Convex universal fixers
PublikacjaPraca dotyczy dominowania wypukłego w grafach pryzmowych.
-
Total outer-connected domination in trees
PublikacjaW pracy przedstawiono dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego w grafach oraz scharakteryzowano wszystkie drzewa osiągające to ograniczenie.
-
A note on mixed tree coloring
PublikacjaZaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].
-
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.
-
Network Approach to Increments of RR-intervals for Visualization of Dynamics of Cardiac Regulation
PublikacjaThe transition network for RR -increments is pre- sented in a directed and weighted graph, with vertices represent- ing RR -increments and edges corresponding to the order in a sequence of increments. The adjacency matrix and the transition matrix of this network provide a graphical tool which could be useful in the assessment of cardiac regulation. As an example, the method is applied in detecting differences between diurnal activity...
-
WYKORZYSTANIE SIECI NEURONOWYCH I METODY WEKTORÓW NOŚNYCH SVM W PROCESIE ROZPOZNAWANIA AKTYWNOŚCI RUCHOWEJ PACJENTÓW DOTKNIĘTYCH CHOROBĄ PARKINSONA
PublikacjaChoroba Parkinsona (ang. PD - Parkinson Disease) zaliczana jest do grupy chorób neurodegeneracyjnych. Jest to powoli postępująca choroba zwyrodnieniowa ośrodkowego układu nerwowego. Jej powstawanie związane jest z zaburzeniem produkcji dopaminy przez komórki nerwowe mózgu. Choroba manifestuje się zaburzeniami ruchowymi. Przyczyna występowania tego typu zaburzeń nie została do końca wyjaśniona. Leczenie osób dotkniętych PD oparte...
-
Elektros energetiniai irengimai ir instaliacija. Vadoelis aukstesniosiomsir profesinems mokykloms.
PublikacjaZawarto: domowe instalacje elektryczne; urządzenia oświetleniowe i grzejne;przemysłowe instalacje elektryczne niskiego napięcia; ochrona przeciwporażeniowa w urządzeniach niskiego napięcia; linie napowietrzne; linie kablowe;stacje elektroenergetyczne; elektrownie; przepięcia i ochrona odgromowa; ochrona przed pożarami i wybuchami; impedancje elementów toru przesyłu energii;obliczanie spadku napięcia oraz strat mocy i strat energii...
-
Recognition, understanding and aestheticization of freehand drawing flowcharts
PublikacjaIn this paper a concept of FCA, a system for recognizing, understanding and aestheticization of freehand drawing flow charts is described. The system is based on a proposed by the author FlowGram graph grammar describing flow charts drawing. An open format FlowChartML for flow charts description is also proposed. The aestheticization criterion is formulated that allows for automatic beautification of flow charts. First experiments...
-
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.
-
Separability Assessment of Selected Types of Vehicle-Associated Noise
PublikacjaMusic Information Retrieval (MIR) area as well as development of speech and environmental information recognition techniques brought various tools in-tended for recognizing low-level features of acoustic signals based on a set of calculated parameters. In this study, the MIRtoolbox MATLAB tool, designed for music parameter extraction, is used to obtain a vector of parameters to check whether they are suitable for separation of...
-
Complexity Issues on of Secondary Domination Number
PublikacjaIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
NADPH Oxidase Gene Polymorphism is Associated with Mortality and Cardiovascular Events in 7-Year Follow-Up
PublikacjaThe CYBA gene encodes the regulatory subunit of NADPH oxidase, which maintains the redox state within cells and in the blood vessels. That led us to investigate the course of coronary artery disease (CAD) with regards to CYBA polymorphisms. Thus, we recruited 1197 subjects with coronary atherosclerosis and observed them during 7-year follow-up. Three CYBA polymorphisms: c.214C>T (rs4673), c.-932G>A (rs9932581), and c.*24G>A (1049255)...
-
Cooperative Word Net Editor for Lexical Semantic Acquisition
PublikacjaThe article describes an approach for building Word Net semantic dictionary in a collaborative approach paradigm. The presented system system enables functionality for gathering lexical data in a Wikipedia-like style. The core of the system is a user-friendly interface based on component for interactive graph navigation. The component has been used for Word Net semantic network presentation on web page, and it brings functionalities...
-
Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
PublikacjaConsider the Euclidean space Rn with the orthogonal action of a compact Lie group G. We prove that a locally Lipschitz G-invariant mapping f from Rn to R can be uniformly approximated by G-invariant smooth mappings g in such a way that the gradient of g is a graph approximation of Clarke’s generalized gradient of f . This result enables a proper development of equivariant gradient degree theory for a class of set-valued gradient...
-
Rodzinne występowanie choroby Bourneville'a-Pringle'a - opis przypadku = Familial Bourneville-Pringle disease - a case report
PublikacjaStwardnienie guzowate (choroba Bourneville'a - Pringle'a ) to wielonarządowa choroba uwarunkowana genetycznie, należąca do grupy fakomatoz. Częstość jej występowania ocenia się na od 1:6000 do 1:20 000. Występowanie rodzinne stwierdza się w ok. 20-30% przypadków (dziedziczenie autosomalne dominujące)
-
Ionophores in polymeric membranes for selective ion recognition:impedance studies
PublikacjaW pracy badano dwa typy elektrod: membranowe elektrody jonoselektywne (ISE) oraz elektrody nowego typu all-solid-state (AAS). Elektrody AAS zawierają przewodzącą warstwę polimerową na węglu szklistym lub platynie, na który nałożona jest membrana zawierająca jonofor. Do badań użyto dwa jonofory: p-tert-butylokaliks[4]aren-korona-4 (L1) selektywnie kompleksująca jony Na+ oraz kaliks[4]aren-korona-6 (L2) selektywnie kompleksująca...
-
Nieswoiste zapalenie jelit
PublikacjaNieswoiste zapalenie jelit jest przewlekłą, nieuleczalną choroba zapalną układu pokarmowego. W niniejszej pracy przedstawiono dane epidemiologiczne, możliwe przyczyny wystąpienia choroby oraz opisano dwie główne jednostki chorobowe zaliczane do nieswoistego zapalenia jelit takie jak wrzodziejące zapalenie jelita grubego oraz choroba Leśniowskiego-Crohn'a.
-
Larmor diamagnetism and Van Vleck paramagnetism in relativistic quantumtheory: the Gordon decomposition approach
PublikacjaWe consider a charged Dirac particle bound in a scalar potential perturbed by a classical magnetic field derivable from a vector potential A(r). Using a procedure based on the Gordon decomposition of a field-induced current, we identify diamagnetic and paramagnetic contributions to the second-order perturbationtheory correction to the particle's energy. In contradiction to earlier findings, based on the sum-over-states approach,...
-
Comparison of EHD devices with parallel and in series spiked electrodes
PublikacjaIn this paper two electrohydrodynamic (EHD) devices for gas pumping and cleaning are presented. In both cases to induce an airflow in these EHD devices corona discharge was used. The discharge was generated between the spiked electrodes set parallel (the first case) or in series (the second case) and the plate electrodes. An asymmetric electric field and generated discharge result in unidirectional gas flow through the EHD device....
-
Metody zwiększania dostępności i efektywności informatycznej infrastruktury w inteligentnym mieście
PublikacjaW pracy omówiono metody zwiększania dostępności i efektywności informatycznej infrastruktury w inteligentnym mieście. Sformułowano dwa kryteria do oceny rozmieszczenia kluczowych zasobów w systemie smart city. Zobrazowano proces wyznaczania rozwiązań kompromisowych spośród rozwiązań Pareto-optymalnych. Omówiono metaheurystyki inteligencji zbiorowej, w tym roju cząstek, kolonii mrówek, roju pszczół oraz ewolucji różnicowej, za pomocą...
-
Materiały sensorowe o makrocyklicznej budowie. Synteza benzokoron oraz azobenzokoron. Zależność: struktura a właściwości jonoforowe
PublikacjaRozwój chemii supramolekularnej jest ściśle powiązany z poszukiwaniem nowych materiałów użytecznych np. w konstruowaniu sensorów chemicznych lub urządzeń molekularnych. Sensory potencjometryczne-membranowe elektrody jonoselektywne (ISE) to jedne z najczęściej stosowanych detektorów jonów metali. Substratami często stosowanymi do otrzymywania jonoforów są etery koronowe.W ramach pracy zsyntezowano szereg eterów koronowych i przeprowadzono...
-
Reliability of production machines in the bakery industry – theoretical and practical issues
PublikacjaThe aim of the article is to present probabilistic models, which were then used to analyze the reliability of production machines in the baking industry. The author conducted research in the period from January 2, 2016 to December 31, 2018 regarding the measurement of reliability of a traditional production system based on a probabilistic concept. Due to the limited scope of the article, reliability calculations for a set of thermo-oil...
-
Proposal of a method for effective tasks distribution in the execution of compolex problems
PublikacjaAn access to a great number of various services allows for decomposition of complex problems into smaller and less complex tasks. Those tasks can be presented in a form of a dependency graph. This paper shows an idea of executing such a problem using cooperating autonomous agents. Main focus of this work is cooperation covering effective tasks distribution among executors. This paper presents an algorithm for dynamic executor selection...