Abstract: We demonstrate the synthesis of intermediary views
within a sequence of color encoded, materials discriminating, X-ray
images that exhibit animated depth in a visual display. During the
image acquisition process, the requirement for a linear X-ray detector
array is replaced by synthetic image. Scale Invariant Feature
Transform, SIFT, in combination with material segmented morphing
is employed to produce synthetic imagery. A quantitative analysis of
the feature matching performance of the SIFT is presented along with
a comparative study of the synthetic imagery. We show that the total
number of matches produced by SIFT reduces as the angular
separation between the generating views increases. This effect is
accompanied by an increase in the total number of synthetic pixel
errors. The trends observed are obtained from 15 different luggage
items. This programme of research is in collaboration with the UK
Home Office and the US Dept. of Homeland Security.
Abstract: An electric power system includes a generating, a
transmission, a distribution, and consumers subsystems. An electrical
power network in Tanzania keeps growing larger by the day and
become more complex so that, most utilities have long wished for
real-time monitoring and remote control of electrical power system
elements such as substations, intelligent devices, power lines,
capacitor banks, feeder switches, fault analyzers and other physical
facilities. In this paper, the concept of automation of management of
power systems from generation level to end user levels was
determined by using Power System Simulator for Engineering
(PSS/E) version 30.3.2.
Abstract: An application framework provides a reusable design
and implementation for a family of software systems. Application
developers extend the framework to build their particular
applications using hooks. Hooks are the places identified to show
how to use and customize the framework. Hooks define the
Framework Interface Classes (FICs) and their possible specifications,
which helps in building reusable test cases for the implementations of
these classes. This paper introduces a novel technique called all
paths-state to generate state-based test cases to test the FICs at class
level. The technique is experimentally evaluated. The empirical
evaluation shows that all paths-state technique produces test cases
with a high degree of coverage for the specifications of the
implemented FICs comparing to test cases generated using round-trip
path and all-transition techniques.
Abstract: This paper discusses the causal explanation capability
of QRIOM, a tool aimed at supporting learning of organic chemistry
reactions. The development of the tool is based on the hybrid use of
Qualitative Reasoning (QR) technique and Qualitative Process
Theory (QPT) ontology. Our simulation combines symbolic,
qualitative description of relations with quantity analysis to generate
causal graphs. The pedagogy embedded in the simulator is to both
simulate and explain organic reactions. Qualitative reasoning through
a causal chain will be presented to explain the overall changes made
on the substrate; from initial substrate until the production of final
outputs. Several uses of the QPT modeling constructs in supporting
behavioral and causal explanation during run-time will also be
demonstrated. Explaining organic reactions through causal graph
trace can help improve the reasoning ability of learners in that their
conceptual understanding of the subject is nurtured.
Abstract: The problem of frequent itemset mining is considered in this paper. One new technique proposed to generate frequent patterns in large databases without time-consuming candidate generation. This technique is based on focusing on transaction instead of concentrating on itemset. This algorithm based on take intersection between one transaction and others transaction and the maximum shared items between transactions computed instead of creating itemset and computing their frequency. With applying real life transactions and some consumption is taken from real life data, the significant efficiency acquire from databases in generation association rules mining.
Abstract: The current study begins with an awareness that
today-s media environment is characterized by technological
development and a new way of reading caused by the introduction of
the Internet. The researcher conducted a meta analysis framed within
Technological Determinism to investigate the process of hypertext
reading, its differences from linear reading and the effects such
differences can have on people-s ways of mentally structuring their
world. The relationship between literacy and the comprehension
achieved by reading hypertexts is also investigated. The results show
hypertexts are not always user friendly. People experience hyperlinks
as interruptions that distract their attention generating comprehension
and disorientation. On one hand hypertextual jumping reading
generates interruptions that finally make people lose their
concentration. On the other hand hypertexts fascinate people who
would rather read a document in such a format even though the
outcome is often frustrating and affects their ability to elaborate and
retain information.
Abstract: Cryptography provides the secure manner of
information transmission over the insecure channel. It authenticates
messages based on the key but not on the user. It requires a lengthy
key to encrypt and decrypt the sending and receiving the messages,
respectively. But these keys can be guessed or cracked. Moreover,
Maintaining and sharing lengthy, random keys in enciphering and
deciphering process is the critical problem in the cryptography
system. A new approach is described for generating a crypto key,
which is acquired from a person-s iris pattern. In the biometric field,
template created by the biometric algorithm can only be
authenticated with the same person. Among the biometric templates,
iris features can efficiently be distinguished with individuals and
produces less false positives in the larger population. This type of iris
code distribution provides merely less intra-class variability that aids
the cryptosystem to confidently decrypt messages with an exact
matching of iris pattern. In this proposed approach, the iris features
are extracted using multi resolution wavelets. It produces 135-bit iris
codes from each subject and is used for encrypting/decrypting the
messages. The autocorrelators are used to recall original messages
from the partially corrupted data produced by the decryption process.
It intends to resolve the repudiation and key management problems.
Results were analyzed in both conventional iris cryptography system
(CIC) and non-repudiation iris cryptography system (NRIC). It
shows that this new approach provides considerably high
authentication in enciphering and deciphering processes.
Abstract: The evolution of current modeling specifications gives rise to the problem of generating automated test cases from a variety of application tools. Past endeavours on behavioural testing of UML statecharts have not systematically leveraged the potential of existing graph theory for testing of objects. Therefore there exists a need for a simple, tool-independent, and effective method for automatic test generation. An architecture, codenamed ACUTE-J (Automated stateChart Unit Testing Engine for Java), for automating the unit test generation process is presented. A sequential approach for converting UML statechart diagrams to JUnit test classes is described, with the application of existing graph theory. Research byproducts such as a universal XML Schema and API for statechart-driven testing are also proposed. The result from a Java implementation of ACUTE-J is discussed in brief. The Chinese Postman algorithm is utilised as an illustration for a run-through of the ACUTE-J architecture.
Abstract: In this paper we propose new method for
simultaneous generating multiple quantiles corresponding to given
probability levels from data streams and massive data sets. This
method provides a basis for development of single-pass low-storage
quantile estimation algorithms, which differ in complexity, storage
requirement and accuracy. We demonstrate that such algorithms may
perform well even for heavy-tailed data.
Abstract: The development of Artificial Neural Networks
(ANNs) is usually a slow process in which the human expert has to
test several architectures until he finds the one that achieves best
results to solve a certain problem. This work presents a new
technique that uses Genetic Programming (GP) for automatically
generating ANNs. To do this, the GP algorithm had to be changed in
order to work with graph structures, so ANNs can be developed. This
technique also allows the obtaining of simplified networks that solve
the problem with a small group of neurons. In order to measure the
performance of the system and to compare the results with other
ANN development methods by means of Evolutionary Computation
(EC) techniques, several tests were performed with problems based
on some of the most used test databases. The results of those
comparisons show that the system achieves good results comparable
with the already existing techniques and, in most of the cases, they
worked better than those techniques.
Abstract: Adaptive observers used in sensorless control of induction motors suffer from instability especally in regenerating mode. In this paper, an optimal feed back gain design is proposed, it can reduce the instability region in the torque speed plane .
Abstract: This paper presents a new technique for generating sets of synthetic classifiers to evaluate abstract-level combination methods. The sets differ in terms of both recognition rates of the individual classifiers and degree of similarity. For this purpose, each abstract-level classifier is considered as a random variable producing one class label as the output for an input pattern. From the initial set of classifiers, new slightly different sets are generated by applying specific operators, which are defined at the purpose. Finally, the sets of synthetic classifiers have been used to estimate the performance of combination methods for abstract-level classifiers. The experimental results demonstrate the effectiveness of the proposed approach.
Abstract: An effort to develop a unit commitment approach
capable of handling large power systems consisting of both thermal
and hydro generating units offers a large profitable return. In order to
be feasible, the method to be developed must be flexible, efficient
and reliable. In this paper, various proposed methods have been
described along with their strengths and weaknesses. As all of these
methods have some sort of weaknesses, a comprehensive algorithm
that combines the strengths of different methods and overcomes each
other-s weaknesses would be a suitable approach for solving
industry-grade unit commitment problem.
Abstract: In this paper, linear multistep technique using power
series as the basis function is used to develop the block methods
which are suitable for generating direct solution of the special second
order ordinary differential equations with associated initial or
boundary conditions. The continuous hybrid formulations enable us
to differentiate and evaluate at some grids and off – grid points to
obtain two different four discrete schemes, each of order (5,5,5,5)T,
which were used in block form for parallel or sequential solutions of
the problems. The computational burden and computer time wastage
involved in the usual reduction of second order problem into system
of first order equations are avoided by this approach. Furthermore, a
stability analysis and efficiency of the block methods are tested on
linear and non-linear ordinary differential equations and the results
obtained compared favorably with the exact solution.
Abstract: Let n ≥ 3 be an integer and p be a prime odd number. Let us consider Gp(n) the subgroup of (Z/nZ)* defined by : Gp(n) = {x ∈ (Z/nZ)* / xp = 1}. In this paper, we give an algorithm that computes a generating set of this subgroup.
Abstract: Aiming the application of localized hyperthermia, a
magnetic induction system with new approaches is proposed. The techniques in this system for improving the effectiveness of localized hyperthermia are that using magnetic circuit and the multiple-coil array instead of a giant coil for generating magnetic field. Specially, amorphous metal is adopted as the material of magnetic circuit. Detail
design parameters of hardware are well described. Simulation tool is
employed for this work and experiment result is reported as well.
Abstract: This paper presents an efficient emission constrained
hydrothermal scheduling algorithm that deals with nonlinear
functions such as the water discharge characteristics, thermal cost,
and transmission loss. It is then incorporated into the hydrothermal
coordination program. The program has been tested on a practical
utility system having 32 thermal and 12 hydro generating units. Test
results show that a slight increase in production cost causes a
substantial reduction in emission.
Abstract: Most of the well known methods for generating
Gaussian variables require at least one standard uniform distributed
value, for each Gaussian variable generated. The length of the
random number generator therefore, limits the number of
independent Gaussian distributed variables that can be generated
meanwhile the statistical solution of complex systems requires a
large number of random numbers for their statistical analysis. We
propose an alternative simple method of generating almost infinite
number of Gaussian distributed variables using a limited number of
standard uniform distributed random numbers.
Abstract: Serial Analysis of Gene Expression is a powerful
quantification technique for generating cell or tissue gene expression
data. The profile of the gene expression of cell or tissue in several
different states is difficult for biologists to analyze because of the large
number of genes typically involved. However, feature selection in
machine learning can successfully reduce this problem. The method
allows reducing the features (genes) in specific SAGE data, and
determines only relevant genes. In this study, we used a genetic
algorithm to implement feature selection, and evaluate the
classification accuracy of the selected features with the K-nearest
neighbor method. In order to validate the proposed method, we used
two SAGE data sets for testing. The results of this study conclusively
prove that the number of features of the original SAGE data set can be
significantly reduced and higher classification accuracy can be
achieved.
Abstract: New generalization of the new class matrix polynomial set have been obtained. An explicit representation and an expansion of the matrix exponential in a series of these matrix are given for these matrix polynomials.