Filtry
wszystkich: 1895
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: OVERALL COLOR PARAMETER
-
Sound quality metrics applied to road noise evaluation
PublikacjaRoad noise monitoring systems typically measure sound levels in specific time periods. The more insightful approach suggests to measure also the nature of noise. Sound quality of sounds such as car noise can be objectively evaluated by several parameters. One of them is psychoacoustic annoyance, described by loudness, tone color, and the temporal structure of sound. In this paper the assessment of several sound quality parameters, such...
-
Paweł Burdziakowski dr inż.
Osobydr inż. Paweł Burdziakowski jest specjalista w zakresie fotogrametrii i teledetekcji lotniczej niskiego pułapu, nawigacji morskiej i lotniczej. Jest również licencjonowanym instruktorem lotniczym oraz programistą. Głównymi obszarami zainteresowania jest fotogrametria cyfrowa, nawigacja platform bezzałogowych oraz systemy bezzałogowe, w tym lotnicze, nawodne, podwodne. Prowadzi badania w zakresie algorytmów i metod poprawiających...
-
Equitable coloring of hypergraphs
PublikacjaA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Tribological test for evaluation of Natural PEEK
Dane BadawczeTest of PEEK natural (beige color) samples with sliding speed up to 1,2 m/s and up to 8 MPa of nominal load
-
Stochastic intervals for the family of quadratic maps
Dane BadawczeNumerical analysis of chaotic dynamics is a challenging task. The one-parameter families of logistic maps and closely related quadratic maps f_a(x)=a-x^2 are well-known examples of such dynamical systems. Determining parameter values that yield stochastic-like dynamics is especially difficult, because although this set has positive Lebesgue measure,...
-
Chromatic cost coloring of weighted bipartite graphs
PublikacjaGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
On the hardness of computing span of subcubic graphs
PublikacjaIn the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Dane BadawczeFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Dane BadawczeFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Dane BadawczeFor K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...
-
Uniform expansion estimates in the quadratic map as a function of the partition size, using Johnson’s algorithm
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Uniform expansion estimates in the quadratic map with the smallest critical neighborhood for which the expansion exponent λ0 is positive
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Uniform expansion estimates in the quadratic map as a function of the partition size, computing λ only
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Uniform expansion estimates in the quadratic map as a function of the partition size, using the “derivative” partition type
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Uniform expansion estimates in the quadratic map with the smallest critical neighborhood for which the expansion exponent λ is positive
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Uniform expansion estimates in the quadratic map as a function of the critical neighborhood size
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Uniform expansion estimates in the quadratic map as a function of the partition size, using the “critical” partition type
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Uniform expansion estimates in the quadratic map as a function of the partition size, using the Floyd–Warshall algorithm
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Uniform expansion estimates in the quadratic map with the smallest critical neighborhood for which the expansion exponent λ0 is greater than 0.1
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Uniform expansion estimates in the quadratic map with the smallest critical neighborhood for which the expansion exponent λ is greater than 0.1
Dane BadawczeThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
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:...
-
Tribological test for evaluation of CF30 Black PEEK
Dane BadawczeSample numner BL03 and BL04 made of PEEK CF30 (black color) tribologicaly tested with sliding speed up to 1,8 m/s and up to 14 MPa of nominal load under water lubrication.
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Dane BadawczeFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Dane BadawczeFor Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...
-
Insights into the Thermo-Mechanical Treatment of Brewers’ Spent Grain as a Potential Filler for Polymer Composites
PublikacjaThis paper investigated the impact of twin-screw extrusion parameters on the properties of brewers’ spent grain. The chemical structure, antioxidant activity, particle size, and color properties, as well as the emission of volatile organic compounds during extrusion, were investigated. The main compounds detected in the air during modifications were terpenes and terpenoids, such as α-pinene, camphene, 3-carene, limonene, or terpinene....
-
Wavelet filtering of signals without using model functions
PublikacjaThe effective wavelet filtering of real signals is impossible without determining their shape. The shape of a real signal is related to its wavelet spectrum. For shape analysis, a continuous color wavelet spectrogram of signal level is often used. The disadvantage of continuous wavelet spectrogram is the complexity of analyzing a blurry color image. A real signal with additive noise strongly distorts the spectrogram based on continuous...
-
Hat problem on a graph
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color looking at the hat colors of the other people. The team wins if at least one person 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 win. In this version every...
-
Simple colorimetric copper(II) sensor – spectral characterization and possible applications
PublikacjaNew o-hydroxyazocompound L bearing pyrrole residue was obtained in the simple synthetic protocol. The structure of L was confirmed and analyzed by X-ray diffraction. It was found that new chemosensor can be successfully used as copper(II) selective spectrophotometric regent in solution and can be also applied for the preparation of sensing materials generating selective color signal upon interaction with copper(II). Selective colorimetric...
-
Influence of lightweight structures used in swimming pools and water parks objects on their functionality, building form and spatial-visual effects indoors.
PublikacjaSpeaking about architecture of swimming facilities and water parks we have in mind their form, function , design and detail, texture and color. A particularly important element of the architecture of these buildings was and still is the structure.
-
Performance evaluation of the parallel object tracking algorithm employing the particle filter
PublikacjaAn algorithm based on particle filters is employed to track moving objects in video streams from fixed and non-fixed cameras. Particle weighting is based on color histograms computed in the iHLS color space. Particle computations are parallelized with CUDA framework. The algorithm was tested on various GPU devices: a desktop GPU card, a mobile chipset and two embedded GPU platforms. The processing speed depending on the number...
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Dane BadawczeFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...
-
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),...
-
Thermal analysis of Magnetohydrodynamics (MHD) Casson fluid with suspended Iron (II, III) oxide-aluminum oxide-titanium dioxide ternary-hybrid nanostructures
PublikacjaThis study is carried out to enhance and analyze the thermal performance of non-Newtonian Casson fluid by immersing Ternary hybrid nanoparticles Fe3O4-Al2O3-TiO2 uniformly. To model the behaviour of such complex phenomena mathematically, a system of complex transport differential equations is developed by utilizing a non-Fourier heat transfer model for energy transport. The non-dimensional system of transport equations involving...
-
Multiaxial Fatigue Behaviour of SLM 18Ni300 Steel
PublikacjaFatigue behaviour of SLM 18Ni300 steel under proportional bending-torsion loading is studied. The fatigue tests are conducted under pulsating loading conditions using tubular specimens with a transversal circular hole. Three ratios of the normal stress to shear stress are considered, namely σ/τ=4,σ/τ=2 and σ/τ = 4/3. Crack initiation sites were found for two diametrically opposite points around the hole, whose locations are governed...
-
Rapid dimension scaling of compact microwave couplers with power split correction
PublikacjaIn this paper, a technique for rapid re-design ofcompact microwave couplers with respect to operating frequency is discussed. Our methodology involves an inverse surrogate model setup using several reference designs optimized (at the level of equivalent circuit representation of the coupler) for a set of operating frequencies within a range of interest. The surrogate establishes the relationship between the operating frequency...
-
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Dane BadawczeFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
Relationship between album cover design and music genres.
PublikacjaThe aim of the study is to find out whether there exists a relationship between typographic, compositional and coloristic elements of the music album cover design and music contained in the album. The research study involves basic statistical analysis of the manually extracted data coming from the worldwide album covers. The samples represent 34 different music genres, coming from nine countries from around the world. There are...
-
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...
-
Calibration images under different lighting conditions vol. 1
Dane BadawczeDataset description: Calibration images under different lighting conditions vol. 1
-
Topology recognition and leader election in colored networks
PublikacjaTopology 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...
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Dane BadawczeFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...
-
Dynamic coloring of graphs
PublikacjaDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Sustainable upcycling of brewers’ spent grain by thermo-mechanical treatment in twin-screw extruder
PublikacjaThermo-mechanical treatment of brewers’ spent grain (a by-product of beer manufacturing) was successfully performed via the extrusion process. The impact of temperature (from 30 to 180 °C), throughput (from 1 to 5 kg/h) and screw speed (from 75 to 375 rpm) on particle size, color, chemical structure, antioxidant activity and thermal stability of resulting material, as well as correlations between particular properties, were investigated....
-
Hat problem on odd cycles
PublikacjaThe topic is the hat problem in which each of n players is randomly 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 a win. In this version every player can...
-
A construction for the hat problem on a directed graph
PublikacjaA team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...
-
Study on the applicability of the measurements of magnetoelastic properties for a nondestructive evaluation of thermally inducted microstructure changes in the P91 grade steel
PublikacjaThe paper presents the resuIts of the investigation of the influence of duration and temperature oftempering process on the magnetoacoustic properties of P91 tempered martensite ferritic steeI. Duringtempering of martensitic steels the dislocation density. which initially is very high. systematicallydecreases what is confirmed both by analysis of the width of X-ray diffraction peaks and hardnessmeasurements. Magnetic hysteresis...
-
Recurrence times in the Morse sets for a two-dimensional discrete neuron model (low resolution)
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Respiratory system modelling and simulation basing on the forced oscilation technique
PublikacjaConventional methods of testing lung functioning demand a specific respiratory action of the patient. In contrast, the forced oscillation technique (fot) provides measurements obtained with a minimal cooperation of the subject. The aim of this study is to verify the usefulness of the forced oscillation technique modelling in respiratory system diagnosing. in order to do it two models of fot measurements have been considered: the...
-
On-line ranking of split graphs
PublikacjaA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...