|
Issue
1, Volume 7, January 2008
Title of the Paper: Constraint
Satisfaction Problem Using Modified Branch and Bound Algorithm
DOWNLOAD
FULL PDF
Authors: Azlinah
Mohamed, Marina Yusoff, Itaza Afiani Mohtar, Sofianita Mutalib, Shuzlina
Abdul Rahman
Abstract: A constraint satisfaction problem (CSP) involves assigning possible
values to a set of variables without defying any constraints. There are
various techniques available to solve or give partial solution to CSP. This
paper presents a modification of branch and bound algorithm, which is used to
solve a constraint satisfaction problem in map colouring problem. There are
two constraints involved which are only three colours are allowed to be used
and adjacent regions in the map must not be of the same colour. The modified
branch and bound algorithm uses back jumping when it encounters a dead-end in
the search. Static variable ordering was also applied to aid the searching
process. The modified branch and bound algorithm shows a better result in
terms of the number of nodes instantiated and the reduced number of
backtracking at dead ends. The result illustrated that the modified branch
and bound algorithm with the use of variable ordering technique is better if
compared to backjumping. Thus, it is concluded that the modified branch and
bound algorithm would improve constraint satisfaction problem.
Keywords: Backjumping, Branch and Bound Algorithm, Constraint Satisfaction
Problem, and Static Variable Ordering
Comments,
Questions, Discussion ...
Title of the Paper: An
Application of Type-2 Fuzzy Notions in Website Structures Selection:
Utilizing Extended TOPSIS Method
DOWNLOAD
FULL PDF
Authors: Hamed Qahri
Saremi, Gholam Ali Montazer
Abstract: Giving more effectiveness to e-commerce sites increases customer
satisfaction as visitors can navigate the website easier and find their
targets in less time and cost. With the development of web content, the
structure of a website becomes more complex and critical to both web
designers and users in a way that has made the prioritizing of various
options of website structure a pivotal decision making problem incorporating
large uncertainty in judgment. Finding a response to such a need, TOPSIS, a
conventional MADM technique, had been a mere remedy for years, solving the
problems with a more or less adequate accuracy. In an aspiring step toward an
improvement in this method, Fuzzy TOPSIS method, a combination of ordinary
TOPSIS method and Fuzzy theory, could heal some of shortcomings of
uncertainties and ordinary TOPSIS in decision making. However there are still
lots of occasions in which decision making is faced with lots of shadowiness
making the Fuzzy TOPSIS method not sufficiently receptive. As a sensible
response to this drawback, in this paper, we utilize a brand-new extension to
TOPSIS and Fuzzy TOPSIS methods, based on type-2 fuzzy notions with ability
to cope with type-2 fuzzy environment and data incorporating much more
fuzziness in decision making. We apply this method to a vague case of the
real world and discuss its results against the other previously-developed
TOPSIS methods.
Keywords:
Decision Making; Website Structure; TOPSIS; Type-2 Fuzzy Sets; Interval
Valued Fuzzy Sets; MADM; Fuzzy TOPSIS; IVF-TOPSIS
Comments,
Questions, Discussion ...
Title of the Paper: A
Novel Robust Watermarking Technique Using IntDCT Based AC Prediction
DOWNLOAD
FULL PDF
Authors: Kuo-Ming Hung
Abstract: Because of the blocking artifacts resulted from 8x8 Discrete Cosine
Transform (DCT) , most watermarking technologies have been proposed using DCT
whose image quality was not very good. In 1990, Gonzales et al. described a
technique which predicts a few low frequency AC coefficients. The AC
predictor uses the dequantized DC values of a 3x3 neighborhood of 8x8 blocks
to predict the AC values in the center block. Wang proposed a data hiding
scheme using the AC prediction technology in 2005. But it is unable to be
suitable for the image of all types to predict AC coefficients accurately. We
propose a new watermarking system by using the technologies of 4x4 integer
DCT transform and adaptive AC estimation. We use 4x4 INTDCT transform to
reduce blocking artifacts caused from 8x8 DCT transform and improve
Imperceptibility and watermark capacity greatly. Moreover, we utilize AC
prediction value as error-checking code to enhance robustness of
watermark.
Keywords:
Watermark; DCT; IntDCT; AC prediction; H.264
Comments,
Questions, Discussion ...
Title of the Paper:
Implementation Feasibility of Convex Recursive Deletion Regions Using
Multi-Layer Perceptrons
DOWNLOAD
FULL PDF
Authors: Che-Chern Lin
Abstract: A constructive algorithm to implement convex recursive deletion
regions via two-layer perceptrons has been presented in a recent study. In
the algorithm, the absolute values of the weights become larger and larger
when the number of nested layers of a convex recursive deletion region
increases. In addition, the absolute values of the weights are determined
according to the complexity of the structure of the convex recursive deletion
region. More complicated convex recursive deletion regions result in larger
values of weights. Besides, the constructive procedure is needed to get the
parameters (weights and thresholds) for the neural networks. In this paper,
we propose a simple three-layer network structure to implement the convex
recursive deletion regions in which all weights of the second and third
layers are all 1’s and the thresholds for the nodes in the second layer are
pre-determined according to the structures of the convex recursive deletion
regions. This paper also provides the activation function for the output
node. In brief, all of parameters (weights and activation functions) in the
proposed structure are pre-determined and no constructive algorithm is needed
for solving the convex recursive deletion region problems. We prove the
feasibility of the proposed structure and give an illustrative example to
demonstrate how the proposed structure implements the convex recursive
deletion regions. Finally, we provide the conceptual diagram of the hardware
implementation of the proposed network structure.
Keywords:
Multi-layer perceptrons, nested decision region, convex recursive deletion
region, hardware implementation.
Comments,
Questions, Discussion ...
Title of the Paper:
Construction of Virtual Backbone on Growth-Bounded Graph with Variable Transmission Range
DOWNLOAD
FULL PDF
Authors: Yanjing Sun,
Xiangping Gu, Jiansheng Qian
Abstract: Virtual backbone has been used extensively in various aspects for
wireless ad hoc or sensor networks recently. We propose an approximation
solution to construct a virtual backbone based on a more generalized and
realistic model of polynomial bounded growth. A localized distributed
algorithm of MCDS_GBG for computing a Minimum Connected Dominating Sets as
backbone in the growth-bounded graph is presented. This approach consists of
three stages: firstly construct an MIS by network decomposition scheme;
secondly compute a minimum dominating set in 2-separated collection with r
transmission range and finally use Marking process and ruling k to reduce the
virtual backbone with 3r transmission range. The computed Connected
Dominating Set guarantees a constant stretch factor on the length of a
shortest path and induces a subgraph of constant degree while the nodes only
require direct neighborhood information. The efficiency of our approach is
confirmed through both theoretical analysis and comparison study
Keywords:
Virtual backbone; Growth-bounded graph; Connected dominating sets; Maximal
independent sets; Wireless ad hoc sensor network; Network decomposition
Comments,
Questions, Discussion ...
Issue
2, Volume 7, February 2008
Title of the Paper: An
Algorithm Based on Core Characteristic Extraction of Watermelon
DOWNLOAD
FULL PDF
Authors: Yong Sun, Yun
Bai, Lihong Gang, Qiangguo Pu, Nikos Mastorakis
Abstract: The algorithm of extracting a series of characteristic values,
taking the flat objects, seeds, as the experiment is applied into the
auto-distinguishing seeds system software successfully. It fulfills the blank
in this area. It shows it is practical for the machine to distinguish the
flat objects with the equipment visual. It designs and realizes the new
algorithm of the length of orthogonal long and minor axis, the degree of
connecting superficial pattern and the area; brings forward the concept of
the coverage degree of black region and the way to distinguish different
colorful objects with the distribution difference of histogram gradation. The
system software has a very bright future. It is meaningful to the
distinguishing objects areas.
Keywords:
long and short axis, the degree of connecting surface patterns, the coverage
degree of black region, core characteristic extraction, watermelon seeds
Comments,
Questions, Discussion ...
Title of the Paper: Fast
Pre-authentication with Minimized Overhead and High Security for WLAN Handoff
DOWNLOAD
FULL PDF
Authors: Hung-Yu Chien,
Tzu-Hang Hsu and Yuan-Liang Tang
Abstract: User mobility in WLANs becomes more and more popular because of
wide deployment of WLANs and numerous applications on it. Some of these
applications, for example multimedia applications, require fast handoffs
among access points to maintain the quality of service. In order to support
multimedia applications for roaming users, IEEE 802.11i defines
pre-authentication to reduce the re-authentication delay. The primary
drawback of IEEE 802.11i pre-authentication is that the full 802.1x/EAP
authentication consumes too much overhead. In this paper, we propose a new
fast pre-authentication scheme that greatly improves the efficiency and
achieves high security level.
Keywords:
Pre-authentication, fast handoff, wireless security, IEEE 802.11i.
Comments,
Questions, Discussion ...
Title of the Paper:
Fractional Fourier Transform Based Key Exchange for Optical Asymmetric Key
Cryptography
DOWNLOAD
FULL PDF
Authors: Aloka Sinha
Abstract: Recently several optical encryption techniques have been proposed
for two-dimensional data. These techniques use random phase masks, jigsaw
transforms, digital signatures, and linear transforms like the Fourier
transforms, the fractional Fourier transform and the Fresnel transform. The
strength of these encryption techniques is dependent on the size of the key
but is strongly limited by the security linked with the exchange of the
secret key. We propose a new technique, based on the Diffie-Hellman protocol,
in which the key can be exchanged with high security. The Diffie-Hellman
protocol allows two users to exchange a secret key over an insecure channel
without any prior secrets. Fractional Fourier transforms have been used for
the secure key transfer. Results of computer simulation are presented to
verify the proposed idea and analyse the robustness of the proposed
technique.
Keywords:
Fractional Fourier Transform, Optical encryption, Public key encryption,
Diffie-Hellman protocol, Fourier Transform, cryptography
Comments,
Questions, Discussion ...
Title of the Paper:
Increase The Efficiency of English-Chinese Sentence Alignment: Target Range Restriction and Empirical
Selection of Stop Words
DOWNLOAD
FULL PDF
Authors: Wing-Kwong
Wong, Hsi-Hsun Yang, Wei-Lung Shen, Sheng-Kai Yin, and Sheng-Cheng Hsu
Abstract: In this paper, we use a lexical method to do sentence alignment for
an English-Chinese corpus. Past research shows that alignment using a
dictionary involves a lot of word matching and dictionary look ups. To
address these two issues, we first restrict the range of candidate target
sentences, based on the location of the source sentence relative to the
beginning of the text. Moreover, careful empirical selection of stop words,
based on word frequencies in the source text, helps to reduce the number of
dictionary look ups. Experimental results show that the amount of word
matching can be cut down by 75% and that of dictionary look ups by as much as
43% without sacrificing precision and recall. Another experiment was also
done with twenty New York Times articles with 598 sentences and 18395 words.
The resulted precision is 95.6% and the recall is 93.8%. Among all predicted
alignment, 86% of the alignment is 1:1 (one source sentence to one target
sentence), 8% is 1:2, and 6% is 2:1. Further analysis shows that most errors
occur in alignments of types 1:2 and 2:1. Future work should focus on
problems with these two alignment types.
Keywords:
Sentence alignment, lexical method, statistical method, English-Chinese
corpus, stop words, target range.
Comments,
Questions, Discussion ...
Title of the Paper:
TEMPLUM: A Process Adapted Numerical Simulation Code for The 3D Predictive
Assessment of Laser Surface Heat Treatments in Planar Geometry
DOWNLOAD
FULL PDF
Authors: A.
García-Beltrán, J. L. Ocaña and C. L. Molpeceres
Abstract: A process adapted numerical simulation code for the 3D predictive
assessment of laser heat treatment of materials has been developed. Primarily
intended for the analysis of the laser transformation hardening of steels,
the code has been successfully applied for the predictive characterization of
other metallic and non metallic materials posing specific difficulties from
the numerical point of view according to their extreme thermal and absorption
properties. Initially based on a conventional FEM calculational structure,
the developed code (TEMPLUM) reveals itself as an extremely useful prediction
tool with specific process adapted features (not usually available in FEM
heat transfer codes) in the field of laser heat treatment applications.
Keywords:
Numerical analysis; Finite element; Modeling; Simulation; Heat conduction;
Laser surface treatments; Transformation hardening; Optical glass polishing.
Comments,
Questions, Discussion ...
Issue
3, Volume 7, March 2008
Title of the Paper: An
Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex
Decision Problem Optimization
DOWNLOAD
FULL PDF
Authors: Chang-Rui Yu
and Yan Luo
Abstract: This paper introduces the main ideas of the nested partitions (NP)
method, analyses its efficiency theoretically and proposes the way to improve
the optimization efficiency of the algorithm. Then the paper introduces the
simulated annealing(SA) algorithm and incorporates the ideas of SA into two
of the arithmetic operators of NP algorithm to form the combined NP/SA
algorithm. Moreover, the paper presents the explicit optimization procedure
of the combined algorithm NP/SA and explains the feasibility and superiority
of it. The NP/SA algorithm adopts the global optimization ability of NP
algorithm and the local search ability of SA algorithm so that it improves
the optimization efficiency and the convergence rate. This paper also
illustrates the NP/SA algorithm through an optimization example.
Keywords:
Nested partitions algorithm, Simulated annealing, Complex decision problem.
Comments,
Questions, Discussion ...
Title of the Paper:
Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH
DOWNLOAD
FULL PDF
Authors: Shih-Jung Wu,
Jen-Chih Lin, and Huan-Chao Keh
Abstract: Different parallel architectures may require different algorithms
to make the existent algorithms on one architecture be easily transformed to or
implemented on another architecture. This paper proposes a novel algorithm
for embedding complete binary trees in a faulty Incrementally Extensible
Hypercube (IEH). Furthermore, to obtain the replaceable node of the faulty
node, 2-expansion is permitted such that up to (n+1) faults can be tolerated
with dilation 3, congestion 1 and load 1. The presented embedding methods are
optimized mainly for balancing the processor loads, while minimizing dilation
and congestion as far as possible. According to the result, we can map the
parallel algorithms developed by the structure of complete binary tree in an
IEH. These methods of reconfiguring enable extremely high-speed parallel
computation.
Keywords:
Hypercube, Incrementally
Extensible Hypercube, Complete binary tree, Fault-Tolerance, Embedding
Comments,
Questions, Discussion ...
Title of the Paper:
Height, Size Performance of Complete and Nearly Complete Binary Search Trees
in Dictionary Applications
DOWNLOAD
FULL PDF
Authors: Ahmed Tarek
Abstract: Trees are frequently used data structures for fast access to the
stored data. Data structures like arrays, vectors and linked lists are
limited by the trade-off between the ability to perform a fast search and the
ability to resize easily. Binary Search Trees are an alternative data
structure that is both dynamic in size and easily searchable. Now-a-days,
more and more people are getting interested in using electronic organizers and
telephone dictionaries avoiding the hard copy counter parts. In this paper,
performance of complete and nearly complete binary search trees are analyzed
in terms of the number of tree nodes and the tree heights. Analytical results
are used together with an electronic telephone dictionary for a medium sized
organization. It’s performance is evaluated in lieu of the real-world
applications. The concept of multiple keys in data structure literature is
relatively new, and was first introduced by the author. To determine the
dictionary performance, another algorithm for determining the internal and
the external path lengths is also discussed. New results on performance
analysis are presented. Using tree-sort, individual records inside the
dictionary may be displayed in ascending order.
Keywords:
Complete Binary Search Tree, Nearly Complete Binary Search Tree, Electronic
Telephone Dictionary, Performance
Analysis, Performance Measurement, Logarithmic Time Complexity.
Comments,
Questions, Discussion ...
Title of the Paper:
Case-Oriented Alert Correlation
DOWNLOAD
FULL PDF
Authors: Jidong Long and
Daniel G. Schwartz
Abstract: Correlating alerts is of importance for identifying complex attacks
and discarding false alerts. Most popular alert correlation approaches employ
some well-de
ned knowledge to uncover the connections among alerts. However, acquiring,
representing and justifying such knowledge has turned out to be a nontrivial
task. In this paper, we propose a novel method to work around these di
culties by using case-based reasoning (CBR). In our application, a case,
constructed from training data, serves as an example of correlated alerts. It
consists of a pattern of alerts caused by an attack and the identity of the
attack. The runtime alert stream is then compared with each case, to see if
any subset of the runtime alerts are similar to the pattern in the case. The
process is reduced to a matching problem. Two kinds of matching methods were
explored. The latter is much more e
cient than the former. Our experiments with the DARPA Grand Challenge Problem
attack simulator have shown that both produce almost the same results and
that case-oriented alert correlation is e ective in detecting intrusions
Keywords:
Alert Correlation, Case-Based Reasoning, Data Mining, Intrusion Detection
Title of
the Paper: CORAL - Online Monitoring in Distributed Applications: Issues
and Solutions
DOWNLOAD
FULL PDF
Authors: Ivan Zoraja,
Ivan Zulim, and Maja Štula
Abstract: In this paper we describe and evaluate issues that come up in the
development of online monitoring systems which connect software tools to a
running distributed application. Our primary intension was to elaborate how
to deal with complex middleware mechanisms that cater for the middleware
functionality in a way transparent to the users and tools. Our current
implementation, called Coral, manages DSM mechanisms that provide an
abstraction of shared memory on loosely coupled hardware, and allows multiple
tools to perform consistent yet efficient operations on the entities being
monitored. Since our primary design choice with Coral was portability we will
port Coral to distributed environments based on the SOA technology.
Keywords:
Online Monitoring, DSM, Tools, Process migration, Performance analysis,
Checkpointing
Title of
the Paper: Mining Strong Positive and Negative
Sequential Patterns
DOWNLOAD
FULL PDF
Authors: Nancy P. Lin,
Hung-Jen Chen, Wei-Hua Hao, Hao-En Chueh, Chung-I Chang
Abstract: In data mining field, sequential pattern mining can be applied in
divers applications such as basket analysis, web access patterns analysis,
and quality control in manufactory engineering, etc. Many methods have been
proposed for mining sequential patterns. However, conventional methods only
consider the occurrences of itemsets in customer sequences. The sequential
patterns discovered by these methods are called as positive sequential
patterns, i.e., such sequential patterns only represent the occurrences of
itemsets. In practice, the absence of a frequent itemset in a sequence may
imply significant information. We call a sequential pattern as negative
sequential pattern, which also represents the absence of itemsets in a
sequence. The two major difficulties in mining sequential patterns,
especially negative ones, are that there may be huge number of candidates
generated, and most of them are meaningless. In this paper, we proposed a
method for mining strong positive and negative sequential patterns, called
PNSPM. In our method, the absences of itemsets are also considered. Besides,
only sequences with high degree of interestingness will be selected as strong
sequential patterns. An example was taken to illustrate the process of PNSPM.
The result showed that PNSPM could prune a lot of redundant candidates, and
could extract meaningful sequential patterns from a large number of frequent
sequences.
Keywords:
Data mining, Itemset, Frequent sequence, Positive sequential pattern,
Negative sequential pattern, Strong sequential pattern
Title of
the Paper: A Deflected Grid-based Algorithm
for Clustering Analysis
DOWNLOAD
FULL PDF
Authors: Nancy P. Lin,
Chung-I Chang, Hao-En Chueh, Hung-Jen Chen, Wei-Hua Hao
Abstract: The grid-based clustering algorithm, which partitions the data
space into a finite number of cells to form a grid structure and then performs
all clustering operations on this obtained grid structure, is an efficient
clustering algorithm, but its effect is seriously influenced by the size of
the cells. To cluster efficiently and simultaneously, to reduce the
influences of the size of the cells, a new grid-based clustering algorithm,
called DGD, is proposed in this paper. The main idea of DGD algorithm is to
deflect the original grid structure in each dimension of the data space after
the clusters generated from this original structure have been obtained. The
deflected grid structure can be considered a dynamic adjustment of the size
of the original cells, and thus, the clusters generated from this deflected
grid structure can be used to revise the originally obtained clusters. The
experimental results verify that, indeed, the effect of DGD algorithm is less
influenced by the size of the cells than other grid-based ones.
Keywords:
Data Mining, Clustering Algorithm, Grid-based Clustering, Significant Cell,
Grid Structure
Title of
the Paper: Fast Mining of Closed Sequential
Patterns
DOWNLOAD
FULL PDF
Authors: Nancy P. Lin,
Wei-Hua Hao, Hung-Jen Chen, Hao-En Chueh, Chung-I Chang
Abstract: This paper propose a novel algorithm for mining closed frequent
sequences, a scalable, condensed and lossless structure of complete frequent
sequences that can be mined from a sequence database. This algorithm, FMCSP,
has applied several optimization methods, such as equivalence class, to
alleviate the needs of searching space and run time. In particular, since one
of the main issues in this type of algorithms is the redundant generation of
the closed sequences, hence, we propose an effective and memory saving
methods, different from previous works, does not require the complete set of
closed sequences to be residing in the memory.
Keywords:
data mining, sequential patterns mining, closed sequential patterns
Title of
the Paper: A Data Centered Approach for Cache
Partitioning in Embedded Real-Time Database System
DOWNLOAD
FULL PDF
Authors: Hu Wei, Chen
Tianzhou, Shi Qingsong, Jiang Ning
Abstract: Embedded real-time databases become a basic part of the embedded
systems in many using environments. Caches are used for reducing the gap
between processor and off-chip memory. But caches introduce unpredictability
in general real-time systems. Although several cache partitioning approaches
have been purposed to tackle this problem, there is no scheme designed for
real-time database system up to now. In this paper, we present a data
centered cache partitioning approach that allows different tasks to have a
shared locking partition in cache. The hard real-time tasks will have their
own partitions and thus they can perform high predictability. At the same
time, a shared non-locking partition is reserved for the soft real-time
tasks. In this way we can target performance improvements based on the data
that are frequently used by many tasks in the system. Our experiment results
show that the miss rate can be reduced by about 10%~18% compared with that of
a statically partitioned cache and by about 24%~40% compared with a dynamic
cache using LRU replacement policy.
Keywords:
Data sharing, Cache partitioning, Embedded database, Real-time
Title of
the Paper: The Curling Vector Field Transform
of Gray-Scale Images: A Magneto-Static Inspired Approach
DOWNLOAD
FULL PDF
Authors: X. D. Zhuang
and N. E. Mastorakis
Abstract: For image structure representation and feature extraction, the
curling vector field transform is proposed based on the magneto-static
analogy. The digital image is taken as the source of the vector field, and
the vector field transform of the image is presented imitating the form of
the physical magnetic field, which has a distinctive feature of rotating
whorl pattern. The simulation results indicate that the curling vector field
can represent the image’s structure feature, which can be applied in image
segmentation. The experimental results show that image segmentation can be
effectively implemented based on the image structure feature extracted by the
curling vector field transform.
Keywords:
vector field transform, curling vector field, image structure, image
segmentation
Issue 4, Volume 7, April 2008
Title of
the Paper: Electrocardiogram Compression and
Optimal ECG Filtering Algorithms
DOWNLOAD
FULL PDF
Authors: Mihaela Lascu,
Dan Lascu
Abstract: In this paper novel compression techniques are developed for
portable heart-monitoring equipment that could also form the basis for more
intelligent diagnostic systems thanks to the way the compression algorithms
depend on signal classification. There are two main categories of compression
which are employed for electrocardiogram signals: lossless and lossy. Design
of an optimal Wiener filter is implemented to remove noise from a signal,
considering that the signal is statistically stationary and the noise is a
stationary random process that is statistically independent of the signal.
Two programs for compression and Wiener optimal filtering are realized in
MATLAB. The main idea of optimal filtering is to give bigger weight
coefficients to signal spectra parts where signal noise has less power and
true signal spectral components have bigger power. A Savitzky-Golay filtering
is applied to a noisy electrocardiogram and a comparison is done between the
four methods Wiener, Butterworth, Savitzky-Golay and synchronized averaging.
Keywords:
Electrocardiogram, Compression, Filtering, Matlab, Noise, Diagnostic.
Title of
the Paper: An Iterative Method for
Finite-Element Solutions of the Nonlinear Poisson-Boltzmann Equation
DOWNLOAD
FULL PDF
Authors: Ren-Chuen Chen
Abstract: A finite-element (FE) approach combined with an efficient iterative
method have been used to provide a numerical solution of the nonlinear
Poisson-Boltzmann equation. The iterative method solves the nonlinear
equations arising from the FE discretization procedure by a node-by-node
calculation. Moreover, some extensions called by Picard, Gauss-Seidel, and
successive overrelaxation (SOR) methods are also presented and analyzed for
the FE solution. The performances of the proposed methods are illustrated by
applying them to the problem of two identical colloidal particles in a
symmetric electrolyte. My numerical results are found in good agreement with
the previous published results. A comprehensive survey is also given for the
accuracy and efficiency of these methods.
Keywords:
finite-element method, Poisson-Boltzmann equation, colloidal particles
interaction
Title of
the Paper: NURBS Curve Shape Modification and
Fairness Evaluation
DOWNLOAD
FULL PDF
Authors: Tetsuzo
Kuragano and Akira Yamaguchi
Abstract: For the purpose of evaluation, a NURBS curve is used, because it is
commonly used in the areas of CAD/CAM and Computer Graphics. A curve with a
monotone radius of curvature distribution is considered as a fair curve in
the area of Computer Aided Aesthetic Design (CAAD). But no official standards
have been established. Therefore, a criterion for a fair curve is proposed. A
quintic NURBS curve, the first derivative of a quintic NURBS curve, curvature
vector, curvature, and radius of curvature are expressed. The concept of
radius of curvature specification to modify the shape of a NURBS curve is
illustrated. The difference between the NURBS curve radius of curvature and
the specified radius of curvature is minimized by introducing the
least-squares method to modify the shape of the NURBS curve. As curve
fairness evaluation, radius of curvature distribution is used as an
alternative characteristic of a curve. Algebraic functions such as linear,
quadratic, cubic, quartic, quintic, and six degrees are applied to the radius
of curvature distribution of the designed curve to specify the radius of
curvature. Then, the shape of the curve is modified according to the
specified radius of curvature distribution. In this manner, six NURBS curves
whose radius of curvature are these algebraic functions are generated, and
are predefined. Using the correlation matching, the similarity is evaluated
by comparing the radius of curvature distribution of the designed curve with
those of six NURBS curves predefined. The highest similarity curve to the
designed curve among these predefined curves is selected. The similarity
evaluated of the selected curve is determined as fairness of the designed curve.
Keywords:
curve shape modification, fair curve, radius of curvature specification,
correlation matching, fairness evaluation
Title of
the Paper: Automated Color Image Edge
Detection Using Improved PCNN Model
DOWNLOAD
FULL PDF
Authors: Liang Zhou, Yu
Sun, Jianguo Zheng
Abstract: Recent researches indicate that pulse coupled neural network can be
used for image processing, such as image segmentation and edge detection
effectively. However, up to now it has mainly been used for the processing of
gray images or binary images, and the parameters of the network are always
adjusted and confirmed manually for different images, which impede PCNN’s
application in image processing. To solve these problems, based on the model
of Pulse Coupled Neural Network and the model of HIS, this paper bring
forward an improved PCNN model in the color image segmentation with the
parameters determined by images’ spatial and gray characteristics
automatically at the first, then use the above model to obtain the edge
information. The experiment results show the good effect of the new PCNN
model.
Keywords:
pulse coupled neural network (PCNN), image processing, HIS, color image
segmentation, parameter determination, image edge detection, spatial
characteristics, gray characteristics
Title of
the Paper: Development of Specific Disease
Data Warehouse for Developing Content from General Guide for Hypertension
Screening, Referral and Follow Up
DOWNLOAD
FULL PDF
Authors: Teh Ying Wah,
Ng Hooi Peng, Ching Sue Hok
Abstract: This paper proposes a method of developing specific disease data
warehouse such as hypertension data warehouse. Significant steps in
developing the data warehouse will be described especially data extraction,
transformation and loading. The purpose of developing this data warehouse is
to help/assist the specialist, health care team, pharmacists to figure out
the best and suitable strategies to be implemented during the screening,
referral and follow up process. As the data may come from various data
sources mostly different websites, the amount of time spent of this tasks is
often underestimated. Issues on how we crawl the data from various data
sources and store it into database will be discussed further.
Keywords:
Data warehouse, Hypertension, Screening, Referral, Follow up
Title of
the Paper: Dynamic Threshold Determination for
Stable Behavior Detection
DOWNLOAD
FULL PDF
Authors: Hiroyuki
Yamahara, Fumiko Harada, Hideyuki Takada, Hiromitsu Shimakawa
Abstract: To provide services according to user behavior, parameters should
be adapted appropriately for the precise recognition of user behavior. In
particular, the threshold value which is used to create behavioral patterns
matched for behavior recognition impacts accuracy of behavior recognition. Because the
threshold value is common to all users in the conventional model, the
threshold setting unsuitable for some users may cause low recognition rates.
In this paper, we propose a behavior detection method which detects
high-level user behaviors, such as “leaving home”. The proposed method
achieves stable behavior recognition regardless of users, by introducing a
model which dynamically determines the threshold value for individual user.
Keywords:
Threshold, Context, Behavior, Ambient, Proactive
Title of
the Paper: Automated Three Stage Red Lesions
Detection In Digital Color Fundus Images
DOWNLOAD
FULL PDF
Authors: C.Mari ˜No, E.
Ares , M.G.Penedo, M. Ortega, N. Barreira, F. Gomez-Ulla
Abstract: The screening process is a very valuable method for prevention of
many pathologies including Diabetic retinopathy. Typically, a large amount of
images have to be analyzed as diabetic patients have both their eyes examined
at least once a year. To effectively manage all this information and the
workload it produces, automatic techniques for analyzing the images are
required. These techniques must be robust, sensitive and specific to be
implemented in real-life screening applications. In this work an algorithm
for the detection of red lesions in digital color fundus photographs is
proposed. The method performs in three stages: in the first stage points candidates
to be red lesions are obtained by using a set of correlation filters working
in different resolutions, allowing that way the detection of a wider set of
points. Then, in the second stage, a region growing segmentation process
rejects the points from the prior stage whose size does not fit in the red
lesion pattern. Finally, in the third stage three test are applied to the
output of the second stage: a shape test to remove non-circular areas, an
intensity test to remove that areas belonging to the fundus of the retina and
finally a test to remove the points which fall inside the vessels (only
lesions outside the vessels are considered). Evaluation was performed on a
test composed on images representative of those normally found in a screening
set. Moreover, comparison with manually-obtained results from clinical
experts are performed, to set the accuracy and reliability of the method.
Keywords:
Fundus, microaneurysm, red lesions, retina, screening, correlation.
Title of
the Paper: Network reliability importance
measures : combinatorics and Monte
Carlo based computations
DOWNLOAD
FULL PDF
Authors: Ilya Gertsbakh,
Yoseph Shpungin
Abstract: In this paper we focus on computational aspects of network
reliability importance measure evaluation. It is a well known fact that most
network reliability problems are NP-hard and therefore there is a significant
gap between theoretical analysis and the ability to compute different
reliability parameters for large or even moderate networks. In this paper we
present two very efficient combinatorial Monte Carlo
models for evaluating network reliability importance measures.
Keywords:
Network, Reliability, Importance Measure, Monte Carlo, Combinatorial Approach
Title of
the Paper: A Cognitive Tool to Support
Mathematical Communication in Fraction Word Problem Solving
DOWNLOAD
FULL PDF
Authors: Azlina Ahmad,
Siti Salwah Salim, Roziati Zainuddin
Abstract: Word problem solving is one of the most challenging tasks in
mathematics for most students. It requires the solver to translate the
problem into the language of mathematics, where we use symbols for
mathematical operations and for numbers whether known or unknown. From a
study conducted on Malaysian school students, it was found that majority of
them did not write their solution to the word problem using correct
mathematical language. Intrapersonal and interpersonal communications are
important in mathematics learning especially in word problem solving. It is
therefore the main aim of this paper is to present a model that promotes the
use of mathematical language. The model is used as a basis in designing a
computer-based learning environment for word problem solving. The cognitive
tool named MINDA which incorporates several important necessary steps and
activities was developed to facilitate learning. From the experimental
analysis conducted on using MINDA, it was found that the mathematical
communication and their word problem solving achievement of students have
improved.
Keywords:
word problem solving, cognitive tool, mathematical communication,
intrapersonal communication, interpersonal communication.
Title of
the Paper: Extending the Equivalent
Transformation Framework to Model Dynamic Interactive Systems
DOWNLOAD
FULL PDF
Authors: Courtney
Powell, Kiyoshi Akama
Abstract: Conceptualizing, visualizing, analyzing, reasoning about and
implementing Dynamic Interactive Systems (DISs) are difficult and error-prone
activities. To conceptualize and reason about the sorts of properties
expected of any DIS, a formal framework that most naturally facilitates
conceptualization and modelling of DISs is essential. In this paper we
propose and explain why extending the Equivalent Transformation Framework to
conceptually model DISs satisfies this ideal. The benefits to be derived from
using this framework include a simplified and intuitive conceptualization
process, mathematically sound models, guaranteed system correctness, high
level abstraction, clarity, granular modularity, and an integrated framework
for reasoning about, manipulating, and optimizing the various aspects of
DISs.
Keywords:
Conceptual Modelling, Dynamic Interactive Systems, Equivalent Transformation,
Correctness, Formal Methods.
Title of
the Paper: An Application of Data Mining
Technique in Developing Sizing System for Army Soldiers in Taiwan
DOWNLOAD
FULL PDF
Authors: Hai-Fen Lin,
Chih-Hung Hsu, Mao-Jiun J. Wang, Yu-Cheng Lin
Abstract: In the field of garment manufacturing, the planning and control of
production and inventory are rather complicated procedures. This is the
reason that establishing standard sizing systems is necessary and important
for garment manufacturers in Taiwan.
As the standard sizing systems need anthropometric data for reference, an
anthropometric database for Taiwan
army servicemen was first constructed for the purpose of simplifying the
entire process. Anthropometric data collected from scratch are used to
establish the sizing systems. The data mining method, which has been
extensively used in many fields, is applied in this project. Few researches
have been conducted in addressing the establishment of sizing systems. This
study aims to establish systems for determining the sizes of garments for
army personnel using the data mining technique. The newly developed sizing
systems can be adopted to better accurately predict the requirements of
different sizes of uniforms, and then to generate a practical production
planning procedure. This study found that, by applying data mining technique,
unnecessary inventory costs resulting from sizing mismatches that portend
large differences between the numbers of soldiers and of produced garments
can be significantly minimized.
Keywords:
Anthropometric data, Data mining, Decision tree, Sizing systems, Production
planning, Garment manufacturing
Title of
the Paper: QoS Integration of the Internet and
Wireless Sensor Networks
DOWNLOAD
FULL PDF
Authors: Weilian Su and
Bassam Almaharmeh
Abstract: Recent developments in sensor networking for both military and
civilian applications emphasized the need for a reliable integration of
sensor networks with the Internet. For sensor networks deployed in various
military applications, it is important that collected information be
delivered as fast as possible with minimum delays. In this paper, an
integration module is proposed. The objective of the module is to provide
preferential services for high-priority traffic. The integration module is
implemented and tested using hardware equipments, such as Cisco routers and
10/100 Mbps switches. According to the testbed measurements, the proposed
integration module is able to adapt to different traffic needs, thus,
ensuring the QoS for different sensor network applications.
Keywords:
Wireless Sensor Networks, QoS, Integration Module.
Title of
the Paper: Channel Propagation Measurement and
Simulation of MICAz mote
DOWNLOAD
FULL PDF
Authors: Weilian Su and
Mohamad Alzaghal
Abstract: Wireless Sensor Networks (WSNs) is an important field of study as
more and more applications are enhancing daily life. The technology trend is
to achieve small-sized, cheap, and power efficient sensor nodes, which will
make the system reliable and efficient. The Crossbow Technologies MICAz mote
is an example used in this paper. Measurements of its propagation
characteristics in a realistic environment will help the deployment and
installation of these motes to form a WSN. The CST Microwave Studio is used
to build a simulation of the MICAz. The results and comparisons between
empirical and simulated data are intended to assist in the design, future
studies and deployment of WSNs in the real world.
Keywords: Wireless
Sensor Networks, Propagation Characteristics, MICAz Motes
Title of
the Paper: Preventing Conflict Situations
During Authorization
DOWNLOAD
FULL PDF
Authors: Slvia Encheva
and Sharil Tumin
Abstract: Computer-based access control systems working with financial and
privacy issues are concerned with access control policies. Structuring
authorizations turns out to be of a key importance in a case of collaborating
organizations.
Keywords:
Computer-based access control systems
Title of
the Paper: E-Research Centre and E-Creative
Design new Trends for E-Activities Platform
DOWNLOAD
FULL PDF
Authors: Sorin Borza,
Dan Pual Brindasu, Livia Beju and Marinela Inta
Abstract: In this paper the author introduces the concept of E-creative
design, which refers to the use of methods and techniques (modify for
internet application) for stimulating the individual and group creativity in
a design session using an e-research center for the researchers in the field
of mechanical engineering sciences as well as its development and integration
in the existing national and international infrastructure. The goal of this
center is to include as many researchers from our faculty initially, then
from our university, our geographic area, our country, from all over the
world. To this purpose, the center sets itself to promote and support new
e-research projects, to encourage the building of multidisciplinary groups
that should cooperate among themselves and share resources and
infrastructure. One of this is E-Creative Design. The E-Creative design
methodology is presented first, step by strep in the pseudo code language. In
order to use creative methods on internet, the morphological analysis and “San Francisco”
creativity methods were presented from this new perspective.Finally the main
functions of a research-design platform were elaborated. An example of
E-creative session on Internet in cutting tool area completes the
presentation.
Keywords:
e-research, e-science, cyberstructure, midleware, virtual centre, e-design,
grid
Title of
the Paper: A Comprehensive Taxonomy of DDoS
Attacks and Defense Mechanism Applying in a Smart Classification
DOWNLOAD
FULL PDF
Authors: Dr. Abbass
Asosheh and Naghmeh Ramezani
Abstract: A Distributed denial of service (DDoS) attack uses multiple
machines operating in concern to attack a network or site. It is the most
important security problem for IT managers. These attacks are very simple
organized for intruders and hence so disruptive. The detection and defense of
this attack has specific importance among network specialists. In this paper
a new and smart taxonomy of DDoS attack and defense mechanism will be
introduced. The attacks taxonomy is introduced using both known and potential
attack mechanisms. It comprises all types of attacks and provides a
comprehensive point of view for DDoS attacks. We introduce a useful tool that
can be employed to a sophisticated selection defense method for DDoS attacks.
Furthermore a smart taxonomy method of DDOS attacks will be proposed to help
selection an appropriate defense mechanism. This method uses some features of
DDOS attacks and classifies it to several clusters by Kmean algorithm and
labels each cluster with a defense mechanism. If an IDS detects a DDOS
attack, proposed system extract attack features and classify it by KNN
(K-Nearest-Neighbor) to determine the cluster in which it belongs to. The
defense mechanisms taxonomy is using the currently known approaches. Also the
comprehensive defense classification will help to find the appropriate
strategy to overcome the DDoS attack.
Keywords:
DDoS attack, Defense mechanism, Taxonomy, Detection, Smart Classification
Title of
the Paper: Parallelization of Prime Number
Generation Using Message Passing Interface
DOWNLOAD
FULL PDF
Authors: Izzatdin Aziz,
Nazleeni Haron, Low Tan Jung and Wan Rahaya Wan Dagang
Abstract: In this research, we propose a parallel processing algorithm that
runs on cluster architecture suitable for prime number generation. The
proposed approach was written using Message Passing Interface (MPI) and is
meant to decrease computational cost and accelerate the prime number
generation process. Several experimental results conducted using High
Performance Linpack (HPL) benchmark are presented to demonstrate the
viability of our work. The results suggest that the performance of our work
is at par with other parallel algorithms.
Keywords:
Prime number generation, parallel processing, cluster architecture, MPI,
primality test.
Title of
the Paper: Experiment Replication and
Meta-Analysis in Evaluation of Intelligent Tutoring System’s Effectiveness
DOWNLOAD
FULL PDF
Authors: Ani Grubisic,
Slavomir Stankov and Branko Zitko
Abstract: This paper presents the methodology for conducting controlled
experiment replication, as well as, the results of a controlled experiment
and an internal replication that investigated the effectiveness of an
intelligent tutoring system. Since, there doesn’t seem to be a common ground
on guidelines for the replication of experiments in intelligent tutoring
system’s educational influence evaluation, this scientific method has just
started to be applied to this propulsive research field. We believe that
every effectiveness evaluation should be replicated at least in order to
verify the original results and to indicate an evaluated e-learning system’s
advantages or disadvantages. On the grounds of experiment replication, a
meta-analysis can be conducted in order to calculate overall intelligent
tutoring system effectiveness.
Keywords:
e-learning, intelligent tutoring systems, evaluation, effect size,
effectiveness, experiment, replication, meta-analysis
Title of
the Paper: Context-aware Learning Path Planner
DOWNLOAD
FULL PDF
Authors: Maiga Chang,
Alex Chang, Jia-Sheng Heh, Tzu-Chien Liu
Abstract: This paper develops a context-awareness learning path planner. The
learning path planner constructs suitable learning path for individual
student according to his/her misconceptions of the learning objects and the
distances in the real world. Beside the remedy learning path, the planner
also provides two guidance messages to students, the moving guidance message
and the learning guidance messages. The moving guidance messages are used to
lead students traveling from one learning spot to another. The learning
guidance messages are used to guide students observing the specific part of the
learning objects in order to clear their misconceptions. At the end of this
paper, an example is showing how the planner works for learning in a museum.
Keywords: Mobile Learning, Learning Path, Knowledge Structure,
Misconception, Situated Learning
Title of
the Paper: Assembly Time Minimization for an
Electronic Component Placement Machine
DOWNLOAD
FULL PDF
Authors: Ali Fuat
Alkaya, Ekrem Duman and Akif Eyler
Abstract: In this study, a new algorithm for a particular component placement
machine is proposed. Also, a pairwise exchange procedure is designed and
applied after the proposed algorithm. In the analyzed machine, previously
proposed algorithms were mounting the components from lightest to heaviest
where we propose to mount the components from heaviest to lightest. This
method brings new opportunities in terms of performance gain on typical Printed
Circuit Boards produced in the industry. The new algorithm is compared with
former approaches on synthetically generated instances. It outperforms the
former approaches by 1.54 percent on printed circuit boards with 100
components to be placed. It gives better results in 96 out of 100 instances.
Applying the designed pairwise exchange procedure after the proposed
algorithm further improves the total assembly time. Moreover, by taking
advantage of inherent design of the analyzed PCBs, other promising improvement
procedures are also suggested for minimizing total assembly time. By applying
all the suggested | 
