Abstract: This paper presents a hybrid algorithm for solving a timetabling problem, which is commonly encountered in many universities. The problem combines both teacher assignment and course scheduling problems simultaneously, and is presented as a mathematical programming model. However, this problem becomes intractable and it is unlikely that a proven optimal solution can be obtained by an integer programming approach, especially for large problem instances. A hybrid algorithm that combines an integer programming approach, a greedy heuristic and a modified simulated annealing algorithm collaboratively is proposed to solve the problem. Several randomly generated data sets of sizes comparable to that of an institution in Indonesia are solved using the proposed algorithm. Computational results indicate that the algorithm can overcome difficulties of large problem sizes encountered in previous related works.
Abstract: This work presents a recursive identification algorithm. This algorithm relates to the identification of closed loop system with Variable Structure Controller. The approach suggested includes two stages. In the first stage a genetic algorithm is used to obtain the parameters of switching function which gives a control signal rich in commutations (i.e. a control signal whose spectral characteristics are closest possible to those of a white noise signal). The second stage consists in the identification of the system parameters by the instrumental variable method and using the optimal switching function parameters obtained with the genetic algorithm. In order to test the validity of this algorithm a simulation example is presented.
Abstract: The given work is devoted to the description of
Information Technologies NAS of Azerbaijan created and
successfully maintained in Institute. On the basis of the decision of
board of the Supreme Certifying commission at the President of the
Azerbaijan Republic and Presidium of National Academy of
Sciences of the Azerbaijan Republic, the organization of training
courses on Computer Sciences for all post-graduate students and
dissertators of the republic, taking of examinations of candidate
minima, it was on-line entrusted to Institute of Information
Technologies of the National Academy of Sciences of Azerbaijan.
Therefore, teaching the computer sciences to post-graduate
students and dissertators a scientific - methodological manual on
effective application of new information technologies for research
works by post-graduate students and dissertators and taking of
candidate minima is carried out in the Educational Center.
Information and communication technologies offer new
opportunities and prospects of their application for teaching and
training. The new level of literacy demands creation of essentially
new technology of obtaining of scientific knowledge. Methods of
training and development, social and professional requirements,
globalization of the communicative economic and political projects
connected with construction of a new society, depends on a level of
application of information and communication technologies in the
educational process. Computer technologies develop ideas of
programmed training, open completely new, not investigated
technological ways of training connected to unique opportunities of
modern computers and telecommunications. Computer technologies
of training are processes of preparation and transfer of the
information to the trainee by means of computer. Scientific and
technical progress as well as global spread of the technologies
created in the most developed countries of the world is the main
proof of the leading role of education in XXI century. Information
society needs individuals having modern knowledge. In practice, all
technologies, using special technical information means (computer,
audio, video) are called information technologies of education.
Abstract: Most integrated inertial navigation systems (INS) and
global positioning systems (GPS) have been implemented using the
Kalman filtering technique with its drawbacks related to the need for
predefined INS error model and observability of at least four
satellites. Most recently, a method using a hybrid-adaptive network
based fuzzy inference system (ANFIS) has been proposed which is
trained during the availability of GPS signal to map the error
between the GPS and the INS. Then it will be used to predict the
error of the INS position components during GPS signal blockage.
This paper introduces a genetic optimization algorithm that is used to
update the ANFIS parameters with respect to the INS/GPS error
function used as the objective function to be minimized. The results
demonstrate the advantages of the genetically optimized ANFIS for
INS/GPS integration in comparison with conventional ANFIS
specially in the cases of satellites- outages. Coping with this problem
plays an important role in assessment of the fusion approach in land
navigation.
Abstract: Automated discovery of Rule is, due to its applicability, one of the most fundamental and important method in KDD. It has been an active research area in the recent past. Hierarchical representation allows us to easily manage the complexity of knowledge, to view the knowledge at different levels of details, and to focus our attention on the interesting aspects only. One of such efficient and easy to understand systems is Hierarchical Production rule (HPRs) system. A HPR, a standard production rule augmented with generality and specificity information, is of the following form: Decision If < condition> Generality Specificity . HPRs systems are capable of handling taxonomical structures inherent in the knowledge about the real world. This paper focuses on the issue of mining Quantified rules with crisp hierarchical structure using Genetic Programming (GP) approach to knowledge discovery. The post-processing scheme presented in this work uses Quantified production rules as initial individuals of GP and discovers hierarchical structure. In proposed approach rules are quantified by using Dempster Shafer theory. Suitable genetic operators are proposed for the suggested encoding. Based on the Subsumption Matrix(SM), an appropriate fitness function is suggested. Finally, Quantified Hierarchical Production Rules (HPRs) are generated from the discovered hierarchy, using Dempster Shafer theory. Experimental results are presented to demonstrate the performance of the proposed algorithm.
Abstract: Like any sentient organism, a smart environment
relies first and foremost on sensory data captured from the real
world. The sensory data come from sensor nodes of different
modalities deployed on different locations forming a Wireless Sensor
Network (WSN). Embedding smart sensors in humans has been a
research challenge due to the limitations imposed by these sensors
from computational capabilities to limited power. In this paper, we
first propose a practical WSN application that will enable blind
people to see what their neighboring partners can see. The challenge
is that the actual mapping between the input images to brain pattern
is too complex and not well understood. We also study the
connectivity problem in 3D/2D wireless sensor networks and propose
distributed efficient algorithms to accomplish the required
connectivity of the system. We provide a new connectivity algorithm
CDCA to connect disconnected parts of a network using cooperative
diversity. Through simulations, we analyze the connectivity gains
and energy savings provided by this novel form of cooperative
diversity in WSNs.
Abstract: This paper investigates the problem of sampling from transactional data streams. We introduce CFISDS as a content based sampling algorithm that works on a landmark window model of data streams and preserve more informed sample in sample space. This algorithm that work based on closed frequent itemset mining tasks, first initiate a concept lattice using initial data, then update lattice structure using an incremental mechanism.Incremental mechanism insert, update and delete nodes in/from concept lattice in batch manner. Presented algorithm extracts the final samples on demand of user. Experimental results show the accuracy of CFISDS on synthetic and real datasets, despite on CFISDS algorithm is not faster than exist sampling algorithms such as Z and DSS.
Abstract: Generalized Center String (GCS) problem are
generalized from Common Approximate Substring problem
and Common substring problems. GCS are known to be
NP-hard allowing the problems lies in the explosion of
potential candidates. Finding longest center string without
concerning the sequence that may not contain any motifs is
not known in advance in any particular biological gene
process. GCS solved by frequent pattern-mining techniques
and known to be fixed parameter tractable based on the
fixed input sequence length and symbol set size. Efficient
method known as Bpriori algorithms can solve GCS with
reasonable time/space complexities. Bpriori 2 and Bpriori
3-2 algorithm are been proposed of any length and any
positions of all their instances in input sequences. In this
paper, we reduced the time/space complexity of Bpriori
algorithm by Constrained Based Frequent Pattern mining
(CBFP) technique which integrates the idea of Constraint
Based Mining and FP-tree mining. CBFP mining technique
solves the GCS problem works for all center string of any
length, but also for the positions of all their mutated copies
of input sequence. CBFP mining technique construct TRIE
like with FP tree to represent the mutated copies of center
string of any length, along with constraints to restraint
growth of the consensus tree. The complexity analysis for
Constrained Based FP mining technique and Bpriori
algorithm is done based on the worst case and average case
approach. Algorithm's correctness compared with the
Bpriori algorithm using artificial data is shown.
Abstract: Broccoli has been widely recognized as a wealthy
vegetable which contains multiple nutrients with potent anti-cancer
properties. Lamb’s lettuce has been used as food for many centuries
but only recently became commercially available and literature is
therefore exiguous concerning these vegetables. The aim of this work
was to evaluate the influence of the extraction conditions on the yield
of phenolic compounds and the corresponding antioxidant capacity of
broccoli and lamb’s lettuce. The results indicate that lamb’s lettuce,
compared to broccoli, contains simultaneously a large amount of total
polyphenols as well as high antioxidant activity. It is clearly
demonstrated that extraction solvent significantly influences the
antioxidant activity. Methanol is the solvent that can globally
maximize the antioxidant extraction yield. The results presented
herein prove lamb’s lettuce as a very interesting source of
polyphenols, and thus a potential health-promoting food.
Abstract: Medical compression bandages are widely used in the
treatment of chronic venous disorder. In order to design effective
compression bandages, researchers have attempted to describe the
interface pressure applied by multi-layer bandages using mathematical
models. This paper reports on the work carried out to
compare and validate the mathematical models used to describe the
interface pressure applied by multi-layer bandages. Both analytical
and experimental results showed that using simple multiplication
of a number of bandage layers with the pressure applied by one
layer of bandage or ignoring the increase in the limb radius due to
former layers of bandage will result in overestimating the pressure.
Experimental results showed that the mathematical models, which
take into consideration the increase in the limb radius due to former
bandage layers, are more accurate than the one which does not.
Abstract: In Virtual organization, Knowledge Discovery (KD)
service contains distributed data resources and computing grid nodes.
Computational grid is integrated with data grid to form Knowledge
Grid, which implements Apriori algorithm for mining association
rule on grid network. This paper describes development of parallel
and distributed version of Apriori algorithm on Globus Toolkit using
Message Passing Interface extended with Grid Services (MPICHG2).
The creation of Knowledge Grid on top of data and
computational grid is to support decision making in real time
applications. In this paper, the case study describes design and
implementation of local and global mining of frequent item sets. The
experiments were conducted on different configurations of grid
network and computation time was recorded for each operation. We
analyzed our result with various grid configurations and it shows
speedup of computation time is almost superlinear.
Abstract: Signature represents an individual characteristic of a
person which can be used for his / her validation. For such application
proper modeling is essential. Here we propose an offline signature
recognition and verification scheme which is based on extraction of
several features including one hybrid set from the input signature
and compare them with the already trained forms. Feature points
are classified using statistical parameters like mean and variance.
The scanned signature is normalized in slant using a very simple
algorithm with an intention to make the system robust which is
found to be very helpful. The slant correction is further aided by the
use of an Artificial Neural Network (ANN). The suggested scheme
discriminates between originals and forged signatures from simple
and random forgeries. The primary objective is to reduce the two
crucial parameters-False Acceptance Rate (FAR) and False Rejection
Rate (FRR) with lesser training time with an intension to make the
system dynamic using a cluster of ANNs forming a multiple classifier
system.
Abstract: the elastic scattering of protons, deuterons and 3He on 6Li at different incident energies have been analyzed in the framework of the optical model using ECIS88 as well as SPI GENOA codes. The potential parameters were extracted in the phenomenological treatment of measured by us angular distributions and literature data. A good agreement between theoretical and experimental differential cross sections was obtained in whole angular range. Parameters for real part of potential have been also calculated microscopically with singleand double-folding model for the p and d, 3He scattering, respectively, using DFPOT code. For best agreement with experiment the normalization factor N for the potential depth is obtained in the range of 0.7-0.9.
Abstract: In this paper, based on steady-state models of Flexible
AC Transmission System (FACTS) devices, the sizing of static
synchronous series compensator (SSSC) controllers in transmission
network is formed as an optimization problem. The objective of this
problem is to reduce the transmission losses in the network. The
optimization problem is solved using particle swarm optimization
(PSO) technique. The Newton-Raphson load flow algorithm is
modified to consider the insertion of the SSSC devices in the
network. A numerical example, illustrating the effectiveness of the
proposed algorithm, is introduced. In addition, a novel model of a 3-
phase voltage source converter (VSC) that is suitable for series
connected FACTS a controller is introduced. The model is verified
by simulation using Power System Blockset (PSB) and Simulink
software.
Abstract: In this work, we suggested a new approach for the
control of a mobile robot capable of being a building block of an
intelligent agent. This approach includes obstacle avoidance and goal
tracking implemented as two different sliding mode controllers. A
geometry based behavior arbitration is proposed for fusing the two
outputs. Proposed structure is tested on simulations and real robot.
Results have confirmed the high performance of the method.
Abstract: Crude oil blending is an important unit operation in
petroleum refining industry. A good model for the blending system is
beneficial for supervision operation, prediction of the export
petroleum quality and realizing model-based optimal control. Since
the blending cannot follow the ideal mixing rule in practice, we
propose a static neural network to approximate the blending
properties. By the dead-zone approach, we propose a new robust
learning algorithm and give theoretical analysis. Real data of crude
oil blending is applied to illustrate the neuro modeling approach.
Abstract: Many electronic voting systems, classified mainly as homomorphic cryptography based, mix-net based and blind signature based, appear after the eighties when zero knowledge proofs were introduced. The common ground for all these three systems is that none of them works without real time cryptologic calculations that should be held on a server. As far as known, the agent-based approach has not been used in a secure electronic voting system. In this study, an agent-based electronic voting schema, which does not contain real time calculations on the server side, is proposed. Conventional cryptologic methods are used in the proposed schema and some of the requirements of an electronic voting system are constructed within the schema. The schema seems quite secure if the used cryptologic methods and agents are secure. In this paper, proposed schema will be explained and compared with already known electronic voting systems.
Abstract: The paper deals with an analysis of visibility records collected from 210 European airports to obtain a realistic estimation of the availability of Free Space Optical (FSO) data links. Commercially available optical links usually operate in the 850nm waveband. Thus the influence of the atmosphere on the optical beam and on the visible light is similar. Long-term visibility records represent an invaluable source of data for the estimation of the quality of service of FSO links. The model used characterizes both the statistical properties of fade depths and the statistical properties of individual fade durations. Results are presented for Italy, France, and Germany.
Abstract: This paper presents an efficient algorithm for
optimization of radial distribution systems by a network
reconfiguration to balance feeder loads and eliminate overload
conditions. The system load-balancing index is used to determine the
loading conditions of the system and maximum system loading
capacity. The index value has to be minimum in the optimal network
reconfiguration of load balancing. A method based on Tabu search
algorithm, The Tabu search algorithm is employed to search for the
optimal network reconfiguration. The basic idea behind the search is
a move from a current solution to its neighborhood by effectively
utilizing a memory to provide an efficient search for optimality. It
presents low computational effort and is able to find good quality
configurations. Simulation results for a radial 69-bus system with
distributed generations and capacitors placement. The study results
show that the optimal on/off patterns of the switches can be identified
to give the best network reconfiguration involving balancing of
feeder loads while respecting all the constraints.
Abstract: In a pilot plant scale of a fluidized bed reactor, a
reduction reaction of sodium sulfate by natural gas has been
investigated. Natural gas is applied in this study as a reductant. Feed
density, feed mass flow rate, natural gas and air flow rate
(independent parameters)and temperature of bed and CO
concentration in inlet and outlet of reactor (dependent parameters)
were monitored and recorded at steady state. The residence time was
adjusted close to value of traditional reaction [1]. An artificial neural
network (ANN) was established to study dependency of yield and
carbon gradient on operating parameters. Resultant 97% accuracy of
applied ANN is a good prove that natural gas can be used as a
reducing agent. Predicted ANN model for relation between other
sources carbon gradient (accuracy 74%) indicates there is not a
meaningful relation between other sources carbon variation and
reduction process which means carbon in granule does not have
significant effect on the reaction yield.