China 
Africa 
Explore chapters and articles related to this topic
Achieving Scalability in the 5G-Enabled Internet of Things
Published in Yulei Wu, Haojun Huang, Cheng-Xiang Wang, Yi Pan, 5G-Enabled Internet of Things, 2019
Fuchun Joseph Lin, David de la Bastida
Delay [21], D, is defined as the latency for bits of data to be transmitted over the network end-to-end and can be denoted as D = bits/ratio, where delay is calculated by the number of bits transmitted over a transmission ratio (i.e., bits/time). Delay is usually measured in milliseconds. It plays a fundamental role in both critical and massive M2M applications. For example, in real-time tracking systems it is important to reflect the location of a specific target with as little delay as possible.
Introduction to LabVIEW
Published in Rick Bitter, Taqi Mohiuddin, Matt Nawrocki, LabVIEW™ Advanced Programming Techniques, 2017
Rick Bitter, Taqi Mohiuddin, Matt Nawrocki
System dates and times are dependent on the system you run on. Most computers measure the date in the number of seconds that have elapsed since a certain time, for example January 1, 1974, at 12:00am. This number is stored in a 32-bit number and it will be an extremely long time from now before this date rolls over (consider that there are approximately pi * 10^7 seconds in a year). The concern with system dates and times is because of the precision you need. As just mentioned, it is stored in units of seconds. If you need millisecond accuracy, system date and time are not going to be sufficient. Some systems will store hundredths or even tenths of a second, but millisecond accuracy is usually not possible with system times.
Addressing in SIP
Published in Radhika Ranjan Roy, Handbook on Session Initiation Protocol, 2018
The above example shows that service has several associated URI parameters that control the content and delivery of the announcement. All these parameters are described below: Play: Specifies the resource or announcement sequence to be played.Repeat: Specifies how many times the media server should repeat the announcement or sequence named by the play= parameter. The value forever means the repeat should be effectively unbounded. In this case, it is recommended the media server implements some local policy, such as limiting what forever means, to ensure errant clients do not create a denial of service attack.Delay: Specifies a delay interval between announcement repetitions. The delay is measured in milliseconds.Duration: Specifies the maximum duration of the announcement. The media server will discontinue the announcement and end the call if the maximum duration has been reached. The duration is measured in milliseconds.Locale: Specifies the language and optionally country variant of the announcement sequence named in the play= parameter. RFC 4646 specifies the locale tag. The locale tag is usually a two- or three-letter code per ISO 639-1. The country variant is also often a two-letter code per ISO 3166-1. These elements are concatenated with a single under bar (%x5F) character, such as enffCA. If only the language is specified, such as locale=en, the choice of country variant is an implementation matter. Implementations should provide the best possible match between the requested locale and the available languages in the event the media server cannot honor the locale request precisely. For example, if the request has locale=caffFR, but the media server only has frffFR available, the media server should use the frffFR variant. Implementations should provide a default locale to use if no language variants are available.Param[n]: Provides a mechanism for passing values that are to be substituted into an announcement sequence. Up to nine parameters (param1= through param9=) may be specified. The mechanics of announcement sequences are beyond the scope of this document.Extension: Provides a mechanism for extending the parameter set. If the media server receives an extension it does not understand, it must silently ignore the extension parameter and value.
Secure and transparent pharmaceutical supply chain using permissioned blockchain network
Published in International Journal of Logistics Research and Applications, 2022
Erukala Suresh Babu, Ilaiah Kavati, Soumya Ranjan Nayak, Uttam Ghosh, Waleed Al Numay
Another performance metric is transaction latency. The reading latency is the query transaction's time to read and respond to the query back to the application. Simultaneously, the transaction latency is the amount of time the network takes to perform the transaction update across the network. Precisely, the delay is measured from all the peers’ process time of the network. The delay is measured in milliseconds (ms). The Table 5 and Figure 8 shows that transaction latency with varying block sizes. It is observed that, with an increase of block size for all arrival rates, the transaction latency is decreased quickly until the block size of 32 transactions per block. It is observed that from the Figure 8, the Maximum latency for writing and reading transactions is 83.46ms and 63.15ms with an arrival rate of 80 and 70 tps, respectively, for a block size of 32. Simultaneously, the Maximum latency for writing and reading transactions is 11.66ms and 1.15ms with an arrival rate of 70 tps with a block size of 512 tps.
Numerical study of strongly-nonlinear regimes of steady premixed flame propagation. The effect of thermal gas expansion and finite-front-thickness effects
Published in Combustion Theory and Modelling, 2018
Kirill A. Kazakov, Oleg G. Kharlanov
The next step is a partial integration of the equations that govern the propagation of the front separating two constant-density fluids, with the aim of reducing them to equations for the flow variables restricted to the front. When successful, this reduction yields the flame front dynamics formulated in inner terms, that is, as a system of equations for functions defined on the front. Implementation of this programme is relatively easy under the assumption of weak flow nonlinearity. Namely, a single equation for the front position has been obtained that describes the linear evolution of perturbations of planar flames [4,9,10]. However, a problem with the weak-nonlinearity assumption is that it is justified only within an initial time interval of order λc/Uf, where λc is the short wavelength cutoff of unstable perturbations and Uf is the planar-front speed relative to the fresh gas. In practice, this time is typically measured in milliseconds. At later times, the flame can remain weakly curved only if the gas expansion coefficient θ (the fresh-to-burnt gas density ratio) is close to unity, that is, when the density contrast across the front is relatively small [11,12]. At the same time, for most flames of interest, θ is much greater than unity (it is typically from 5 to 8 for flames in strongly diluted mixtures such as hydrocarbon–air, while for near-stoichiometric methane–oxygen mixtures, θ ≈ 10).