Wyszukiwarka
Filtry
wszystkich: 2933
-
Katalog
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: call set-up delay
-
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...
-
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...
-
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...
-
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...
-
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,...
-
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...
-
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,...
-
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...
-
Data on LEGO sets release dates and retail prices combined with aftermarket transaction prices between June 2018 and June 2023.
Dane BadawczeThe dataset contains LEGO bricks sets item count and pricing history for AI-based set pricing prediction.
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
Statistical Method for Analysis of Interactions Between Chosen Protein and Chondroitin Sulfate in an Aqueous Environment
PublikacjaWe present the statistical method to study the interaction between a chosen protein and another molecule (e.g., both being components of lubricin found in synovial fluid) in a water environment. The research is performed on the example of univariate time series of chosen features of the dynamics of mucin, which interact with chondroitin sulfate (4 and 6) in four different saline solutions. Our statistical approach is based on recurrence...
-
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...
-
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...
-
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...
-
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...
-
Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets
PublikacjaThis 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
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...
-
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...
-
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,...
-
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...
-
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...
-
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.
-
THE INFLUENCE OF WSR PARAMETER ON PET BOTTLE THICKNESS PROFILE IN SBM FROM PREFORM PROCESS
PublikacjaFrom 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...
-
Wykorzystanie fazy transformaty STFT do oceny jakości spektrogramu
PublikacjaW 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...
-
Using concentrated spectrogram for analysis of audio acoustic signals
PublikacjaThe 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...
-
Topological, nonreciprocal, and multiresonant slow light beyond the time-bandwidth limit
PublikacjaTopologically 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...
-
Threshold Attendance under Soft-Crash Model: TAG Protocol and Markovian Analysis
PublikacjaA 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...
-
On rotational instability within the nonlinear six-parameter shell theory
PublikacjaWithin 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...
-
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...
-
Dynamic GPU power capping with online performance tracing for energy efficient GPU computing using DEPO tool
PublikacjaGPU 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...
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublikacjaTwo 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...