Abstract: Bond graph models of an electrical transformer
including the nonlinear saturation are presented. These models
determine the relation between self and mutual inductances, and
the leakage and magnetizing inductances of power transformers
with two and three windings using the properties of a bond
graph. The modelling and analysis using this methodology to
three phase power transformers or transformers with internal
incipient faults can be extended.
Abstract: A well balanced numerical scheme based on
stationary waves for shallow water flows with arbitrary topography
has been introduced by Thanh et al. [18]. The scheme was
constructed so that it maintains equilibrium states and tests indicate
that it is stable and fast. Applying the well-balanced scheme for the
one-dimensional shallow water equations, we study the early shock
waves propagation towards the Phuket coast in Southern Thailand
during a hypothetical tsunami. The initial tsunami wave is generated
in the deep ocean with the strength that of Indonesian tsunami of
2004.
Abstract: Multiport diffusers are the effective engineering
devices installed at the modern marine outfalls for the steady
discharge of effluent streams from the coastal plants, such as
municipal sewage treatment, thermal power generation and seawater
desalination. A mathematical model using a two-dimensional
advection-diffusion equation based on a flat seabed and incorporating
the effect of a coastal tidal current is developed to calculate the
compounded concentration following discharges of desalination
brine from a sea outfall with multiport diffusers. The analytical
solutions are computed graphically to illustrate the merging of
multiple brine plumes in shallow coastal waters, and further
approximation will be made to the maximum shoreline's
concentration to formulate dilution of a multiport diffuser discharge.
Abstract: Graph coloring is an important problem in computer
science and many algorithms are known for obtaining reasonably
good solutions in polynomial time. One method of comparing
different algorithms is to test them on a set of standard graphs where
the optimal solution is already known. This investigation analyzes a
set of 50 well known graph coloring instances according to a set of
complexity measures. These instances come from a variety of
sources some representing actual applications of graph coloring
(register allocation) and others (mycieleski and leighton graphs) that
are theoretically designed to be difficult to solve. The size of the
graphs ranged from ranged from a low of 11 variables to a high of
864 variables. The method used to solve the coloring problem was
the square of the adjacency (i.e., correlation) matrix. The results
show that the most difficult graphs to solve were the leighton and the
queen graphs. Complexity measures such as density, mobility,
deviation from uniform color class size and number of block
diagonal zeros are calculated for each graph. The results showed that
the most difficult problems have low mobility (in the range of .2-.5)
and relatively little deviation from uniform color class size.
Abstract: In the artificial intelligence field, knowledge
representation and reasoning are important areas for intelligent
systems, especially knowledge base systems and expert systems.
Knowledge representation Methods has an important role in
designing the systems. There have been many models for knowledge
such as semantic networks, conceptual graphs, and neural networks.
These models are useful tools to design intelligent systems. However,
they are not suitable to represent knowledge in the domains of reality
applications. In this paper, new models for knowledge representation
called computational networks will be presented. They have been
used in designing some knowledge base systems in education for
solving problems such as the system that supports studying
knowledge and solving analytic geometry problems, the program for
studying and solving problems in Plane Geometry, the program for
solving problems about alternating current in physics.
Abstract: The purpose of semantic web research is to transform
the Web from a linked document repository into a distributed knowledge base and application platform, thus allowing the vast range of available information and services to be more efficiently
exploited. As a first step in this transformation, languages such as
OWL have been developed. Although fully realizing the Semantic Web still seems some way off, OWL has already been very
successful and has rapidly become a defacto standard for ontology
development in fields as diverse as geography, geology, astronomy,
agriculture, defence and the life sciences. The aim of this paper is to classify key concepts of Semantic Web as well as introducing a new
practical approach which uses these concepts to outperform Word Wide Web.
Abstract: As a tool for human spatial cognition and thinking, the map has been playing an important role. Maps are perhaps as fundamental to society as language and the written word. Economic and social development requires extensive and in-depth understanding of their own living environment, from the scope of the overall global to urban housing. This has brought unprecedented opportunities and challenges for traditional cartography . This paper first proposed the concept of scaleless-map and its basic characteristics, through the analysis of the existing multi-scale representation techniques. Then some strategies are presented for automated mapping compilation. Taking into account the demand of automated map compilation, detailed proposed the software - WJ workstation must have four technical features, which are generalization operators, symbol primitives, dynamically annotation and mapping process template. This paper provides a more systematic new idea and solution to improve the intelligence and automation of the scaleless cartography.
Abstract: To analyze the behavior of Petri nets, the accessibility
graph and Model Checking are widely used. However, if the
analyzed Petri net is unbounded then the accessibility graph becomes
infinite and Model Checking can not be used even for small Petri
nets. ECATNets [2] are a category of algebraic Petri nets. The main
feature of ECATNets is their sound and complete semantics based on
rewriting logic [8] and its language Maude [9]. ECATNets analysis
may be done by using techniques of accessibility analysis and Model
Checking defined in Maude. But, these two techniques supported by
Maude do not work also with infinite-states systems. As a category
of Petri nets, ECATNets can be unbounded and so infinite systems.
In order to know if we can apply accessibility analysis and Model
Checking of Maude to an ECATNet, we propose in this paper an
algorithm allowing the detection if the ECATNet is bounded or not.
Moreover, we propose a rewriting logic based tool implementing this
algorithm. We show that the development of this tool using the
Maude system is facilitated thanks to the reflectivity of the rewriting
logic. Indeed, the self-interpretation of this logic allows us both the
modelling of an ECATNet and acting on it.
Abstract: Gas chromatography (GC) is the most widely used
technique in analytical chemistry. However, GC has high initial cost
and requires frequent maintenance. This paper examines the
feasibility and potential of using a neural network model as an
alternative whenever GC is unvailable. It can also be part of system
verification on the performance of GC for preventive maintenance
activities. It shows the performance of MultiLayer Perceptron (MLP)
with Backpropagation structure. Results demonstrate that neural
network model when trained using this structure provides an
adequate result and is suitable for this purpose. cm.
Abstract: The effect of porous medium on the capillary instability of a cylindrical interface in the presence of axial electric field has been investigated using viscous potential flow theory. In viscous potential flow, the viscous term in Navier-Stokes equation vanishes as
vorticity is zero but viscosity is not zero. Viscosity enters through normal stress balance in the viscous potential flow theory and tangential stresses are not considered. A dispersion relation that accounts for the growth of axisymmetric waves is derived and stability is discussed theoretically as well as numerically. Stability criterion is given by critical value of applied electric field as well as critical wave number. Various graphs have been drawn to show the effect of various physical parameters such as electric field, viscosity ratio, permittivity ratio on the stability of the system. It has been observed that the axial electric field and porous medium both have stabilizing effect on the stability of the system.
Abstract: In this paper, a novel copyright protection scheme for digital images based on Visual Cryptography and Statistics is proposed. In our scheme, the theories and properties of sampling distribution of means and visual cryptography are employed to achieve the requirements of robustness and security. Our method does not need to alter the original image and can identify the ownership without resorting to the original image. Besides, our method allows multiple watermarks to be registered for a single host image without causing any damage to other hidden watermarks. Moreover, it is also possible for our scheme to cast a larger watermark into a smaller host image. Finally, experimental results will show the robustness of our scheme against several common attacks.
Abstract: Task of object localization is one of the major
challenges in creating intelligent transportation. Unfortunately, in
densely built-up urban areas, localization based on GPS only
produces a large error, or simply becomes impossible. New
opportunities arise for the localization due to the rapidly emerging
concept of a wireless ad-hoc network. Such network, allows
estimating potential distance between these objects measuring
received signal level and construct a graph of distances in which
nodes are the localization objects, and edges - estimates of the
distances between pairs of nodes. Due to the known coordinates of
individual nodes (anchors), it is possible to determine the location of
all (or part) of the remaining nodes of the graph. Moreover, road
map, available in digital format can provide localization routines
with valuable additional information to narrow node location search.
However, despite abundance of well-known algorithms for solving
the problem of localization and significant research efforts, there are
still many issues that currently are addressed only partially. In this
paper, we propose localization approach based on the graph mapped
distances on the digital road map data basis. In fact, problem is
reduced to distance graph embedding into the graph representing area
geo location data. It makes possible to localize objects, in some cases
even if only one reference point is available. We propose simple
embedding algorithm and sample implementation as spatial queries
over sensor network data stored in spatial database, allowing
employing effectively spatial indexing, optimized spatial search
routines and geometry functions.
Abstract: This paper proposes a novel architecture for developing decision support systems. Unlike conventional decision support systems, the proposed architecture endeavors to reveal the decision-making process such that humans' subjectivity can be incorporated into a computerized system and, at the same time, to preserve the capability of the computerized system in processing information objectively. A number of techniques used in developing the decision support system are elaborated to make the decisionmarking process transparent. These include procedures for high dimensional data visualization, pattern classification, prediction, and evolutionary computational search. An artificial data set is first employed to compare the proposed approach with other methods. A simulated handwritten data set and a real data set on liver disease diagnosis are then employed to evaluate the efficacy of the proposed approach. The results are analyzed and discussed. The potentials of the proposed architecture as a useful decision support system are demonstrated.
Abstract: Graph has become increasingly important in modeling
complicated structures and schemaless data such as proteins, chemical
compounds, and XML documents. Given a graph query, it is desirable
to retrieve graphs quickly from a large database via graph-based
indices. Different from the existing methods, our approach, called
VFM (Vertex to Frequent Feature Mapping), makes use of vertices
and decision features as the basic indexing feature. VFM constructs
two mappings between vertices and frequent features to answer graph
queries. The VFM approach not only provides an elegant solution to
the graph indexing problem, but also demonstrates how database
indexing and query processing can benefit from data mining,
especially frequent pattern mining. The results show that the proposed
method not only avoids the enumeration method of getting subgraphs
of query graph, but also effectively reduces the subgraph isomorphism
tests between the query graph and graphs in candidate answer set in
verification stage.
Abstract: Stresses for the elastic-plastic transition and fully
plastic state have been derived for a thin rotating disc with inclusion
and results have been discussed numerically and depicted graphically.
It has been observed that the rotating disc with inclusion and made of
compressible material requires lesser angular speed to yield at the
internal surface whereas it requires higher percentage increase in
angular speed to become fully plastic as compare to disc made of
incompressible material.
Abstract: In this paper a modified version NXM of traditional 5X5 playfair cipher is introduced which enable the user to encrypt message of any Natural language by taking appropriate size of the matrix depending upon the size of the natural language. 5X5 matrix has the capability of storing only 26 characters of English language and unable to store characters of any language having more than 26 characters. To overcome this limitation NXM matrix is introduced which solve this limitation. In this paper a special case of Urdu language is discussed. Where # is used for completing odd pair and * is used for repeating letters.
Abstract: The localized corrosion behavior of laser surface
melted 304L austenitic stainless steel was studied by
potentiodynamic polarization test. The extent of improvement in
corrosion resistance was governed by the preferred orientation and
the percentage of delta ferrite present on the surface of the laser
melted sample. It was established by orientation imaging microscopy
that the highest pitting potential value was obtained when grains were
oriented in the most close- packed [101] direction compared to the
random distribution of the base metal and other laser surface melted
samples oriented in [001] direction. The sample with lower
percentage of ferrite had good pitting resistance.
Abstract: We here propose improved version of elastic graph matching (EGM) as a face detector, called the multi-scale EGM (MS-EGM). In this improvement, Gabor wavelet-based pyramid reduces computational complexity for the feature representation often used in the conventional EGM, but preserving a critical amount of information about an image. The MS-EGM gives us higher detection performance than Viola-Jones object detection algorithm of the AdaBoost Haar-like feature cascade. We also show rapid detection speeds of the MS-EGM, comparable to the Viola-Jones method. We find fruitful benefits in the MS-EGM, in terms of topological feature representation for a face.
Abstract: The characterization of κ-carrageenan could provide a
better understanding of its functions in biological, medical and
industrial applications. Chemical and physical analyses of
carrageenan from seaweeds, Euchema cottonii L., were done to offer
information on its properties and the effects of Co-60 γ-irradiation on
its thermochemical characteristics. The structural and morphological
characteristics of κ-carrageenan were determined using scanning
electron microscopy (SEM) while the composition, molecular weight
and thermal properties were determined using attenuated total
reflectance Fourier transform infrared spectroscopy (ATR-FTIR), gel
permeation chromatography (GPC), thermal gravimetric analysis
(TGA) and differential scanning calorimetry (DSC). Further chemical
analysis was done using hydrogen-1 nuclear magnetic resonance (1H
NMR) and functional characteristics in terms of biocompatibility
were evaluated using cytotoxicity test.
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.