Wyszukiwarka
Filtry
wszystkich: 2914
wybranych: 1879
-
Katalog
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: call set-up delay
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
Using phase of short-term Fourier transform for evaluation of spectrogram performance
PublikacjaThe concept of spectrogram performance evaluation which exploits information on phase of short-term Fourier transform (STFT) is presented. A spectrograph which is time-frequency analyzing tool, is compared to a filter bank that demultiplexes a signal. Local group delay (LGD) and channelized instantaneous frequency (CIF) is obtained for each filtered component signal. In presented solution the performance is evaluated using so-called...
-
Mathematical analysis of a generalised p53-Mdm2 protein gene expression model
PublikacjaWe propose the generalisation of the p53-Mdm2 protein gene expression model introduced by Monk (2003). We investigate the stability of a unique positive steady state and formulate conditions which guarantee the occurrence of the Hopf bifurcation. We show that oscillatory behaviour can be caused not only by time lag in protein transcription process, but also can be present in the model without time delay. Moreover, we investigate...
-
On proper (1,2)‐dominating sets in graphs
PublikacjaIn 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double 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. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Sensorless Control of Induction Motor Based on Super-Twisting Sliding Mode Observer With Speed Convergence Improvement
PublikacjaThe super twisting sliding-mode observer (ST-SMO) has been proposed to achieve an effective method for alleviating low-order harmonics of measured quantities, issues related to DC drift, and suppression of chattering due to low-frequency sampling. The conventional ST-SMO, on the other hand, suffers from control delay in the convergence trajectory due to the system disturbance, resulting in decreased anti-disturbance capability...
-
Dynamic Route Discovery Using Modified Grasshopper Optimization Algorithm in Wireless Ad-Hoc Visible Light Communication Network
PublikacjaIn recent times, visible light communication is an emerging technology that supports high speed data communication for wireless communication systems. However, the performance of the visible light communication system is impaired by inter symbol interference, the time dispersive nature of the channel, and nonlinear features of the light emitting diode that significantly reduces the bit error rate performance. To address these problems,...
-
Assessment of the Impact of GNSS Processing Strategies on the Long-Term Parameters of 20 Years IWV Time Series
PublikacjaAdvanced processing of collected global navigation satellite systems (GNSS) observations allows for the estimation of zenith tropospheric delay (ZTD), which in turn can be converted to the integrated water vapour (IWV). The proper estimation of GNSS IWV can be affected by the adopted GNSS processing strategy. To verify which of its elements cause deterioration and which improve the estimated GNSS IWV, we conducted eight reprocessings...
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
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...
-
On trees with double domination number equal to total domination number plus one
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. A vertex of a graph is said to dominate itself and all of its neighbors. A double 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. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Analysis of radiometric signal in sedimentating suspension flow in open channel
PublikacjaThe article discusses issues related to the estimation of the sedimentating solid particles average flow velocity in an open channel using radiometric methods. Due to the composition of the compound, which formed water and diatomite, received data have a very weak signal to noise ratio. In the process analysis the known determining of the solid phase transportation time delay the classical cross-correlation function is the most...
-
Implementation of magnitude calculation of complex numbers using improved alpha max plus beta min algorithm
PublikacjaThe paper presents the hardware implementation of the improved alpha max plus beta min algorithm for calculating the magnitude of complex numbers. This version of the algorithm requires the general division which is performed using a noniterative multiplicative division algorithm. We analyze in detail the division algorithm, its error and the impact of finite word-length signal representations on the assumed total computation error....
-
Hybrid no-signaling-quantum correlations
PublikacjaFundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term HNSQ in the...
-
The convex domination subdivision number of a graph
PublikacjaLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
Odpowiedzialność kierownicza w biznesie – zagadnienia procesowe i rodzajowe
PublikacjaCelem podjętych prac było przeprowadzenie rozważań nad zagadnieniami powstawania, ponoszenia, podejmowania oraz pociągania do odpowiedzialności kierowniczej. Kontynuacja badań nad odpowiedzialnością kierowniczą została oparta na sformułowanej wcześniej definicji. Umożliwiło to procesowe ujęcie przedmiotu eksploracji. W procesie tym wyróżniono fazy: przywołania, przyjęcia oraz poniesienia odpowiedzialności kierowniczej. Przeprowadzone...
-
Multiresolution analysis and adaptive estimation on a sphere using stereographic wavelets
PublikacjaWe construct an adaptive estimator of a density function on d dimensional unit sphere Sd (d ≥ 2), using a new type of spherical frames. The frames, or as we call them, stereografic wavelets are obtained by transforming a wavelet system, namely Daubechies, using some stereographic operators. We prove that our estimator achieves an optimal rate of convergence on some Besov type class of functions by adapting to unknown smoothness....
-
Weak forms of shadowing in topological dynamics
PublikacjaWe consider continuous maps of compact metric spaces. It is proved that every pseudotrajectory with sufficiently small errors contains a subsequence of positive density that is point-wise close to a subsequence of an exact trajectory with the same indices. Also, we study homeomor- phisms such that any pseudotrajectory can be shadowed by a finite number of exact orbits. In terms of numerical methods this property (we call it multishadowing)...
-
Multipath routing for quality of service differentiation and network capacity optimization in broadband low-earth orbit systems
PublikacjaThis paper shows the importance of employing multiple different paths for routing in Inter-Satellite Link (ISL) networks in broadband Low-Earth Orbit (LEO) satellite systems. A theoretical analysis is presented and a routing concept is proposed to demonstrate three facts that make multipath routing especially important in broadband LEO networks: (1) differences in the propagation delays have a much greater impact on end-to-end...
-
On the lower smoothing bound in identification of time-varying systems
PublikacjaIn certain applications of nonstationary system identification the model-based decisions can be postponed, i.e. executed with a delay. This allows one to incorporate in the identification process not only the currently available information, but also a number of ''future'' data points. The resulting estimation schemes, which involve smoothing, are not causal. Assuming that the infinite observation history is available, the paper...
-
Usage of concentrated spectrogram for analysis of acoustical signals
PublikacjaA novel precise method of signal analysis in the time-frequency domain is presented. A signal energy distribution is estimated by discard and displacement of energy parts of the classical spectrogram. A channelized instantaneous frequency and a local group delay are used in order to energy replacement. Additionally, newly introduced representations such as: a channelized instantaneous bandwidth and a local group duration are used...
-
A novel method of time-frequency analysis: an essential spectrogram
PublikacjaA novel precise method of time-frequency analysis is presented. In the algorithm, a new energy distribution is estimated by simultaneously discard or displacement of the classical spec- trogram energy. A channelized instantaneous frequency and a local group delay are used in order to replacement in the same manner as formulated by Kodera et al. [1, 2]. Additionally, new representations: a channelized instantaneous bandwidth and...
-
Time-frequency analysis of acoustic signals using concentrated spectrogram
PublikacjaThe paper presents improved method of time-frequency (TF) analysis of discrete-time signals. The method involves signal's local group delay (LGD) and channelized instantaneous frequency (CIF) to purposely redistribute all Short-time Fourier transform (STFT) lines. Additionally, the energy concentration index (ECI) and some histogram-like statistics are used to evaluate readability of estimated TF distributions of the energy. Recorded...
-
Simultaneous handover scheme for IEEE 802.11 WLANs with IEEE 802.21 tiggers
PublikacjaHandover performance in wireless networks is important, especially nowadays, when multimedia services are becoming increasingly available over the wireless devices. However, users expect uncompromised mobility when using the service. Thus, the support of multimedia services is not possible if handover is inefficient. At the same time it is clear that a strict separation between IP Layer and the Link Layer results in built-in sources...
-
Wideband Off-Body Channel Characteristics with Dynamic User
PublikacjaThis paper presents the preliminary results of a dynamic off-body channel characterisation study, based on wideband measurements at 5.8 GHz in an indoor environment. The Channel Impulse Response (CIR) was measured for a scenario with the user approaching and departing from the off-body antenna. A CIR deconvolution procedure was performed jointly in two polarisations, and the received signal power, Cross-Polarisation Discrimination...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 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 nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
Graphs with equal domination and certified domination numbers
PublikacjaA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
The Challenge of Quantification: An Interdisciplinary Reading
PublikacjaThe present work looks at what we call “the multiverse of quantification”, where visible and invisible numbers permeate all aspects and venues of life. We review the contributions of different authors who focus on the roles of quantification in society, with the aim of capturing different and sometimes separate voices. Several scholars, including economists, jurists, philosophers, sociologists, communication and data scientists,...
-
Introduction to the special issue on machine learning in acoustics
PublikacjaWhen we started our Call for Papers for a Special Issue on “Machine Learning in Acoustics” in the Journal of the Acoustical Society of America, our ambition was to invite papers in which machine learning was applied to all acoustics areas. They were listed, but not limited to, as follows: • Music and synthesis analysis • Music sentiment analysis • Music perception • Intelligent music recognition • Musical source separation • Singing...
-
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,...
-
On ''cheap smoothing'' opportunities in identification of time-varying systems
PublikacjaIn certain applications of nonstationary system identification the model-based decisions can be postponed, i.e. executed with a delay. This allows one to incorporate into the identification process not only the currently available information, but also a number of ''future'' data points. The resulting estimation schemes, which involve smoothing, are not causal. Despite the possible performance improvements, the existing smoothing...
-
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...
-
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...
-
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,...
-
Measurement of Coherence Bandwidth in UHF Radio Channels for Narrowband Networks
PublikacjaThis paper presents results of investigation on the coherence bandwidth of narrowband radio channels in 430MHz band. The coherence bandwidth values were estimated froma power delay profile obtained by recording CDMA2000 forward channel signals during real-fieldmeasurements in various environments:mediumcity, flat terrain, and hilly terrain in northern Poland.The results of measurements are compared with characteristic parameters...
-
Estimation of time-frequency complex phase-based speech attributes using narrow band filter banks
PublikacjaIn this paper, we present nonlinear estimators of nonstationary and multicomponent signal attributes (parameters, properties) which are instantaneous frequency, spectral (or group) delay, and chirp-rate (also known as instantaneous frequency slope). We estimate all of these distributions in the time-frequency domain using both finite and infinite impulse response (FIR and IIR) narrow band filers for speech analysis. Then, we present...
-
Probe signal processing for channel estimation in underwater acoustic communication system
PublikacjaUnderwater acoustic communication channels are characterized by a large variety of propagation conditions. Designing a reliable communication system requires knowledge of the transmission parameters of the channel, namely multipath delay spread, Doppler spread, coherence time, and coherence bandwidth. However, the possibilities of its estimation in a realtime underwater communication system are limited, mainly due to the computational...
-
N-point estimators of the Instantaneous Complex Frequency
PublikacjaIn this paper estimators of the instantaneous complex frequency (ICF) are presented and discussed. The differential approach for the estimation of the ICF is used, therefore the estimators are based on maximally flat N-point FIR filters: differential and delay. The investigation of the filter performance includes static characteristics of ICF estimation and the error of the ICF estimation in the discrete frequency domain.W pracy...
-
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...
-
Identification of Shift in Sowing and Harvesting Dates of Rice Crop (L. Oryza sativa) through Remote Sensing Techniques: A Case Study of Larkana District
PublikacjaThe present study aimed to determine the impact of climate variability on rice crops in terms of sowing and harvesting dates and crop period. The identification of sowing and harvesting dates were spotted by mask identification, variations in land surface temperature (LST) on a temporal scale in the respective months, and a field-level social inquiry. The study was conducted during a time period (1994–2017), in which geo-referenced...
-
On minimum cost edge searching
PublikacjaWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
NLP Questions Answering Using DBpedia and YAGO
PublikacjaIn this paper, we present results of employing DBpedia and YAGO as lexical databases for answering questions formulated in the natural language. The proposed solution has been evaluated for answering class 1 and class 2 questions (out of 5 classes defined by Moldovan for TREC conference). Our method uses dependency trees generated from the user query. The trees are browsed for paths leading from the root of the tree to the question...
-
Towards more inclusive qualitative research: the practice of interviewing neurominorities
PublikacjaManagement scholars increasingly focus their efforts on the development of neurodivergent human capital and the promotion of inclusive employment and decent work. However, it may be argued that existing research still suffers from the lack of a comprehensive appreciation of what neurominorities may find difficult in the research process or how they interpret what the researchers are doing. In the light of only fragmented advice...
-
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...
-
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}...
-
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...