Abstract: Due to the coexistence of different Radio Access
Technologies (RATs), Next Generation Wireless Networks (NGWN)
are predicted to be heterogeneous in nature. The coexistence of
different RATs requires a need for Common Radio Resource
Management (CRRM) to support the provision of Quality of Service
(QoS) and the efficient utilization of radio resources. RAT selection
algorithms are part of the CRRM algorithms. Simply, their role is to
verify if an incoming call will be suitable to fit into a heterogeneous
wireless network, and to decide which of the available RATs is most
suitable to fit the need of the incoming call and admit it.
Guaranteeing the requirements of QoS for all accepted calls and at
the same time being able to provide the most efficient utilization of
the available radio resources is the goal of RAT selection algorithm.
The normal call admission control algorithms are designed for
homogeneous wireless networks and they do not provide a solution
to fit a heterogeneous wireless network which represents the NGWN.
Therefore, there is a need to develop RAT selection algorithm for
heterogeneous wireless network. In this paper, we propose an
approach for RAT selection which includes receiving different
criteria, assessing and making decisions, then selecting the most
suitable RAT for incoming calls. A comprehensive survey of
different RAT selection algorithms for a heterogeneous wireless
network is studied.
Abstract: Visual inputs are one of the key sources from which
humans perceive the environment and 'understand' what is
happening. Artificial systems perceive the visual inputs as digital
images. The images need to be processed and analysed. Within the
human brain, processing of visual inputs and subsequent
development of perception is one of its major functionalities. In this
paper we present part of our research project, which aims at the
development of an artificial model for visual perception (or
'understanding') based on the human perceptive and cognitive
systems. We propose a new model for perception from visual inputs
and a way of understaning or interpreting images using the model.
We demonstrate the implementation and use of the model with a real
image data set.
Abstract: In Orthogonal Frequency Division Multiplexing (OFDM) systems, the peak to average power ratio (PAR) is much high. The clipping signal scheme is a useful method to reduce PAR. Clipping the OFDM signal, however, increases the overall noise level by introducing clipping noise. It is necessary to recover the figure of the original signal at receiver in order to reduce the clipping noise. Considering the continuity of the signal and the figure of the peak, we obtain a certain conic function curve to replace the clipped signal module within the clipping time. The results of simulation show that the proposed scheme can reduce the systems? BER (bit-error rate) 10 times when signal-to-interference-and noise-ratio (SINR) equals to 12dB. And the BER performance of the proposed scheme is superior to that of kim's scheme, too.
Abstract: The applications on numbers are across-the-board that there is much scope for study. The chic of writing numbers is diverse and comes in a variety of form, size and fonts. Identification of Indian languages scripts is challenging problems. In Optical Character Recognition [OCR], machine printed or handwritten characters/numerals are recognized. There are plentiful approaches that deal with problem of detection of numerals/character depending on the sort of feature extracted and different way of extracting them. This paper proposes a recognition scheme for handwritten Hindi (devnagiri) numerals; most admired one in Indian subcontinent our work focused on a technique in feature extraction i.e. Local-based approach, a method using 16-segment display concept, which is extracted from halftoned images & Binary images of isolated numerals. These feature vectors are fed to neural classifier model that has been trained to recognize a Hindi numeral. The archetype of system has been tested on varieties of image of numerals. Experimentation result shows that recognition rate of halftoned images is 98 % compared to binary images (95%).
Abstract: In this paper, we study a new modified Novikov equation for its classical and nonclassical symmetries and use the symmetries to reduce it to a nonlinear ordinary differential equation (ODE). With the aid of solutions of the nonlinear ODE by using the modified (G/G)-expansion method proposed recently, multiple exact traveling wave solutions are obtained and the traveling wave solutions are expressed by the hyperbolic functions, trigonometric functions and rational functions.
Abstract: Linearization of graph embedding has been emerged
as an effective dimensionality reduction technique in pattern
recognition. However, it may not be optimal for nonlinearly
distributed real world data, such as face, due to its linear nature. So, a
kernelization of graph embedding is proposed as a dimensionality
reduction technique in face recognition. In order to further boost the
recognition capability of the proposed technique, the Fisher-s
criterion is opted in the objective function for better data
discrimination. The proposed technique is able to characterize the
underlying intra-class structure as well as the inter-class separability.
Experimental results on FRGC database validate the effectiveness of
the proposed technique as a feature descriptor.
Abstract: One of the most important aspects expected from an
ERP system is to mange user\administrator manual documents
dynamically. Since an ERP package is frequently changed during its
implementation in customer sites, it is often needed to add new
documents and/or apply required changes to existing documents in
order to cover new or changed capabilities. The worse is that since
these changes occur continuously, the corresponding documents
should be updated dynamically; otherwise, implementing the ERP
package in the organization encounters serious risks. In this paper, we
propose a new architecture which is based on the agent oriented
vision and supplies the dynamic document generation expected from
ERP systems using several independent but cooperative agents.
Beside the dynamic document generation which is the main issue of
this paper, the presented architecture will address some aspects of
intelligence and learning capabilities existing in ERP.
Abstract: Ultra-wide band (UWB) communication is one of
the most promising technologies for high data rate wireless networks
for short range applications. This paper proposes a blind channel
estimation method namely IMM (Interactive Multiple Model) Based
Kalman algorithm for UWB OFDM systems. IMM based Kalman
filter is proposed to estimate frequency selective time varying
channel. In the proposed method, two Kalman filters are concurrently
estimate the channel parameters. The first Kalman filter namely
Static Model Filter (SMF) gives accurate result when the user is static
while the second Kalman filter namely the Dynamic Model Filter
(DMF) gives accurate result when the receiver is in moving state. The
static transition matrix in SMF is assumed as an Identity matrix
where as in DMF, it is computed using Yule-Walker equations. The
resultant filter estimate is computed as a weighted sum of individual
filter estimates. The proposed method is compared with other existing
channel estimation methods.
Abstract: In the present paper the results of a numerical study are presented, numerical models were developed to simulate the behaviour of vertical massive dikes. The proposed models were developed according to the geometry, boundary conditions, loading conditions and initial conditions of a physical model taken as reference. The results obtained were compared to the experimental data. As far as the overall behaviour, the displacements and the failure mechanisms of the dikes is concerned, the numerical results were in good agreement with the experimental results, which clearly indicates a good quality of numerical modelling. The validated numerical models were used in a parametric study were the displacements and failure mechanisms were fully investigated. Out of the results obtained, some conclusions and recommendations related to the design of massive dikes are proposed.
Abstract: A proposed small-signal model parameters for a pseudomorphic high electron mobility transistor (PHEMT) is presented. Both extrinsic and intrinsic circuit elements of a smallsignal model are determined using genetic algorithm (GA) as a stochastic global search and optimization tool. The parameters extraction of the small-signal model is performed on 200-μm gate width AlGaAs/InGaAs PHEMT. The equivalent circuit elements for a proposed 18 elements model are determined directly from the measured S- parameters. The GA is used to extract the parameters of the proposed small-signal model from 0.5 up to 18 GHz.
Abstract: This paper proposes a novel spectrum sensing technique
for the digital video broadcasting-terrestrial (DVB-T) systems, which
utilizes the periodicity of pilot signals in the orthogonal frequency
division multiplexing (OFDM) symbols. The proposed scheme can
overcome the effect of the timing synchronization error by recorrelating
the correlation values in the same sample distances. The
numerical results demonstrate that the detection probability performance
of the proposed scheme outperforms that of the conventional
scheme when there exists a timing synchronization error.
Abstract: This research proposed a new design of helmet-shaped
array transcranial magnetic stimulation coil system. It was constructed
using several sagittal directional wires and several coronal directional
wires. By varying the current direction and strength on each wire, this
array coil system could be constructed into the circular coil and
figure-eight coil of different size. Also, this proposed coil system can
flexibly not only change the stimulation location, range, type and
strength, but also change the shape and the channel number of coil
dynamically.
Abstract: Steganography meaning covered writing. Steganography includes the concealment of information within computer files [1]. In other words, it is the Secret communication by hiding the existence of message. In this paper, we will refer to cover image, to indicate the images that do not yet contain a secret message, while we will refer to stego images, to indicate an image with an embedded secret message. Moreover, we will refer to the secret message as stego-message or hidden message. In this paper, we proposed a technique called RGB intensity based steganography model as RGB model is the technique used in this field to hide the data. The methods used here are based on the manipulation of the least significant bits of pixel values [3][4] or the rearrangement of colors to create least significant bit or parity bit patterns, which correspond to the message being hidden. The proposed technique attempts to overcome the problem of the sequential fashion and the use of stego-key to select the pixels.
Abstract: This paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem (TSP). The idea of the algorithm is to cut a TSP tour into overlapped blocks and then each block is improved separately. It is conjectured that the chance of improving a good solution by moving a node to a position far away from its original one is small. By doing intensive search in each block, it is possible to further improve a TSP tour that cannot be improved by other local search methods. To test the performance of the proposed algorithm, computational experiments are carried out based on benchmark problem instances. The computational results show that algorithm proposed in this paper is efficient for solving the TSPs.
Abstract: In this era of technology, fueled by the pervasive usage of the internet, security is a prime concern. The number of new attacks by the so-called “bots", which are automated programs, is increasing at an alarming rate. They are most likely to attack online registration systems. Technology, called “CAPTCHA" (Completely Automated Public Turing test to tell Computers and Humans Apart) do exist, which can differentiate between automated programs and humans and prevent replay attacks. Traditionally CAPTCHA-s have been implemented with the challenge involved in recognizing textual images and reproducing the same. We propose an approach where the visual challenge has to be read out from which randomly selected keywords are used to verify the correctness of spoken text and in turn detect the presence of human. This is supplemented with a speaker recognition system which can identify the speaker also. Thus, this framework fulfills both the objectives – it can determine whether the user is a human or not and if it is a human, it can verify its identity.
Abstract: In this paper, an intelligent automatic parking control method is proposed. First, the dynamical equation of the rear parking control is derived. Then a fuzzy logic control is proposed to perform the parking planning process. Further, a rear neural network is proposed for the steering control. Through the simulations and experiments, the intelligent auto-parking mode controllers have been shown to achieve the demanded goals with satisfactory control performance and to guarantee the system robustness under parametric variations and external disturbances. To improve some shortcomings and limitations in conventional parking mode control and further to reduce consumption time and prime cost.
Abstract: The volume of XML data exchange is explosively
increasing, and the need for efficient mechanisms of XML data
management is vital. Many XML storage models have been proposed
for storing XML DTD-independent documents in relational database
systems. Benchmarking is the best way to highlight pros and cons of
different approaches. In this study, we use a common benchmarking
scheme, known as XMark to compare the most cited and newly
proposed DTD-independent methods in terms of logical reads,
physical I/O, CPU time and duration. We show the effect of Label
Path, extracting values and storing in another table and type of join
needed for each method-s query answering.
Abstract: Multiple criteria decision making (MCDM) is an approach to ranking the solutions and finding the best one when two or more solutions are provided. In this study, MCDM approach is proposed to select the most suitable scheduling rule of robotic flexible assembly cells (RFACs). Two MCDM approaches, Analytic Hierarchy Process (AHP) and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) are proposed for solving the scheduling rule selection problem. The AHP method is employed to determine the weights of the evaluation criteria, while the TOPSIS method is employed to obtain final ranking order of scheduling rules. Four criteria are used to evaluate the scheduling rules. Also, four scheduling policies of RFAC are examined to choose the most appropriate one for this purpose. A numerical example illustrates applications of the suggested methodology. The results show that the methodology is practical and works in RFAC settings.
Abstract: This paper presents an exact pruning algorithm with
adaptive pruning interval for general dynamic neural networks
(GDNN). GDNNs are artificial neural networks with internal dynamics.
All layers have feedback connections with time delays to the
same and to all other layers. The structure of the plant is unknown, so
the identification process is started with a larger network architecture
than necessary. During parameter optimization with the Levenberg-
Marquardt (LM) algorithm irrelevant weights of the dynamic neural
network are deleted in order to find a model for the plant as
simple as possible. The weights to be pruned are found by direct
evaluation of the training data within a sliding time window. The
influence of pruning on the identification system depends on the
network architecture at pruning time and the selected weight to be
deleted. As the architecture of the model is changed drastically during
the identification and pruning process, it is suggested to adapt the
pruning interval online. Two system identification examples show
the architecture selection ability of the proposed pruning approach.
Abstract: Today, node-disjoint routing becomes inessential
technique in communication of packets among various nodes in
networks. Meanwhile AODV (Ad Hoc On-demand Multipath
Distance Vector) creates single-path route between a pair of source
and destination nodes. Some researches has done so far to make
multipath node-disjoint routing based on AODV protocol. But
however their overhead and end-to-end delay are relatively high,
while the detail of their code is not available too. This paper proposes
a new approach of multipath node-disjoint routing based on AODV
protocol. Then the algorithm of analytical model is presented. The
extensive results of this algorithm will be presented in the next paper.