Abstract: Programmable logic controllers are the main controllers in the today's industries; they are used for several applications in industrial control systems and there are lots of examples exist from the PLC applications in industries especially in big companies and plants such as refineries, power plants, petrochemical companies, steel companies, and food and production companies. In the PLCs there are some functions in the function library in software that can be used in PLC programs as basic program elements. The aim of this project are introducing and implementing a new function block of a neural network to the function library of PLC. This block can be applied for some control applications or nonlinear functions calculations after it has been trained for these applications. The implemented neural network is a Perceptron neural network with three layers, three input nodes and one output node. The block can be used in manual or automatic mode. In this paper the structure of the implemented function block, the parameters and the training method of the network are presented by considering the especial method of PLC programming and its complexities. Finally the application of the new block is compared with a classic simulated block and the results are presented.
Abstract: In this paper, an inventory model with finite and
constant replenishment rate, price dependant demand rate, time
value of money and inflation, finite time horizon, lead time and
exponential deterioration rate and with the objective of maximizing
the present worth of the total system profit is developed. Using a
dynamic programming based solution algorithm, the optimal
sequence of the cycles can be found and also different optimal
selling prices, optimal order quantities and optimal maximum
inventories can be obtained for the cycles with unequal lengths,
which have never been done before for this model. Also, a
numerical example is used to show accuracy of the solution
procedure.
Abstract: Frequent patterns are 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 dataset. Most of the proposed frequent pattern mining algorithms have been implemented with imperative programming languages such as C, Cµ, Java. The imperative paradigm is significantly inefficient when itemset is large and the frequent pattern is long. We suggest a high-level declarative style of programming using a functional language. Our supposition is that the problem of frequent pattern discovery can be efficiently and concisely implemented via a functional paradigm since pattern matching is a fundamental feature supported by most functional languages. Our frequent pattern mining implementation using the Haskell language confirms our hypothesis about conciseness of the program. The performance studies on speed and memory usage support our intuition on efficiency of functional language.
Abstract: In this article, a formal specification and verification of the Rabin public-key scheme in a formal proof system is presented. The idea is to use the two views of cryptographic verification: the computational approach relying on the vocabulary of probability theory and complexity theory and the formal approach based on ideas and techniques from logic and programming languages. A major objective of this article is the presentation of the first computer-proved implementation of the Rabin public-key scheme in Isabelle/HOL. Moreover, we explicate a (computer-proven) formalization of correctness as well as a computer verification of security properties using a straight-forward computation model in Isabelle/HOL. The analysis uses a given database to prove formal properties of our implemented functions with computer support. The main task in designing a practical formalization of correctness as well as efficient computer proofs of security properties is to cope with the complexity of cryptographic proving. We reduce this complexity by exploring a light-weight formalization that enables both appropriate formal definitions as well as efficient formal proofs. Consequently, we get reliable proofs with a minimal error rate augmenting the used database, what provides a formal basis for more computer proof constructions in this area.
Abstract: One major difficulty that faces developers of
concurrent and distributed software is analysis for concurrency based
faults like deadlocks. Petri nets are used extensively in the
verification of correctness of concurrent programs. ECATNets are a
category of algebraic Petri nets based on a sound combination of
algebraic abstract types and high-level Petri nets. ECATNets have
'sound' and 'complete' semantics because of their integration in
rewriting logic and its programming language Maude. Rewriting
logic is considered as one of very powerful logics in terms of
description, verification and programming of concurrent systems We
proposed previously a method for translating Ada-95 tasking
programs to ECATNets formalism (Ada-ECATNet) and we showed
that ECATNets formalism provides a more compact translation for
Ada programs compared to the other approaches based on simple
Petri nets or Colored Petri nets. We showed also previously how the
ECATNet formalism offers to Ada many validation and verification
tools like simulation, Model Checking, accessibility analysis and
static analysis. In this paper, we describe the implementation of our
translation of the Ada programs into ECATNets.
Abstract: Conventional industrial monitoring systems are
tedious, inefficient and the at times integrity of the data is
unreliable. The objective of this system is to monitor industrial
processes specifically the fluid level which will measure the
instantaneous fluid level parameter and respond by text
messaging the exact value of the parameter to the user when
being enquired by a privileged access user. The development of
the embedded program code and the circuit for fluid level
measuring are discussed as well. Suggestions for future
implementations and efficient remote monitoring works are
included.
Abstract: In this paper, some problem formulations of dynamic object parameters recovery described by non-autonomous system of ordinary differential equations with multipoint unshared edge conditions are investigated. Depending on the number of additional conditions the problem is reduced to an algebraic equations system or to a problem of quadratic programming. With this purpose the paper offers a new scheme of the edge conditions transfer method called by conditions shift. The method permits to get rid from differential links and multipoint unshared initially-edge conditions. The advantage of the proposed approach is concluded by capabilities of reduction of a parametric identification problem to essential simple problems of the solution of an algebraic system or quadratic programming.
Abstract: According to the density of the chips, designers are
trying to put so any facilities of computational and storage on single
chips. Along with the complexity of computational and storage
circuits, the designing, testing and debugging become more and more
complex and expensive. So, hardware design will be built by using
very high speed hardware description language, which is more
efficient and cost effective. This paper will focus on the
implementation of 32-bit ALU design based on Verilog hardware
description language. Adder and subtracter operate correctly on both
unsigned and positive numbers. In ALU, addition takes most of the
time if it uses the ripple-carry adder. The general strategy for
designing fast adders is to reduce the time required to form carry
signals. Adders that use this principle are called carry look- ahead
adder. The carry look-ahead adder is to be designed with combination
of 4-bit adders. The syntax of Verilog HDL is similar to the C
programming language. This paper proposes a unified approach to
ALU design in which both simulation and formal verification can
co-exist.
Abstract: This paper considers the integration of assembly
operations and product structure to Cellular Manufacturing System
(CMS) design so that to correct the drawbacks of previous researches
in the literature. For this purpose, a new mathematical model is
developed which dedicates machining and assembly operations to
manufacturing cells while the objective function is to minimize the
intercellular movements resulting due to both of them. A
linearization method is applied to achieve optimum solution through
solving aforementioned nonlinear model by common programming
language such as Lingo. Then, using different examples and
comparing the results, the importance of integrating assembly
considerations is demonstrated.
Abstract: One of the most used assumptions in logic programming
and deductive databases is the so-called Closed World Assumption
(CWA), according to which the atoms that cannot be inferred
from the programs are considered to be false (i.e. a pessimistic
assumption). One of the most successful semantics of conventional
logic programs based on the CWA is the well-founded semantics.
However, the CWA is not applicable in all circumstances when
information is handled. That is, the well-founded semantics, if
conventionally defined, would behave inadequately in different cases.
The solution we adopt in this paper is to extend the well-founded
semantics in order for it to be based also on other assumptions. The
basis of (default) negative information in the well-founded semantics
is given by the so-called unfounded sets. We extend this concept
by considering optimistic, pessimistic, skeptical and paraconsistent
assumptions, used to complete missing information from a program.
Our semantics, called extended well-founded semantics, expresses
also imperfect information considered to be missing/incomplete,
uncertain and/or inconsistent, by using bilattices as multivalued
logics. We provide a method of computing the extended well-founded
semantics and show that Kripke-Kleene semantics is captured by
considering a skeptical assumption. We show also that the complexity
of the computation of our semantics is polynomial time.
Abstract: A semi-active control strategy for suspension
systems of passenger cars is presented employing
Magnetorheological (MR) dampers. The vehicle is modeled with
seven DOFs including the, roll pitch and bounce of car body, and
the vertical motion of the four tires. In order to design an optimal
controller based on the actuator constraints, a Linear-Quadratic
Regulator (LQR) is designed. The design procedure of the LQR
consists of selecting two weighting matrices to minimize the energy
of the control system. This paper presents a hybrid optimization
procedure which is a combination of gradient-based and
evolutionary algorithms to choose the weighting matrices with
regards to the actuator constraint. The optimization algorithm is
defined based on maximum comfort and actuator constraints. It is
noted that utilizing the present control algorithm may significantly
reduce the vibration response of the passenger car, thus, providing
a comfortable ride.
Abstract: A generalised relational data model is formalised for
the representation of data with nested structure of arbitrary depth. A
recursive algebra for the proposed model is presented. All the
operations are formally defined. The proposed model is proved to be
a superset of the conventional relational model (CRM). The
functionality and validity of the model is shown by a prototype
implementation that has been undertaken in the functional
programming language Miranda.
Abstract: The finite-difference time-domain (FDTD) method is
one of the most widely used computational methods in
electromagnetic. This paper describes the design of two-dimensional
(2D) FDTD simulation software for transverse magnetic (TM)
polarization using Berenger's split-field perfectly matched layer
(PML) formulation. The software is developed using Matlab
programming language. Numerical examples validate the software.
Abstract: The institutions seek to improve their performance
and quality of service, so that their patients are satisfied. This
research project aims, conduct a time study program in the area of
gynecological surgery, to determine the current level of capacity and
optimize the programming time in order to adequately respond to
demand. The system is analyzed by waiting lines and uses the
simulation using ARENA to evaluate proposals for improvement and
optimization programming time each of the surgeries.
Abstract: Genetic Folding (GF) a new class of EA named as is
introduced for the first time. It is based on chromosomes composed
of floating genes structurally organized in a parent form and
separated by dots. Although, the genotype/phenotype system of GF
generates a kernel expression, which is the objective function of
superior classifier. In this work the question of the satisfying
mapping-s rules in evolving populations is addressed by analyzing
populations undergoing either Mercer-s or none Mercer-s rule. The
results presented here show that populations undergoing Mercer-s
rules improve practically models selection of Support Vector
Machine (SVM). The experiment is trained multi-classification
problem and tested on nonlinear Ionosphere dataset. The target of this
paper is to answer the question of evolving Mercer-s rule in SVM
addressed using either genetic folding satisfied kernel-s rules or not
applied to complicated domains and problems.
Abstract: Modular fixtures (MFs) are very important tools in
manufacturing processes in terms of reduction the cost and the
production time. This paper introduces an automated approach for
assembling MFs elements by employing SolidWorks as a powerful
3D CAD software. Visual Basic (VB) programming language was
applied integrating with SolidWorks API (Application programming
interface) functions. This integration allowed creating plug-in file and
generating new menus in the SolidWorks environment. The menus
allow the user to select, insert, and assemble MFs elements.
Abstract: Parallel programming models exist as an abstraction
of hardware and memory architectures. There are several parallel
programming models in commonly use; they are shared memory
model, thread model, message passing model, data parallel model,
hybrid model, Flynn-s models, embarrassingly parallel computations
model, pipelined computations model. These models are not specific
to a particular type of machine or memory architecture. This paper
expresses the model program for concurrent approach to data parallel
model through java programming.
Abstract: Supplier selection is a multi criteria decision-making process that comprises tangible and intangible factors. The majority of previous supplier selection techniques do not consider strategic perspective. Besides, uncertainty is one of the most important obstacles in supplier selection. For the first, time in this paper, the idea of the algorithm " Knapsack " is used to select suppliers Moreover, an attempt has to be made to take the advantage of a simple numerical method for solving model .This is an innovation to resolve any ambiguity in choosing suppliers. This model has been tried in the suppliers selected in a competitive environment and according to all desired standards of quality and quantity to show the efficiency of the model, an industry sample has been uses.
Abstract: This paper describes the process used in the
automation of the Maritime UAV commands using the Kinect sensor.
The AR Drone is a Quadrocopter manufactured by Parrot [1] to be
controlled using the Apple operating systems such as iPhones and
Ipads. However, this project uses the Microsoft Kinect SDK and
Microsoft Visual Studio C# (C sharp) software, which are compatible
with Windows Operating System for the automation of the navigation
and control of the AR drone.
The navigation and control software for the Quadrocopter runs on
a windows 7 computer. The project is divided into two sections; the
Quadrocopter control system and the Kinect sensor control system.
The Kinect sensor is connected to the computer using a USB cable
from which commands can be sent to and from the Kinect sensors.
The AR drone has Wi-Fi capabilities from which it can be connected
to the computer to enable transfer of commands to and from the
Quadrocopter.
The project was implemented in C#, a programming language that
is commonly used in the automation systems. The language was
chosen because there are more libraries already established in C# for
both the AR drone and the Kinect sensor.
The study will contribute toward research in automation of
systems using the Quadrocopter and the Kinect sensor for navigation
involving a human operator in the loop. The prototype created has
numerous applications among which include the inspection of vessels
such as ship, airplanes and areas that are not accessible by human
operators.
Abstract: Rapid economic development and population growth
in Malaysia had accelerated the generation of solid waste. This issue
gives pressure for effective management of municipal solid waste
(MSW) to take place in Malaysia due to the increased cost of landfill.
This paper discusses optimal planning of waste-to-energy (WTE)
using a combinatorial simulation and optimization model through
mixed integer linear programming (MILP) approach. The proposed
multi-period model is tested in Iskandar Malaysia (IM) as case study
for a period of 12 years (2011 -2025) to illustrate the economic
potential and tradeoffs involved in this study. In this paper, 3
scenarios have been used to demonstrate the applicability of the
model: (1) Incineration scenario (2) Landfill scenario (3) Optimal
scenario. The model revealed that the minimum cost of electricity
generation from 9,995,855 tonnes of MSW is estimated as USD
387million with a total electricity generation of 50MW /yr in the
optimal scenario.