Abstract: In this study, a new criterion for determining the number of classes an image should be segmented is proposed. This criterion is based on discriminant analysis for measuring the separability among the segmented classes of pixels. Based on the new discriminant criterion, two algorithms for recursively segmenting the image into determined number of classes are proposed. The proposed methods can automatically and correctly segment objects with various illuminations into separated images for further processing. Experiments on the extraction of text strings from complex document images demonstrate the effectiveness of the proposed methods.1
Abstract: Music segmentation is a key issue in music information
retrieval (MIR) as it provides an insight into the
internal structure of a composition. Structural information about
a composition can improve several tasks related to MIR such
as searching and browsing large music collections, visualizing
musical structure, lyric alignment, and music summarization.
The authors of this paper present the MTSSM framework, a twolayer
framework for the multi-track segmentation of symbolic
music. The strength of this framework lies in the combination of
existing methods for local track segmentation and the application
of global structure information spanning via multiple tracks.
The first layer of the MTSSM uses various string matching
techniques to detect the best candidate segmentations for each
track of a multi-track composition independently. The second
layer combines all single track results and determines the best
segmentation for each track in respect to the global structure of
the composition.
Abstract: Thai and Vietnamese music had been influenced and inspired by the traditional Chinese music. Whereby the differences of the tuning systems as well as the music modes are obviously known . The research examined the character of musical instruments, songs and culture between Thai and Vietnamese. An analyzing of songs and modes and the study of tone vibration as well as timbre had been done accurately. This qualitative research is based on documentary and songs analysis, field study, interviews and focus group discussion of Thai and Vietnamese masters. The research aims are to examine the musical instruments and songs of both Thai and Vietnamese as well as the comparison of the sounding system between Thailand and Vietnam. The finding of the research has revealed that there are similarities in certain kinds of instruments but differences in the sound systems regarding songs and scale of Thailand and Vietnam. Both cultural musical instruments are diverse and synthetic combining native and foreign inspiring. An integral part of Vietnam has been highly impacted by Chinese musical convention. Korea, Mongolia and Japan music have also play an active and effectively influenced as their geographical related. Whereas Thailand has been influenced by Chinese and Indian traditional music. Both Thai and Vietnamese musical instruments can be divided into four groups: plucked strings, bowed strings, winds and percussion. Songs from both countries have their own characteristics. They are playing a role in touching people heart in ceremonies, social functions and an essential element of the native performing arts. The Vietnamese music melodies have been influenced by Chinese music and taken the same character as Chinese songs. Thai song has specific identity and variety showed in its unique melody. Pentatonic scales have effectively been used in composing Thai and Vietnamese songs, but in different implementing concept.
Abstract: Determining reasonable fees is the main objective of designing the cost estimation and payment systems for consultant contracts. However, project clients utilize different cost estimation and payment systems because of their varying views on the reasonableness of consultant fees. This study reviews the cost estimation and payment systems of consultant contracts for five countries, including the US (Washington State Department of Transportation), Japan (Ministry of Land, Infrastructure, Transport and Tourism), China (Engineering Design Charging Standard) and UK (Her Majesty's Treasure). Specifically, this work investigates the budgeting process, contractor selection method, contractual price negotiation process, cost review, and cost-control concept of the systems used in these countries. The main finding indicates that that project client-s view on whether the fee is high will affect the way he controls it. In the US, the fee is commonly considered to be high. As a result, stringent auditing system (low flexibility given to the consultant) is then applied. In the UK, the fee is viewed to be low by comparing it to the total life-cycle project cost. Thus, a system that has high flexibility in budgeting and cost reviewing is given to the consultant. In terms of the flexibility allowed for the consultant, the systems applied in Japan and China fall between those of the US and UK. Both the US and UK systems are helpful in determining a reasonable fee. However, in the US system, rigid auditing standards must be established and additional cost-audit manpower is required. In the UK system, sufficient historical cost data should be needed to evaluate the reasonableness of the consultant-s proposed fee
Abstract: We present a hybrid architecture of recurrent neural
networks (RNNs) inspired by hidden Markov models (HMMs). We
train the hybrid architecture using genetic algorithms to learn and
represent dynamical systems. We train the hybrid architecture on a
set of deterministic finite-state automata strings and observe the
generalization performance of the hybrid architecture when presented
with a new set of strings which were not present in the training data
set. In this way, we show that the hybrid system of HMM and RNN
can learn and represent deterministic finite-state automata. We ran
experiments with different sets of population sizes in the genetic
algorithm; we also ran experiments to find out which weight
initializations were best for training the hybrid architecture. The
results show that the hybrid architecture of recurrent neural networks
inspired by hidden Markov models can train and represent dynamical
systems. The best training and generalization performance is
achieved when the hybrid architecture is initialized with random real
weight values of range -15 to 15.
Abstract: The static stability analysis of stiffened functionally
graded cylindrical shells by isotropic rings and stringers subjected to
axial compression is presented in this paper. The Young's modulus of
the shell is taken to be function of the thickness coordinate. The
fundamental relations, the equilibrium and stability equations are
derived using the Sander's assumption. Resulting equations are
employed to obtain the closed-form solution for the critical axial
loads. The effects of material properties, geometric size and different
material coefficient on the critical axial loads are examined. The
analytical results are compared and validated using the finite element
model.
Abstract: Bioinformatics and Cheminformatics use computer as disciplines providing tools for acquisition, storage, processing, analysis, integrate data and for the development of potential applications of biological and chemical data. A chemical database is one of the databases that exclusively designed to store chemical information. NMRShiftDB is one of the main databases that used to represent the chemical structures in 2D or 3D structures. SMILES format is one of many ways to write a chemical structure in a linear format. In this study we extracted Antimicrobial Structures in SMILES format from NMRShiftDB and stored it in our Local Data Warehouse with its corresponding information. Additionally, we developed a searching tool that would response to user-s query using the JME Editor tool that allows user to draw or edit molecules and converts the drawn structure into SMILES format. We applied Quick Search algorithm to search for Antimicrobial Structures in our Local Data Ware House.
Abstract: The Far From Most Strings Problem (FFMSP) is to obtain a string which is far from as many as possible of a given set of strings. All the input and the output strings are of the same length, and two strings are said to be far if their hamming distance is greater than or equal to a given positive integer. FFMSP belongs to the class of sequences consensus problems which have applications in molecular biology. The problem is NP-hard; it does not admit a constant-ratio approximation either, unless P = NP. Therefore, in addition to exact and approximate algorithms, (meta)heuristic algorithms have been proposed for the problem in recent years. On the other hand, in the recent years, hybrid algorithms have been proposed and successfully used for many hard problems in a variety of domains. In this paper, a new metaheuristic algorithm, called Constructive Beam and Local Search (CBLS), is investigated for the problem, which is a hybridization of constructive beam search and local search algorithms. More specifically, the proposed algorithm consists of two phases, the first phase is to obtain several candidate solutions via the constructive beam search and the second phase is to apply local search to the candidate solutions obtained by the first phase. The best solution found is returned as the final solution to the problem. The proposed algorithm is also similar to memetic algorithms in the sense that both use local search to further improve individual solutions. The CBLS algorithm is compared with the most recent published algorithm for the problem, GRASP, with significantly positive results; the improvement is by order of magnitudes in most cases.
Abstract: At a time of growing market turbulence and a strong
shifts towards increasingly complex risk models and more stringent audit requirements, it is more critical than ever to maintain the highest quality of financial and credit information. IFC implemented
an approach that helps increase data integrity and quality significantly. This approach is called “Screening". Screening is based on linking information from different sources to identify potential
inconsistencies in key financial and credit data. That, in turn, can help
to ease the trials of portfolio supervision, and improve overall company global reporting and assessment systems. IFC experience
showed that when used regularly, Screening led to improved information.
Abstract: The research is to minimize environmental damage
pertinent to maritime activities about the operation of lighter boat
anchorage and its tugboat. The guidance on upgrading current
harbor service and infrastructure has been provided to Kho Sichang
Municpality. This will involve a study of the maritime logistics of
the water area under jurisdiction of the Sichang island Municipality
and possible recommendations may involve charging taxes,
regulations and fees. With implementing these recommendations will
help in protection of the marine environment and in increasing
operator functionality. Additionally, our recommendation is to
generate a consistent revenue stream to the municipality. The action
items contained in this research are feasible and effective, the success
of these initiatives are heavily dependent upon successful promotion
and enforcement. Promoting new rules and regulations effectively
and peacefully can be done through theories and techniques used in
the psychology of persuasion. In order to assure compliance with the
regulations, the municipality must maintain stringent patrols and
fines for violators. In order to become success, the Municipality
must preserve a consistent, transparent and significant enforcement
system. Considering potential opportunities outside of the current
state of the municipality, the authors recommend that Koh Sichang be
given additional jurisdiction to capture value from the master vessels,
as well as to confront the more significant environmental challenges
these vessels pose. Finally, the authors recommend that the Port of
Koh Sichang Island obtain a free port status in order to increase
economic viability and overall sustainability.
Abstract: A new, combinatorial model for analyzing and inter-
preting an electrocardiogram (ECG) is presented. An application of
the model is QRS peak detection. This is demonstrated with an
online algorithm, which is shown to be space as well as time efficient.
Experimental results on the MIT-BIH Arrhythmia database show that
this novel approach is promising. Further uses for this approach are
discussed, such as taking advantage of its small memory requirements
and interpreting large amounts of pre-recorded ECG data.
Abstract: Quasigroups are algebraic structures closely related to
Latin squares which have many different applications. The
construction of block cipher is based on quasigroup string
transformation. This article describes a block cipher based
Quasigroup of order 256, suitable for fast software encryption of
messages written down in universal ASCII code. The novelty of this
cipher lies on the fact that every time the cipher is invoked a new set
of two randomly generated quasigroups are used which in turn is
used to create a pair of quasigroup of dual operations. The
cryptographic strength of the block cipher is examined by calculation
of the xor-distribution tables. In this approach some algebraic
operations allows quasigroups of huge order to be used without any
requisite to be stored.
Abstract: Generalized Center String (GCS) problem are
generalized from Common Approximate Substring problem
and Common substring problems. GCS are known to be
NP-hard allowing the problems lies in the explosion of
potential candidates. Finding longest center string without
concerning the sequence that may not contain any motifs is
not known in advance in any particular biological gene
process. GCS solved by frequent pattern-mining techniques
and known to be fixed parameter tractable based on the
fixed input sequence length and symbol set size. Efficient
method known as Bpriori algorithms can solve GCS with
reasonable time/space complexities. Bpriori 2 and Bpriori
3-2 algorithm are been proposed of any length and any
positions of all their instances in input sequences. In this
paper, we reduced the time/space complexity of Bpriori
algorithm by Constrained Based Frequent Pattern mining
(CBFP) technique which integrates the idea of Constraint
Based Mining and FP-tree mining. CBFP mining technique
solves the GCS problem works for all center string of any
length, but also for the positions of all their mutated copies
of input sequence. CBFP mining technique construct TRIE
like with FP tree to represent the mutated copies of center
string of any length, along with constraints to restraint
growth of the consensus tree. The complexity analysis for
Constrained Based FP mining technique and Bpriori
algorithm is done based on the worst case and average case
approach. Algorithm's correctness compared with the
Bpriori algorithm using artificial data is shown.
Abstract: Authentication plays a vital role in many secure
systems. Most of these systems require user to log in with his or her
secret password or pass phrase before entering it. This is to ensure all
the valuables information is kept confidential guaranteeing also its
integrity and availability. However, to achieve this goal, users are
required to memorize high entropy passwords or pass phrases.
Unfortunately, this sometimes causes difficulty for user to remember
meaningless strings of data. This paper presents a new scheme which
assigns a weight to each personal question given to the user in
revealing the encrypted secrets or password. Concentration of this
scheme is to offer fault tolerance to users by allowing them to forget
the specific password to a subset of questions and still recover the
secret and achieve successful authentication. Comparison on level of
security for weight-based and weightless secret recovery scheme is
also discussed. The paper concludes with the few areas that requires
more investigation in this research.
Abstract: A numerical solution of the initial boundary value
problem of the suspended string vibrating equation with the
particular nonlinear damping term based on the finite difference
scheme is presented in this paper. The investigation of how the
second and third power terms of the nonlinear term affect the
vibration characteristic. We compare the vibration amplitude as a
result of the third power nonlinear damping with the second power
obtained from previous report provided that the same initial shape
and initial velocities are assumed. The comparison results show that
the vibration amplitude is inversely proportional to the coefficient of
the damping term for the third power nonlinear damping case, while
the vibration amplitude is proportional to the coefficient of the
damping term in the second power nonlinear damping case.
Abstract: In this paper, we propose a selective mutation method
for improving the performances of genetic algorithms. In selective
mutation, individuals are first ranked and then additionally mutated
one bit in a part of their strings which is selected corresponding to
their ranks. This selective mutation helps genetic algorithms to fast
approach the global optimum and to quickly escape local optima.
This results in increasing the performances of genetic algorithms.
We measured the effects of selective mutation with four function
optimization problems. It was found from extensive experiments that
the selective mutation can significantly enhance the performances of
genetic algorithms.
Abstract: All Text processing systems allow their users to
search a pattern of string from a given text. String matching is
fundamental to database and text processing applications. Every text
editor must contain a mechanism to search the current document for
arbitrary strings. Spelling checkers scan an input text for words in the
dictionary and reject any strings that do not match. We store our
information in data bases so that later on we can retrieve the same
and this retrieval can be done by using various string matching
algorithms. This paper is describing a new string matching algorithm
for various applications. A new algorithm has been designed with the
help of Rabin Karp Matcher, to improve string matching process.
Abstract: In this paper, a novel method for a biometric system based on the ECG signal is proposed, using spectral coefficients computed through linear predictive coding (LPC). ECG biometric systems have traditionally incorporated characteristics of fiducial points of the ECG signal as the feature set. These systems have been shown to contain loopholes and thus a non-fiducial system allows for tighter security. In the proposed system, incorporating non-fiducial features from the LPC spectrum produced a segment and subject recognition rate of 99.52% and 100% respectively. The recognition rates outperformed the biometric system that is based on the wavelet packet decomposition (WPD) algorithm in terms of recognition rates and computation time. This allows for LPC to be used in a practical ECG biometric system that requires fast, stringent and accurate recognition.
Abstract: Traditional parallel single string matching algorithms
are always based on PRAM computation model. Those algorithms
concentrate on the cost optimal design and the theoretical speed.
Based on the distributed string matching algorithm proposed by
CHEN, a practical distributed string matching algorithm architecture
is proposed in this paper. And also an improved single string matching
algorithm based on a variant Boyer-Moore algorithm is presented. We
implement our algorithm on the above architecture and the
experiments prove that it is really practical and efficient on distributed
memory machine. Its computation complexity is O(n/p + m), where n
is the length of the text, and m is the length of the pattern, and p is the
number of the processors.
Abstract: As a structure for processing string problem, suffix
array is certainly widely-known and extensively-studied. But if the
string access pattern follows the “90/10" rule, suffix array can not take
advantage of the fact that we often find something that we have just
found. Although the splay tree is an efficient data structure for small
documents when the access pattern follows the “90/10" rule, it
requires many structures and an excessive amount of pointer
manipulations for efficiently processing and searching large
documents. In this paper, we propose a new and conceptually powerful
data structure, called splay suffix arrays (SSA), for string search. This
data structure combines the features of splay tree and suffix arrays into
a new approach which is suitable to implementation on both
conventional and clustered computers.