Recently, Boyd published a paper entitled ‘‘A proof that the discrete singular convolution (DSC)/ Lagrange-distributed approximating function (LDAF) method is inferior to high order finite differences’’ (J. Comput. Phys. 214 (2006) 538–549 [3]), which will be referred to as ‘‘Proof’’. This Letter analyzes the validity of central claims in ‘‘Proof’’. In its title and abstract, ‘‘Proof’’ refers t...

We consider a queueing network of d single server stations. Each station has a finite capacity waiting buffer, and all customers served at a station are homogeneous in terms of service requirements and routing. The routing is assumed to be deterministic and hence feedforward. A server stops working when the downstream buffer is full. We show that a properly normalized d-dimensional queue length...

We address the problem of efficient verification of multithreaded programs running over Total Store Order (TSO) memory model. It has been shown that even with finite data domain programs, the complexity of control state reachability under TSO is non-primitive recursive. In this paper, we first present a bounded-buffer verification approach wherein a bound on the size of buffers is placed; verif...

While there have been considerable advances in the modelling of 802.11’s MAC layer in recent years, 802.11 with finite buffer space is considered difficult to analyse. In this paper, we study the impact of finite buffers’ effect on the 802.11 performance, in view of the requirements of interactive applications sensitive to delay and packet loss. Using both state-of-the art and simplified queuei...

This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relaxation, which corresponds to the use of store buffers. The proposed approach proceeds by using finite automata to symbolically represent the possible contents of the store buffers. Store, load and commit operations then...

We consider a system of two separate finite-buffer M/M/1 queues served by a single server, where the switching mechanism between the queues is thresholdbased, determined by the queue which is not being served. Applications may be found in data centers, smart traffic-light control and human behavior. Specifically, whenever the server attends queue i (Qi ) and the number of customers in the other...

Stable and accurate interface conditions are derived for the linear advection-diffusion equation. The conditions are functionally independent of the spatial order of accuracy and rely only on the form of the discrete operator. We focus on high-order finite-difference operators that satisfy the summation-by-parts (SBP) property. We prove that stability is a natural consequence of the SBP operato...

This paper combines an analysis of data on security vulnerabilities (published in Bugtraq database) and a focused source-code examination to develop a finite state machine (FSM) model to depict and reason about security vulnerabilities. An in-depth analysis of the vulnerability reports and the corresponding source code of the applications leads to three observations: (i) exploits must pass thro...

This paper presents a programmable multi-mode finite impulse response (FIR) filter implemented as switched capacitor (SC) technique in CMOS 0.18 μm technology. Intended application of the described circuit is in analog base-band filtering in GSM/WCDMA systems. The proposed filter features a regular structure that allows for elimination of some parasitic capacitances, thus significantly improvin...

Delay tolerant network (DTN) challenges on large delay of communication, opportunistic and intermittent connectivity so that data can be transferred over vulnerable network. Most routing protocols in DTN basing on replicating routing work well over infinite buffer assumption but the performance drops when using with finite buffer due to the congestion problem. However, it is still lack of work ...