Abstract: This paper presents the hardware design of a unified
architecture to compute the 4x4, 8x8 and 16x16 efficient twodimensional
(2-D) transform for the HEVC standard. This
architecture is based on fast integer transform algorithms. It is
designed only with adders and shifts in order to reduce the hardware
cost significantly. The goal is to ensure the maximum circuit reuse
during the computing while saving 40% for the number of operations.
The architecture is developed using FIFOs to compute the second
dimension. The proposed hardware was implemented in VHDL. The
VHDL RTL code works at 240 MHZ in an Altera Stratix III FPGA.
The number of cycles in this architecture varies from 33 in 4-point-
2D-DCT to 172 when the 16-point-2D-DCT is computed. Results
show frequency improvements reaching 96% when compared to an
architecture described as the direct transcription of the algorithm.
Abstract: An adaptive fuzzy PID controller with gain scheduling is proposed in this paper. The structure of the proposed gain scheduled fuzzy PID (GS_FPID) controller consists of both fuzzy PI-like controller and fuzzy PD-like controller. Both of fuzzy PI-like and PD-like controllers are weighted through adaptive gain scheduling, which are also determined by fuzzy logic inference. A modified genetic algorithm called accumulated genetic algorithm is designed to learn the parameters of fuzzy inference system. In order to learn the number of fuzzy rules required for the TSK model, the fuzzy rules are learned in an accumulated way. In other words, the parameters learned in the previous rules are accumulated and updated along with the parameters in the current rule. It will be shown that the proposed GS_FPID controllers learned by the accumulated GA perform well for not only the regular linear systems but also the higher order and time-delayed systems.
Abstract: In this paper, an intelligent algorithm for optimal
document archiving is presented. It is kown that electronic archives
are very important for information system management. Minimizing
the size of the stored data in electronic archive is a main issue to
reduce the physical storage area. Here, the effect of different types of
Arabic fonts on electronic archives size is discussed. Simulation
results show that PDF is the best file format for storage of the Arabic
documents in electronic archive. Furthermore, fast information
detection in a given PDF file is introduced. Such approach uses fast
neural networks (FNNs) implemented in the frequency domain. The
operation of these networks relies on performing cross correlation in
the frequency domain rather than spatial one. It is proved
mathematically and practically that the number of computation steps
required for the presented FNNs is less than that needed by
conventional neural networks (CNNs). Simulation results using
MATLAB confirm the theoretical computations.
Abstract: Reachability graph (RG) generation suffers from the
problem of exponential space and time complexity. To alleviate the
more critical problem of time complexity, this paper presents the new
approach for RG generation for the Petri net (PN) models of parallel
processes. Independent RGs for each parallel process in the PN
structure are generated in parallel and cross-product of these RGs
turns into the exhaustive state space from which the RG of given
parallel system is determined. The complexity analysis of the
presented algorithm illuminates significant decrease in the time
complexity cost of RG generation. The proposed technique is
applicable to parallel programs having multiple threads with the
synchronization problem.
Abstract: In this paper an efficient implementation of Ripemd-
160 hash function is presented. Hash functions are a special family
of cryptographic algorithms, which is used in technological
applications with requirements for security, confidentiality and
validity. Applications like PKI, IPSec, DSA, MAC-s incorporate
hash functions and are used widely today. The Ripemd-160 is
emanated from the necessity for existence of very strong algorithms
in cryptanalysis. The proposed hardware implementation can be
synthesized easily for a variety of FPGA and ASIC technologies.
Simulation results, using commercial tools, verified the efficiency of
the implementation in terms of performance and throughput. Special
care has been taken so that the proposed implementation doesn-t
introduce extra design complexity; while in parallel functionality was
kept to the required levels.
Abstract: An exact algorithm for a n-link manipulator movement amidst arbitrary unknown static obstacles is presented.
The algorithm guarantees the reaching of a target configuration of the manipulator in a finite number of steps. The algorithm is
reduced to a finite number of calls of a subroutine for planning a trajectory in the presence of known forbidden states. The polynomial approximation algorithm which is used as the subroutine is presented. The results of the exact algorithm
implementation for the control of a seven link (7 degrees of
freedom, 7DOF) manipulator are given.
Abstract: High level synthesis (HLS) is a process which
generates register-transfer level design for digital systems from
behavioral description. There are many HLS algorithms and
commercial tools. However, most of these algorithms consider a
behavioral description for the system when a single token is
presented to the system. This approach does not exploit extra
hardware efficiently, especially in the design of digital filters where
common operations may exist between successive tokens. In this
paper, we modify the behavioral description to process multiple
tokens in parallel. However, this approach is unlike the full
processing that requires full hardware replication. It exploits the
presence of common operations between successive tokens. The
performance of the proposed approach is better than sequential
processing and approaches that of full parallel processing as the
hardware resources are increased.
Abstract: With the popularity of the multi-core and many-core architectures there is a great requirement for software frameworks which can support parallel programming methodologies. In this paper we introduce an Eclipse toolkit, JConqurr which is easy to use and provides robust support for flexible parallel progrmaming. JConqurr is a multi-core and many-core programming toolkit for Java which is capable of providing support for common parallel programming patterns which include task, data, divide and conquer and pipeline parallelism. The toolkit uses an annotation and a directive mechanism to convert the sequential code into parallel code. In addition to that we have proposed a novel mechanism to achieve the parallelism using graphical processing units (GPU). Experiments with common parallelizable algorithms have shown that our toolkit can be easily and efficiently used to convert sequential code to parallel code and significant performance gains can be achieved.
Abstract: This paper proposes a novel hybrid algorithm for feature selection based on a binary ant colony and SVM. The final subset selection is attained through the elimination of the features that produce noise or, are strictly correlated with other already selected features. Our algorithm can improve classification accuracy with a small and appropriate feature subset. Proposed algorithm is easily implemented and because of use of a simple filter in that, its computational complexity is very low. The performance of the proposed algorithm is evaluated through a real Rotary Cement kiln dataset. The results show that our algorithm outperforms existing algorithms.
Abstract: The problem of lot sizing, sequencing and scheduling
multiple products in flow line production systems has been studied
by several authors. Almost all of the researches in this area assumed
that setup times and costs are sequence –independent even though
sequence dependent setups are common in practice. In this paper we
present a new mixed integer non linear program (MINLP) and a
heuristic method to solve the problem in sequence dependent case.
Furthermore, a genetic algorithm has been developed which applies
this constructive heuristic to generate initial population. These two
proposed solution methods are compared on randomly generated
problems. Computational results show a clear superiority of our
proposed GA for majority of the test problems.
Abstract: In this paper, we propose a routing scheme that guarantees
the residual lifetime of wireless sensor networks where each
sensor node operates with a limited budget of battery energy. The
scheme maximizes the communications QoS while sustaining the
residual battery lifetime of the network for a specified duration.
Communication paths of wireless nodes are translated into a directed
acyclic graph(DAG) and the maximum-flow algorithm is applied to
the graph. The found maximum flow are assigned to sender nodes, so
as to maximize their communication QoS. Based on assigned flows,
the scheme determines the routing path and the transmission rate of
data packet so that any sensor node on the path would not exhaust
its battery energy before a specified duration.
Abstract: In Geographic Information System, one of the sources
of obtaining needed geographic data is digitizing analog maps and
evaluation of aerial and satellite photos. In this study, a method will
be discussed which can be used to extract vectorial features and
creating vectorized drawing files for aerial photos. At the same time
a software developed for these purpose. Converting from raster to
vector is also known as vectorization and it is the most important step
when creating vectorized drawing files. In the developed algorithm,
first of all preprocessing on the aerial photo is done. These are;
converting to grayscale if necessary, reducing noise, applying some
filters and determining the edge of the objects etc. After these steps,
every pixel which constitutes the photo are followed from upper left
to right bottom by examining its neighborhood relationship and one
pixel wide lines or polylines obtained. The obtained lines have to be
erased for preventing confusion while continuing vectorization
because if not erased they can be perceived as new line, but if erased
it can cause discontinuity in vector drawing so the image converted
from 2 bit to 8 bit and the detected pixels are expressed as a different
bit. In conclusion, the aerial photo can be converted to vector form
which includes lines and polylines and can be opened in any CAD
application.
Abstract: Fault-proneness of a software module is the
probability that the module contains faults. A correlation exists
between the fault-proneness of the software and the measurable
attributes of the code (i.e. the static metrics) and of the testing (i.e.
the dynamic metrics). Early detection of fault-prone software
components enables verification experts to concentrate their time and
resources on the problem areas of the software system under
development. This paper introduces Genetic Algorithm based
software fault prediction models with Object-Oriented metrics. The
contribution of this paper is that it has used Metric values of JEdit
open source software for generation of the rules for the classification
of software modules in the categories of Faulty and non faulty
modules and thereafter empirically validation is performed. The
results shows that Genetic algorithm approach can be used for
finding the fault proneness in object oriented software components.
Abstract: In this paper, we demonstrate the adaptive
least-mean-square (LMS) filter modeling using SystemC. SystemC is
a modeling language that allows designer to model both hardware and
software component and makes it possible to design from high level
system of abstraction to low level system of abstraction. We produced
five adaptive least-mean-square filter models that are classed as five
abstraction levels using SystemC proceeding from the abstract model
to the more concrete model.
Abstract: For decades, the defense business has been plagued by
not having a reliable, deterministic method to know when the Kalman
filter solution for passive ranging application is reliable for use by the
fighter pilot. This has made it hard to accurately assess when the
ranging solution can be used for situation awareness and weapons
use. To date, we have used ad hoc rules-of-thumb to assess when we
think the estimate of the Kalman filter standard deviation on range is
reliable. A reliable algorithm has been developed at BAE Systems
Electronics & Integrated Solutions that monitors the Kalman gain
matrix elements – and a patent is pending. The “settling" of the gain
matrix elements relates directly to when we can assess the time when
the passive ranging solution is within the 10 percent-of-truth value.
The focus of the paper is on surface-based passive ranging – but the
method is applicable to airborne targets as well.
Abstract: The dynamics of the Autonomous Underwater
Vehicles (AUVs) are highly nonlinear and time varying and the hydrodynamic coefficients of vehicles are difficult to estimate
accurately because of the variations of these coefficients with
different navigation conditions and external disturbances. This study presents the on-line system identification of AUV dynamics to obtain
the coupled nonlinear dynamic model of AUV as a black box. This black box has an input-output relationship based upon on-line
adaptive fuzzy model and adaptive neural fuzzy network (ANFN)
model techniques to overcome the uncertain external disturbance and
the difficulties of modelling the hydrodynamic forces of the AUVs instead of using the mathematical model with hydrodynamic parameters estimation. The models- parameters are adapted according
to the back propagation algorithm based upon the error between the
identified model and the actual output of the plant. The proposed
ANFN model adopts a functional link neural network (FLNN) as the
consequent part of the fuzzy rules. Thus, the consequent part of the
ANFN model is a nonlinear combination of input variables. Fuzzy
control system is applied to guide and control the AUV using both
adaptive models and mathematical model. Simulation results show
the superiority of the proposed adaptive neural fuzzy network
(ANFN) model in tracking of the behavior of the AUV accurately
even in the presence of noise and disturbance.
Abstract: This paper introduces the effective speckle reduction of
synthetic aperture radar (SAR) images using inner product spaces in
undecimated wavelet domain. There are two major areas in projection
onto span algorithm where improvement can be made. First is the use
of undecimated wavelet transformation instead of discrete wavelet
transformation. And second area is the use of smoothing filter namely
directional smoothing filter which is an additional step. Proposed
method does not need any noise estimation and thresholding
technique. More over proposed method gives good results on both
single polarimetric and fully polarimetric SAR images.
Abstract: Although the STL (stereo lithography) file format is
widely used as a de facto industry standard in the rapid prototyping
industry due to its simplicity and ability to tessellation of almost all
surfaces, but there are always some defects and shortcoming in their
usage, which many of them are difficult to correct manually. In
processing the complex models, size of the file and its defects grow
extremely, therefore, correcting STL files become difficult. In this
paper through optimizing the exiting algorithms, size of the files and
memory usage of computers to process them will be reduced. In spite
of type and extent of the errors in STL files, the tail-to-head
searching method and analysis of the nearest distance between tails
and heads techniques were used. As a result STL models sliced
rapidly, and fully closed contours produced effectively and errorless.
Abstract: The hybridization of artificial immune system with
cellular automata (CA-AIS) is a novel method. In this hybrid model,
the cellular automaton within each cell deploys the artificial immune
system algorithm under optimization context in order to increase its
fitness by using its neighbor-s efforts. The hybrid model CA-AIS is
introduced to fix the standard artificial immune system-s weaknesses.
The credibility of the proposed approach is evaluated by simulations
and it shows that the proposed approach achieves better results
compared to standard artificial immune system.
Abstract: In this paper, a method to detect multiple ellipses is presented. The technique is efficient and robust against incomplete ellipses due to partial occlusion, noise or missing edges and outliers. It is an iterative technique that finds and removes the best ellipse until no reasonable ellipse is found. At each run, the best ellipse is extracted from randomly selected edge patches, its fitness calculated and compared to a fitness threshold. RANSAC algorithm is applied as a sampling process together with the Direct Least Square fitting of ellipses (DLS) as the fitting algorithm. In our experiment, the method performs very well and is robust against noise and spurious edges on both synthetic and real-world image data.