Wyszukiwarka
Filtry
wszystkich: 2826
-
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
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: TRANSITION NETWORK GRAPHS
-
Calixthioamides as ionophores for transition and heavy-metal cations
PublikacjaThere is an increasing interest in applying p-tert-butylcalix[4]arenes as sensing materials in ion-selective electrodes(ISEs). Considerable efforts were made to design calixarenes that are selective for some heavy- or transitionmetal ions to be used in ISEs for controlling and monitoring the level of such pollutants in the environment. It has been reported that introduction of softer sulfur atoms instead of oxygen atoms in calix[4]arene...
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublikacjaThe problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...
-
GROWTH AND STRUCTURAL CHANGES IN TRANSITION COUNTRIES: THE CHICKEN OR THE EGG?
PublikacjaThe objective of this study is to test empirically the relationship between structural changes (changes in gross value added and employment) and economic growth. We used a panel Granger-causality analysis based on annual data for eight transition countries, covering the period 1995–2011. The main finding is that the causality relations analysed are heterogeneous processes and are identified more often...
-
Connection graphs
Publikacja -
Global energy transition: From the main determinants to economic challenges regions
PublikacjaDynamic global energy transition has been accelerating for the last decade. Interestingly, the energy transition is multidimensional and concerns both the dimensions of technique/ technology and the economic, social, institu-tional, and legal spheres (Shuguang et al., 2022; Tzeremes et al., 2022; Ram-zan et al., 2022; Tzeremes et al., 2022). The literature also points to the signif-icant impact of the digitization of the global...
-
Transition curve with smoothed curvature at its ends for railway roads
PublikacjaIn the paper, in view of a railway ballasted track, a new concept of transition curve of linear form of curvature along its length and smoothed extreme regions is presented. For this purpose use has been made of an original, universal method for identifying transition curves by means of differential equations. Some general curvature equations for three regions investigated have been determined to be followed by appropriate parametric...
-
Local properties of organic coatings close to glass transition temperature
PublikacjaAcrylic coating applied on copper substrate has been investigated at different temperatures starting from the ambient one up to the level above the glass transition temperature. Its local topographic and electric properties have been examined with the atomic force microscopy (AFM) based approach including dc current mapping and local impedance spectroscopy. The local findings have been compared with the information from global...
-
Transition Studies Review
Czasopisma -
Health systems in transition
Czasopisma -
Immune Network
Czasopisma -
Neonatal Network
Czasopisma -
Network Neuroscience
Czasopisma -
Network Science
Czasopisma -
Textile Network
Czasopisma -
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ą...
-
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...
-
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...
-
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...
-
Transition dipole moment functions of the KRb molecule
Dane BadawczeElectronic transition dipole moment functions (TDMF) have been calculated for the singlet (s) and triplet (t) Sigma+ (S+), Pi (P), and Delta (D) electronic states of the KRb molecule. TDMFs are needed in understanding processes like photodissociation, photoassociation, cooling, and trapping of molecules. All results of the transition dipole moments...
-
A collection of directed graphs for the minimum cycle mean weight computation
Dane BadawczeThis dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08 These...
-
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,...
-
Sylwester Kaczmarek dr hab. inż.
OsobySylwester Kaczmarek ukończył studia w 1972 roku jako mgr inż. Elektroniki, a doktorat i habilitację uzyskał z technik komutacyjnych i inżynierii ruchu telekomunikacyjnego w 1981 i 1994 roku na Politechnice Gdańskiej. Jego zainteresowania badawcze ukierunkowane są na: sieci IP QoS, sieci GMPLS, sieci SDN, komutację, ruting QoS, inżynierię ruchu telekomunikacyjnego, usługi multimedialne i jakość usług. Aktualnie jego badania skupiają...
-
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...
-
Accelerating the transition to clean and healthy Baltic Sea
WydarzeniaWebinarium poświęcone działaniom na rzecz czystego i zdrowego Morza Bałtyckiego, gdzie zostaną pokazane projekty realizowane przez naukowców z PG w ramach centrum EkoTech.
-
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...