Filtry
wszystkich: 2637
wybranych: 2079
-
Katalog
- Publikacje 2079 wyników po odfiltrowaniu
- Czasopisma 48 wyników po odfiltrowaniu
- Konferencje 3 wyników po odfiltrowaniu
- Osoby 88 wyników po odfiltrowaniu
- Projekty 2 wyników po odfiltrowaniu
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 36 wyników po odfiltrowaniu
- Wydarzenia 13 wyników po odfiltrowaniu
- Dane Badawcze 367 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: VERTEX RANKING
-
Fast determination of bisphenol A in spiked juice and drinking water samples by pipette tip solid phase extraction using cobalt metal organic framework as sorbent
Publikacja -
Application of response surface methodology for silver nanoparticle stir bar sorptive extraction of heavy metals from drinking water samples: a Box–Behnken design
Publikacja -
Multiprocessor implementation of Parallel Multiobjective Genetic Algorithm for Optimized Allocation of Chlorination Stations in Drinking Water Distribution System - a new water quality model approach
Publikacja -
A Hierarchical Multiscale Approach to Protein Structure Prediction: Production of Low‐Resolution Packing Arrangements of Helices and Refinement of the Best Models with a United‐Residue Force Field
Publikacja -
Multiprocessor Implementation of Parallel Multiobjective Genetic Algorithm for Optimized Allocation of Chlorination Stations in Drinking Water Distribution System a New Water Quality Model Approach
PublikacjaThe Critical Infrastructure Systems (CISs) have received in recent years a considerable attention due to their heavy impact on sustainable development of modern societies. Most CISs may be classied as large scale complex systems of network structure, in uenced by strong interactions form the surrounding environment, internal and external interconnections. The later is a result of inter-CIS dependencies. The control, monitoring...
-
Escherichia coli K-12 suppressor-free mutants lacking early glycosyltransferases and late acyltransferases. Minimal lipopolysaccharide structure and induction of envelope stress response.
PublikacjaTo elucidate the minimal lipopolysaccharide (LPS) structure needed for the viability of Escherichia coli, suppressor-free strains lacking either the 3-deoxy-d-manno-oct-2-ulosonic acid transferase waaA gene or derivatives of the heptosyltransferase I waaC deletion with lack of one or all late acyltransferases (lpxL/M/P) and/or various outer membrane biogenesis factors were constructed. Δ(waaC lpxL lpxM lpxP) and waaA mutants exhibited...
-
Automated Detection of Sleep Apnea and Hypopnea Events Based on Robust Airflow Envelope Tracking in the Presence of Breathing Artifacts. - [IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS]
PublikacjaThe paper presents a new approach to detection of apnea/hypopnea events, in the presence of artifacts and breathing irregularities, from a single channel airflow record. The proposed algorithm, based on a robust envelope detector , identifies segments of signal affected by a high amplitude mo d- ulation corresponding to apnea/hypopnea events. It is show n that a robust airflow envelope - free of breathing artifacts - improves effectiveness...
-
The effect of strain rate on the passive layer cracking of 304L stainless steel in chloride solutions based on the differential analysis of electrochemical parameters obtained by means of DEIS
PublikacjaOkreślono wpływ szybkości rozciągania w zakresie 10-5s-1 ÷ 16∙10-5s-1 na niestacjonarny proces elektrochemiczny pękania warstwy pasywnej. Badania przeprowadzono na stali wysokostopowej 304L w temperaturze pokojowej w środowisku chlorków za pomocą dynamicznej elektrochemicznej spektroskopii impedancyjnej (DEIS). W rezultacie uzyskano zestaw chwilowych widm impedancyjnych odzwierciedlających dynamikę badanego układu korozyjnego....
-
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...
-
Cognitive decline in Huntington's disease expansion gene carriers
Publikacja -
On the hat problem on a graph
PublikacjaThe topic of this paper is the hat problem in which each of n players is uniformly and independently 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....
-
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
Publikacja -
The Weather as an Indicator for Decision-Making Support Systems Regarding the Control of Cutworms in Beets and Cereal Leaf Beetles in Cereals and Their Adoption in Farming Practice
Publikacja -
On Decision-Making Strategies for Improved-Reliability Size Reduction of Microwave Passives: Intermittent Correction of Equality Constraints and Adaptive Handling of Inequality Constraints
PublikacjaDesign optimization of passive microwave components is an intricate process, especially if the primary objective is a reduction of the physical size of the structure. The latter has become an important design consideration for a growing number of modern applications (mobile communications, wearable/implantable devices, internet of things), where miniaturization is imperative due to a limited space allocated for the electronic circuitry....
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
Ekspertyza konstrukcji i stanu technicznego napędu rollera rejowego, napędu rollera sztagowego oraz wózka fałowego na sztag s/y "Running on Waves"
PublikacjaCelem ekspertyzy było ustalenie przyczyn nieprawidłowej pracy urządzeń rejowych i wciągarek. Omówiono błędy projektowe i wykonawcze oraz wskazano przyczyny awarii. Sformułowano wnioski dotyczące kierunków modernizacji konstrukcji.
-
A new look at two polymorphic crystal structures of dibenzoylmethane: relationship between the crystal packing and the hydrogen atom position revealed by quantum chemistry and quantum crystallography methods
Publikacja -
Three-fast-searchable graphs
PublikacjaIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
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...
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Comprehensive thermodynamic analysis of the CAES system coupled with the underground thermal energy storage taking into account global, central and local level of energy conversion
PublikacjaA key aspect of CAES is the optimal configuration of the thermodynamic cycle. In this paper, the situation of cooperation between the current conventional power plants and wind farms is analyzed, and then, based on thermodynamic models, the process of storing thermal and electrical energy in the CAES system coupled with a heat storage and recovery is developed. Therefore, three levels can be distinguished, namely: the global level...
-
Acoustic Streaming Induced by Periodic and Aperiodic Sound in a Bubbly Liquid
PublikacjaThe vortex ow which follows intense sound propagating in a bubbly liquid, is considered. The reasons for acoustic streaming are both nonlinearity and dispersion. That makes streaming especial as compared with that in a Newtonian uid. Conclusions concern the vortex ow induced in a half-space by initially harmonic or impulse Gaussian beam. The vortex ow recalls a turbulent ow with increasing in time number of small-scale vortices...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph 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 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublikacjaIn the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. No-wait requirement enforces that the delay between operations is equal to 0. No-idle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)-coloring (IIR(1, 1)-coloring) of a graph with the minimum...
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublikacjaWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
2-outer-independent domination in graphs
PublikacjaWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
All graphs with paired-domination number two less than their order
PublikacjaLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
An upper bound for the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
Wykorzystanie Web 2.0 oraz architektury informacji w pracy brokera informacji = TAKING ADVANTAGE OF WEB 2.0 AND THE INFORMATION ARCHITECTURE IN THE INFORMATION BROKER’S WORK
PublikacjaThe development of information and communication technologies, dissemination of access as well as unlimited increase of publications result in the uncontrolled growth of knowledge resources. Looking up for the relevant information becomes increasingly difficult, especially when time plays a role. Such process requires vast knowledge, practical experience in obtaining and providing information and also analytical...
-
Limiting distribution of the three-state semi-Markov model of technical state transitions of ship power plant machines and its applicability in operational decision-making.
PublikacjaThe article presents the three-state semi-Markov model of the process {W(t): t 0} of state transitions of a ship power plant machine, with the following interpretation of these states: s1 – state of full serviceability, s2 – state of partial serviceability, and s3 – state of unserviceability. These states are precisely defined for the ship main engine (ME). A hypothesis is proposed which explains the possibility of application...
-
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...
-
Opitmalising Human Development Index with sensitivity analysis
PublikacjaResearch background: Composite indicators are commonly used not only to measure economic development, the standard of livin g, competitiveness, fairness, effectiveness but are also willingly implemented in to many different fields. How- ever, it seems that in most cases the variable weig hting procedure is avoided or erroneous since in most cases so-called “wights by belief” are...
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublikacjaIn the paper, we show that the incidence chromatic number of a complete k-partite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
-
3D Hand Shape Modeling for Automatic Assessing Motor Performance in Parkinson's Disease
PublikacjaIn this paper a method for hand pattern processing to create a 3D hand model is presented. By applying a complete hand armature to the model obtained, an interpolation of three motor tests for an individual Parkinson's disease patient can be performed. To obtain the 3D hand model the top view of the hand from a web cam is analyzed. The hand contour is examined to find characteristic points that allows for dividing hand image into...
-
Multicopy Suppressor Analysis of Strains Lacking Cytoplasmic Peptidyl-Prolyl cis/trans Isomerases Identifies Three New PPIase Activities in Escherichia coli That Includes the DksA Transcription Factor
PublikacjaConsistent with a role in catalyzing rate-limiting step of protein folding, removal of genes encoding cytoplasmic protein folding catalysts belonging to the family of peptidyl-prolyl cis/trans isomerases (PPIs) in Escherichia coli confers conditional lethality. To address the molecular basis of the essentiality of PPIs, a multicopy suppressor approach revealed that overexpression of genes encoding chaperones (DnaK/J and GroL/S),...
-
Mobility Oriented Development (MOD): Public-Private Partnership in Urban Parking & Traffic Management with the Use of Autonomous Automobiles, Car-Sharing, Ridesharing Modes of Transport & Mobility as a Service (MaaS)
PublikacjaThe focus of the following research are relations between mobility technologies and metropolitan (urban and suburban) spatial structures. In this paper the author discusses various urban modes of transport (automobile, mass transit) in the context of emerging technical (autonomous vehicles, self-driving cars and driverless shuttles) and organizational (carpooling, ridesharing, car-sharing, on-demand mobility) solutions for " mobility...
-
Graph Decomposition for Memoryless Periodic Exploration
PublikacjaWe consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex...
-
The Efficiency and Productivity Evaluation of National Innovation Systems in Europe
PublikacjaPurpose: An efficient innovation system currently plays a crucial role in creating competitive prevalence, contributing to the economic growth of individual states. The innovation system is influenced by many socioeconomic factors, including in international rankings of innovativeness of economies. These classifications have some limitations. Primarily, they do not examine the efficiency, which means they do not analyze the...
-
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...
-
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...
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
A model of fuel combustion process in the marine reciprocating engine work space taking into account load and wear of crankshaft-piston assembly and the theory of semi-Markov processes
PublikacjaThe ar ticle analyses the operation of reciprocal internal combu stion engines, with mar ine engines u sed a s an example. The analysis takes into account types of energy conversion in the work spaces (cylinders) of these engines, loads of their crankshaft-piston assemblies, and types of fuel combustion which can take place in these spaces during engine operation. It is highlighted that the analysed time-dependent loads of marine...
-
Niechciany ''Pomost'' jako świadek destrukcji tkanki architektonicznej w Parku Nadmorskim w Sopocie = The unwanted ''Walking Overpass'' as the Witness to the destruction pf architectural tissue in the Seaside Park in Sopot
PublikacjaW referacie zawarta jest refleksja nad bezkarnym działaniem niszczycielskim w najdelikatniejszej strukturze krajobrazu miasta nadmorskiego. Krajobrazu ani jego dobrej pierwotnej tkanki nie da się odtworzyć tak szybko jak się ją niszczyło. W efekcie zapomnieliśmy, że piękno spaceru w Parku Nadmorskim jest wspólnym dobrem.
-
Oznaczanie stężeń jonów fluorkowych w próbkach wody pitnej z terenu miasta Malborka = Determination of fluoride ions in drinking water samples collected from the area of the town of Malbork
PublikacjaW pracy przedstawiono badania próbek wody pitnej z terenu miasta Malborka. Próbki wody pobierano sześciokrotnie (w miesięcznych odstępach - październik 2008, listopad 2008, grudzień 2008, styczeń 2009, luty 2009 oraz marzec 2009) w siedmiu punktach leżących w głównych dzielnicach miasta Malborka. Pobrane próbki podano analizie w celu oznaczenia następujących parametrów: zawartość anionów: F-, Cl-, Br-, 2NO , 3NO , 34 PO , 24 SO...
-
Fast collaborative graph exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Fast Collaborative Graph Exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
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...
-
Coronas and Domination Subdivision Number of a Graph
PublikacjaIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.
-
Methods of deep modification of low-bearing soil for the foundation of new and spare air runways
PublikacjaAfter analyzing the impact of aircraft on the airport pavement (parking spaces, runways, startways), it was considered advisable to consider the problem of deep improvement or strengthening of its subsoil. This is especially true for low-bearing soil. The paper presents a quick and effective method of strengthening the subsoil intended for the construction of engineering structures used for civil...
-
Brain-computer interaction based on EEG signal and gaze-tracking information = Analiza interackji mózg-komputer wykorzystująca sygnał EEg i informacje z systemu śledzenia punktu fiksacji wzroku
PublikacjaThe article presents an attempt to integrate EEG signal analysis with information about human visual activities, i.e. gaze fixation point. The results from gaze-tracking-based measurement were combined with the standard EEG analysis. A search for correlation between the brain activity and the region of the screen observed by the user was performed. The preliminary stage of the study consists in electrooculography (EOG) signal processing....