Wyszukiwarka
Filtry
wszystkich: 2826
wybranych: 2399
-
Katalog
- Publikacje 2399 wyników po odfiltrowaniu
- Czasopisma 53 wyników po odfiltrowaniu
- Konferencje 27 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 64 wyników po odfiltrowaniu
- Projekty 6 wyników po odfiltrowaniu
- Kursy Online 12 wyników po odfiltrowaniu
- Wydarzenia 5 wyników po odfiltrowaniu
- Dane Badawcze 259 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: TRANSITION NETWORK GRAPHS
-
A Framework for Searching in Graphs in the Presence of Errors
PublikacjaWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
Possible quadrupole-order-driven commensurate-incommensurate phase transition in B20 CoGe
PublikacjaThe B20-type cobalt germanide CoGe was investigated by measuring the specific heat, resistivity, and 59Co nuclear magnetic resonance (NMR).We observed a phase transition at TQ = 13.7 K, evidenced by a very narrow peak of the specific heat and sharp changes of the nuclear spin-spin (T −1 2 ) and spin-lattice (T −1 1 ) relaxation rates. The fact that the entropy release is extremely small and the Knight shift is almost independent...
-
EMULACJA ŚRODOWISKA DLA ZASTOSOWANIA PROTOKOŁU IN-BAND NETWORK TELEMETRY
PublikacjaOkreślenie jakości obsługi strumieni pakietów w sieci przełączników wymaga odpowiedniego środowiska badawczego w którym prowadzi się doświadczenia i pomiary wybranych wielkości. Protokół In-band Network Telemetry jest jednym z narzędzi, które można wykorzystać do realizacji tych zadań. W pracy zaproponowano zwirtualizowane środowisko badawcze w którym można emulować sieć przełączników programowalnych w języku P4 wraz z implementacją...
-
Nanostructure of the laser-modified transition metal nanocomposites for water splitting
PublikacjaAlthough hydrogen is considered by many to be the green fuel of the future, nowadays it is primarily produced through steam reforming, which is a process far from ecological. Therefore, emphasis is being put on the development of electrodes capable of the efficient production of hydrogen and oxygen from water. To make the green alternative possible, the solution should be cost-efficient and well processable, generating less waste...
-
Ionic thermoelectric effect in Cu2-δSe during phase transition
PublikacjaThe ionic Seebeck coefficient was studied in copper selenide with Cu1.99Se, Cu1.95Se and Cu1.8Se stoichiometry which was synthesized with a melt crystallization method. To measure the ionic Seebeck coefficient of copper ions, 0.15C6H12N4CH3I + 0.85CuI solid-state electrolyte was prepared. Electrolyte layers were pressed with copper selenide powder into a sandwich-like structure. At the temperature of 410 K, the materials have ionic...
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublikacjaConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
On the fast BSS transition algorithms in the IEEE 802.11r local area wireless networks
PublikacjaHandover performance is critical to support multimedia services that are becoming increasingly available over the wireless devices. The high transition delay can be unaccepted for such services or can be a source of disruption on the session. On the other side, IEEE 802.11 standard is being extended with new functionalities. Security and QoS features, included in recent IEEE 802.11-2007 standard, add management frames that are...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublikacjaThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
Quasirelativistic potential energy curves and transition dipole moments of NaRb
PublikacjaWe report on extensive calculations of quasi-relativistic potential energy curves and, for the first time, transition dipole moments including spin-orbit and scalar-relativistic effects of the NaRb molecule. The calculated curves of the 0+, 0-, 1, 2 and 3 molecular states correlate for large internuclear separation with the fourteen lowest atomic energies up to the Na(3s ^2S_{1/2}) + Rb(7s ^2S_{1/2}) atomic limit. Several new features...
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublikacjaGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
The maximum edge-disjoint paths problem in complete graphs
PublikacjaRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
S-Shaped Suppression of the Superconducting Transition Temperature in Cu-Intercalated NbSe2
Publikacja2H-NbSe2 is the prototype and most frequently studied of the well-known transition metal dichalcogenide (TMDC) superconductors. As 2H-NbSe2 is widely acknowledged as a conventional superconductor, its transition temperature to the superconducting state (Tc) is 7.3 K, a Tc that is substantially higher than those seen for the majority of TMDCs, where Tc values between 2 and 4 K are the norm. Here we report the intercalation of Cu...
-
On the deficiency of bipartite graphs
Publikacja -
Named Property Graphs
Publikacja -
Serialization for Property Graphs
Publikacja -
Rank Coloring of Graphs.
PublikacjaRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Circular colorings of graphs.
PublikacjaRozdział poświęcony jest cyrkularnemu modelowi kolorowania krawędzi. Rozważana jest zarówno wersja wierzchołkowa i krawędziowa. Szczególny nacisk położono na złożoność obliczeniową i zastosowania dla omawianych modeli kolorowania.
-
T-coloring of graphs.
PublikacjaNiniejszy rozdział omawia kontrastowe kolorowanie grafów. Podana została jego definicja i podstawowe własności, zastosowania oraz złożoność obliczeniowa problemów rozważanych w ramach tej dziedziny.
-
Harmonions Coloring of Graphs.
PublikacjaProblem kolorowania grafów jest motywowany radionawigacją lotniczą, kompresją obrazów i in. W rozdziale podano podstawowe fakty dotyczące tego modelu kolorowania, a wsród nich dolne i górne oszacowania na liczbę harmoniczną i algorytm o złożoności 0 (mm3) dający bardzo dobre pokolorowania przybliżone.
-
Classical coloring of graphs.
PublikacjaRozdział obejmuje klasyczne kolorowanie krawędzi i wierzołków w grafach prostych. Oprócz podstawowych definicji podane zostały najczęściej stosowane metody przybliżone oraz ich właściwości. Dodatkowo rozdział zawiera przegląd znanych benczmarków dla podanych metod w kontekście klasycznego modelu kolorowania.
-
Sum Coloring of Graphs.
PublikacjaRozdział jest poświęcony sumacyjnemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Resource constrained neural network training
PublikacjaModern applications of neural-network-based AI solutions tend to move from datacenter backends to low-power edge devices. Environmental, computational, and power constraints are inevitable consequences of such a shift. Limiting the bit count of neural network parameters proved to be a valid technique for speeding up and increasing efficiency of the inference process. Hence, it is understandable that a similar approach is gaining...
-
Weakly convex and convex domination numbers of some products of graphs
PublikacjaIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Application tool for IP QoS network design
PublikacjaDespite the fact that differentiated-service-aware network implementation has been a widely discussed topic for quite some time, network design still proofs nontrivial. Well developed software could put an end to network designer's problems. This chapter describes work, which has been aimed at creating a comprehensive network design tool, offering a fair range of functionality and high reliability. The presented tool is able to...
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublikacjaIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
Experimental comparison of the transition speed of a hydrodynamic journal bearing lubricated with oil and magnetorheological fluid
PublikacjaA journal bearing test bench is used to find the transition speed between the hydrodynamic and mixed lubrication regimes for a modified magnetorheological (MR) fluid. It is shown that the transition speed of the bearing can be reduced by applying a local magnetic field near minimum film when it is lubricated with the MR fluid, and that this will only marginally increase friction. The lubricating performance of the MR fluid is compared...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublikacjaIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublikacjaTwo identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublikacjaWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Software Agents for Computer Network Security
PublikacjaThe chapter presents applications of multi-agent technology for design and implementation of agent-based systems intended to cooperatively solve several critical tasks in the area of computer network security. These systems are Agent-based Generator of Computer Attacks (AGCA), Multi-agent Intrusion Detection and Protection System (MIDPS), Agent-based Environment for Simulation of DDoS Attacks and Defense (AESAD) and Mobile Agent...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet 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...
-
Model of control plane of ASON/GMPLS network
PublikacjaASON (Automatic Switched Optical Network) is a concept of optical network recommended in G.8080/Y.1304 by ITU-T. Control Plane of this network could be based on GMPLS (Generalized Multi-Protocol Label Switching) protocols. This solution, an ASON control plane built on GMPLS protocols is named ASON/GMPLS. In the paper, we decompose the control plane problem and show the main concepts of ASON network. We propose a hierarchical architecture...
-
Simulator for Performance Evaluation of ASON/GMPLS Network
PublikacjaThe hierarchical control plane network architecture of Automatically Switched Optical Network with utilization of Generalized Multi-Protocol Label Switching protocols is compliant to next generation networks requirements and can supply connections with required quality of service, even with incomplete domain information. Considering connection control, connection management and network management, the controllers of this architecture...
-
Low-energy electron scattering from molecular hydrogen: Excitation of the X1Σg+ to b3Σu+ transition
PublikacjaWe present time-of-flight differential cross-section measurements and convergent close-coupling calculations of differential cross sections for the electron-impact excitation of the X 1 g + → b 3 u + transition in molecular hydrogen. A part of this work was recently published [M. Zawadzki et al., Phys. Rev. A 97, 050702(R) (2018)]. In this work, agreement between theory and experiment is excellent overall, and marks a transition...
-
Directions of Energy Transition of Uzbekistan
PublikacjaThe aim of the paper is to present the changes in the Uzbekistan energy market over the past few years. Uzbekistan is self-sufficient in terms of energy resources, the exploitation of which will last for many years. In 2019, the government adopted the "Concept Note ensuring electricity supply in Uzbekistan in 2020-2030" strategy, which announced the modernization of gas and coal power plants and the construction of new energy facilities,...
-
Potential energy curves, transition and permanent dipole moments of KRb
PublikacjaWe present extensive calculations of 48 adiabatic potential energy curves of the KRb molecule. Efforts have been focused on preparing the appropriate basis sets. Compared to previous approaches, the set of new potential energy curves is extended to higher excitations, including the single-excited K(4s2S)+Rb(5d2D) and double-excited K(4p2P)+Rb(5p2P) atomic limits. Larger distances between nuclei are also taken into account. New...
-
Calix[4]arene-Thioamides as Ionophores for Transition and Heavy Metal cations
PublikacjaCalix[4]arene derivatives play an important role as sensing materials in Ion Selective Electrodes(ISEs). Nowadays a high impact is put to control in natural waters the level of toxic heavy metals, like Pb ,Cd, Hg or Cu which may cause the great risk to human health. Our goal was to design and to synthesize ligands possessing ability to bind transition and heavy metal cations. The synthesis, crystal structures,extractive and ionophoric...
-
Transition Metal Oxides influence on phosphate and borate glasses structure
PublikacjaBorate and phosphate glasses possess many potential luminescence and optical applications. With their low melting point, they are one of the most often studied amorphous materials. In recent years these glasses, doped with transition metal oxides (TMO), gained much attention due to their tunable structural and thermal properties. Review of systems containing TMOs was presented. Additionally synthesis of binary MnO-P2O5 and MnO-B2O3...
-
The unstable thermoelectric effect in non-stoichiometric Cu2Se during the non-equilibrium phase transition
PublikacjaThe superionic α ↔ β phase transition in Cu1.96Se thermoelectric material is investigated by means of thermal analysis (DSC) and measurements of Seebeck coefficient and electrical conductivity. Results of the DSC measurements with 1–10 K/min heating and cooling rates show that the material is close to the equilibrium phase composition during the transformation. However, the kinetic limitation of the process exists, which is indicated...
-
Evolutionary Algorithms in MPLS network designing
PublikacjaMPLS technology become more and more popular especially in core networks giving great flexibility and compatibility with existing Internet protocols. There is a need to optimal design such networks and optimal bandwidth allocation. Linear Programming is not time efficient and does not solve nonlinear problems. Heuristic algorithms are believed to deal with these disadvantages and the most promising of them are Evolutionary Algorithms....
-
A first-principles study of electronic and magnetic properties of 4d transition metals doped in Wurtzite GaN for spintronics applications
PublikacjaWe studied the electronic and magnetic properties of wurtzite GaN (w-GaN) doped with different concentrations of the 4d transition metal ions Nb, Mo, and Ru. We incorporated spin-polarized plane-wave density functional theory within an ultrasoft pseudopotential formalism. The 4d transition metals were doped at different geometrical sites to determine the geometry with the lowest total energy and the one that induced the largest...
-
Interval Edge-Coloring of Graphs
Publikacja -
Correction to: Serialization for Property Graphs
Publikacja -
On efficient coloring of chordless graphs
PublikacjaArtykuł omawia zagadnienie optymalnego, wielomianowego rozpoznawania i kolorowania grafów bezcięciwowych. Zawiera dowód tego, że takie grafy są zawsze 4-kolorowalne oraz opis wielomianowego algorytmu, który koloruje je minimalną możliwą liczbą kolorów.
-
Greedy T-colorings of graphs
PublikacjaTreścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.
-
Super Dominating Sets in Graphs
PublikacjaIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
Total restrained bondage in graphs
PublikacjaPodzbiór D zbioru wierzchołków grafu nazywamy zewnętrznie totalnym dominującym w grafie, jeśli każdy wierzchołek spoza D ma sąsiada zarówno w D jak i poza D. Moc najmniejszego zbioru o tej własności nazywamy liczbą dominowania zewnętrznie totalnego. W artykule badamy wpływ usuwania krawędzi na liczbę dominowania zewnętrznie totalnego, czyli liczbę zewnętrznego totalnego zniewolenie w grafach.
-
Interval edge-coloring of graphs.
PublikacjaRozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.
-
Path Coloring and Routing in Graphs.
PublikacjaW rozdziale omówione zostały problemy kolorowania ścieżek i routingu w grafach. Podano podstawowe definicje związane z tymi problemami, znane wyniki wraz z dyskusją złożoności obliczeniowej dla grafów ogólnych i dla kilku podstawowych klas grafów oraz zastosowania.