Abstract: This paper considers the development of a two-point
predictor-corrector block method for solving delay differential
equations. The formulae are represented in divided difference form
and the algorithm is implemented in variable stepsize variable order
technique. The block method produces two new values at a single
integration step. Numerical results are compared with existing
methods and it is evident that the block method performs very well.
Stability regions of the block method are also investigated.
Abstract: In cryptography, confusion and diffusion are very
important to get confidentiality and privacy of message in block
ciphers and stream ciphers. There are two types of network to provide
confusion and diffusion properties of message in block ciphers. They
are Substitution- Permutation network (S-P network), and Feistel
network. NLFS (Non-Linear feedback stream cipher) is a fast and
secure stream cipher for software application. NLFS have two modes
basic mode that is synchronous mode and self synchronous mode.
Real random numbers are non-deterministic. R-box (random box)
based on the dynamic properties and it performs the stochastic
transformation of data that can be used effectively meet the
challenges of information is protected from international destructive
impacts. In this paper, a new implementation of stochastic
transformation will be proposed.
Abstract: IEEE has recently incorporated CCMP protocol to provide robust security to IEEE 802.11 wireless LANs. It is found that CCMP has been designed with a weak nonce construction and transmission mechanism, which leads to the exposure of initial counter value. This weak construction of nonce renders the protocol vulnerable to attacks by intruders. This paper presents how the initial counter can be pre-computed by the intruder. This vulnerability of counter block value leads to pre-computation attack on the counter mode encryption of CCMP. The failure of the counter mode will result in the collapse of the whole security mechanism of 802.11 WLAN.
Abstract: In this paper, the local grid refinement is focused by
using a nested grid technique. The Cartesian grid numerical method is
developed for simulating unsteady, viscous, incompressible flows
with complex immersed boundaries. A finite volume method is used in
conjunction with a two-step fractional-step procedure. The key aspects
that need to be considered in developing such a nested grid solver are
imposition of interface conditions on the inter-block and accurate
discretization of the governing equation in cells that are with the
inter-block as a control surface. A new interpolation procedure is
presented which allows systematic development of a spatial
discretization scheme that preserves the spatial accuracy of the
underlying solver. The present nested grid method has been tested by
two numerical examples to examine its performance in the two
dimensional problems. The numerical examples include flow past a
circular cylinder symmetrically installed in a Channel and flow past
two circular cylinders with different diameters. From the numerical
experiments, the ability of the solver to simulate flows with
complicated immersed boundaries is demonstrated and the nested grid
approach can efficiently speed up the numerical solutions.
Abstract: The paper shows that in the analysis of a queuing system with fixed-size batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomials of the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to note is the proportion of the overflow (or blocking) probability resident in the transient component, which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significance of transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads.
Abstract: The Block Sorting problem is to sort a given
permutation moving blocks. A block is defined as a substring
of the given permutation, which is also a substring of the
identity permutation. Block Sorting has been proved to be
NP-Hard. Until now two different 2-Approximation algorithms
have been presented for block sorting. These are the best known
algorithms for Block Sorting till date. In this work we present
a different characterization of Block Sorting in terms of a
transposition cycle graph. Then we suggest a heuristic,
which we show to exhibit a 2-approximation performance
guarantee for most permutations.
Abstract: In this paper we present two novel 1-bit full adder
cells in dynamic logic style. NP-CMOS (Zipper) and Multi-Output
structures are used to design the adder blocks. Characteristic of
dynamic logic leads to higher speeds than the other standard static
full adder cells. Using HSpice and 0.18┬Ám CMOS technology
exhibits a significant decrease in the cell delay which can result in a
considerable reduction in the power-delay product (PDP). The PDP
of Multi-Output design at 1.8v power supply is around 0.15 femto
joule that is 5% lower than conventional dynamic full adder cell and
at least 21% lower than other static full adders.
Abstract: In this work, we derive two numerical schemes for
solving a class of nonlinear partial differential equations. The first
method is of second order accuracy in space and time directions, the
scheme is unconditionally stable using Von Neumann stability
analysis, the scheme produced a nonlinear block system where
Newton-s method is used to solve it. The second method is of fourth
order accuracy in space and second order in time. The method is
unconditionally stable and Newton's method is used to solve the
nonlinear block system obtained. The exact single soliton solution
and the conserved quantities are used to assess the accuracy and to
show the robustness of the schemes. The interaction of two solitary
waves for different parameters are also discussed.
Abstract: A time-domain numerical model within the
framework of transmission line modeling (TLM) is developed to
simulate electromagnetic pulse propagation inside multiple
microcavities forming photonic crystal (PhC) structures. The model
developed is quite general and is capable of simulating complex
electromagnetic problems accurately. The field quantities can be
mapped onto a passive electrical circuit equivalent what ensures that
TLM is provably stable and conservative at a local level.
Furthermore, the circuit representation allows a high level of
hybridization of TLM with other techniques and lumped circuit
models of components and devices. A photonic crystal structure
formed by rods (or blocks) of high-permittivity dieletric material
embedded in a low-dielectric background medium is simulated as an
example. The model developed gives vital spatio-temporal
information about the signal, and also gives spectral information over
a wide frequency range in a single run. The model has wide
applications in microwave communication systems, optical
waveguides and electromagnetic materials simulations.
Abstract: The H.264/AVC standard is a highly efficient video
codec providing high-quality videos at low bit-rates. As employing
advanced techniques, the computational complexity has been
increased. The complexity brings about the major problem in the
implementation of a real-time encoder and decoder. Parallelism is the
one of approaches which can be implemented by multi-core system.
We analyze macroblock-level parallelism which ensures the same bit
rate with high concurrency of processors. In order to reduce the
encoding time, dynamic data partition based on macroblock region is
proposed. The data partition has the advantages in load balancing and
data communication overhead. Using the data partition, the encoder
obtains more than 3.59x speed-up on a four-processor system. This
work can be applied to other multimedia processing applications.
Abstract: The H.264/AVC standard uses an intra prediction, 9
directional modes for 4x4 luma blocks and 8x8 luma blocks, 4
directional modes for 16x16 macroblock and 8x8 chroma blocks,
respectively. It means that, for a macroblock, it has to perform 736
different RDO calculation before a best RDO modes is determined.
With this Multiple intra-mode prediction, intra coding of H.264/AVC
offers a considerably higher improvement in coding efficiency
compared to other compression standards, but computational
complexity is increased significantly. This paper presents a fast intra
prediction algorithm for H.264/AVC intra prediction based a
characteristic of homogeneity information. In this study, the gradient
prediction method used to predict the homogeneous area and the
quadratic prediction function used to predict the nonhomogeneous
area. Based on the correlation between the homogeneity and block
size, the smaller block is predicted by gradient prediction and
quadratic prediction, so the bigger block is predicted by gradient
prediction. Experimental results are presented to show that the
proposed method reduce the complexity by up to 76.07%
maintaining the similar PSNR quality with about 1.94%bit rate
increase in average.
Abstract: In this paper, we propose a reversible watermarking
scheme based on histogram shifting (HS) to embed watermark bits
into the H.264/AVC standard videos by modifying the last nonzero
level in the context adaptive variable length coding (CAVLC) domain.
The proposed method collects all of the last nonzero coefficients (or
called last level coefficient) of 4×4 sub-macro blocks in a macro
block and utilizes predictions for the current last level from the
neighbor block-s last levels to embed watermark bits. The feature of
the proposed method is low computational and has the ability of
reversible recovery. The experimental results have demonstrated that
our proposed scheme has acceptable degradation on video quality and
output bit-rate for most test videos.
Abstract: In order to derive important parameters concerning
mobile subscriber MS with ongoing calls in Low Earth Orbit Mobile
Satellite Systems LEO MSSs, a positioning system had to be
integrated into MSS in order to localize mobile subscribers MSs and
track them during the connection. Such integration is regarded as a
complex implementation. We propose in this paper a novel method
based on advantages of mobility model of Low Earth Orbit Mobile
Satellite System LEO MSS which allows the evaluation of instant of
subsequent handover of a MS even if its location is unknown. This
method is utilized to propose a Dynamic Channel Reservation DCRlike
scheme based on the DCR scheme previously proposed in
literature. Results presented show that DCR-like technique gives
different QoS performance than DCR. Indeed, an improve in
handover blocking probability and an increase in new call blocking
probability are observed for the DCR-like technique.