Search results for: call set-up delay - Bridge of Knowledge

Search

Search results for: call set-up delay

Search results for: call set-up delay

  • Hybrid SONIC: joint feedforward–feedback narrowband interference canceler

    SONIC (self-optimizing narrowband interference canceler) is an acronym of a recently proposed active noise control algorithm with interesting adaptivity and robustness properties. SONIC is a purely feedback controller, capable of rejecting nonstationary sinusoidal disturbances (with time-varying amplitude and/or frequency) in the presence of plant (secondary path) uncertainty. We show that although SONIC can work reliably without...

    Full text available to download

  • Sample Rate Conversion with Fluctuating Resampling Ratio

    Publication

    - Year 2012

    In this paper a sample rate conversion with continuouslychanging resampling ratio has been presented. The proposed implementation is based on variable fractional delay filter implemented using a Farrow structure. It have been demonstrated that using the proposed approach instantaneous resampling ratio can be freely changed. This allows for simulation of audio recored on magnetic tape with nonuniform velocity as well as removal...

  • Broadband communication solutions for maritime ITSs: Wider and faster deployment of new e-navigation services

    Publication

    n its initial part, the paper presents an overview of popular technologies and systems currently developed or employed in maritime communication. These solutions are used to provide both ship-to-ship and ship-to-shore communication for the purpose of supporting specific services, often dedicated to maritime safety and e-navigation. Utility of such communication systems have been thoroughly verified over the years and their strengths...

    Full text to download in external service

  • How Machine Learning Contributes to Solve Acoustical Problems

    Publication
    • M. A. Roch
    • P. Gerstoft
    • B. Kostek
    • Z. Michalopoulou

    - Journal of the Acoustical Society of America - Year 2021

    Machine learning is the process of learning functional relationships between measured signals (called percepts in the artificial intelligence literature) and some output of interest. In some cases, we wish to learn very specific relationships from signals such as identifying the language of a speaker (e.g. Zissman, 1996) which has direct applications such as in call center routing or performing a music information retrieval task...

    Full text available to download

  • Rigorous numerics for critical orbits in the quadratic family

    Publication

    - CHAOS - Year 2020

    We develop algorithms and techniques to compute rigorous bounds for finite pieces of orbits of the critical points, for intervals of parameter values, in the quadratic family of one-dimensional maps fa(x)=a−x2. We illustrate the effectiveness of our approach by constructing a dynamically defined partition P of the parameter interval Ω=[1.4,2] into almost 4 million subintervals, for each of which we compute to high precision the...

    Full text available to download

  • Empirically adjusted and consistent set of EHT valence orbital parametersfor all elements of the periodic table. Modelling Simul. Mater. Sci. Eng. [online]. 2004 vol. 12 [dostęp..] s. 21-32, 3 rys. 3 tab. bibliogr. 35 poz. Dostępny w Internecie stacks.iop.org/MSMSE/12/21.ISSN 0965-0393 Jednorodny skorygowany empirycznie zbiór parametrów EHT dla orbitali walen- cyjnych pierwiastków.

    Publication

    - Year 2003

    Model atomu HFS został zmodyfikowany poprzez przypisanie każdemu z atomówindywidualnego parametru ŕ. Wartości ŕ dobrano w oparciu o pierwszy poten-cjał jonizacji atomu. Parametry EHT wyznaczono w oparciu o tak zmodyfikowa-ny model HFS.

  • Sample Rate Conversion with Fluctuating Resampling Ratio

    Publication

    In this paper a sample rate conversion with continuously changing resampling ratio has been presented. The proposed implementation is based on variable fractional delay filter implemented using a Farrow structure. It have been demonstrated that using the proposed approach instantaneous resampling ratio can be freely changed. This allows for simulation of audio recored on magnetic tape with nonuniform velocity as well as removal...

    Full text available to download

  • Geo-location of the commune of an IP user

    Publication

    - Year 2008

    This paper describes a system of geo-location of an IP user that would enable VoIP users to call 112. Basic requirement is fast (under 50ms) determination of the commune of the subscriber. To obtain as accurate information as possible aggregation of several methods was proposed: using a database of locations of IP ranges created by specialized companies, traceroute using history of user locations to assume his current one.It is...

  • Peer assessment as a method for measuring harmful internet use

    Publication
    • W. W. Koczkodaj
    • A. Kowalczyk
    • M. Mazurek
    • W. Pedrycz
    • G. Redlarski
    • E. Rogalska
    • D. Strzałka
    • A. Szymańska
    • A. Wilinski
    • S. Xue

    - MethodsX - Year 2023

    Harmful Internet use (HIU) describes unintended use of the Internet. It could be both self-harm and harming others. Our research goal is to develop a more accurate method for measuring HIU by this novel peer assessment. As such, it may become, with our call for more research, a paradigm shift supplementing every rating scale or other type of Internet use assessment. In addition to classic statistical analysis, structural equations...

    Full text available to download

  • No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs

    Publication

    In the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. No-wait requirement enforces that the delay between operations is equal to 0. No-idle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)-coloring (IIR(1, 1)-coloring) of a graph with the minimum...

    Full text available to download

  • Mechanizmy bezpieczeństwa transmisji w systemie netBaltic

    artykule zaprezentowano założenia dotyczące zabezpieczania węzłów sieci realizowanej w ramach systemu netBaltic. Ze względu na dużą różnorodność rozważanych mechanizmów komunikacyjnych architektura bezpieczeństwa została podzielona na kilka elementów – infrastrukturę klucza publicznego (PKI), bezpieczeństwo systemowe węzłów, zabezpieczanie komunikacji w modelu samoorganizującej wieloskokowej sieci kratowej, a także sieci niewrażliwej...

    Full text to download in external service

  • A novel method of local chirp-rate estimation of LFM chirp signals in the time-frequency domain

    Publication

    In the paper, novel dynamic representations of a complex signal in the time-frequency domain are introduced. The proposed approach is based on using the gradient of the short-time Fourier transform complex phase. A channelized instantaneous complex frequency (CICF) and a complex local group delay (CLGD) are included in the presented signal representations. An application of the newly-introduced distributions is demonstrated by...

    Full text to download in external service

  • Weak Solutions within the Gradient-Incomplete Strain-Gradient Elasticity

    Publication

    - Lobachevskii Journal of Mathematics - Year 2020

    In this paper we consider existence and uniqueness of the three-dimensional static boundary-value problems in the framework of so-called gradient-incomplete strain-gradient elasticity. We call the strain-gradient elasticity model gradient-incomplete such model where the considered strain energy density depends on displacements and only on some specific partial derivatives of displacements of first- and second-order. Such models...

    Full text available to download

  • Architektura bezpieczeństwa systemu netBaltic

    W artykule zaprezentowano założenia dotyczące zabezpieczania węzłów sieci realizowanej w ramach systemu netBaltic. Ze względu na dużą różnorodność rozważanych mechanizmów komunikacyjnych architektura bezpieczeństwa została podzielona na kilka elementów – infrastrukturę klucza publicznego (PKI), bezpieczeństwo systemowe węzłów, zabezpieczanie komunikacji w modelu samoorganizującej wieloskokowej sieci kratowej, a także sieci niewrażliwej...

  • Aktualność "Sporu o istnienie świata" Romana Ingardena w świetle współczesnych mu stanowisk filozoficznych

    Publication

    Paradoksalnie Ingarden nie jest w stanie wykazać, że świat realny istnieje w pewnym zasadniczym sensie „istnienia”, bo przyjmuje taki sam jak Husserl egologiczny, przeżyciowy model czystej świadomości i sam podążając za Husserlem przyjmuje istnienie dwóch dziedzin przedmiotów indywidualnych: dziedzinę czystej świadomości (rozumianej po husserlowsku jako strumień przeżyć) i dziedzinę świata realnego za punkt wyjścia swoich rozważań....

    Full text available to download

  • Time Synchronization between the eNBs in E-UTRAN under the Asymmetric IP Network

    Publication

    - Year 2019

    In this paper, we present a method for a time synchronization between the two eNodeBs (eNBs) in E-UTRAN (Evolved Universal Terrestrial Radio Access) network. The...

    Full text to download in external service

  • GPU Power Capping for Energy-Performance Trade-Offs in Training of Deep Convolutional Neural Networks for Image Recognition

    Publication

    In the paper we present performance-energy trade-off investigation of training Deep Convolutional Neural Networks for image recognition. Several representative and widely adopted network models, such as Alexnet, VGG-19, Inception V3, Inception V4, Resnet50 and Resnet152 were tested using systems with Nvidia Quadro RTX 6000 as well as Nvidia V100 GPUs. Using GPU power capping we found other than default configurations minimizing...

    Full text available to download

  • A simple way of increasing estimation accuracy of generalized adaptive notch filters

    Generalized adaptive notch filters are used for identification/tracking of quasi-periodically varying dynamic systems and can be considered an extension, to the system case, of classical adaptive notch filters. It is shown that frequency biases, which arisein generalized adaptive notch filtering algorithms, can be significantly reduced by incorporating in the adaptive loop an appropriately chosen decision delay. The resulting performance...

    Full text to download in external service

  • Implementation of failover and load balancing algorithms in SIP PBX High Availability system

    Publication

    - Year 2014

    Goal of the project was to design a High Availability SIP VoIP system that guarantees access to additional services like auto-attendent and automatic call distribution. The realization of the project required system to have load balancing and failover algorithms implemented. From the end users’ point of view the whole system had to figure as a single element. After taking under consideration the known methods of implementations...

  • Chirp-rate estimation of FM signals in the time-frequency domain

    Publication

    Novel dynamic representations of a complex signal in the time-frequency domain including: a channelized instantaneous complex frequency (CICF), a complex local group delay (CLGD) and a channelized instantaneous chirp-rate (CICR) are introduced. The proposed approach is based on the use of the gradient of the short-time Fourier transform complex phase. An interpretation of the newly-introduced distributions especially of the CICR...

    Full text available to download

  • A Nonlinear Model of a Mesh Shell

    Publication

    For a certain class of elastic lattice shells experiencing finite deformations, a continual model using the equations of the so-called six-parameter shell theory has been proposed. Within this model, the kinematics of the shell is described using six kinematically independent scalar degrees of freedom — the field of displacements and turns, as in the case of the Cosserat continuum, which gives reason to call the model under consideration...

    Full text available to download

  • The ONETEP linear-scaling density functional theory program

    Publication
    • J. C. A. Prentice
    • J. Aarons
    • J. C. Womack
    • A. E. A. Allen
    • L. Andrinopoulos
    • L. Anton
    • R. A. Bell
    • A. Bhandari
    • G. A. Bramley
    • R. J. Charlton... and 26 others

    - JOURNAL OF CHEMICAL PHYSICS - Year 2020

    We present an overview of the ONETEP program for linear-scaling density functional theory (DFT) calculations with large basis set (planewave) accuracy on parallel computers. The DFT energy is computed from the density matrix, which is constructed from spatially localized orbitals we call Non-orthogonal Generalized Wannier Functions (NGWFs), expressed in terms of periodic sinc (psinc) functions. During the calculation, both the...

    Full text available to download

  • Soft skills among academics: Five theoretically informed lessons for current times

    Publication

    RESEARCH OBJECTIVE: The aim of this article is to provide a comprehensive examination of the role of soft skills among academics in the context of the evolving higher-education landscape. THE RESEARCH PROBLEM AND METHODS: We use a scoping review of existing literature to discuss the importance of soft skills in academia. Through critical analysis and synthesis, we identify patterns and gaps in current knowledge and develop five...

    Full text available to download

  • On the ratio between 2-domination and total outer-independent domination numbers of trees

    A 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...

    Full text to download in external service

  • Using phase of short-term Fourier transform for evaluation of spectrogram performance

    The 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...

    Full text available to download

  • Mathematical analysis of a generalised p53-Mdm2 protein gene expression model

    Publication

    - APPLIED MATHEMATICS AND COMPUTATION - Year 2018

    We 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...

    Full text to download in external service

  • On proper (1,2)‐dominating sets in graphs

    Publication

    In 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...

    Full text to download in external service

  • On trees with double domination number equal to 2-outer-independent domination number plus one

    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 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...

    Full text to download in external service

  • Unicyclic graphs with equal total and total outer-connected domination numbers

    Publication

    - ARS COMBINATORIA - Year 2015

    Let 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...

    Full text to download in external service

  • Dynamic Route Discovery Using Modified Grasshopper Optimization Algorithm in Wireless Ad-Hoc Visible Light Communication Network

    Publication
    • S. Vadivel
    • S. Konda
    • K. R. Balmuri
    • A. Stateczny
    • B. D. Parameshachari

    - Electronics - Year 2021

    In 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,...

    Full text available to download

  • Assessment of the Impact of GNSS Processing Strategies on the Long-Term Parameters of 20 Years IWV Time Series

    Publication

    - Remote Sensing - Year 2018

    Advanced 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...

    Full text available to download

  • Marek Kowalewski dr

    People

  • Odpowiedzialność kierownicza w biznesie – zagadnienia procesowe i rodzajowe

    Celem 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...

    Full text available to download

  • Total Domination Versus Domination in Cubic Graphs

    Publication

    A 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...

    Full text available to download

  • Global defensive sets in graphs

    In 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...

    Full text available to download

  • On trees with double domination number equal to total domination number plus one

    Publication

    A 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,...

    Full text to download in external service

  • Implementation of magnitude calculation of complex numbers using improved alpha max plus beta min algorithm

    The 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....

    Full text available to download

  • Analysis of radiometric signal in sedimentating suspension flow in open channel

    Publication

    - Year 2014

    The 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...

    Full text to download in external service

  • Hybrid no-signaling-quantum correlations

    Publication

    - NEW JOURNAL OF PHYSICS - Year 2022

    Fundamental 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...

    Full text available to download

  • The convex domination subdivision number of a graph

    Publication

    Let 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...

    Full text available to download

  • Multiresolution analysis and adaptive estimation on a sphere using stereographic wavelets

    We 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....

    Full text available to download

  • Weak forms of shadowing in topological dynamics

    Publication

    We 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)...

    Full text available to download

  • Time-frequency analysis of acoustic signals using concentrated spectrogram

    Publication

    The 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...

  • Multipath routing for quality of service differentiation and network capacity optimization in broadband low-earth orbit systems

    Publication

    - Year 2009

    This 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...

    Full text to download in external service

  • Simultaneous handover scheme for IEEE 802.11 WLANs with IEEE 802.21 tiggers

    Handover 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...

    Full text to download in external service

  • On the lower smoothing bound in identification of time-varying systems

    Publication

    - AUTOMATICA - Year 2008

    In 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...

    Full text available to download

  • Usage of concentrated spectrogram for analysis of acoustical signals

    Publication

    A 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...

    Full text to download in external service

  • A novel method of time-frequency analysis: an essential spectrogram

    Publication

    A 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...

    Full text available to download

  • Wideband Off-Body Channel Characteristics with Dynamic User

    Publication

    - Year 2019

    This 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...

  • A lower bound on the total outer-independent domination number of a tree

    Publication

    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 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,...

    Full text to download in external service