Period Jitter Period jitter (JPER) is the time difference between a measured cycle period and the ideal cycle period. Due to its random nature, this jitter can be measured peak-to-peak or by Root of Mean Square (RMS). We begin by defining the clock rising-edge crossing point at the threshold VTH as TPER(n), where n is the time domain index, as shown in Figure 1. Mathematically, we can describe ...

Up to now we have discussed various approaches to discrete-time filter design that are all based on approximating the response of ideal lowpass, highpass, or bandpass filters, etc., with the designs involving various deterministic satisfaction of constraints such as passband and stopband ripple, and passband and stopband edge frequencies. In many actual situations we seek to design a filter tha...

the edge szeged index is a new molecular structure descriptor equal to the sum of products mu(e)mv(e) over all edges e = uv of the molecular graph g, where mu(e) is the number of edges which its distance to vertex u is smaller than the distance to vertex v, and nv(e) is defined analogously. in this paper, the edge szeged index of one-pentagonal carbon nanocone cnc5[n] is computed for the first ...

An ideal triangulation T of a hyperbolic 3-manifold M with one cusp is non-peripheral if no edge of T is homotopic to a curve in the boundary torus of M . For such a triangulation, the gluing and completeness equations can be solved to recover the hyperbolic structure of M . A planar projection of a knot gives four ideal cell decompositions of its complement (minus 2 balls), two of which are id...

-d) u {00} c= CP = dH, and each a ePSL2(0d) determines an edge which is the geodesic in H having endpoints a//? and y/d. The tesselations 5^ and ^ are by regular ideal octahedra and tetrahedra, respectively, and are classical objects; for example, &\ is constructed in [2]. The tesselations «^, by ideal cuboctahedra, and ST-i, by ideal triangular prisms, are implicit in Chapter 6 of [9]; ^ is a ...

let $r$ be a commutative ring with identity and $mathbb{a}(r)$ be the set   of ideals of $r$ with non-zero annihilators. in this paper, we first introduce and investigate the principal ideal subgraph of the annihilating-ideal graph of $r$, denoted by $mathbb{ag}_p(r)$. it is a (undirected) graph with vertices $mathbb{a}_p(r)=mathbb{a}(r)cap mathbb{p}(r)setminus {(0)}$, where   $mathbb{p}(r)$ is...

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...

As an innovative strategy, edge computing has been considered a viable option to address the limitations of cloud in supporting Internet-of-Things applications. However, due instability network and increase attack surfaces, security edge-assisted IoT needs be better guaranteed. In this paper, we propose intelligent intrusion detection mechanism, FedACNN, which completes task by assisting deep l...

Let [Formula: see text] be a weighted oriented graph and its edge ideal. We provide one method to find all the minimal generators of text], where is maximal strong vertex cover intersections irreducible ideals associated covers contained in text]. If an induced digraph under certain condition on we show that for some implies necessary sufficient equality ordinary symbolic powers ideal union two...