Abstract: A SCADA (Supervisory Control And Data
Acquisition) system is an industrial control and monitoring system for
national infrastructures. The SCADA systems were used in a closed
environment without considering about security functionality in the
past. As communication technology develops, they try to connect the
SCADA systems to an open network. Therefore, the security of the
SCADA systems has been an issue. The study of key management for
SCADA system also has been performed. However, existing key
management schemes for SCADA system such as SKE(Key
establishment for SCADA systems) and SKMA(Key management
scheme for SCADA systems) cannot support broadcasting
communication. To solve this problem, an Advanced Key
Management Architecture for Secure SCADA Communication has
been proposed by Choi et al.. Choi et al.-s scheme also has a problem
that it requires lots of computational cost for multicasting
communication. In this paper, we propose an enhanced scheme which
improving computational cost for multicasting communication with
considering the number of keys to be stored in a low power
communication device (RTU).
Abstract: Estimating the reliability of a computer network has been a subject of great interest. It is a well known fact that this problem is NP-hard. In this paper we present a very efficient combinatorial approach for Monte Carlo reliability estimation of a network with unreliable nodes and unreliable edges. Its core is the computation of some network combinatorial invariants. These invariants, once computed, directly provide pure and simple framework for computation of network reliability. As a specific case of this approach we obtain tight lower and upper bounds for distributed network reliability (the so called residual connectedness reliability). We also present some simulation results.
Abstract: When the shock front (SF) hits the central electrode
axis of plasma focus device, a reflected shock wave moves radially
outwards. The current sheath (CS) results from ionization of filled
gas between two electrodes continues to compress inwards until it
hits the out-going reflected shock front. In this paper the Lagrangian
equations are solved for a parabolic shock trajectory yielding a first
and second approximation for the CS path. To determine the
accuracy of the approximation, the same problem is solved for a
straight shock.
Abstract: This paper presents the prediction of air flow,
humidity and temperature patterns in a co-current pilot plant spray
dryer fitted with a pressure nozzle using a three dimensional model.
The modelling was done with a Computational Fluid Dynamic
package (Fluent 6.3), in which the gas phase is modelled as
continuum using the Euler approach and the droplet/ particle phase is
modelled by the Discrete Phase model (Lagrange approach).Good
agreement was obtained with published experimental data where the
CFD simulation correctly predicts a fast downward central flowing
core and slow recirculation zones near the walls. In this work, the
effects of the air flow pattern on droplets trajectories, residence time
distribution of droplets and deposition of the droplets on the wall also
were investigated where atomizing of maltodextrin solution was
used.
Abstract: Iris-based biometric system is gaining its importance in several applications. However, processing of iris biometric is a challenging and time consuming task. Detection of iris part in an eye image poses a number of challenges such as, inferior image quality, occlusion of eyelids and eyelashes etc. Due to these problems it is not possible to achieve 100% accuracy rate in any iris-based biometric authentication systems. Further, iris detection is a computationally intensive task in the overall iris biometric processing. In this paper, we address these two problems and propose a technique to localize iris part efficiently and accurately. We propose scaling and color level transform followed by thresholding, finding pupil boundary points for pupil boundary detection and dilation, thresholding, vertical edge detection and removal of unnecessary edges present in the eye images for iris boundary detection. Scaling reduces the search space significantly and intensity level transform is helpful for image thresholding. Experimental results show that our approach is comparable with the existing approaches. Following our approach it is possible to detect iris part with 95-99% accuracy as substantiated by our experiments on CASIA Ver-3.0, ICE 2005, UBIRIS, Bath and MMU iris image databases.
Abstract: The evolution of logic circuits, which falls under the heading of evolvable hardware, is carried out by evolutionary algorithms. These algorithms are able to automatically configure reconfigurable devices. One of main difficulties in developing evolvable hardware with the ability to design functional electrical circuits is to choose the most favourable EA features such as fitness function, chromosome representations, population size, genetic operators and individual selection. Until now several researchers from the evolvable hardware community have used and tuned these parameters and various rules on how to select the value of a particular parameter have been proposed. However, to date, no one has presented a study regarding the size of the chromosome representation (circuit layout) to be used as a platform for the evolution in order to increase the evolvability, reduce the number of generations and optimize the digital logic circuits through reducing the number of logic gates. In this paper this topic has been thoroughly investigated and the optimal parameters for these EA features have been proposed. The evolution of logic circuits has been carried out by an extrinsic evolvable hardware system which uses (1+λ) evolution strategy as the core of the evolution.
Abstract: High-velocity oxygen fuel (HVOF) thermal spraying
uses a combustion process to heat the gas flow and coating material.
A computational fluid dynamics (CFD) model has been developed to
predict gas dynamic behavior in a HVOF thermal spray gun in which
premixed oxygen and propane are burnt in a combustion chamber
linked to a parallel-sided nozzle. The CFD analysis is applied to
investigate axisymmetric, steady-state, turbulent, compressible,
chemically reacting, subsonic and supersonic flow inside and outside
the gun. The gas velocity, temperature, pressure and Mach number
distributions are presented for various locations inside and outside
the gun. The calculated results show that the most sensitive
parameters affecting the process are fuel-to-oxygen gas ratio and
total gas flow rate. Gas dynamic behavior along the centerline of the
gun depends on both total gas flow rate and fuel-to-oxygen gas ratio.
The numerical simulations show that the axial gas velocity and Mach
number distribution depend on both flow rate and ratio; the highest
velocity is achieved at the higher flow rate and most fuel-rich ratio.
In addition, the results reported in this paper illustrate that the
numerical simulation can be one of the most powerful and beneficial
tools for the HVOF system design, optimization and performance
analysis.
Abstract: In the paper, a fast high-resolution range profile synthetic algorithm called orthogonal matching pursuit with sensing dictionary (OMP-SD) is proposed. It formulates the traditional HRRP synthetic to be a sparse approximation problem over redundant dictionary. As it employs a priori that the synthetic range profile (SRP) of targets are sparse, SRP can be accomplished even in presence of data lost. Besides, the computation complexity decreases from O(MNDK) flops for OMP to O(M(N + D)K) flops for OMP-SD by introducing sensing dictionary (SD). Simulation experiments illustrate its advantages both in additive white Gaussian noise (AWGN) and noiseless situation, respectively.
Abstract: A procedure commonly used in Job Shop Scheduling Problem (JSSP) to evaluate the neighborhoods functions that use the non-deterministic algorithms is the calculation of the critical path in a digraph. This paper presents an experimental study of the cost of computation that exists when the calculation of the critical path in the solution for instances in which a JSSP of large size is involved. The results indicate that if the critical path is use in order to generate neighborhoods in the meta-heuristics that are used in JSSP, an elevated cost of computation exists in spite of the fact that the calculation of the critical path in any digraph is of polynomial complexity.
Abstract: Workflow Management Systems (WfMS) alloworganizations to streamline and automate business processes and reengineer their structure. One important requirement for this type of system is the management and computation of the Quality of Service(QoS) of processes and workflows. Currently, a range of Web processes and workflow languages exist. Each language can be characterized by the set of patterns they support. Developing andimplementing a suitable and generic algorithm to compute the QoSof processes that have been designed using different languages is a difficult task. This is because some patterns are specific to particular process languages and new patterns may be introduced in future versions of a language. In this paper, we describe an adaptive algorithm implemented to cope with these two problems. The algorithm is called adaptive since it can be dynamically changed as the patterns of a process language also change.
Abstract: In the Equivalent Transformation (ET) computation
model, a program is constructed by the successive accumulation of
ET rules. A method by meta-computation by which a correct ET
rule is generated has been proposed. Although the method covers a
broad range in the generation of ET rules, all important ET rules
are not necessarily generated. Generation of more ET rules can be
achieved by supplementing generation methods which are specialized
for important ET rules. A Specialization-by-Equation (Speq) rule is
one of those important rules. A Speq rule describes a procedure in
which two variables included in an atom conjunction are equalized
due to predicate constraints. In this paper, we propose an algorithm
that systematically and recursively generate Speq rules and discuss
its effectiveness in the synthesis of ET programs. A Speq rule is
generated based on proof of a logical formula consisting of given
atom set and dis-equality. The proof is carried out by utilizing some
ET rules and the ultimately obtained rules in generating Speq rules.
Abstract: The link between Gröbner basis and linear algebra was
described by Lazard [4,5] where he realized the Gr¨obner basis
computation could be archived by applying Gaussian elimination over
Macaulay-s matrix .
In this paper, we indicate how same technique may be used to
SAGBI- Gröbner basis computations in invariant rings.
Abstract: Microstrip lines, widely used for good reason, are
broadband in frequency and provide circuits that are compact and
light in weight. They are generally economical to produce since they
are readily adaptable to hybrid and monolithic integrated circuit (IC)
fabrication technologies at RF and microwave frequencies. Although,
the existing EM simulation models used for the synthesis and
analysis of microstrip lines are reasonably accurate, they are
computationally intensive and time consuming. Neural networks
recently gained attention as fast and flexible vehicles to microwave
modeling, simulation and optimization. After learning and
abstracting from microwave data, through a process called training,
neural network models are used during microwave design to provide
instant answers to the task learned.This paper presents simple and
accurate ANN models for the synthesis and analysis of Microstrip
lines to more accurately compute the characteristic parameters and
the physical dimensions respectively for the required design
specifications.
Abstract: Several studies have been carried out, using various techniques, including neural networks, to discriminate vigilance states in humans from electroencephalographic (EEG) signals, but we are still far from results satisfactorily useable results. The work presented in this paper aims at improving this status with regards to 2 aspects. Firstly, we introduce an original procedure made of the association of two neural networks, a self organizing map (SOM) and a learning vector quantization (LVQ), that allows to automatically detect artefacted states and to separate the different levels of vigilance which is a major breakthrough in the field of vigilance. Lastly and more importantly, our study has been oriented toward real-worked situation and the resulting model can be easily implemented as a wearable device. It benefits from restricted computational and memory requirements and data access is very limited in time. Furthermore, some ongoing works demonstrate that this work should shortly results in the design and conception of a non invasive electronic wearable device.
Abstract: In the paper an effective context based lossless coding
technique is presented. Three principal and few auxiliary contexts are
defined. The predictor adaptation technique is an improved CoBALP
algorithm, denoted CoBALP+. Cumulated predictor error combining
8 bias estimators is calculated. It is shown experimentally that
indeed, the new technique is time-effective while it outperforms the
well known methods having reasonable time complexity, and is
inferior only to extremely computationally complex ones.
Abstract: This paper presents the development of a wavelet
based algorithm, for distinguishing between magnetizing inrush
currents and power system fault currents, which is quite adequate,
reliable, fast and computationally efficient tool. The proposed
technique consists of a preprocessing unit based on discrete wavelet
transform (DWT) in combination with an artificial neural network
(ANN) for detecting and classifying fault currents. The DWT acts as
an extractor of distinctive features in the input signals at the relay
location. This information is then fed into an ANN for classifying
fault and magnetizing inrush conditions. A 220/55/55 V, 50Hz
laboratory transformer connected to a 380 V power system were
simulated using ATP-EMTP. The DWT was implemented by using
Matlab and Coiflet mother wavelet was used to analyze primary
currents and generate training data. The simulated results presented
clearly show that the proposed technique can accurately discriminate
between magnetizing inrush and fault currents in transformer
protection.
Abstract: In this paper, we propose a Connect6 solver which
adopts a hybrid approach based on a tree-search algorithm and image
processing techniques. The solver must deal with the complicated
computation and provide high performance in order to make real-time
decisions. The proposed approach enables the solver to be
implemented on a single Spartan-6 XC6SLX45 FPGA produced by
XILINX without using any external devices. The compact
implementation is achieved through image processing techniques to
optimize a tree-search algorithm of the Connect6 game. The tree
search is widely used in computer games and the optimal search brings
the best move in every turn of a computer game. Thus, many
tree-search algorithms such as Minimax algorithm and artificial
intelligence approaches have been widely proposed in this field.
However, there is one fundamental problem in this area; the
computation time increases rapidly in response to the growth of the
game tree. It means the larger the game tree is, the bigger the circuit
size is because of their highly parallel computation characteristics.
Here, this paper aims to reduce the size of a Connect6 game tree using
image processing techniques and its position symmetric property. The
proposed solver is composed of four computational modules: a
two-dimensional checkmate strategy checker, a template matching
module, a skilful-line predictor, and a next-move selector. These
modules work well together in selecting next moves from some
candidates and the total amount of their circuits is small. The details of
the hardware design for an FPGA implementation are described and
the performance of this design is also shown in this paper.
Abstract: In this paper a new fast simplification method is
presented. Such method realizes Karnough map with large
number of variables. In order to accelerate the operation of the
proposed method, a new approach for fast detection of group
of ones is presented. Such approach implemented in the
frequency domain. The search operation relies on performing
cross correlation in the frequency domain rather than time one.
It is proved mathematically and practically that the number of
computation steps required for the presented method is less
than that needed by conventional cross correlation. Simulation
results using MATLAB confirm the theoretical computations.
Furthermore, a powerful solution for realization of complex
functions is given. The simplified functions are implemented
by using a new desigen for neural networks. Neural networks
are used because they are fault tolerance and as a result they
can recognize signals even with noise or distortion. This is
very useful for logic functions used in data and computer
communications. Moreover, the implemented functions are
realized with minimum amount of components. This is done
by using modular neural nets (MNNs) that divide the input
space into several homogenous regions. Such approach is
applied to implement XOR function, 16 logic functions on one
bit level, and 2-bit digital multiplier. Compared to previous
non- modular designs, a clear reduction in the order of
computations and hardware requirements is achieved.
Abstract: Rounding of coefficients is a common practice in
hardware implementation of digital filters. Where some coefficients
are very close to zero or one, as assumed in this paper, this rounding
action also leads to some computation reduction. Furthermore, if the
discarded coefficient is of high order, a reduced order filter is
obtained, otherwise the order does not change but computation is
reduced. In this paper, the Least Squares approximation to rounded
(or discarded) coefficient FIR filter is investigated. The result also
succinctly extended to general type of FIR filters.
Abstract: As a method of expanding a higher-order tensor data to tensor products of vectors we have proposed the Third-order Orthogonal Tensor Product Expansion (3OTPE) that did similar expansion as Higher-Order Singular Value Decomposition (HOSVD). In this paper we provide a computation algorithm to improve our previous method, in which SVD is applied to the matrix that constituted by the contraction of original tensor data and one of the expansion vector obtained. The residual of the improved method is smaller than the previous method, truncating the expanding tensor products to the same number of terms. Moreover, the residual is smaller than HOSVD when applying to color image data. It is able to be confirmed that the computing time of improved method is the same as the previous method and considerably better than HOSVD.