Filters
total: 502
Search results for: theoretical chemistry
-
Cross-linked epoxy-isocyanate blends containing Epidian-6 modified by glycols
PublicationPolymeric films of cross-linked structure may be formed using epoxy-isocyanate blends composed of Epidian-5 epoxy resin, 4,4’-diphenylmethanediisocyanate (MDI), Z-1 polyamine hardener and Epidian-6 epoxy resin modified by glycols. The effect of the component natures and ratio, process temperature and time on the gel-fraction content, as well as film hardness, was examined. The chemistry of the film forming process was determined...
-
Water chemistry of tundra lakes in the periglacial zone of the Bellsund Fiord (Svalbard) in the summer of 2013
PublicationClimate changes observed in the Arctic (e.g. permafrost degradation, glacier retreat) may have significant influence on sensitive polar wetlands. The main objectives of this paper are defining chemical features of water within six small arctic lakes located in Bellsund (Svalbard) in the area of continuous permafrost occurrence. The unique environmental conditions of the study area offer an opportunity to observe phenomena influencing...
-
Measurement report: Spatial variations in ionic chemistry and water-stable isotopes in the snowpack on glaciers across Svalbard during the 2015–2016 snow accumulation season
PublicationThe Svalbard archipelago, located at the Arctic sea-ice edge between 74 and 81∘ N, is ∼60 % covered by glaciers. The region experiences rapid variations in atmospheric flow during the snow season (from late September to May) and can be affected by air advected from both lower and higher latitudes, which likely impact the chemical composition of snowfall. While long-term changes in Svalbard snow chemistry have been documented in...
-
On the origin of surfaces-dependent growth of benzoic acid crystal inferred through the droplet evaporation method
PublicationCrystal growth behavior of benzoic acid crystals on different surfaces was examined. The performed experiments documented the existence of very strong influence introduced by polar surfaces as glass, gelatin, and polyvinyl alcohol (PVA) on the growth of benzoic acid crystals. These surfaces impose strong orientation effect resulting in a dramatic reduction of number of faces seen with x-ray powder diffractions (XPRD). However,...
-
On the origin of surfaces-dependent growth of benzoic acid crystal inferred through the droplet evaporation method
PublicationCrystal growth behavior of benzoic acid crystals on different surfaces was examined. The performed experiments documented the existence of very strong influence introduced by polar surfaces as glass, gelatin, and polyvinyl alcohol (PVA) on the growth of benzoic acid crystals. These surfaces impose strong orientation effect resulting in a dramatic reduction of number of faces seen with x-ray powder diffractions (XPRD). However,...
-
On the origin of surfaces-dependent growth of benzoic acid crystal inferred through the droplet evaporation method
PublicationCrystal growth behavior of benzoic acid crystals on different surfaces was examined. The performed experiments documented the existence of very strong influence introduced by polar surfaces as glass, gelatin, and polyvinyl alcohol (PVA) on the growth of benzoic acid crystals. These surfaces impose strong orientation effect resulting in a dramatic reduction of number of faces seen with x-ray powder diffractions (XPRD). However,...
-
Introduction to MIP synthesis, characteristics and analytical application
PublicationOne of the trends in analytical chemistry is associated with designing and developing new types of sample preparation techniques, which might significantly increase the efficiency and selectivity of the analytes isolation or/and preconcentration process. One of the most widely employed solutions are selective sorption materials, defined as molecularly imprinted polymers (MIPs), as well as the sorbents with the molecular fingerprint....
-
Solid phase microextraction: state of the art, opportunities and applications
PublicationSolid phase microextraction is one of the most popular green techniques used for sample preparations in analytical chemistry. It is a simple, rapid, sensitive, and solvent-free technique. Since SPME was first introduced in the early 1990s, there has been an intensification of research in order to elaborate new methodical solutions in many research facilities around the world, which could increase the use of this technique. More...
-
Microextraction Techniques Used in the Procedures for Determining Organomercury and Organotin Compounds in Environmental Samples
PublicationDue to human activities, the concentrations of organometallic compounds in all parts of the environment have increased in recent decades. The toxicity and some biochemical properties of mercury and tin present in the environment depend on the concentration and chemical form of these two elements. The ever-increasing demand for determining compounds at very low concentration levels in samples with complex matrices requires...
-
Mussel‐inspired biomaterials: From chemistry to clinic
PublicationAfter several billions of years, nature still makes decisions on its own to identify, develop, and direct the most effective material for phenomena/challenges faced. Likewise, and inspired by the nature, we learned how to take steps in developing new technologies and materials innovations. Wet and strong adhesion by Mytilidae mussels (among which Mytilus edulis—blue mussel and Mytilus californianus—California mussel are the most...
-
On coertia and inertia in aspects of Natanson’s nonlinear extended thermodynamics
PublicationIn this article, the previously underrepresented contributions of Natanson to the field of thermodynamics have been presented. In order to identify a source of irreversibility at Nature, Natanson introduced the concept of Coertia, which is similar to inertia. Natanson’s Coertia is a fundamental property of space that is responsible for every irreversible phenomena in matter, as well as in the electromagnetic and gravitational fields....
-
Donor-substituted SrTi1+xO3−δ anodes for SOFC
PublicationNonstoichiometric Nb-substituted SrTiO3 compounds were investigated in order to discuss the influence of nonstoichiometry at the sample properties in the light of recent results reported in the literature. Structural and electrical properties of samples were characterized. Investigated compounds were also applied as anodes for Solid Oxide Fuel Cells and their reactivity with YSZ electrolyte was examined. The defect chemistry explaining...
-
Durability of snow cover and its long-term variability in the Western Sudetes Mountains
Publication -
Winter severity and snowiness and their multiannual variability in the Karkonosze Mountains and Jizera Mountains
Publication -
Universal Augmentation Schemes for Network Navigability
PublicationRozważano problem uzupełniania grafu (reprezentującego np. sieci społeczne) poprzez dodanie w każdym węźle jednego dodatkowego skierowanego połączenia (długodystansowego). Dokładniej, dla każdego węzła definiuje się listę prawdopodobieństw istnienia połączenia wychodzącego z danego węzła do wszystkich pozostałych węzłów; wartości tych prawdopodobieństw muszą sumować się do jedności. Routing zachłanny w takiej sieci polega na przekazywaniu...
-
The maximum edge-disjoint paths problem in complete graphs
PublicationRozważ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...
-
Quality of service in optical burst switched networks
PublicationIn the paper analytical models of two service differentiation schemes for optical burst switched network: extended offset time based and PPS (Preemptive Priority Scheme) are revised. Also accordance of analytical models for those schemes is studied when complete class isolation is assumed. Furthermore authors introduce an analytical model which describes an effective degree of isolation when burst switched network employs both...
-
Dressing method in matter + radiation quantum models
PublicationRozważane są modele typu Dicka i Jaynes-Cummings'a, i obliczono widmo zaburzonego modelu Dicka. Wyprowadzono równania łańcuchowe ubierania.
-
Global dynamics in a stage-structured discrete-time population model with harvesting
Publication -
A Proposal for Using Modified Site-specific Recombination Systems for Making Insertions into a Chosen Chromosomal Sitein vivoBased on the Analysis of I Phage Integration
Publication -
Reducing the Number of Microlocations in Oligonucleotide Microchip Matrices by the Application of Degenerate Oligonucleotides
Publication -
2-Coloring number revisited
Publication2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Finding small-width connected path decompositions in polynomial time
PublicationA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
Approximate search strategies for weighted trees
PublicationW pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.
-
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
PublicationArtykuł poświęcony jest nowym modelom konsensusowego kolorowania grafów. Artykuł zawiera omówienie trzech takich modeli, analizę ich złożoności obliczeniowej oraz wielomianowy algorytm dla częściowych k-drzew, dla tzw. modelu addytywnego.
-
Multimode systems of nonlinear equations: derivation, integrability, and numerical solutions
PublicationWe consider the propagation of electromagnetic pulses in isotropic media taking a third-order nonlinearityinto account. We develop a method for transforming Maxwell's equations based on a complete set ofprojection operators corresponding to wave-dispersion branches (in a waveguide or in matter) with thepropagation direction taken into account. The most important result of applying the method is a systemof equations describing the...
-
Connected searching of weighted trees
PublicationW pracy pokazano, że problem spójnego przeszukiwania drzew ważonych jest silnie NP-zupełny. Problem pozostaje trudnym dla drzew z jednym wierzchołkiem o stopniu większym niż 2. Ponadto, przedstawiony został wielomianowy optymalny algorytm dla klasy drzew z ograniczonym stopniem.
-
Phutball is PSPACE-hard
PublicationW pracy dowodzimy, że gra ''Phutball'' (Philosopher's Football) jest PSPACE-trudna.
-
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublicationOne 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...
-
Synchronous black hole search in directed graphs
PublicationThe 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...
-
Smaller representation of finite state automata
PublicationThis paper is a follow-up to Jan Daciuk's experiments on space-efficient finite state automata representation that can be used directly for traversals in main memory (Daciuk, 2000)[4]. We investigate several techniques for reducing memory footprint of minimal automata, mainly exploiting the fact that transition labels and transition pointer offset values are not evenly distributed and so are suitable for compression. We achieve...
-
Sunshine duration and its variability in the main ridge of the Karkonosze Mountains in relation to with atmospheric circulation
Publication -
Comparison of sunshine duration measurements from Campbell-Stokes sunshine recorder and CSD1 sensor
Publication -
Long-term air temperature variation in the Karkonosze mountains according to atmospheric circulation
Publication -
Topology recognition and leader election in colored networks
PublicationTopology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We consider both these problems in networks whose nodes are equipped with...
-
The searchlight problem for road networks
PublicationWe consider the problem of searching for a mobile intruder hiding in a road network given as the union of two or more lines, or two or more line segments, in the plane. Some of the intersections of the road network are occupied by stationary guards equipped with a number of searchlights, each of which can emit a single ray of light in any direction along the lines (or line segments) it is on. The goal is to detect the intruder,...
-
Distinguishing views in symmetric networks: A tight lower bound
PublicationThe view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers n ≥ D ≥ 1, there exists a port-labeled network with at most n nodes and diameter at most D which contains a pair of nodes whose (infinite) views are different, but whose views truncated to depth Omega( D log(n/ D )) are identical.
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
The complexity of zero-visibility cops and robber
PublicationWe consider the zero-visibility cops & robber game restricted to trees. We produce a characterisation of trees of copnumber k and We consider the computational complexity of the zero-visibility Cops and Robber game. We present a heavily modified version of an already-existing algorithm that computes the zero-visibility copnumber of a tree in linear time and we show that the corresponding decision problem is NP-complete on a nontrivial...
-
Brushing with additional cleaning restrictions
PublicationIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
On minimum cost edge searching
PublicationWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
Tip-Based Nanofabrication as a Rapid Prototyping Tool for Quantum Science and Technology
PublicationTip-Based Nanofabication as a Rapid Prototyping Tool for Quantum Science and Technology discusses the development of cantilevered nanotips techniques of quantum devices prototyping and how they evolved from scanning probe microscopy. Also covered are the advantages and future prospects of atomic resolution capability and how to use this enabling technology as a rapid prototyping tool for quantum science and technology.
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
The influence of atmospheric circulation on the occurrence of dry and wet periods in Central Poland in 1954–2018
PublicationThis work presents the influence of atmospheric circulation on the occurrence of dry and wet periods in the central Polish region of Kujawy. The material on which the authors relied encompassed monthly totals of precipitation obtained from 10 weather stations in the period 1954–2018. Both dry and wet periods have been identified on the basis of monthly values of the Standardised Precipitation Index (SPI). Additionally, the calendar...
-
Weighted 2-sections and hypergraph reconstruction
PublicationIn the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: (1) Given a weighted graph , is there a hypergraph H such that is its weighted 2-section? (2) Given a weighted 2-section , find a hypergraph H such that is its weighted 2-section. We show that (1) is NP-hard even if G is a complete graph or integer weights w does not exceed...
-
Gossiping by energy-constrained mobile agents in tree networks
PublicationEvery node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energy proportionally to the distance traveled and collect copies of the data packets present at the visited network nodes. An agent visiting a node deposits there copies of all currently...
-
Finite automata for compact representation of tuple dictionaries.
PublicationOpisane zostaje uogólnienie struktury danych - słownika, zwane słownikiem n-tek. Słownik n-tek przedstawia odwzorowanie n-tek łańcuchów znaków na pewne wartości. Motywacją dla powstania tej struktury danych są praktyczne zastosowania w przetwarzaniu języka i mowy, w których obszerne słowniki n-tek używane są do przedstawiania modeli języka. Przedstawiona zostaje technika oszczędnej reprezentacji słowników n-tek. Ta technika...
-
Rank two bibartite bound entangled states do not exist.
PublicationWykazano, że nie istnieją stany rzędu dwa które zawierałyby splątanie. Pokazano związki między lokalnym a globalnym rzędem macierzy gęstości oraz ewentualną możliwością wydestylowania kwantowego splątania.
-
Sample Preparation in Foodomics: Miniaturized Solid-Phase Extraction
PublicationAnalytical chemists face a challenge to bring comprehensive information on a given food and biological sample by using the best available analytical techniques and meet the requirements of sustainable development and green chemistry at the same time. A key objective of this chapter is to review selected literature data on the utilization of solid-phase extraction techniques with special attention to their miniaturized modes in...