Filtry
wszystkich: 2824
-
Katalog
- Publikacje 2377 wyników po odfiltrowaniu
- Czasopisma 77 wyników po odfiltrowaniu
- Konferencje 6 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 35 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 15 wyników po odfiltrowaniu
- Dane Badawcze 312 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: OPTICAL GLYPHS
-
On bipartization of cubic graphs by removal of an independent set
PublikacjaWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Domination-Related Parameters in Rooted Product Graphs
PublikacjaAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.
-
Bipartite theory of graphs: outer-independent domination
PublikacjaLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
Minimum order of graphs with given coloring parameters
PublikacjaA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Towards Increasing Density of Relations in Category Graphs
PublikacjaIn the chapter we propose methods for identifying new associations between Wikipedia categories. The first method is based on Bag-of-Words (BOW) representation of Wikipedia articles. Using similarity of the articles belonging to different categories allows to calculate the information about categories similarity. The second method is based on average scores given to categories while categorizing documents by our dedicated score-based...
-
Graphs with equal domination and certified domination numbers
PublikacjaA 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...
-
Chromatic cost coloring of weighted bipartite graphs
PublikacjaGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
PublikacjaA team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublikacjaThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA 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...
-
On the size of identifying codes in triangle-free graphs
PublikacjaIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
Synchronous black hole search in directed graphs
PublikacjaThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
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.
-
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...
-
Progress on Roman and Weakly Connected Roman Graphs
PublikacjaA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
The State Of Lightguide Technology In Poland On The Basis Of The IV National Symposium "Optical Fibres And Their Applications"
Publikacja -
<title>FPGA-based modular configurable controller with fast synchronous optical network</title>
Publikacja -
Evolution of the optical properties of chromium doped calcium tetraborate glass under high pressure
Publikacja -
Effect of Temperature and Pressure on Structural and Optical Properties of Organic–Inorganic Hybrid Manganese Halides
Publikacja -
Changes in optical properties of YAG:Ce single crystals due to codoping and ionizing radiation treatment
Publikacja -
Photoacoustic and optical absorption spectroscopy studies of luminescentCr3+andCr4+centers in yttrium aluminum garnet
Publikacja -
Optical properties of pure and Ce3+ doped gadolinium gallium garnet crystals and epitaxial layers
Publikacja -
Magnesium porphyrazine with peripheral methyl (3,5-dibromophenylmethyl)amino groups – synthesis and optical properties
Publikacja -
Large-scale multimedia content delivery over optical networks for interactive TV services
Publikacja -
Sensitivity calibration procedures in optical‐CT scanning of BANG®3 polymer gel dosimeters
Publikacja -
Hardware implementation of digital image stabilization using optical flow algorithm and FPGA technology
PublikacjaW artykule przedstawiono efektywną procedurę uproszczenia algorytmu przepływu optycznego oraz jego realizację w układzie programowalnym FPGA. Zmodyfikowany algorytm wykorzystuję metodę blokowego dopasowania podobszarów oraz jednowymiarową reprezentację podobszarów. Dodatkowo, funkcja korelacji oparta jest o normę L1. W rezultacie uzyskano zmniejszenie zużytych zasobów kosztem nieznacznej utraty dokładności. Zarówno dokładność,...
-
Efficiency of service recovery in scale-free optical networks under multiple node failures
PublikacjaIn this paper we examine the properties of scale-free networks in case of simultaneous failures of two networknodes. Survivability assumptions are as follows: end-to-end path protection with two node-disjoint backup pathsfor each working path. We investigate three models of scale-free networks generation: IG, PFP and BA.Simulations were to measure the lengths of active and backup paths and the values of service recovery time.We...
-
<title>Ultrahigh-resolution detection techniques for biomedical applications of optical coherent tomography</title>
Publikacja -
<title>Modeling of broadband light source to use with optical coherent tomography system</title>
Publikacja -
Incorporation of nitrogen in diamond films - A new way of tuning parameters for optical passive elements
PublikacjaThis paper investigates the impact of nitrogen incorporation in diamond films for the construction of an interferometric sensor to measure displacement. Diamond films with different nitrogen levels (0–5%) were deposited on silicon substrates by microwave plasma enhanced chemical vapor deposition. The structural characteristics of these samples are characterized using scanning electron microscopy (SEM), atomic force microscopy...
-
Cuprous Oxide Thin Films Implanted with Chromium Ions - Optical and Physical Properties Studies
Publikacja -
Effect of chemical structure and deposition method on optical properties of polyazomethines with alkyloxy side groups
Publikacja -
Optical coherence tomography and magnetic resonance imaging visual pathway evaluation in Wolfram syndrome
Publikacja -
Single‐walled carbon nanotubes modified by PFO: An optical absorption and Raman spectroscopic investigation
Publikacja -
Nonlinear optical birefringence in Li2SO4-MgO-P2O5 amorphous system -influence of Cu ions
Publikacja -
Second and third harmonic nonlinear optical process in spray pyrolysed Mg:ZnO thin films
Publikacja -
Small isomeric push–pull chromophores based on thienothiophenes with tunable optical (non)linearities
Publikacja -
Effect of Na doping on photoluminescence and laser stimulated nonlinear optical features of ZnO nanostructures
Publikacja -
Enhancement of defects induced optical nonlinearity in Al: ZnO thin films by electron beam
Publikacja -
Synthesis, structural, electronic and linear electro-optical features of new quaternary Ag2Ga2SiS6 compound
Publikacja -
Close-Distance Optical Flow Fusion Using EKF for Multirotor UAV Position Estimation
Publikacja -
Variable Temperature Spectroscopic Ellipsometry as a Tool for Insight into the Optical Order in the P3HT:PC70BM and PC70BM Layers
PublikacjaTwo combined ellipsometric techniques—variable angle spectroscopic ellipsometry (VASE) and variable temperature spectroscopic ellipsometry (VTSE)—were used as tools to study the surface order and dielectric properties of thin films of a poly(3-hexylthiophene-2,5-diyl) (P3HT) mixture with a fullerene derivative (6,6-phenyl-C71-butyric acid methyl ester) (PC70BM). Under the influence of annealing, a layer of the ordered PC70BM...
-
Comparison of resonance optical scattering of plane waves by infinite gratings of silver cylinders and strips
Publikacja -
Methods of decreasing the lasing thresholds of optical resonators with periodically structured active nano wires
Publikacja -
Capacity efficient shared protection and fast restoration scheme in self-configured optical networks
PublikacjaW artykule zaproponowano nową koncepcję optymalizacji rozdziału zasobów dla przeżywalnych sieci rozległych, która gwarantuje szybkie odtwarzanie usług po wystąpieniu awarii. Wykazano, iż proponowany algorytm, wykorzystujący ideę wierzchołkowego kolorowania grafów, nie powoduje wydłużania ścieżek zabezpieczających - zjawiska charakterystycznego dla powszechnie stosowanych algorytmów optymalizacji. Udowodniono, iż powyższa cecha...
-
The microstructure effect on the electrical and optical properties of undoped and Sr-doped SmCoO3 thin films.
PublikacjaW pracy przedstawiono elektryczne i optyczne właściwości niedomieszkowanego i domieszkowanego Sr SmCoO3 cienkich filmów. Gęste i przezroczyste filmy o grubościach 80-100nm były przygotowane na szafirze metodą nanoszenia wirowego ciekłych polimerów. Filmy były syntezowane w temperaturach od 500 do 800C co umożliwiło otrzymanie różnych mikrostruktur. Elektryczne właściwości filmów były mierzone w funkcji temperatury. Domieszkowanie...
-
Optical activity of the guest azobenzene molecule generated by inclusion complexation with steroidal bile acids.
PublikacjaZsyntetyzowano krystaliczne kompleksy inkluzyjne azobenzenu z kwasami cholowym i deoksycholowym. Otrzymane związki inkluzyjne poddano badaniom przy wykorzystaniu spektroskopii dichroizmu kołowego w fazie stałej (KBr). Dodatni efekt Cottona, odpowiadający niskoenergetycznemu przejściu elektronowemu n-pi*, skorelowano z helikalnością M,M skręconej cząsteczki azobenzenu. Ponadto w celach porównawczych zmierzono dichroizm kołowy w...
-
Optical activity of benzophenone and thiobenzophenone generated by spontaneous crystallization and inclusion complexation with cholic acid.
PublikacjaOtrzymano związki inkluzyjne benzofenonu i jego tioanalogu z kwasem cholowym. W zależności od stosowanej metody syntezy kompleksów inkluzyjnych benzofenonu powstawały one w dwóch różnych postaciach polimorficznych. Jedna z nich wykazuje istnienie cząsteczek gościa w czterech konformacjach, przy czym dominuje konformer o helikalności M. Struktura krystalograficzna kompleksu tiobenzofenonu z kwasem cholowym ujawniła obecność tylko...
-
High resolution optical time-domain reflectometry using sub-picosecond laser sources
PublikacjaPrzedstawiono działanie sensorów światłowodowych wykorzystujących reflektometrię optyczną w dziedzinie czasu. Omówiono ograniczenia możliwości pomiarowych tej klasy sensorów wynikające z zastosowania w nich reflektometrów światłowodowych zaprojektowanych do zastosowań w telekomunikacji. Zaprezentowano sensory wykorzystujące specjalizowane reflektometry o dużej rozdzielczości. Przedstawiono koncepcję sensora wykorzystującego dwa...