Abstract: In this work, we propose a hybrid heuristic in order to
solve the Team Orienteering Problem (TOP). Given a set of points (or
customers), each with associated score (profit or benefit), and a team
that has a fixed number of members, the problem to solve is to visit a
subset of points in order to maximize the total collected score. Each
member performs a tour starting at the start point, visiting distinct
customers and the tour terminates at the arrival point. In addition,
each point is visited at most once, and the total time in each tour
cannot be greater than a given value. The proposed heuristic combines
beam search and a local optimization strategy. The algorithm was
tested on several sets of instances and encouraging results were
obtained.
Abstract: The Chinese Postman Problem (CPP) is one of the
classical problems in graph theory and is applicable in a wide range
of fields. With the rapid development of hybrid systems and model
based testing, Chinese Postman Problem with Time Dependent Travel
Times (CPPTDT) becomes more realistic than the classical problems.
In the literature, we have proposed the first integer programming
formulation for the CPPTDT problem, namely, circuit formulation,
based on which some polyhedral results are investigated and a cutting
plane algorithm is also designed. However, there exists a main drawback:
the circuit formulation is only available for solving the special
instances with all circuits passing through the origin. Therefore, this
paper proposes a new integer programming formulation for solving
all the general instances of CPPTDT. Moreover, the size of the circuit
formulation is too large, which is reduced dramatically here. Thus, it
is possible to design more efficient algorithm for solving the CPPTDT
in the future research.
Abstract: Lossless compression schemes with secure
transmission play a key role in telemedicine applications that helps in
accurate diagnosis and research. Traditional cryptographic algorithms
for data security are not fast enough to process vast amount of data.
Hence a novel Secured lossless compression approach proposed in
this paper is based on reversible integer wavelet transform, EZW
algorithm, new modified runlength coding for character
representation and selective bit scrambling. The use of the lifting
scheme allows generating truly lossless integer-to-integer wavelet
transforms. Images are compressed/decompressed by well-known
EZW algorithm. The proposed modified runlength coding greatly
improves the compression performance and also increases the
security level. This work employs scrambling method which is fast,
simple to implement and it provides security. Lossless compression
ratios and distortion performance of this proposed method are found
to be better than other lossless techniques.
Abstract: Processing the data by computers and performing
reasoning tasks is an important aim in Computer Science. Semantic
Web is one step towards it. The use of ontologies to enhance the
information by semantically is the current trend. Huge amount of
domain specific, unstructured on-line data needs to be expressed in
machine understandable and semantically searchable format.
Currently users are often forced to search manually in the results
returned by the keyword-based search services. They also want to use
their native languages to express what they search. In this paper, an
ontology-based automated question answering system on software
test documents domain is presented. The system allows users to enter
a question about the domain by means of natural language and
returns exact answer of the questions. Conversion of the natural
language question into the ontology based query is the challenging
part of the system. To be able to achieve this, a new algorithm
regarding free text to ontology based search engine query conversion
is proposed. The algorithm is based on investigation of suitable
question type and parsing the words of the question sentence.
Abstract: The main purpose of the research is to address the role of psychological harassment behaviors (mobbing) to which employees are exposed and personality characteristics over work alienation. Research population was composed of the employees of Provincial Special Administration. A survey with four sections was created to measure variables and reach out the basic goals of the research. Correlation and step-wise regression analyses were performed to investigate the separate and overall effects of sub-dimensions of psychological harassment behaviors and personality characteristic on work alienation of employees. Correlation analysis revealed significant but weak relationships between work alienation and psychological harassment and personality characteristics. Step-wise regression analysis revealed also significant relationships between work alienation variable and assault to personality, direct negative behaviors (sub dimensions of mobbing) and openness (sub-dimension of personality characteristics). Each variable was introduced into the model step by step to investigate the effects of significant variables in explaining the variations in work alienation. While the explanation ratio of the first model was 13%, the last model including three variables had an explanation ratio of 24%.
Abstract: In order to accelerate the similarity search in highdimensional database, we propose a new hierarchical indexing method. It is composed of offline and online phases. Our contribution concerns both phases. In the offline phase, after gathering the whole of the data in clusters and constructing a hierarchical index, the main originality of our contribution consists to develop a method to construct bounding forms of clusters to avoid overlapping. For the online phase, our idea improves considerably performances of similarity search. However, for this second phase, we have also developed an adapted search algorithm. Our method baptized NOHIS (Non-Overlapping Hierarchical Index Structure) use the Principal Direction Divisive Partitioning (PDDP) as algorithm of clustering. The principle of the PDDP is to divide data recursively into two sub-clusters; division is done by using the hyper-plane orthogonal to the principal direction derived from the covariance matrix and passing through the centroid of the cluster to divide. Data of each two sub-clusters obtained are including by a minimum bounding rectangle (MBR). The two MBRs are directed according to the principal direction. Consequently, the nonoverlapping between the two forms is assured. Experiments use databases containing image descriptors. Results show that the proposed method outperforms sequential scan and SRtree in processing k-nearest neighbors.
Abstract: This research intends to introduce a new usage of Artificial Intelligent (AI) approaches in Stepping Stone Detection (SSD) fields of research. By using Self-Organizing Map (SOM) approaches as the engine, through the experiment, it is shown that SOM has the capability to detect the number of connection chains that involved in a stepping stones. Realizing that by counting the number of connection chain is one of the important steps of stepping stone detection and it become the research focus currently, this research has chosen SOM as the AI techniques because of its capabilities. Through the experiment, it is shown that SOM can detect the number of involved connection chains in Network-based Stepping Stone Detection (NSSD).
Abstract: 'Secure routing in Mobile Ad hoc networks' and
'Internet connectivity to Mobile Ad hoc networks' have been dealt
separately in the past research. This paper proposes a light weight
solution for secure routing in integrated Mobile Ad hoc Network
(MANET)-Internet. The proposed framework ensures mutual
authentication of Mobile Node (MN), Foreign Agent (FA) and Home
Agent (HA) to avoid various attacks on global connectivity and
employs light weight hop-by-hop authentication and end-to-end
integrity to protect the network from most of the potential security
attacks. The framework also uses dynamic security monitoring
mechanism to monitor the misbehavior of internal nodes. Security
and performance analysis show that our proposed framework
achieves good security while keeping the overhead and latency
minimal.
Abstract: Missing data is a persistent problem in almost all
areas of empirical research. The missing data must be treated very
carefully, as data plays a fundamental role in every analysis.
Improper treatment can distort the analysis or generate biased results.
In this paper, we compare and contrast various imputation techniques
on missing data sets and make an empirical evaluation of these
methods so as to construct quality software models. Our empirical
study is based on NASA-s two public dataset. KC4 and KC1. The
actual data sets of 125 cases and 2107 cases respectively, without
any missing values were considered. The data set is used to create
Missing at Random (MAR) data Listwise Deletion(LD), Mean
Substitution(MS), Interpolation, Regression with an error term and
Expectation-Maximization (EM) approaches were used to compare
the effects of the various techniques.
Abstract: The research titled “Developing of Thai Classical Music Ensemble in Rattanakosin Period" aimed 1) to study the history of Thai Classical Music Ensemble in Rattanakosin Period and 2) to analyze changing in each period of Rattanakosin Era. This is the historical and documentary research. The data was collected by in-depth interview those musicians, and academic music experts and field study. The focus group discussion was conducted to analyze and conclude the findings. The research found that the history of Thai Classical Music Ensemble in Rattanakosin Period derived from the Ayutthaya period. Thai classical music ensemble consisted of “Wong Pipat", “Wong Mahori", “Wong Kreang Sai". “Wong Kubmai", “Wong Krongkak", “Brass Band", and “Kan Band" which were used to ceremony, ritual, drama, performs and entertainment. Changed of the Thai music in the early Rattanakosin Period were passed from the Ayutthaya Period and the influence of the western civilization. New Band formed in Thai Music were “Orchestra" and “Contemporary Band". The role of Thai music was changed from the ceremonial rituals to entertainment. Development of the Thai music during the reign of King Rama 1 to King Rama 7, was improved from the court. But after the revolution, the musical patronage of the court was maintained by the Government. Thai Classical Music Ensemble were performed to be standard pattern.
Abstract: In this paper, the use of beam search and look-ahead strategies for solving the strip packing problem (SPP) is investigated. Given a strip of fixed width W, unlimited length L, and a set of n circular pieces of known radii, the objective is to determine the minimum length of the initial strip that packs all the pieces. An augmented algorithm which combines beam search and a look-ahead strategies is proposed. The look-ahead is used in order to evaluate the nodes at each level of the tree search. The best nodes are then retained for branching. The computational investigation showed that the proposed augmented algorithm is able to improve the best known solutions of the literature on most instances used.
Abstract: Bacterial magnetic nanoparticles have great useful potential in biotechnological and biomedical applications. In this study, a liquid growth medium was modified for cultivation a fastidious magnetotactic bacterium that has been isolated from Anzali
lagoon, Iran in our previous research. These modifications include
change in vitamin, mineral, carbon sources and etcetera. In our
experience, the serum bottles and designed air-tight laboratory bottles
were used to create microaerobic conditions in order to development
of a method for scale-up experiment. This information may serve as a
guide to green chemistry based biological protocols for the synthesis
of magnetic nanoparticles with control over the chemical
composition, morphology and size.
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.
Abstract: The increasing popularity of wireless technologies
and mobile computing devices has enabled new application areas and
research. One of these new areas is pervasive systems in urban
environments, because urban environments are characterized by high
concentration of these technologies and devices. In this paper we will
show the process of pervasive system design in urban environments,
using as use case a local zoo in Cali, Colombia. Based on an
ethnographic studio, we present the design of a pervasive system for
urban computing based on service oriented architecture to controlled
environment of Cali Zoo. In this paper, the reader will find a
methodological approach for the design of similar systems, using
data collection methods, conceptual frameworks for urban
environments and considerations of analysis and design of service
oriented systems.
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: Rainfall records of rainfall station including the
rainfall potential per hour and rainfall mass of five heavy storms are
explored, respectively from 2001 to 2010. The rationalization formula
is to investigate the capability of flood peak duration of flood
detention pond in different rainfall conditions. The stable flood
detention model is also proposed by using system dynamic control
theory to get the message of flood detention pond in this research.
When rainfall frequency of one hour rainfall duration is more than
100-year frequency which exceeds the flood detention standard of
20-year frequency for the flood detention pond, the flood peak
duration of flood detention pond is 1.7 hours at most even though the
flood detention pond with maximum drainage potential about 15.0
m3/s of pumping system is constructed. If the rainfall peak current is
more than maximum drainage potential, the flood peak duration of
flood detention pond is about 1.9 hours at most. The flood detention
pond is the key factor of stable drainage control and flood prevention.
The critical factors of flood disaster is not only rainfall mass, but also
rainfall frequency of heavy storm in different rainfall duration and
flood detention frequency of flood detention system.
Abstract: Quantitative Structure-Activity Relationship (QSAR)
approach for discovering novel more active Calanone derivative as
anti-leukemia compound has been conducted. There are 6
experimental activities of Calanone compounds against leukemia cell
L1210 that are used as material of the research. Calculation of
theoretical predictors (independent variables) was performed by
AM1 semiempirical method. The QSAR equation is determined by
Principle Component Regression (PCR) analysis, with Log IC50 as
dependent variable and the independent variables are atomic net
charges, dipole moment (μ), and coefficient partition of noctanol/
water (Log P). Three novel Calanone derivatives that
obtained by this research have higher activity against leukemia cell
L1210 than pure Calanone.
Abstract: The purpose of this study is to discuss the effect of the
intervention of exercise behavior change plan for high school students
on study subjects- social and psychological factors and exercise
stages. This research uses the transtheoretical model as the research
framework. One experiment group and one control group were used in
a quasi-experimental design research. The experimental group
accepted health-related physical fitness course and the traditional
course; the control group accepted traditional physical education
course. There is a significant difference before and after the
intervention in the experimental group. Karl-s test shows the
experimental group gained a better improvement than that in the
control group. The Analysis of Covariance had shown the exercise
stages (F=7.62, p
Abstract: This article presents the developments of efficient
algorithms for tablet copies comparison. Image recognition has
specialized use in digital systems such as medical imaging,
computer vision, defense, communication etc. Comparison between
two images that look indistinguishable is a formidable task. Two
images taken from different sources might look identical but due to
different digitizing properties they are not. Whereas small variation
in image information such as cropping, rotation, and slight
photometric alteration are unsuitable for based matching
techniques. In this paper we introduce different matching
algorithms designed to facilitate, for art centers, identifying real
painting images from fake ones. Different vision algorithms for
local image features are implemented using MATLAB. In this
framework a Table Comparison Computer Tool “TCCT" is
designed to facilitate our research. The TCCT is a Graphical Unit
Interface (GUI) tool used to identify images by its shapes and
objects. Parameter of vision system is fully accessible to user
through this graphical unit interface. And then for matching, it
applies different description technique that can identify exact
figures of objects.
Abstract: Names are important in many societies, even in technologically oriented ones which use e.g. ID systems to identify individual people. Names such as surnames are the most important as they are used in many processes, such as identifying of people and genealogical research. On the other hand variation of names can be a major problem for the identification and search for people, e.g. web search or security reasons. Name matching presumes a-priori that the recorded name written in one alphabet reflects the phonetic identity of two samples or some transcription error in copying a previously recorded name. We add to this the lode that the two names imply the same person. This paper describes name variations and some basic description of various name matching algorithms developed to overcome name variation and to find reasonable variants of names which can be used to further increasing mismatches for record linkage and name search. The implementation contains algorithms for computing a range of fuzzy matching based on different types of algorithms, e.g. composite and hybrid methods and allowing us to test and measure algorithms for accuracy. NYSIIS, LIG2 and Phonex have been shown to perform well and provided sufficient flexibility to be included in the linkage/matching process for optimising name searching.