Abstract: In this paper, a recursive algorithm for the
computation of 2-D DCT using Ramanujan Numbers is proposed.
With this algorithm, the floating-point multiplication is completely
eliminated and hence the multiplierless algorithm can be
implemented using shifts and additions only. The orthogonality of
the recursive kernel is well maintained through matrix factorization
to reduce the computational complexity. The inherent parallel
structure yields simpler programming and hardware implementation
and provides
log 1
2
3
2 N N-N+
additions and
N N
2 log
2 shifts which is
very much less complex when compared to other recent multiplierless
algorithms.
Abstract: In this paper we explore the application of a formal proof system to verification problems in cryptography. Cryptographic properties concerning correctness or security of some cryptographic algorithms are of great interest. Beside some basic lemmata, we explore an implementation of a complex function that is used in cryptography. More precisely, we describe formal properties of this implementation that we computer prove. We describe formalized probability distributions (o--algebras, probability spaces and condi¬tional probabilities). These are given in the formal language of the formal proof system Isabelle/HOL. Moreover, we computer prove Bayes' Formula. Besides we describe an application of the presented formalized probability distributions to cryptography. Furthermore, this paper shows that computer proofs of complex cryptographic functions are possible by presenting an implementation of the Miller- Rabin primality test that admits formal verification. Our achievements are a step towards computer verification of cryptographic primitives. They describe a basis for computer verification in cryptography. Computer verification can be applied to further problems in crypto-graphic research, if the corresponding basic mathematical knowledge is available in a database.
Abstract: Nowadays, doping is an intricate dilemma. Wrestling
is the nationally popular sport in Iran. Also the prevalence of doping
may be high, due to its power demanding characteristics. So, we
aimed to assess the knowledge and attitudes toward doping among
the club wrestlers. In a cross sectional study, 426 wrestlers were
studied. For this reason, a researcher made questionnaire was used. In
this study, researchers selected the clubs by randomized clustered
sampling and distributed the questionnaire among wrestlers.
Knowledge of wrestlers in three categories of doping definitions,
recognition of prohibited drugs and side effects was poor or moderate
in 70.8%, 95.8% and 99.5%, respectively. Wrestlers have poor
knowledge in doping. Furthermore, they believe some myths which
are unfavorable. It seems necessary to design a comprehensive
educational program for all of the athletes and coaches.
Abstract: Grid computing is a high performance computing
environment to solve larger scale computational applications. Grid
computing contains resource management, job scheduling, security
problems, information management and so on. Job scheduling is a
fundamental and important issue in achieving high performance in
grid computing systems. However, it is a big challenge to design an
efficient scheduler and its implementation. In Grid Computing, there
is a need of further improvement in Job Scheduling algorithm to
schedule the light-weight or small jobs into a coarse-grained or
group of jobs, which will reduce the communication time,
processing time and enhance resource utilization. This Grouping
strategy considers the processing power, memory-size and
bandwidth requirements of each job to realize the real grid system.
The experimental results demonstrate that the proposed scheduling
algorithm efficiently reduces the processing time of jobs in
comparison to others.
Abstract: In this paper, delay-dependent stability analysis for
neutral type neural networks with uncertain paramters and
time-varying delay is studied. By constructing new
Lyapunov-Krasovskii functional and dividing the delay interval into
multiple segments, a novel sufficient condition is established to
guarantee the globally asymptotically stability of the considered
system. Finally, a numerical example is provided to illustrate the
usefulness of the proposed main results.
Abstract: Object Relational Databases (ORDB) are complex in
nature than traditional relational databases because they combine the
characteristics of both object oriented concepts and relational
features of conventional databases. Design of an ORDB demands
efficient and quality schema considering the structural, functional
and componential traits. This internal quality of the schema is
assured by metrics that measure the relevant attributes. This is
extended to substantiate the understandability, usability and
reliability of the schema, thus assuring external quality of the
schema. This work institutes a formalization of ORDB metrics;
metric definition, evaluation methodology and the calibration of the
metric. Three ORDB schemas were used to conduct the evaluation
and the formalization of the metrics. The metrics are calibrated using
content and criteria related validity based on the measurability,
consistency and reliability of the metrics. Nominal and summative
scales are derived based on the evaluated metric values and are
standardized. Future works pertaining to ORDB metrics forms the
concluding note.
Abstract: In order to define a new model of Tunisian foot
sizes and for building the most comfortable shoes, Tunisian
industrialists must be able to offer for their customers products able
to put on and adjust the majority of the target population concerned.
Moreover, the use of models of shoes, mainly from others
country, causes a mismatch between the foot and comfort of the
Tunisian shoes.
But every foot is unique; these models become uncomfortable for
the Tunisian foot. We have a set of measures produced from a
3D scan of the feet of a diverse population (women, men ...) and we
try to analyze this data to define a model of foot specific to the
Tunisian footwear design.
In this paper we propose tow new approaches to modeling a new
foot sizes model. We used, indeed, the neural networks, and specially
the Kohonen network.
Next, we combine neural networks with the concept of half-foot
size to improve the models already found. Finally, it was necessary to
compare the results obtained by applying each approach and we
decide what-s the best approach that give us the most model of foot
improving more comfortable shoes.
Abstract: Social networking is one of the most successful and popular tools to emerge from the Web 2.0 era. However, the increased interconnectivity and access to peoples- personal lives and information has created a plethora of opportunities for the nefarious side of human nature to manifest. This paper categorizes and describes the major types of anti-social behavior and criminal activity that can arise through undisciplined use and/or misuse of social media. We specifically address identity theft, misrepresentation of information posted, cyber bullying, children and social networking, and social networking in the work place. Recommendations are provided for how to reduce the risk of being the victim of a crime or engaging in embarrassing behavior that could irrevocably harm one-s reputation either professionally or personally. We also discuss what responsibilities social networking companies have to protect their users and also what law enforcement and policy makers can do to help alleviate the problems.
Abstract: A theory for optimal filtering of infinite sets of random
signals is presented. There are several new distinctive features of the
proposed approach. First, a single optimal filter for processing any
signal from a given infinite signal set is provided. Second, the filter is
presented in the special form of a sum with p terms where each term
is represented as a combination of three operations. Each operation
is a special stage of the filtering aimed at facilitating the associated
numerical work. Third, an iterative scheme is implemented into the
filter structure to provide an improvement in the filter performance at
each step of the scheme. The final step of the scheme concerns signal
compression and decompression. This step is based on the solution of
a new rank-constrained matrix approximation problem. The solution
to the matrix problem is described in this paper. A rigorous error
analysis is given for the new filter.
Abstract: In a previously developed fast vortex method, the
diffusion of the vortex sheet induced at the solid wall by the no-slip
boundary conditions was modeled according to the approximation
solution of Koumoutsakos and converted into discrete blobs in the
vicinity of the wall. This scheme had been successfully applied to a
simulation of the flow induced with an impulsively initiated circular
cylinder. In this work, further modifications on this vortex method are
attempted, including replacing the approximation solution by the
boundary-element-method solution, incorporating a new algorithm for
handling the over-weak vortex blobs, and diffusing the vortex sheet
circulation in a new way suitable for high-curvature solid bodies. The
accuracy is thus largely improved. The predictions of lift and drag
coefficients for a uniform flow past a NASA airfoil agree well with the
existing literature.
Abstract: Animation is simply defined as the sequencing of a
series of static images to generate the illusion of movement. Most
people believe that actual drawings or creation of the individual
images is the animation, when in actuality it is the arrangement of
those static images that conveys the motion. To become an animator,
it is often assumed that needed the ability to quickly design
masterpiece after masterpiece. Although some semblance of artistic
skill is a necessity for the job, the real key to becoming a great
animator is in the comprehension of timing. This paper will use a
combination of sprite animation, frame animation, and some other
techniques to cause a group of multi-colored static images to slither
around in the bounded area. In addition to slithering, the images
will also change the color of different parts of their body, much like
the real world creatures that have this amazing ability to change the
colors on their bodies do. This paper was implemented by using
Java 2 Standard Edition (J2SE).
It is both time-consuming and expensive to create animations,
regardless if they are created by hand or by using motion-capture
equipment. If the animators could reuse old animations and even
blend different animations together, a lot of work would be saved in
the process. The main objective of this paper is to examine a method
for blending several animations together in real time. This paper
presents and analyses a solution using Weighted Skeleton
Animation (WSA) resulting in limited CPU time and memory waste
as well as saving time for the animators. The idea presented is
described in detail and implemented. In this paper, text animation,
vertex animation, sprite part animation and whole sprite animation
were tested.
In this research paper, the resolution, smoothness and movement
of animated images will be carried out from the parameters, which
will be obtained from the experimental research of implementing
this paper.
Abstract: Synchronization is a difficult problem in CDMA
satellite communications. Due to the influence of additive noise and
fading in the mobile channel, it is not easy to keep up with the
attenuation and offset. This paper considers a recently proposed
approach to solve the problem of synchronization chaotic Chen
system in CDMA satellite communication in the presence of constant
attenuation and offset. An analytic algorithm that provides closed
form channel and carrier offset estimates is presented. The principle
of this approach is based on adding a compensation block before the
receiver to compensate the distortion of the imperfect channel by
using genetic algorithm.
The resultants presented, show that the receiver is able to recover
rapidly the synchronization with the transmitter.
Abstract: One of the main image representations in Mathematical Morphology is the 3D Shape Decomposition Representation, useful for Image Compression and Representation,and Pattern Recognition. The 3D Morphological Shape Decomposition representation can be generalized a number of times,to extend the scope of its algebraic characteristics as much as possible. With these generalizations, the Morphological Shape Decomposition 's role to serve as an efficient image decomposition tool is extended to grayscale images.This work follows the above line, and further develops it. Anew evolutionary branch is added to the 3D Morphological Shape Decomposition's development, by the introduction of a 3D Multi Structuring Element Morphological Shape Decomposition, which permits 3D Morphological Shape Decomposition of 3D binary images (grayscale images) into "multiparameter" families of elements. At the beginning, 3D Morphological Shape Decomposition representations are based only on "1 parameter" families of elements for image decomposition.This paper addresses the gray scale inter frame interpolation by means of mathematical morphology. The new interframe interpolation method is based on generalized morphological 3D Shape Decomposition. This article will present the theoretical background of the morphological interframe interpolation, deduce the new representation and show some application examples.Computer simulations could illustrate results.
Abstract: In general the images used for compression are of
different types like dark image, high intensity image etc. When these
images are compressed using Counter Propagation Neural Network,
it takes longer time to converge. The reason for this is that the given
image may contain a number of distinct gray levels with narrow
difference with their neighborhood pixels. If the gray levels of the
pixels in an image and their neighbors are mapped in such a way that
the difference in the gray levels of the neighbor with the pixel is
minimum, then compression ratio as well as the convergence of the
network can be improved. To achieve this, a Cumulative Distribution
Function is estimated for the image and it is used to map the image
pixels. When the mapped image pixels are used the Counter
Propagation Neural Network yield high compression ratio as well as
it converges quickly.
Abstract: Modern manufacturing facilities are large scale,
highly complex, and operate with large number of variables under
closed loop control. Early and accurate fault detection and diagnosis
for these plants can minimise down time, increase the safety of plant
operations, and reduce manufacturing costs. Fault detection and
isolation is more complex particularly in the case of the faulty analog
control systems. Analog control systems are not equipped with
monitoring function where the process parameters are continually
visualised. In this situation, It is very difficult to find the relationship
between the fault importance and its consequences on the product
failure. We consider in this paper an approach to fault detection and
analysis of its effect on the production quality using an adaptive
centring and scaling in the pickling process in cold rolling. The fault
appeared on one of the power unit driving a rotary machine, this
machine can not track a reference speed given by another machine.
The length of metal loop is then in continuous oscillation, this affects
the product quality. Using a computerised data acquisition system,
the main machine parameters have been monitored. The fault has
been detected and isolated on basis of analysis of monitored data.
Normal and faulty situation have been obtained by an artificial neural
network (ANN) model which is implemented to simulate the normal
and faulty status of rotary machine. Correlation between the product
quality defined by an index and the residual is used to quality
classification.
Abstract: This article presents a short discussion on
optimum neighborhood size selection in a spherical selforganizing
feature map (SOFM). A majority of the literature
on the SOFMs have addressed the issue of selecting optimal
learning parameters in the case of Cartesian topology SOFMs.
However, the use of a Spherical SOFM suggested that the
learning aspects of Cartesian topology SOFM are not directly
translated. This article presents an approach on how to
estimate the neighborhood size of a spherical SOFM based on
the data. It adopts the L-curve criterion, previously suggested
for choosing the regularization parameter on problems of
linear equations where their right-hand-side is contaminated
with noise. Simulation results are presented on two artificial
4D data sets of the coupled Hénon-Ikeda map.
Abstract: Students often adopt routine practicing as learning
strategy for mathematics. The reason is they are often bound and
trained to solving conventional-typed questions in Mathematics in
high school. This will be problematic if students further consolidate
this practice in university. Therefore, the Department of Mathematics
emphasized and integrated the Discovery-enriched approach in the
undergraduate curriculum. This paper presents the details of
implementing the Discovery-enriched Curriculum by providing
adequate platform for project-learning, expertise for guidance and
internship opportunities for students majoring in Mathematics. The
Department also provided project-learning opportunities to
mathematics courses targeted for students majoring in other science or
engineering disciplines. The outcome is promising: the research
ability and problem solving skills of students are enhanced.
Abstract: Having a very many number of pipelines all over the
country, Iran is one of the countries consists of various ecosystems
with variable degrees of fragility and robusticity as well as
geographical conditions. This study presents a state-of-the-art method
to estimate environmental risks of pipelines by recommending
rational equations including FES, URAS, SRS, RRS, DRS, LURS
and IRS as well as FRS to calculate the risks. This study was carried
out by a relative semi-quantitative approach based on land uses and
HVAs (High-Value Areas). GIS as a tool was used to create proper
maps regarding the environmental risks, land uses and distances. The
main logic for using the formulas was the distance-based approaches
and ESI as well as intersections. Summarizing the results of the
study, a risk geographical map based on the ESIs and final risk score
(FRS) was created. The study results showed that the most sensitive
and so of high risk area would be an area comprising of mangrove
forests located in the pipeline neighborhood. Also, salty lands were
the most robust land use units in the case of pipeline failure
circumstances. Besides, using a state-of-the-art method, it showed
that mapping the risks of pipelines out with the applied method is of
more reliability and convenience as well as relative
comprehensiveness in comparison to present non-holistic methods for
assessing the environmental risks of pipelines. The focus of the
present study is “assessment" than that of “management". It is
suggested that new policies are to be implemented to reduce the
negative effects of the pipeline that has not yet been constructed
completely
Abstract: The paper presents an on-line recognition machine
(RM) for continuous/isolated, dynamic and static gestures that arise
in Flight Deck Officer (FDO) training. RM is based on generic pattern
recognition framework. Gestures are represented as templates using
summary statistics. The proposed recognition algorithm exploits temporal
and spatial characteristics of gestures via dynamic programming
and Markovian process. The algorithm predicts corresponding index
of incremental input data in the templates in an on-line mode.
Accumulated consistency in the sequence of prediction provides a
similarity measurement (Score) between input data and the templates.
The algorithm provides an intuitive mechanism for automatic detection
of start/end frames of continuous gestures. In the present paper,
we consider isolated gestures. The performance of RM is evaluated
using four datasets - artificial (W TTest), hand motion (Yang) and
FDO (tracker, vision-based ). RM achieves comparable results which
are in agreement with other on-line and off-line algorithms such as
hidden Markov model (HMM) and dynamic time warping (DTW).
The proposed algorithm has the additional advantage of providing
timely feedback for training purposes.
Abstract: The main aim of the presented experiments is to
improve behaviour of sandwich structures under dynamic loading,
such as crash or explosion. Several cellular materials are widely used
as core of the sandwich structures and their properties influence
the response of the entire element under impact load. To optimize
their performance requires the characterisation of the core material
behaviour at high strain rates and identification of the underlying
mechanism. This work presents the study of high strain-rate
characteristics of a specific porous lightweight blast energy absorbing
foam using a Split Hopkinson Pressure Bar (SHPB) technique
adapted to perform tests on low strength materials. Two different
velocities, 15 and 30 m.s-1 were used to determine the strain
sensitivity of the material. Foams were designed using two types of
porous lightweight spherical raw materials with diameters of 30-
100 *m, combined with polymer matrix. Cylindrical specimens with
diameter of 15 mm and length of 7 mm were prepared and loaded
using a Split Hopkinson Pressure Bar apparatus to assess the relation
between the composition of the material and its shock wave
attenuation capacity.