Second-order accurate nonoscillatory schemes for scalar conservation laws

Explicit finite difference schemes for the computation of weak solutions of nonlinear scalar conservation laws is presented and analyzed. These schemes are uniformly second-order accurate and nonoscillatory in the sense that the number of extrema of the discrete solution is not increasing in time

VHDL design and simulation for embedded zerotree wavelet quantisation

This thesis discusses a highly effective still image compression algorithm – The Embedded Zerotree Wavelets coding technique, as it is called. This technique is simple but achieves a remarkable result. The image is wavelet-transformed, symbolically coded and successive quantised, therefore the compression and transmission/storage saving can be achieved by utilising the structure of zerotree. The algorithm was first proposed by Jerome M. Shapiro in 1993, however to minimise the memory usage and speeding up the EZW processor, a Depth First Search method is used to transverse across the image rather than Breadth First Search method as initially discussed in Shapiro\u27s paper (Shapiro, 1993). The project\u27s primary objective is to simulate the EZW algorithm from a basic building block of 8 by 8 matrix to a well-known reference image such Lenna of 256 by 256 matrix. Hence the algorithm performance can be measured, for instance its peak signal to noise ratio can be calculated. The software environment used for the simulation is a Very-High Speed Integrated Circuits - Hardware Description Language such Peak VHDL, PC based version. This will lead to the second phase of the project. The secondary objective is to test the algorithm at a hardware level, such FPGA for a rapid prototype implementation only if the project time permits

A nonoscillatory, characteristically convected, finite volume scheme for multidimensional convection problems

A new, nonoscillatory upwind scheme is developed for the multidimensional convection equation. The scheme consists of an upwind, nonoscillatory interpolation of data to the surfaces of an intermediate finite volume; a characteristic convection of surface data to a midpoint time level; and a conservative time integration based on the midpoint rule. This procedure results in a convection scheme capable of resolving discontinuities neither aligned with, nor convected along, grid lines

Comparing Java Programs: Syntactic and Contextual Semantic Differences

This thesis describes the foundation for developing a tool that compares Java programs, or different versions of a program. The tool captures syntactic differences and contextual semantic differences as well. Syntactic differences are “ordinary” changes in the code. This tool works much in the same way as the Unix tool diff, but it is much smarter than diff. This is because it exploits the fact that programs are built differently than ordinary text. The tool diff’s purpose is to compare text, and it will therefore give imprecise or too verbose results. The tool described in this thesis can identify contextual semantic differences because it knows the contexts of methods, meaning that it knows whether methods are directly declared in the class, inherited from implemented interfaces or if methods override the class’ parent’s method. The approach in this thesis for comparing Java programs is to transform the programs into abstract syntax trees. The transformation from source code to abstract syntax trees are done with the help Strafunski. Strafunski is a software bundle that supports generic programming. The implementation of the tool is done in Haskell. Haskell is a functional programming language. The work of comparing abstract syntax trees can be broken down into the problem of finding the largest common subtree of two abstract syntax trees and further more, the problem of finding the longest common subsequence of two sequences. This thesis describes and presents new algorithms for doing this and it also describe working Haskell code of the implementation of the tool

Accurate monotone cubic interpolation

Monotone piecewise cubic interpolants are simple and effective. They are generally third-order accurate, except near strict local extrema where accuracy degenerates to second-order due to the monotonicity constraint. Algorithms for piecewise cubic interpolants, which preserve monotonicity as well as uniform third and fourth-order accuracy are presented. The gain of accuracy is obtained by relaxing the monotonicity constraint in a geometric framework in which the median function plays a crucial role

Secrecy outage probability of a NOMA scheme and impact imperfect channel state information in underlay cooperative cognitive networks

Security performance and the impact of imperfect channel state information (CSI) in underlay cooperative cognitive networks (UCCN) is investigated in this paper. In the proposed scheme, relay R uses non-orthogonal multiple access (NOMA) technology to transfer messages e1, e2 from the source node S to User 1 (U-1) and User 2 (U-2), respectively. An eavesdropper (E) is also proposed to wiretap the messages of U-1 and U-2. The transmission's security performance in the proposed system was analyzed and performed over Rayleigh fading channels. Through numerical analysis, the results showed that the proposed system's secrecy performance became more efficient when the eavesdropper node E was farther away from the source node S and the intermediate cooperative relay R. The secrecy performance of U-1 was also compared to the secrecy performance of U-2. Finally, the simulation results matched the Monte Carlo simulations well.Web of Science203art. no. 89