Filtry
wszystkich: 1979
wybranych: 1736
-
Katalog
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: DISCRETE GREEN'S FUNCTION
-
Turán numbers for odd wheels
PublikacjaThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
Graphs with isolation number equal to one third of the order
PublikacjaA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
The circular chromatic index of some class 2 graphs
PublikacjaW artykule został wyznaczony cyrkularny indeks chromatyczny dla dwóch rodzin grafów klasy 2. Co więcej, podano nie trywialne oszacowania tego parametru dla snarków Isaacsa i Goldberga. Na koniec artykułu rozważana jest złożoność obliczeniowa problemów związanych z cyrkularnym kolorowaniem krawędzi.
-
Total restrained domination numbers of trees
PublikacjaOpisane są wszystkie drzewa, w których liczby dominowania totalnego i totalno - powściągniętego są sobie równe, a także podano dolne ograniczenie na liczbę dominowania totalno - powściągniętego w drzewach.
-
Distance paired domination numbers of graphs
PublikacjaW pracy przedstawione są pewne własności liczb k-dominowania parami w grafach. Wykazane jest, że problem decyzyjny liczby k-dominowania parami jest problemem NP-zupełnym nawet dla grafów dwudzielnych. Przedstawione są ograniczenia górne i dolne dla liczby k-dominowania parami w drzewach i scharakteryzowane drzewa, w których te ograniczenia są osiągnięte.
-
Paired bondage in trees
PublikacjaW pracy zdefiniowano pojęcie liczby zniewolenia parami jako moc najmniejszego zbioru krawędzi, którego usunięcie z grafu spowoduje wzrost liczby dominowania parami. W szczególności scharakteryzowane są wszystkie drzewa, w których liczba zniewolenia wynosi 0, czyli takie, w których usunięcie dowolnego podzbioru krawędzi nie zwiększy liczby dominowania parami.
-
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ą.
-
Compact cyclic edge-colorings of graphs
PublikacjaArtykuł jest poświęcony modelowi zwartego cyklicznego kolorowania krawędzi grafów. Ten wariant kolorowania jest stosowany w modelowaniu uszeregowań w systemach produkcyjnych, w których proces produkcyjny ma charakter cykliczny. W pracy podano konstrukcje grafów, które nie zezwalają na istnienie pokolorowania w rozważanym modelu. Wykazano także kilka własności teoretycznych, takich jak ograniczenia górne na liczbę kolorów w optymalnym...
-
The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
PublikacjaW pracy pokazano, że problem L(p,q)-kolorowania przy użyciu ''t'' kolorów jest NP-zupełny nawet w wersji ograniczonej do grafów planarnych dwudzielnych małego stopnia, nawet dla stosunkowo niewielkich wartości ''t''. Jako wniosek z uzyskanych wyników stwierdzono, że problem L(2,1)-kolorowania grafów planarnych przy użyciu 4 kolorów jest NP-zupełny, a także że problem L(p,q)-kolorowania grafów o maksymalnym stopniu 4 jest NP-zupełny...
-
A note on compact and compact circular edge-colorings of graphs
PublikacjaW pracy rozważamy dwa warianty kolorowania krawędzi grafów prostych i ważonych, mianowicie kolorowania zwarte oraz zwarte cyrkularne. Rozważamy relacje pomiędzy nimi. Dowodzimy, że każdy zewnętrznie planarny graf dwudzielny posiada zwarte pokolorowanie krawędziowe oraz, że problem ten dla grafów ogólnych jest NP-zupełny. Podajemy również wielomianowy 1.5-przybliżony algorytm oraz pseudowielomianowy dokładny algorytm zwartego cyrkularnego...
-
Mixed graph edge coloring
PublikacjaW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
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),...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Dynamic analysis of the impact of the wind spectrum according to the theory of Davenport for lightweight structures of the roof in sports hall Czyzyna in Cracow.
PublikacjaThe main aim of this analysis is to characterize numerical simulations connected with modeling dynamic influence of wind on the lightweight structures of the roof in sports hall – “Czyżyna”. This hall is built in Cracow. The article also involves the proposals of the solutions connected with dynamic influence of the wind – Davenport’s method has been used. These proposals have not been taken into consideration at the detailed engineering...
-
Assessment of chemical‐crosslink‐assisted protein structure modeling in CASP13
Publikacja -
Common functionally important motions of the nucleotide‐binding domain of H sp70
Publikacja -
Prediction of protein structure with the coarse-grained UNRES force field assisted by small X-ray scattering data and knowledge-based information
Publikacja -
Blind prediction of homo‐ and hetero‐protein complexes: The CASP13‐CAPRI experiment
Publikacja -
Density functional theory calculations on entire proteins for free energies of binding: Application to a model polar binding site
PublikacjaIn drug optimization calculations, the molecular mechanics Poisson-Boltzmann surface area (MM-PBSA) method can be used to compute free energies of binding of ligands to proteins. The method involves the evaluation of the energy of configurations in an implicit solvent model. One source of errors is the force field used, which can potentially lead to large errors due to the restrictions in accuracy imposed by its empirical nature....
-
Prediction of protein assemblies, the next frontier: The CASP14‐CAPRI experiment
PublikacjaWe present the results for CAPRI Round 50, the 4th joint CASP-CAPRI protein assembly prediction challenge. The Round comprised a total of 12 targets, including 6 dimers, 3 trimers, and 3 higher-order oligomers. Four of these were easy targets, for which good structural templates were available either for the full assembly, or for the main interfaces (of the higher-order oligomers). Eight were difficult targets for which only distantly...
-
Impact of AlphaFold on structure prediction of protein complexes: The CASP15‐CAPRI experiment
PublikacjaWe present the results for CAPRI Round 54, the 5th joint CASP-CAPRI protein assembly prediction challenge. The Round offered 37 targets, including 14 homodimers, 3 homo-trimers, 13 heterodimers including 3 antibody–antigen complexes, and 7 large assemblies. On average 70 CASP and CAPRI predictor groups, including more than 20 automatics servers, submitted models for each target. A total of 21 941 models submitted by these groups...
-
Modeling SARS‐CoV‐2 proteins in the CASP‐commons experiment
PublikacjaCritical Assessment of Structure Prediction (CASP) is an organization aimed at advancing the state of the art in computing protein structure from sequence. In the spring of 2020, CASP launched a community project to compute the structures of the most structurally challenging proteins coded for in the SARS-CoV-2 genome. Forty-seven research groups submitted over 3000 three-dimensional models and 700 sets of accuracy estimates on...
-
Atomic resolution crystal structure of HV-BBI protease inhibitor from amphibian skin in complex with bovine trypsin
Publikacja -
Particle Shape Effect on Macroscopic Behaviour of Underground Structures: Numerical and Experimental Study
PublikacjaAbstract: The mechanical performance of underground flexible structures such as buried pipes or culverts made of plastics depend not only on the properties of the structure, but also on the material surrounding it. Flexible drains can deflect by 30% with the joints staying tight, or even invert. Large deformations of the structure are difficult to model in the framework of Finite Element Method, but straightforward in Discrete...
-
Particle Shape Effect on Macroscopic Behaviour of Underground Structures: Numerical and Experimental Study
PublikacjaThe mechanical performance of underground flexible structures such as buried pipes or culverts made of plastics depend not only on the properties of the structure, but also the material surrounding it. Flexible drains can deflect by 30% with the joints staying tight, or even invert. Large deformations of the structure are difficult to model in the framework of Finite Element Method, but straightforward in Discrete Element Methods....
-
PROPERTIES OF ONE DIMENSIONAL OPEN-CHANNEL STEADY FLOW EQUATIONS
PublikacjaIn this paper properties of discrete forms of one dimensional steady gradually varied flow equations are discussed. Such forms of flow equations are obtained as a result of approximation of their differential forms, which is required to solve them numerically. For such purpose explicit or implicit numerical approximation schemes for ordinary differential equations can be applied. It turns out that dependently on the chosen approximation...
-
Modulated crystal structures - periodicity in more than three dimensions
PublikacjaThe initial definition of a crystal was that it is an object with flat faces. When diffraction studies were developed it turned out that crystal consists of a highly ordered particles and it is possible to isolate a small unique part of their structure - a unit cell - and the definition has been changed to rely on this fact. Nowadays by a crystal we mean any solid having an essentially discrete diffraction diagram. It is because...
-
Parametric impulsive noise detector for corrupted audio signals based on hidden Markow model
PublikacjaThe paper addresses the problem of impulsive noise detection for audio signals. A structure of threshold parameter detectors using modelingof signals was introduced. the algorithm of the noise detection, based on discrete-time hidden Markow model (HMM)of whitened audio signal is elaborated
-
The finite-difference simulation of x-rays propagation through a system of lenses
PublikacjaThe propagation of X-ray waves through an optical system consisting of 33 aluminum X-ray refractive lenses is considered. For solving the problem, a finite-difference method is suggested and investigated. It is shown that very small steps of the difference grid are necessary for reliable computation of propagation of X-ray waves through the system of lenses. It is shown that the wave phase is a function very quickly increasing...
-
New Concept of Numerical Ship Motion Modelling for Total Ship Operability Analysis by Integrating Ship and Environment Under One Overall System
PublikacjaThe paper presents a new concept of overall ship motion modelling for application to total ship operability. The delivered model is a multi-phase and includes both submerged part of ship’s hull and the surrounding water as a unique body. The Discrete Finite Element Method is applied. The model is successfully examined and illustrated for a selected AHTS.
-
A Nyquist filter of fractional delay
PublikacjaIn the paper a novel discrete-time FIR fractonal delay specjal filter is investigated. This is a Nyquist filter which, besides the traditional its attribute (interymbol interference (ISI) free property), has the ability to compensate for subsample transmission delay involved, for example, in multipath propagation channel. The performance of the filter is analysed and illustrated.
-
Analysis of compressive forces in CFGFT cylindrical pillars and their coatings using laboratory tests and metric spaces
PublikacjaThe article discusses compressive forces tests in composite-concrete pillars with the use of laboratory active experiment including the factors and properties of materials which have a significant impact on the test results and their repeatability. A polymer composite based on glass fiber reinforced resin with different fiber beam angles (20, 55 and 85) was used as a buffer/coat of the pole. Due to the problems with direct comparison...
-
Flow Process Models for Pipeline Diagnosis
PublikacjaThis chapter examines the problem of modeling and parameterization of the transmission pipeline flow process. First, the base model for discrete time is presented, which is a reference for other developed models. Then, the diagonal approximation (AMDA) method is proposed, in which the tridiagonal sub-matrices of the recombination matrix are approximated by their diagonal counterparts, which allows for a simple determination of...
-
On the Structure of Time in Computational Semantics of a Variable-Step Solver for Hybrid Behavior Analysis
PublikacjaHybrid dynamic systems combine continuous and discrete behavior. Often, computational approaches are employed to derive behaviors that approximate the analytic solution. An important part of this is the approximation of differential equation behavior by numerical integration. The accuracy and computational efficiency of the integration usually depend on the complexity of the method and its implicated approximation errors, especially...
-
Periodic and chaotic dynamics in a map‐based neuron model
PublikacjaMap-based neuron models are an important tool in modeling neural dynamics and sometimes can be considered as an alternative to usually computationally costlier models based on continuous or hybrid dynamical systems. However, due to their discrete nature, rigorous mathematical analysis might be challenging. We study a discrete model of neuronal dynamics introduced by Chialvo in 1995. In particular, we show that its reduced one-dimensional...
-
More Just Measure of Fairness for Sharing Network Resources
PublikacjaA more just measure of resource distribution in computer networks is proposed. Classic functions evaluate fairness only “on average”. The proposed new fairness score function ensures that no node is left without resources while on average everything looks good. It is compared with well-known and widely adopted function proposed by Jain, Chiu and Hawe and another one recently proposed fairness function by Chen and Zhang. The function...
-
Application of non-classical operational calculus to indicate hazards in numerical solutions of engineering problems
PublikacjaThe article addresses the application of non- classical operational calculus to approximative solutions of engineering problems. The engineering-sound examples show that a continuous–discrete problem transformation from differential unequivocal problem to a differential wildcard problem, triggering a change in solution quality. A number of approximative methods are capable to alter both quantitative and qualitative...
-
Active and Dynamic Graphical Code for Object Identification in Healthcare
PublikacjaA new approach for item marking using two dimensional discrete graphics markers. Proposed solution allow o change the code rapidly, upon request and in the case of thermal markers make the code invisible for unauthorized observers. Connecting the proposed codes with wearable multmedial platform such as eGlasses can create new possibilities in human-environment interaction.
-
High frequency oscillations are associated with cognitive processing in human recognition memory
PublikacjaHigh frequency oscillations are associated with normal brain function, but also increasingly recognized as potential biomarkers of the epileptogenic brain. Their role in human cognition has been predominantly studied in classical gamma frequencies (30-100 Hz), which reflect neuronal network coordination involved in attention, learning and memory. Invasive brain recordings in animals and humans demonstrate that physiological oscillations...
-
Rating mathematical models for first-pass of tracer in pCT lung studies
PublikacjaThis paper presents a comparison of model based on the Gauss function and the most commonly used Gamma-variate model in perfusion computed tomography (pCT) lung studies. It also verifies whether used model affects value of blood volume parameter. Three mean concentration-time curves were created from actual pCT measurements: arterial input function, blood vessels in lungs and lung parenchyma. On the basis of these mean curves we...
-
Clarke duality for Hamiltonian systems with nonstandard growth
PublikacjaWe consider the existence of periodic solutions to Hamiltonian systems with growth conditions involving G-function. We introduce the notion of symplectic G-function and provide relation for the growth of Hamiltonian in terms of certain constant CG associated to symplectic G-function G. We discuss an optimality of this constant for some special cases. We also provide applications to the Φ-laplacian type systems.
-
Complex Root Finding Algorithm Based on Delaunay Triangulation
PublikacjaA simple and flexible algorithm for finding zeros of a complex function is presented. An arbitrary-shaped search region can be considered and a very wide class of functions can be analyzed, including those containing singular points or even branch cuts. The proposed technique is based on sampling the function at nodes of a regular or a self-adaptive mesh and on the analysis of the function sign changes. As a result, a set of candidate points...
-
Simulations of Shear Zones and Cracks in Engineering Materials Using eXtended Finite Element Method
PublikacjaNumerical simulations of cracks and shear zones in quasi-brittle materials are presented. Extended Finite Element Method is used to describe both cracks and shear zones. In a description of tensile cracks, a Rankine criterion is assumed. A discrete Mohr-Coulomb law is adopted for simulations of shear zones. Results of simple numerical tests: unixial tension, bending and biaxial compression are demonstrated.
-
Alternative convolution approach to friction in unsteady pipe flow
PublikacjaIn the paper some aspects of the unsteady friction in pipe flow expressed by the convolution are analyzed. This additional term introduced into the motion equation involves the accelerations of fluid occurring in the past and a weighting function. The essence of such approach is to assume the appropriate form of weighting function. However, until now no fully reliable formula for this function has been found. To avoid some inconveniences...
-
Open-Source Coprocessor for Integer Multiple Precision Arithmetic
PublikacjaThis paper presents an open-source digital circuit of the coprocessor for an integer multiple-precision arithmetic (MPA). The purpose of this coprocessor is to support a central processing unit (CPU) by offloading computations requiring integer precision higher than 32/64 bits. The coprocessor is developed using the very high speed integrated circuit hardware description language (VHDL) as an intellectual property (IP) core. Therefore,...
-
Mechanochemical Energy Transduction during the Main Rotary Step in the Synthesis Cycle of F1-ATPase
PublikacjaF1-ATPase is a highly efficient molecular motor that can synthesize ATP driven by a mechanical torque. Its ability to function reversibly in either direction requires tight mechanochemical coupling between the catalytic domain and the rotating central shaft, as well as temporal control of substrate binding and product release. Despite great efforts and significant progress, the molecular details of this synchronized and fine-tuned...
-
A high-accuracy complex-phase method of simulating X-ray propagation through a multi-lens system
PublikacjaThe propagation of X-ray waves through an optical system consisting of many X-ray refractive lenses is considered. For solving the problem for an electromagnetic wave, a finite-difference method is applied. The error of simulation is analytically estimated and investigated. It was found that a very detailed difference grid is required for reliable and accurate calculations of the propagation of X-ray waves through a multi-lens...
-
Comments on “Closed Form Variable Fractional Time Delay Using FFT”
PublikacjaIn this letter drawbacks of the aforementioned paper are pointed out. The proposed approach is improved with minor modifications of the discrete frequency response. This allows for design of fractional delay filters which are close to optimal and can be efficiently implemented in the frequency domain using the sliding DFT based structure. Alternatively, the derived equivalent closed form formulae for offset windows can be used...
-
Global edge alliances in graphs
PublikacjaIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...