Filtry
wszystkich: 4210
wybranych: 2561
-
Katalog
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: MULTIPLE CAMERA SET
-
Reduced-cost electromagnetic-driven optimisation of antenna structures by means of trust-region gradient-search with sparse Jacobian updates
PublikacjaNumerical optimisation plays more and more important role in the antenna design. Because of lack of design-ready theoretical models, electromagnetic (EM)-simulation-driven adjustment of geometry parameters is a necessary step of the design process. At the same time, traditional parameter sweeping cannot handle complex topologies and large number of design variables. On the other hand, high computational cost of the conventional...
-
Ship weather routing featuring w-MOEA/D and uncertainty handling
PublikacjaThe paper presents a new version of evolutionary multi-objective weather routing (WR) for ships taking into account uncertainties of weather forecasts in route optimization. The method applies authors’ w-MOEA/D algorithm: MOEA/D framework incorporating Decision Maker’s (DM) preferences by means of w-dominance relation. Owing to this, DM preferences are taken into account throughout optimization, allowing the process to focus on...
-
Post-Chromatographic Derivatization Coupled with Mass Spectrometry as a Method of Profiling and Identification of Antioxidants; Ligustrum vulgare Phytocomplex as an Example
PublikacjaHigh-performance liquid chromatography (HPLC) and high-performance thin-layer chromatography (HPTLC) coupled with radical scavenging assays, such as 2,2-diphenyl-1-picrylhydrazyl (DPPH) and 2,2′-azinobis-(3-ethylbenzothiazoline-6-sulfonic acid (ABTS) can be both used for the detection of the antioxidants in plant extracts. In this study, the ethanolic (70% v/v) extracts from different morphological parts of Ligustrum vulgare collected...
-
An upper bound on the 2-outer-independent domination number of a tree
PublikacjaA 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 a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
Data on LEGO sets release dates and worldwide retail prices combined with aftermarket transaction prices in Poland between June 2018 and June 2023
PublikacjaThe dataset contains LEGO bricks sets item count and pricing history for AI-based set pricing prediction. The data spans the timeframe from June 2018 to June 2023. The data was obtained from three sources: Brickset.com (LEGO sets retail prices, release dates, and IDs), Lego.com official web page (ID number of each set that was released by Lego, its retail prices, the current status of the set) and promoklocki.pl web page (the retail...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(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 total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Estimation of groundwater recharge in a shallow sandy aquifer using unsaturated zone modeling and water table fluctuation method
PublikacjaQuantification of groundwater recharge is one of the most important issues in hydrogeology, especially in view of the ongoing changes in climate and land use. In this study, we use numerical models of 1D vertical flow in the vadose zone and the water table fluctuation (WTF) analysis to investigate local-scale recharge of a shallow sandy aquifer in the Brda outwash plain in northern Poland. We show that these two methods can be...
-
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,...
-
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...
-
Literature Review on Conceptualisation of Online Consumer Engagement
PublikacjaThe purpose of the current study is to develop a literature review on “online consumer engagement” (OCE). Articles from 2006 to 2016 published in the marketing journals and other related journals have been reviewed to summarise the OCE concept. Although there is not an agreed definition and conceptualisation of OCE, this study classified the concept as either behavioural or psychological within the dimensions of cognitive, emotional,...
-
Modeling SPMD Application Execution Time
PublikacjaParallel applications in a Single Process Multiple Data paradigm assume splitting huge amounts of data to multiple processors working in parallel at small data packets. As the individual data packets are not independent, the processors must interact with each other to exchange results of the calculations with their adjacent partners and take these results into account in their own computations. An example of SPMD is geometric parallelism...
-
Ocena klimatu akustycznego w przestrzeni pasażerskiej elektrycznego zespołu trakcyjnego serii EN57
PublikacjaW pracy przedstawiono wyniki badań poziomów dźwięku w przestrzeni pasażerskiej elektrycznego zespołu trakcyjnego (EZT) serii EN57 podczas postoju, rozruchu, jazdy oraz hamowania. Badania przeprowadzono na podstawie autorskiej metodyki badawczej bazując na normie PNEN ISO 3381:Kolejnictwo. Akustyka. Pomiar hałasu wewnątrz pojazdów szynowych. Badania przeprowadzono na linii kolejowej nr 250 od przystanku Gdańsk Śródmieście do stacji...
-
Weakly convex domination subdivision number of a graph
PublikacjaA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
Multi Parameter Sliding Test Result Evaluation for The Selection of Material Pair for Wear Resistant Components of a Hydraulic motor Dedicated for Use With Environmentally Friendly Working Fluids
PublikacjaIn the paper the method and results are presented of the testing of tribological performance of a number of hard materials available commercially. The tests consisted in unidirectional sliding with liquid lubrication. The load and velocity regime chosen were similar to a standard four-ball lubricity test with constant velocity and load increasing over time. The regime was modified in such a way that over the initial part of the...
-
Experimental investigations on adiabatic frictional pressure drops of R134a during flow in 5mm diameter channel
PublikacjaThe article presents detailed two-phase adiabatic pressure drops data for refrigerant R134a at a saturation pressure of 5.5 bar corresponding to the saturation temperature of 19.4 °C. Study cases have been set for a mass flux varying from 100 to 500 kg/m2 s. The frictional pressure drop was characterized for the refrigerant R134a, for vapor qualities ranging from 0 to 1. Long-time thermal stability of test facility allowed to gather...
-
3D Object Shape Reconstruction from Underwater Multibeam Data and Over Ground Lidar Scanning
PublikacjaThe technologies of sonar and laser scanning are an efficient and widely used source of spatial information with regards to underwater and over ground environment respectively. The measurement data are usually available in the form of groups of separate points located irregularly in three-dimensional space, known as point clouds. This data model has known disadvantages, therefore in many applications a different form of representation,...
-
Trade-offs in multiparty Bell-inequality violations in qubit networks
PublikacjaTwo overlapping bipartite binary input Bell inequalities cannot be simultaneously violated as this would contradict the usual no-signalling principle. This property is known as monogamy of Bell inequality violations and generally Bell monogamy relations refer to trade-offs between simultaneous violations of multiple inequalities. It turns out that multipartite Bell inequalities admit weaker forms of monogamies that allow for violations...
-
Strategies for mitigating nitrous oxide production and decreasing the carbon footprint of a full-scale combined nitrogen and phosphorus removal activated sludge system
PublikacjaNitrous oxide (N2O) emitted from biological nutrient removal activated sludge systems contributes significantly to the total carbon footprint of modern wastewater treatment plants. In the present study, N2O production and emissions were experimentally determined in a large-scale plant (220,000 PE) employing combined nitrogen (N) and phosphorus (P) removal. As a modelling tool, the Activated Sludge Model 2d (ASM2d) was extended...
-
Performance-Based Nested Surrogate Modeling of Antenna Input Characteristics
PublikacjaUtilization of electromagnetic (EM) simulation tools is mandatory in the design of contemporary antenna structures. At the same time, conducting designs procedures that require multiple evaluations of the antenna at hand, such as parametric optimization or yield-driven design, is hindered by a high cost of accurate EM analysis. To certain extent, this issue can be addressed by utilization of fast replacement models (also referred...
-
Review of ship safety domains: Models and applications
PublikacjaShip safety domain is a term which is widely used in research on collision avoidance and traffic engineering among others. Classic ship domains have been compared in multiple reports. However, up till now there has been no work summing up contemporary research in this field. The paper offers a systematic and critical review of the newer ship domain models and related research. It discusses multiple differences in approach to ship...
-
Weakly convex and convex domination numbers of some products of graphs
PublikacjaIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
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...
-
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...
-
Głowice optoelektroniczne bezzałogowych środków latających
PublikacjaBezzałogowe środki latające nie wymagają długiego i kosztownego szkolenia załóg. Koszty ich wdrożenia są wielokrotnie niższe od załogowych środków latających. Bezzałogowe środki latające są następcami załogowych pojazdów latających rozpoznawczych i obserwacyjnych. Jednym z podstawowych elementów wyposażania bezzałogowego środka latającego jest głowica optoelektroniczna. Głowice wyposażone są w systemy rejestracji i śledzenia wskazanych...
-
Total domination in versus paired-domination in regular graphs
PublikacjaA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Reply to Comment on ‘Nanodiamond incorporated human liver mimicking phantoms: prospective calibration medium of magnetic resonance imaging’
PublikacjaDependence of the spin–lattice (T1) relaxation times on the nanodiamond concentration in human liver phantoms is discussed. Factors affecting stability and and reproducibility of these phantoms are presented. The need for comparative measurements on multiple MRI scanners for better understanding of potential variations in the obtained imaging data is emphasised.
-
On trees attaining an upper bound on the total domination number
PublikacjaA total 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. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
Thermodynamic Cycles of Air Microturbine Power Plants Working on Biomass Fuels
PublikacjaThe gas turbine engine is modified to work as an air turbine set which consists, in the simplest arrangement, of a compressor, a heat exchanger and a turbine. Air is a working medium for both: the compressor and the turbine. This kind of air turbine set can be applied in power plants working on biomass fuels. In this solution we can burn fuels of varying parameters in the external combustion chamber without any harmful effects...
-
Bounds on the vertex-edge domination number of a tree
PublikacjaA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
Interpolation properties of domination parameters of a graph
PublikacjaAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
Research into flows in turbine blade seals. Part II: Numerical analysis
PublikacjaPrzedstawiono wyniki badań numerycznych programem Fluent przepływów w uszczelnieniu nadbandażowym stopnia turbinowego. Badania wykonano przy zastosowaniu różnych typów siatek obliczeniowych, różnych rodzajów "zszywek" oraz różnych metod obliczeniowych (Mixing Plane, Sliding Mesh, Multiple ReferenceFrame).
-
Independent Domination Subdivision in Graphs
PublikacjaA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
Graph security testing
PublikacjaSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
Weakly connected Roman domination in graphs
PublikacjaA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
A remark on singular sets of vector bundle morphisms
PublikacjaIf characteristic classes for two vector bundles over the same base space do not coincide, then the bundles are not isomorphic. We give under rather common assumptions a lower bound on the topological dimension of the set of all points in the base over which a morphism between such bundles is not bijective. Moreover, we show that this set is topologically non-trivial.
-
Towards Scalable Simulation of Federated Learning
PublikacjaFederated learning (FL) allows to train models on decentralized data while maintaining data privacy, which unlocks the availability of large and diverse datasets for many practical applications. The ongoing development of aggregation algorithms, distribution architectures and software implementations aims for enabling federated setups employing thousands of distributed devices, selected from millions. Since the availability of...
-
Analysis of energy efficiency of suburban railway transport network
PublikacjaRising numbers of agglomeration residents cause increased need for people movement on daily basis. Because of congestion of local roads, air pollution and limited parking space, providing mass transit based on electric traction is reasonable. While the electric rail vehicles are considered highly efficient in themselves, they need to be analyzed as a part of a transport network, because energy consumption depends on operating conditions...
-
Rapid multi-objective optimization of antennas using nested kriging surrogates and single-fidelity EM simulation models
PublikacjaEver increasing performance requirements make the design of contemporary antenna systems a complex and multi-stage process. One of the challenges, pertinent to the emerging application areas but also some of the recent trends (miniaturization, demands for multi-functionality, etc.), is the necessity of handling several performance figures such as impedance matching, gain, or axial ratio, often over multiple frequency bands. The...
-
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...
-
Color-based Detection of Bleeding in Endoscopic Images
PublikacjaIn this paper a color descriptor designed for bleeding detection in endoscopic images is proposed. The development of the algorithm was carried out on a representative training set of 36 images of bleeding and 25 clear images. Another 38 bleeding and 26 normal images were used in the final stage as a test set. All of the considered images were extracted from separate endoscopic examinations. The experiments include color distribution...
-
Common Independence in Graphs
PublikacjaAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Simulating propagation of coherent light in random media using the Fredholm type integral equation
PublikacjaStudying propagation of light in random scattering materials is important for both basic and applied research. Such studies often require usage of numerical method for simulating behavior of light beams in random media. However, if such simulations require consideration of coherence properties of light, they may become a complex numerical problems. There are well established methods for simulating multiple scattering of light (e.g....
-
Extending touch-less interaction with smart glasses by implementing EMG module
PublikacjaIn this paper we propose to use temporal muscle contraction to perform certain actions. Method: The set of muscle contractions corresponding to one of three actions including “single-click”, “double-click” “click-n-hold” and “non-action” were recorded. After recording certain amount of signals, the set of five parameters was calculated. These parameters served as an input matrix for the neural network. Two-layer feedforward neural...
-
Comparing Arbitrary Unrooted Phylogenetic Trees Using Generalized Matching Split Distance
PublikacjaIn the paper, we describe a method for comparing arbitrary, not necessary fully resolved, unrooted phylogenetic trees. Proposed method is based on finding a minimum weight matching in bipartite graphs and can be regarded as a generalization of well-known Robinson-Foulds distance. We present some properties and advantages of the new distance. We also investigate some properties of presented distance in a common biological problem...
-
REVISING ENTREPRENEURIAL ORIENTATION (EO) IN SOCIAL ENTREPRENEURSHIP, QUALITATIVE EVIDENCE FROM WORK INTEGRATION SOCIAL ENTERPRISES (WISES) FROM POLAND
PublikacjaEntrepreneurial behaviour and entrepreneurial orientation (EO) of (commercial) entrepreneurship. have received significant scholarly attention in entrepreneurship and management research However, there are insufficient attempts discussing such behaviour and EO in non-profit, and particularly social entrepreneurship context, arguing that EO is higher in such contexts, or remains the same, some new EO dimensions are proposed, existing...
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Domination-Related Parameters in Rooted Product Graphs
PublikacjaAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.