Abstract: A computer cluster is a group of tightly coupled
computers that work together closely so that in many respects they
can be viewed as though they are a single computer. The components
of a cluster are commonly, but not always, connected to each other
through fast local area networks. Clusters are usually deployed to
improve performance and/or availability over that provided by a
single computer, while typically being much more cost-effective than
single computers of comparable speed or availability. This paper
proposed the way to implement the Beowulf Cluster in order to
achieve high performance as well as high availability.
Abstract: In online context, the design and implementation of
effective remote laboratories environment is highly challenging on
account of hardware and software needs. This paper presents the
remote laboratory software framework modified from ilab shared
architecture (ISA). The ISA is a framework which enables students to
remotely acccess and control experimental hardware using internet
infrastructure. The need for remote laboratories came after
experiencing problems imposed by traditional laboratories. Among
them are: the high cost of laboratory equipment, scarcity of space,
scarcity of technical personnel along with the restricted university
budget creates a significant bottleneck on building required
laboratory experiments. The solution to these problems is to build
web-accessible laboratories. Remote laboratories allow students and
educators to interact with real laboratory equipment located
anywhere in the world at anytime. Recently, many universities and
other educational institutions especially in third world countries rely
on simulations because they do not afford the experimental
equipment they require to their students. Remote laboratories enable
users to get real data from real-time hand-on experiments. To
implement many remote laboratories, the system architecture should
be flexible, understandable and easy to implement, so that different
laboratories with different hardware can be deployed easily. The
modifications were made to enable developers to add more
equipment in ISA framework and to attract the new developers to
develop many online laboratories.
Abstract: To reduce accidents in the industry, WSNs(Wireless Sensor
networks)- sensor data is used. WSNs- sensor data has the persistence and
continuity. therefore, we design and exploit the buffer management system that
has the persistence and continuity to avoid and delivery data conflicts. To
develop modules, we use the multi buffers and design the buffer management
modules that transfer sensor data through the context-aware methods.
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: The evaluation of the question answering system is a major research area that needs much attention. Before the rise of domain-oriented question answering systems based on natural language understanding and reasoning, evaluation is never a problem as information retrieval-based metrics are readily available for use. However, when question answering systems began to be more domains specific, evaluation becomes a real issue. This is especially true when understanding and reasoning is required to cater for a wider variety of questions and at the same time achieve higher quality responses The research in this paper discusses the inappropriateness of the existing measure for response quality evaluation and in a later part, the call for new standard measures and the related considerations are brought forward. As a short-term solution for evaluating response quality of heterogeneous systems, and to demonstrate the challenges in evaluating systems of different nature, this research presents a black-box approach using observation, classification scheme and a scoring mechanism to assess and rank three example systems (i.e. AnswerBus, START and NaLURI).
Abstract: In this paper, a novel adaptive fuzzy sliding mode
control method is proposed for the robust tracking control of robotic
manipulators. The proposed controller possesses the advantages of
adaptive control, fuzzy control, and sliding mode control. First, system
stability and robustness are guaranteed based on the sliding mode
control. Further, fuzzy rules are developed incorporating with
adaptation law to alleviate the input chattering effectively. Stability of
the control system is proven by using the Lyapunov method. An
application to a three-degree-of-freedom robotic manipulator is
carried out. Accurate trajectory tracking as well as robustness is
achieved. Input chattering is greatly eliminated.
Abstract: Fossil fuel-firing power plants dominate electric
power generation in Taiwan, which are also the major contributor to
Green House gases (GHG). CO2 is the most important greenhouse
gas that cause global warming. This paper penetrates the relationship
between carbon trading for GHG reduction and power generation
expansion planning (GEP) problem for the electrical utility. The
Particle Swarm Optimization (PSO) Algorithm is presented to deal
with the generation expansion planning strategy of the utility with
independent power providers (IPPs). The utility has to take both the
IPPs- participation and environment impact into account when a new
generation unit is considering expanded from view of supply side.
Abstract: It-s known that incorporating prior knowledge into support
vector regression (SVR) can help to improve the approximation
performance. Most of researches are concerned with the incorporation
of knowledge in form of numerical relationships. Little work,
however, has been done to incorporate the prior knowledge on the
structural relationships among the variables (referred as to Structural
Prior Knowledge, SPK). This paper explores the incorporation of SPK
in SVR by constructing appropriate admissible support vector kernel
(SV kernel) based on the properties of reproducing kernel (R.K).
Three-levels specifications of SPK are studies with the corresponding
sub-levels of prior knowledge that can be considered for the method.
These include Hierarchical SPK (HSPK), Interactional SPK (ISPK)
consisting of independence, global and local interaction, Functional
SPK (FSPK) composed of exterior-FSPK and interior-FSPK. A
convenient tool for describing the SPK, namely Description Matrix
of SPK is introduced. Subsequently, a new SVR, namely Motivated
Support Vector Regression (MSVR) whose structure is motivated
in part by SPK, is proposed. Synthetic examples show that it is
possible to incorporate a wide variety of SPK and helpful to improve
the approximation performance in complex cases. The benefits of
MSVR are finally shown on a real-life military application, Air-toground
battle simulation, which shows great potential for MSVR to
the complex military applications.
Abstract: This paper quantifies the impact of providing a shortterm
excess active power support of a variable speed wind turbine
(VSWT) and effect of super magnetic energy storage (SMES) unit on
frequency control, particularly temporary minimum frequency (TMF)
term. To demonstrate the effect of these factors on the power system
frequency, a three-area power system is considered as a test system.
Abstract: We introduce a novel approach to measuring how
humans learn based on techniques from information theory and
apply it to the oriental game of Go. We show that the total amount
of information observable in human strategies, called the strategic
information, remains constant for populations of players of differing
skill levels for well studied patterns of play. This is despite the very
large amount of knowledge required to progress from the recreational
players at one end of our spectrum to the very best and most
experienced players in the world at the other and is in contrast to
the idea that having more knowledge might imply more 'certainty'
in what move to play next. We show this is true for very local
up to medium sized board patterns, across a variety of different
moves using 80,000 game records. Consequences for theoretical and
practical AI are outlined.
Abstract: We considered repeated-root cyclic codes whose
block length is divisible by the characteristic of the underlying field.
Cyclic self dual codes are also the repeated root cyclic codes. It is
known about the one-level squaring construction for binary repeated
root cyclic codes. In this correspondence, we introduced of two
level squaring construction for binary repeated root cyclic codes of
length 2a b , a > 0, b is odd.
Abstract: In data mining, the association rules are used to find
for the associations between the different items of the transactions
database. As the data collected and stored, rules of value can be found
through association rules, which can be applied to help managers
execute marketing strategies and establish sound market frameworks.
This paper aims to use Fuzzy Frequent Pattern growth (FFP-growth)
to derive from fuzzy association rules. At first, we apply fuzzy
partition methods and decide a membership function of quantitative
value for each transaction item. Next, we implement FFP-growth
to deal with the process of data mining. In addition, in order to
understand the impact of Apriori algorithm and FFP-growth algorithm
on the execution time and the number of generated association
rules, the experiment will be performed by using different sizes of
databases and thresholds. Lastly, the experiment results show FFPgrowth
algorithm is more efficient than other existing methods.
Abstract: In this paper, we present an algorithm for computing a
Schur factorization of a real nonsymmetric matrix with ordered diagonal
blocks such that upper left blocks contains the largest magnitude
eigenvalues. Especially in case of multiple eigenvalues, when matrix
is non diagonalizable, we construct an invariant subspaces with few
additional tricks which are heuristic and numerical results shows the
stability and accuracy of the algorithm.
Abstract: In this paper, a fractional-order FIR differentiator
design method using the differential evolution (DE) algorithm is
presented. In the proposed method, the FIR digital filter is designed to
meet the frequency response of a desired fractal-order differentiator,
which is evaluated in the frequency domain. To verify the design
performance, another design method considered in the time-domain is
also provided. Simulation results reveal the efficiency of the proposed
method.
Abstract: OpenMP is an API for parallel programming model of shared memory multiprocessors. Novice OpenMP programmers often produce the code that compiler cannot find human errors. It was investigated how compiler coped with the common mistakes that can occur in OpenMP code. The latest version(4.4.3) of GCC is used for this research. It was found that GCC compiled the codes without any errors or warnings. In this paper the programming aid tool is presented for OpenMP programs. It can check 12 common mistakes that novice programmer can commit during the programming of OpenMP. It was demonstrated that the programming aid tool can detect the various common mistakes that GCC failed to detect.
Abstract: This study aims to segment objects using the K-means
algorithm for texture features. Firstly, the algorithm transforms color
images into gray images. This paper describes a novel technique for
the extraction of texture features in an image. Then, in a group of
similar features, objects and backgrounds are differentiated by using
the K-means algorithm. Finally, this paper proposes a new object
segmentation algorithm using the morphological technique. The
experiments described include the segmentation of single and multiple
objects featured in this paper. The region of an object can be
accurately segmented out. The results can help to perform image
retrieval and analyze features of an object, as are shown in this paper.
Abstract: The policies governing the business of any
organization are well reflected in her business rules. The business
rules are implemented by data validation techniques, coded during
the software development process. Any change in business
policies results in change in the code written for data validation
used to enforce the business policies. Implementing the change in
business rules without changing the code is the objective of this
paper. The proposed approach enables users to create rule sets at
run time once the software has been developed. The newly defined
rule sets by end users are associated with the data variables for
which the validation is required. The proposed approach facilitates
the users to define business rules using all the comparison
operators and Boolean operators. Multithreading is used to
validate the data entered by end user against the business rules
applied. The evaluation of the data is performed by a newly
created thread using an enhanced form of the RPN (Reverse Polish
Notation) algorithm.
Abstract: Self-organizing map (SOM) provides both clustering and visualization capabilities in mining data. Dynamic self-organizing maps such as Growing Self-organizing Map (GSOM) has been developed to overcome the problem of fixed structure in SOM to enable better representation of the discovered patterns. However, in mining large datasets or historical data the hierarchical structure of the data is also useful to view the cluster formation at different levels of abstraction. In this paper, we present a technique to generate concept trees from the GSOM. The formation of tree from different spread factor values of GSOM is also investigated and the quality of the trees analyzed. The results show that concept trees can be generated from GSOM, thus, eliminating the need for re-clustering of the data from scratch to obtain a hierarchical view of the data under study.
Abstract: Optimal load shedding (LS) design as an emergency plan is one of the main control challenges posed by emerging new uncertainties and numerous distributed generators including renewable energy sources in a modern power system. This paper presents an overview of the key issues and new challenges on optimal LS synthesis concerning the integration of wind turbine units into the power systems. Following a brief survey on the existing LS methods, the impact of power fluctuation produced by wind powers on system frequency and voltage performance is presented. The most LS schemas proposed so far used voltage or frequency parameter via under-frequency or under-voltage LS schemes. Here, the necessity of considering both voltage and frequency indices to achieve a more effective and comprehensive LS strategy is emphasized. Then it is clarified that this problem will be more dominated in the presence of wind turbines.
Abstract: The self-organizing map (SOM) model is a well-known neural network model with wide spread of applications. The main characteristics of SOM are two-fold, namely dimension reduction and topology preservation. Using SOM, a high-dimensional data space will be mapped to some low-dimensional space. Meanwhile, the topological relations among data will be preserved. With such characteristics, the SOM was usually applied on data clustering and visualization tasks. However, the SOM has main disadvantage of the need to know the number and structure of neurons prior to training, which are difficult to be determined. Several schemes have been proposed to tackle such deficiency. Examples are growing/expandable SOM, hierarchical SOM, and growing hierarchical SOM. These schemes could dynamically expand the map, even generate hierarchical maps, during training. Encouraging results were reported. Basically, these schemes adapt the size and structure of the map according to the distribution of training data. That is, they are data-driven or dataoriented SOM schemes. In this work, a topic-oriented SOM scheme which is suitable for document clustering and organization will be developed. The proposed SOM will automatically adapt the number as well as the structure of the map according to identified topics. Unlike other data-oriented SOMs, our approach expands the map and generates the hierarchies both according to the topics and their characteristics of the neurons. The preliminary experiments give promising result and demonstrate the plausibility of the method.