Filters
total: 2950
filtered: 1901
displaying 1000 best results Help
Search results for: CALL SET-UP DELAY
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $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
PublicationA 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...
-
Graphs with isolation number equal to one third of the order
PublicationA 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...
-
Total domination in versus paired-domination in regular graphs
PublicationA 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...
-
Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets
PublicationThis work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry...
-
Bounds on the vertex-edge domination number of a tree
PublicationA 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...
-
On trees attaining an upper bound on the total domination number
PublicationA 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...
-
On trees with double domination number equal to 2-domination number plus one
PublicationA 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,...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 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...
-
Thermodynamic Cycles of Air Microturbine Power Plants Working on Biomass Fuels
PublicationThe 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...
-
Interpolation properties of domination parameters of a graph
PublicationAn 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.
-
Using concentrated spectrogram for analysis of audio acoustic signals
PublicationThe paper presents results of time-frequency analysis of audio acoustic signals using the method of Concentrated Spectrograph also known as ''Cross-spectral method'' or ''Reassignment method''. Presented algorithm involves signal's local group delay and channelized instantaneous frequency to relevantly redistribute all Short-time Fourier transform lines in time-frequency plain. The main intention of the paper is to compare various...
-
Wykorzystanie fazy transformaty STFT do oceny jakości spektrogramu
PublicationW niniejszej publikacji przedstawiono koncepcję oceny jakości spektrogramu, wykorzystując często marginalizowaną fazę transformaty STFT (ang. Short-term Fourier transform). Spektrograf traktowany jest jako bank filtrów demultipleksujących sygnał. Dla każdego w ten sposób odfiltrowanego sygnału składowego obliczana jest kanałowa pulsacja chwilowa (ang. channel instantaneous frequency) oraz lokalne opóźnienie grupowe (ang. local...
-
THE INFLUENCE OF WSR PARAMETER ON PET BOTTLE THICKNESS PROFILE IN SBM FROM PREFORM PROCESS
PublicationFrom a mechanical point of view, the thickness profile of PET bottles manufactured by ISBM process is determined by mechanical and thermal response of blown preforms. From the microscopic point of view the biggest influence on the mechanical and thermal properties of PET bottles have orientation and crystallization processes. From a technological point of view, the thickness profile of PET bottles after manufacture by SBM process...
-
Topological, nonreciprocal, and multiresonant slow light beyond the time-bandwidth limit
PublicationTopologically protected transport has recently emerged as an effective means to address a recurring problem hampering the field of slow light for the past two decades: its keen sensitivity to disorders and structural imperfections. With it, there has been renewed interest in efforts to overcome the delay-time-bandwidth limitation usually characterizing slow-light devices, on occasion thought to be a fundamental limit. What exactly...
-
On rotational instability within the nonlinear six-parameter shell theory
PublicationWithin the six-parameter nonlinear shell theory we analyzed the in-plane rotational instability which oc- curs under in-plane tensile loading. For plane deformations the considered shell model coincides up to notations with the geometrically nonlinear Cosserat continuum under plane stress conditions. So we con- sidered here both large translations and rotations. The constitutive relations contain some additional mi- cropolar parameters...
-
Threshold Attendance under Soft-Crash Model: TAG Protocol and Markovian Analysis
PublicationA realistic and systematic network evaluation should subsume an availability model and a failure model. We combine a "hard availability" model we call threshold attendance, whereby a certain minimum number of network elements must be present at any time, with a soft-crash failure model, whereby after experiencing a failure, a network element is still able to function correctly for a while in an emergency mode at a risk of a major...
-
Independent Domination Subdivision in Graphs
PublicationA 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
PublicationSet 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
PublicationA 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...
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublicationTwo identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...
-
Dynamic GPU power capping with online performance tracing for energy efficient GPU computing using DEPO tool
PublicationGPU accelerators have become essential to the recent advance in computational power of high- performance computing (HPC) systems. Current HPC systems’ reaching an approximately 20–30 mega-watt power demand has resulted in increasing CO2 emissions, energy costs and necessitate increasingly complex cooling systems. This is a very real challenge. To address this, new mechanisms of software power control could be employed. In this...
-
A remark on singular sets of vector bundle morphisms
PublicationIf 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.
-
All graphs with paired-domination number two less than their order
PublicationLet 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...
-
Novel Adaptive Method for Data Streams Allocation Based on the Estimate of Radio Channel Parameters in Heterogeneous WBAN Network
PublicationThe new adaptive method for data streams allocation in heterogeneous Wireless Body Area Networks and meas-urement equipment is presented. The results obtained using the developed method compared with the selected algorithms likely to be used in those networks. The pro-posed adaptive data streams allocation method based on radio channel parameters makes it even twice as efficient to use in terms of resources usage in a WBAN heterogeneous...
-
A self-optimization mechanism for generalized adaptive notch smoother
PublicationTracking of nonstationary narrowband signals is often accomplished using algorithms called adaptive notch filters (ANFs). Generalized adaptive notch smoothers (GANSs) extend the concepts of adaptive notch filtering in two directions. Firstly, they are designed to estimate coefficients of nonstationary quasi-periodic systems, rather than signals. Secondly, they employ noncausal processing, which greatly improves their accuracy and...
-
Efficient FPGA Implementation of an RFIR Filter Using the APC–OMS Technique with WTM for High-Throughput Signal Processing
PublicationNowadays, Finite Impulse Response (FIR) filters are used to change the attributes of a signal in the time or frequency domain. Among FIR filters, a reconfigurable filter has the advantage of changing the coefficient in real-time, while performing the operation. In this paper, the Anti-Symmetric Product Coding (APC) and Odd Multiple Storage (OMS) modules are utilized to implement the reconfigurable FIR filter (RFIR–APC–OMS). Herein,...
-
Optimization of the femtosecond laser impulse for excitation and the Spin-Orbit mediated dissociation in the NaRb Dimer
PublicationWe study the dynamics of multiple coupled states under the influence of an arbitrary time-dependent external field to investigate the femtosecond laser-driven excitation and the spin-orbit mediated dissociation in the NaRb dimer. In this process, the dimer is excited from the ground triplet state 1^3Sigma+ to the 1^3Pi state using the femtosecond laser impulse and the spin-orbit coupling between the 1^3Pi and 2^1Sigma+ states results...
-
Color-based Detection of Bleeding in Endoscopic Images
PublicationIn 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
PublicationAbstract: 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|...
-
Comparing Arbitrary Unrooted Phylogenetic Trees Using Generalized Matching Split Distance
PublicationIn 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...
-
Extending touch-less interaction with smart glasses by implementing EMG module
PublicationIn 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...
-
Paired domination versus domination and packing number in graphs
PublicationGiven 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...
-
Two-particle entropy and structural ordering in liquid water
PublicationEntropies of simple point charge (SPC) water were calculated over the temperature range 278-363 K using the two-particle correlation function approximation. Then, the total two-particle contribution to the entropy of the system was divided into three parts, which we call translational, configurational, and orientational. The configurational term describes the contribution to entropy, which originates from spatial distribution of...
-
How to evaluate methods used in chemical laboratories in terms of the total chemical risk? – a ChlorTox Scale
PublicationReliable assessment of the health and environmental risk associated with the use of chemicals is critical to ob- jectively evaluate the greenness and whiteness of an analytical method. An objective and useful way of risk assessment should take into account all the relevant properties of used substances, their actual amounts needed for application of the method, and quantify the assessment result using a standardized unit. This...
-
Clean energy in the European Union: Transition or evolution?
PublicationIn this paper, we analyse two phenomena. First, the relationship between greenhouse gases emission and effectiveness of the European Union energy policies and second the transition from the fossil fuels to renewable energy sources. We run two-step data analysis concerning 25 European Union member states in the period from 1990 to 2018. We use information on greenhouse gases emission, introduction of new energy policies, source...
-
Two- and three-dimensional elastic networks with rigid junctions: modeling within the theory of micropolar shells and solids
PublicationFor two- and three-dimensional elastic structures made of families of flexible elastic fibers undergoing finite deformations, we propose homogenized models within the micropolar elasticity. Here we restrict ourselves to networks with rigid connections between fibers. In other words, we assume that the fibers keep their orthogonality during deformation. Starting from a fiber as the basic structured element modeled by the Cosserat...
-
A Assessment of Management Efficiency in Local Administrative Offices: Case Study Poland
PublicationThe analysis of management efficiency is an important element in evaluating the functioning of public administration from an economic point of view. In order to achieve greater efficiency of the management process, and thus the quality in public administration, it is important to analyze and evaluate its elements. Modern research usually covers individual elements, parts of the management process. However, the current study proposes...
-
Domination-Related Parameters in Rooted Product Graphs
PublicationAbstract 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.
-
Induction of the common-sense hierarchies in lexical data
PublicationUnsupervised organization of a set of lexical concepts that captures common-sense knowledge inducting meaningful partitioning of data is described. Projection of data on principal components allow for dentification of clusters with wide margins, and the procedure is recursively repeated within each cluster. Application of this idea to a simple dataset describing animals created hierarchical partitioning with each clusters related...
-
Comparison of Methods for Real and Imaginary Motion Classification from EEG Signals
PublicationA method for feature extraction and results of classification of EEG signals obtained from performed and imagined motion are presented. A set of 615 features was obtained to serve for the recognition of type and laterality of motion using 8 different classifications approaches. A comparison of achieved classifiers accuracy is presented in the paper, and then conclusions and discussion are provided. Among applied algorithms the...
-
Construction of phylogenetic trees with topological constraints
PublicationThis paper proposes a method of reconstruction of phylogenetic trees based on heuristic search with topological constraints. Using topological constraints it is possible to reduce the set of solutions as well as to enforce that the result is consistent with a given hypothesis about the evolution process within some group of species. Along with this work a number of algorithms used for phylogenetic analysis were implemented. Those...
-
Automatic Regularization by Quantization in Reducible Representations of CCR: Point-Form Quantum Optics with Classical Sources
PublicationElectromagnetic fields are quantized in a manifestly covariant way by means ofa class of reducible "center-of-mass N-representations" of the algebra of canonical commutationrelations (CCR). The four-potential Aa(x) transforms in these representations as aHermitian four-vector field in Minkowski four-position space (without change of gauge), butin momentum space it splits into spin-1 massless photons and two massless scalars. Whatwe...
-
Low-cost multiband four-port phased array antenna for sub-6 GHz 5G applications with enhanced gain methodology in Radio-over-fiber systems using modulation instability
PublicationPhased array antenna (PAA) technology is essential for applications requiring high gain and wide bandwidth, such as sensors, medical, and 5G. Achieving such a design, however, is a challenging and intricate process that calls for precise calculations and a combination of findings to alter the phase and amplitude of each unit. Furthermore, coupling effects between these PAA structure elements can only be completed with the use of...
-
Fast Multi-Objective Optimization of Narrow-Band Antennas Using RSA Models and Design Space Reduction
PublicationComputationally efficient technique for multi-objective design optimization of narrow-band antennas is presented. In our approach, the corrected low-fidelity antenna model (obtained through coarse-discretization EM simulations) is enhanced using frequency scaling and response correction, sampled, and utilized to obtain a fast response surface approximation (RSA) antenna surrogate. The RSA model is constructed in the reduced design space....
-
Pareto Ranking Bisection Algorithm for Expedited Multi-Objective Optimization of Antenna Structures
PublicationThe purpose of this letter is introduction of a novel methodology for expedited multi-objective design of antenna structures. The key component of the presented approach is fast identification of the initial representation of the Pareto front (i.e., a set of design representing the best possible trade-offs between conflicting objectives) using a Pareto-ranking bisection algorithm. The algorithm finds a discrete set of Pareto-optimal...
-
Crystallization of space: Space-time fractals from fractal arithmetic
PublicationFractals such as the Cantor set can be equipped with intrinsic arithmetic operations (addition, subtraction, multiplication, division) that map the fractal into itself. The arithmetics allows one to define calculus and algebra intrinsic to the fractal in question, and one can formulate classical and quantum physics within the fractal set. In particular, fractals in space-time can be generated by means of homogeneous spaces associated...
-
Emotion recognition and its application in software engineering
PublicationIn this paper a novel application of multimodal emotion recognition algorithms in software engineering is described. Several application scenarios are proposed concerning program usability testing and software process improvement. Also a set of emotional states relevant in that application area is identified. The multimodal emotion recognition method that integrates video and depth channels, physiological signals and input devices...
-
The Influence of Stretch Rod Speed on the Relationship between Preblown Bottle Aesthetic Quality and Final Blown Bottle Thickness Profile in Stretch Blow Molding from Preform Process
PublicationFrom a mechanical point of view, the aesthetic quality of preblown PET bottles and thickness profile of final blown PET bottles manufactured in ISBM process are determined by mechanical and thermal response of blown preforms. From the microscopic point of view the biggest influence on the mechanical and thermal properties of PET bottles have orientation and crystallization processes. From a technological point of view, the aesthetic...
-
Measurement of Impulse Response of Shallow Water Communication Channel by Correlation Method
PublicationPerformances of underwater acoustic communication (UAC) systems are strongly related to specific propagation conditions of the underwater channel; conditions that can additionally change in time due to the movement of the acoustic system transmitter and receiver or to reflection by underwater objects of the transmitted signal. The time-varying impulse response is a comprehensive description of dynamically changing transmission...