Abstract: The prologue of new High Voltage (HV) transmission mains into the community necessitates earthing design to ensure safety compliance of the system. Concrete poles are widely used within HV transmission mains; many retired transmission mains with timber poles are being replaced with concrete ones, green transmission mains are deploying concrete poles. The earthing arrangement of the concrete poles could have an impact on the earth grid impedance also on the input impedance of the system from the fault point of view. This paper endeavors to provide information on the soil resistivity of the area and the deployments of concrete poles. It introduce the cut off soil resistivity value ρSC, this value aid in determine the impact of deploying the concrete poles on the earthing system. Multiple cases were discussed in this paper.
Abstract: The problem of frequent pattern discovery is defined
as the process of searching for patterns such as sets of features or items that appear in data frequently. Finding such frequent patterns
has become an important data mining task because it reveals associations, correlations, and many other interesting relationships
hidden in a database. Most of the proposed frequent pattern mining
algorithms have been implemented with imperative programming
languages. Such paradigm is inefficient when set of patterns is large
and the frequent pattern is long. We suggest a high-level declarative
style of programming apply to the problem of frequent pattern
discovery. We consider two languages: Haskell and Prolog. Our
intuitive idea is that the problem of finding frequent patterns should
be efficiently and concisely implemented via a declarative paradigm
since pattern matching is a fundamental feature supported by most
functional languages and Prolog. Our frequent pattern mining
implementation using the Haskell and Prolog languages confirms our
hypothesis about conciseness of the program. The comparative
performance studies on line-of-code, speed and memory usage of
declarative versus imperative programming have been reported in the
paper.
Abstract: Coloured Petri net (CPN) has been widely adopted in various areas in Computer Science, including protocol specification, performance evaluation, distributed systems and coordination in multi-agent systems. It provides a graphical representation of a system and has a strong mathematical foundation for proving various properties. This paper proposes a novel representation of a coloured Petri net using an extension of logic programming called abductive logic programming (ALP), which is purely based on classical logic. Under such a representation, an implementation of a CPN could be directly obtained, in which every inference step could be treated as a kind of equivalence preserved transformation. We would describe how to implement a CPN under such a representation using common meta-programming techniques in Prolog. We call our framework CPN-LP and illustrate its applications in modeling an intelligent agent.
Abstract: In order to give high expertise the computer aided
design of mechanical systems involves specific activities focused on
processing two type of information: knowledge and data. Expert rule
based knowledge is generally processing qualitative information and
involves searching for proper solutions and their combination into
synthetic variant. Data processing is based on computational models
and it is supposed to be inter-related with reasoning in the knowledge
processing. In this paper an Intelligent Integrated System is proposed,
for the objective of choosing the adequate material. The software is
developed in Prolog – Flex software and takes into account various
constraints that appear in the accurate operation of gears.
Abstract: As computer network technology becomes
increasingly complex, it becomes necessary to place greater
requirements on the validity of developing standards and the
resulting technology. Communication networks are based on large
amounts of protocols. The validity of these protocols have to be
proved either individually or in an integral fashion. One strategy for
achieving this is to apply the growing field of formal methods.
Formal methods research defines systems in high order logic so that
automated reasoning can be applied for verification. In this research
we represent and implement a formerly announced multicast protocol
in Prolog language so that certain properties of the protocol can be
verified. It is shown that by using this approach some minor faults in
the protocol were found and repaired. Describing the protocol as
facts and rules also have other benefits i.e. leads to a process-able
knowledge. This knowledge can be transferred as ontology between
systems in KQML format. Since the Prolog language can increase its
knowledge base every time, this method can also be used to learn an
intelligent network.
Abstract: This paper discusses the development of a qualitative
simulator (abbreviated QRiOM) for predicting the behaviour of
organic chemical reactions. The simulation technique is based on the
qualitative process theory (QPT) ontology. The modelling constructs
of QPT embody notions of causality which can be used to explain the
behaviour of a chemical system. The major theme of this work is
that, in a qualitative simulation environment, students are able to
articulate his/her knowledge through the inspection of explanations
generated by software. The implementation languages are Java and
Prolog. The software produces explanation in various forms that
stresses on the causal theories in the chemical system which can be
effectively used to support learning.
Abstract: Work Breakdown Structure (WBS) is one of the
most vital planning processes of the project management since it
is considered to be the fundamental of other processes like
scheduling, controlling, assigning responsibilities, etc. In fact
WBS or activity list is the heart of a project and omission of a
simple task can lead to an irrecoverable result. There are some
tools in order to generate a project WBS. One of the most
powerful tools is mind mapping which is the basis of this article.
Mind map is a method for thinking together and helps a project
manager to stimulate the mind of project team members to
generate project WBS. Here we try to generate a WBS of a
sample project involving with the building construction using the
aid of mind map and the artificial intelligence (AI) programming
language. Since mind map structure can not represent data in a
computerized way, we convert it to a semantic network which can
be used by the computer and then extract the final WBS from the
semantic network by the prolog programming language. This
method will result a comprehensive WBS and decrease the
probability of omitting project tasks.
Abstract: Considering the theory of attribute grammars, we use
logical formulas instead of traditional functional semantic rules.
Following the decoration of a derivation tree, a suitable algorithm
should maintain the consistency of the formulas together with the
evaluation of the attributes. This may be a Prolog-like resolution, but
this paper examines a somewhat different strategy, based on
production specialization, local consistency and propagation: given a
derivation tree, it is interactively decorated, i.e. incrementally
checked and evaluated. The non-directed dependencies are
dynamically directed during attribute evaluation.
Abstract: The prologue of new High Voltage (HV) transmission
mains into the community necessitates earthing design to ensure
safety compliance of the system. Conductive structures such as steel
or concrete poles are widely used in HV transmission mains. The
earth potential rise (EPR) generated by a fault on these structures
could result to an unsafe condition. This paper discusses information
on the input impedance of the over head earth wire (OHEW) system
for finite and infinite transmission mains. The definition of finite and
infinite system is discussed, maximum EPR due to pole fault. The
simplified equations for EPR assessments are introduced and
discussed for the finite and infinite conditions. A case study is also
shown.