Abstract: This paper is concerned with knowledge representation
and extraction of fuzzy if-then rules using Interval Type-2
Context-based Fuzzy C-Means clustering (IT2-CFCM) with the aid of
fuzzy granulation. This proposed clustering algorithm is based on
information granulation in the form of IT2 based Fuzzy C-Means
(IT2-FCM) clustering and estimates the cluster centers by preserving
the homogeneity between the clustered patterns from the IT2 contexts
produced in the output space. Furthermore, we can obtain the
automatic knowledge representation in the design of Radial Basis
Function Networks (RBFN), Linguistic Model (LM), and Adaptive
Neuro-Fuzzy Networks (ANFN) from the numerical input-output data
pairs. We shall focus on a design of ANFN in this paper. The
experimental results on an estimation problem of energy performance
reveal that the proposed method showed a good knowledge
representation and performance in comparison with the previous
works.
Abstract: Physics Education Research (PER) results have shown
that students do not achieve the expected level of competency in
understanding the concepts of different domains of Physics learning
when taught by the traditional teaching methods, the concepts of
Electricity and Magnetism (E&M) being one among them.
Simulation being one of the valuable instructional tools renders an
opportunity to visualize varied experiences with such concepts.
Considering the electric force concept which requires extensive use
of vector representations, we report here the outcome of the research
results pertaining to the student understanding of this concept and the
role of simulation in using vector representation. The simulation
platform provides a positive impact on the use of vector
representation.
The first stage of this study involves eliciting and analyzing
student responses to questions that probe their understanding of the
concept of electrostatic force and this is followed by four stages of
student interviews as they use the interactive simulations of electric
force in one dimension. Student responses to the questions are
recorded in real time using electronic pad. A validation test interview
is conducted to evaluate students' understanding of the electric force
concept after using interactive simulation. Results indicate lack of
procedural knowledge of the vector representation. The study
emphasizes the need for the choice of appropriate simulation and
mode of induction for learning.
Abstract: This paper discusses the potential benefits of an
interactive multimedia information representation in enhancing
students’ critical thinking aligned with history reasoning in learning
history amongst Secondary School students in Malaysia. Two modes
of multimedia information representation were implemented;
chronologic and thematic information representations. A qualitative
study of an unstructured interview was conducted among two history
teachers, one history education lecturer, two i-think experts, and five
students from Form Four secondary school. The interview was to
elicit their opinions on the implementation of thinking maps and
interactive multimedia information representation in history learning.
The key elements of the interactive multimedia (e.g. multiple media,
user control, interactivity and use of timelines and concept maps)
were then considered to improve the learning process. Findings of the
preliminary investigation reveal that the interactive multimedia
information representations have the potential benefits to be
implemented as an instructional resource in enhancing students’
higher order thinking skills (HOTs). This paper concludes by giving
suggestions for future work.
Abstract: Shifted polynomial basis (SPB) is a variation of
polynomial basis representation. SPB has potential for efficient
bit level and digi -level implementations of multiplication over
binary extension fields with subquadratic space complexity. For
efficient implementation of pairing computation with large finite
fields, this paper presents a new SPB multiplication algorithm based
on Karatsuba schemes, and used that to derive a novel scalable
multiplier architecture. Analytical results show that the proposed
multiplier provides a trade-off between space and time complexities.
Our proposed multiplier is modular, regular, and suitable for very
large scale integration (VLSI) implementations. It involves less
area complexity compared to the multipliers based on traditional
decomposition methods. It is therefore, more suitable for efficient
hardware implementation of pairing based cryptography and elliptic
curve cryptography (ECC) in constraint driven applications.
Abstract: This paper proposes an innovative approach to represent the Pictogram Chinese Characters. The advantage of this representation is using an extraordinary representation to represent the pictogram Chinese character. This extraordinary representation is created accordingly to the original pictogram Chinese characters revolution or transition. The purpose of this innovative creation is to assist the learner to learn Chinese as second language (CSL) in Chinese language learning, specifically on memorizing Chinese characters. Commonly, the CSL will give up and frustrate easily while memorizing the Chinese characters by rote. So, our innovative representation helps on memorizing the Chinese character by visual storytelling. This innovative representation enhances the Chinese language learning experience of the CSL.
Abstract: This paper deals with modeling and optimization of two NP-hard problems in production planning of flexible manufacturing system (FMS), part type selection problem and loading problem. The part type selection problem and the loading problem are strongly related and heavily influence the system’s efficiency and productivity. These problems have been modeled and solved simultaneously by using real coded genetic algorithms (RCGA) which uses an array of real numbers as chromosome representation. The novel proposed chromosome representation produces only feasible solutions which minimize a computational time needed by GA to push its population toward feasible search space or repair infeasible chromosomes. The proposed RCGA improves the FMS performance by considering two objectives, maximizing system throughput and maintaining the balance of the system (minimizing system unbalance). The resulted objective values are compared to the optimum values produced by branch-and-bound method. The experiments show that the proposed RCGA could reach near optimum solutions in a reasonable amount of time.
Abstract: The residue number system (RNS) is popular in high performance computation applications because of its carry-free nature. The challenges of RNS systems design lie in the moduli set selection and in the reverse conversion from residue representation to weighted representation. In this paper, we proposed a fully parallel reverse conversion algorithm for the moduli set {rn - 2, rn - 1, rn}, based on simple mathematical relationships. Also an efficient hardware realization of this algorithm is presented. Our proposed converter is very faster and results to hardware savings, compared to the other reverse converters.
Abstract: Text document categorization involves large amount
of data or features. The high dimensionality of features is a
troublesome and can affect the performance of the classification.
Therefore, feature selection is strongly considered as one of the
crucial part in text document categorization. Selecting the best
features to represent documents can reduce the dimensionality of
feature space hence increase the performance. There were many
approaches has been implemented by various researchers to
overcome this problem. This paper proposed a novel hybrid approach
for feature selection in text document categorization based on Ant
Colony Optimization (ACO) and Information Gain (IG). We also
presented state-of-the-art algorithms by several other researchers.
Abstract: This paper and its companion (Part 2) deal with
modeling and optimization of two NP-hard problems in production
planning of flexible manufacturing system (FMS), part type selection
problem and loading problem. The part type selection problem and
the loading problem are strongly related and heavily influence the
system-s efficiency and productivity. The complexity of the problems
is harder when flexibilities of operations such as the possibility of
operation processed on alternative machines with alternative tools are
considered. These problems have been modeled and solved
simultaneously by using real coded genetic algorithms (RCGA)
which uses an array of real numbers as chromosome representation.
These real numbers can be converted into part type sequence and
machines that are used to process the part types. This first part of the
papers focuses on the modeling of the problems and discussing how
the novel chromosome representation can be applied to solve the
problems. The second part will discuss the effectiveness of the
RCGA to solve various test bed problems.
Abstract: A large number of semantic web service composition
approaches are developed by the research community and one is
more efficient than the other one depending on the particular
situation of use. So a close look at the requirements of ones particular
situation is necessary to find a suitable approach to use. In this paper,
we present a Technique Recommendation System (TRS) which using
a classification of state-of-art semantic web service composition
approaches, can provide the user of the system with the
recommendations regarding the use of service composition approach
based on some parameters regarding situation of use. TRS has
modular architecture and uses the production-rules for knowledge
representation.
Abstract: The job shop scheduling problem (JSSP) is a
notoriously difficult problem in combinatorial optimization. This
paper presents a hybrid artificial immune system for the JSSP with the
objective of minimizing makespan. The proposed approach combines
the artificial immune system, which has a powerful global exploration
capability, with the local search method, which can exploit the optimal
antibody. The antibody coding scheme is based on the operation based
representation. The decoding procedure limits the search space to the
set of full active schedules. In each generation, a local search heuristic
based on the neighborhood structure proposed by Nowicki and
Smutnicki is applied to improve the solutions. The approach is tested
on 43 benchmark problems taken from the literature and compared
with other approaches. The computation results validate the
effectiveness of the proposed algorithm.
Abstract: A hybrid learning automata-genetic algorithm (HLGA) is proposed to solve QoS routing optimization problem of next generation networks. The algorithm complements the advantages of the learning Automato Algorithm(LA) and Genetic Algorithm(GA). It firstly uses the good global search capability of LA to generate initial population needed by GA, then it uses GA to improve the Quality of Service(QoS) and acquiring the optimization tree through new algorithms for crossover and mutation operators which are an NP-Complete problem. In the proposed algorithm, the connectivity matrix of edges is used for genotype representation. Some novel heuristics are also proposed for mutation, crossover, and creation of random individuals. We evaluate the performance and efficiency of the proposed HLGA-based algorithm in comparison with other existing heuristic and GA-based algorithms by the result of simulation. Simulation results demonstrate that this paper proposed algorithm not only has the fast calculating speed and high accuracy but also can improve the efficiency in Next Generation Networks QoS routing. The proposed algorithm has overcome all of the previous algorithms in the literature.
Abstract: The Deoxyribonucleic Acid (DNA) which is a doublestranded helix of nucleotides consists of: Adenine (A), Cytosine (C), Guanine (G) and Thymine (T). In this work, we convert this genetic code into an equivalent digital signal representation. Applying a wavelet transform, such as Haar wavelet, we will be able to extract details that are not so clear in the original genetic code. We compare between different organisms using the results of the Haar wavelet Transform. This is achieved by using the trend part of the signal since the trend part bears the most energy of the digital signal representation. Consequently, we will be able to quantitatively reconstruct different biological families.
Abstract: This paper proposes a new technique to detect code
clones from the lexical and syntactic point of view, which is based
on PALEX source code representation. The PALEX code contains
the recorded parsing actions and also lexical formatting information
including white spaces and comments. We can record a list of parsing
actions (shift, reduce, and reading a token) during a compiling process
after a compiler finishes analyzing the source code. The proposed
technique has advantages for syntax sensitive approach and language
independency.
Abstract: XML is an important standard of data exchange and
representation. As a mature database system, using relational database
to support XML data may bring some advantages. But storing XML in
relational database has obvious redundancy that wastes disk space,
bandwidth and disk I/O when querying XML data. For the efficiency
of storage and query XML, it is necessary to use compressed XML
data in relational database. In this paper, a compressed relational
database technology supporting XML data is presented. Original
relational storage structure is adaptive to XPath query process. The
compression method keeps this feature. Besides traditional relational
database techniques, additional query process technologies on
compressed relations and for special structure for XML are presented.
In this paper, technologies for XQuery process in compressed
relational database are presented..
Abstract: In this paper, we propose an approach for the classification of fingerprint databases. It is based on the fact that a fingerprint image is composed of regular texture regions that can be successfully represented by co-occurrence matrices. So, we first extract the features based on certain characteristics of the cooccurrence matrix and then we use these features to train a neural network for classifying fingerprints into four common classes. The obtained results compared with the existing approaches demonstrate the superior performance of our proposed approach.
Abstract: Traditional principal components analysis (PCA)
techniques for face recognition are based on batch-mode training
using a pre-available image set. Real world applications require that
the training set be dynamic of evolving nature where within the
framework of continuous learning, new training images are
continuously added to the original set; this would trigger a costly
continuous re-computation of the eigen space representation via
repeating an entire batch-based training that includes the old and new
images. Incremental PCA methods allow adding new images and
updating the PCA representation. In this paper, two incremental
PCA approaches, CCIPCA and IPCA, are examined and compared.
Besides, different learning and testing strategies are proposed and
applied to the two algorithms. The results suggest that batch PCA is
inferior to both incremental approaches, and that all CCIPCAs are
practically equivalent.
Abstract: Nowadays there are many methods for representing
knowledge such as semantic network, neural network, and conceptual
graphs. Nonetheless, these methods are not sufficiently efficient
when applied to perform and deduce on knowledge domains about
supporting in general education such as algebra, analysis or plane
geometry. This leads to the introduction of computational network
which is a useful tool for representation knowledge base, especially
for computational knowledge, especially knowledge domain about
general education. However, when dealing with a practical problem,
we often do not immediately find a new solution, but we search
related problems which have been solved before and then proposing
an appropriate solution for the problem. Besides that, when finding
related problems, we have to determine whether the result of them
can be used to solve the practical problem or not. In this paper, the
extension model of computational network has been presented. In this
model, Sample Problems, which are related problems, will be used
like the experience of human about practical problem, simulate the
way of human thinking, and give the good solution for the practical
problem faster and more effectively. This extension model is applied
to construct an automatic system for solving algebraic problems in
middle school.
Abstract: In this paper; we are interested principally in dynamic modelling of quadrotor while taking into account the high-order nonholonomic constraints in order to develop a new control scheme as well as the various physical phenomena, which can influence the dynamics of a flying structure. These permit us to introduce a new state-space representation. After, the use of Backstepping approach for the synthesis of tracking errors and Lyapunov functions, a sliding mode controller is developed in order to ensure Lyapunov stability, the handling of all system nonlinearities and desired tracking trajectories. Finally simulation results are also provided in order to illustrate the performances of the proposed controller.
Abstract: This essay endeavors to read Ama Ata Aidoo-s Our Sister Killjoy with a postocolonially-inflected consciousness. It aims at demonstrating how her work could be read as a sophisticated postcolonial revision of the colonial travel narrative whereby the protagonist-s black-eyed squint operates as 'the all-seeing-eye' to subvert the historically unbroken legacy of the Orientalist ideology. It tries to demonstrate how Sissie assumes authority and voice in an act that destabilizes the traditionally established modes of western representation. It is also an investigation into how Aidoo-s text adopts processes which disengage the Eurocentric view produced by the discursive itineraries of western institutions through diverse acts of resistance and 'various strategies of subversion and appropriation'. Her counter discursive strategies of resistance are shaped up in various ways by a feminist consciousness that attempts to articulate a distinct African version of identity and preserve cultural distinctiveness.