Abstract: We depend upon explanation in order to “make sense"
out of our world. And, making sense is all the more important when
dealing with change. But, what happens if our explanations are
wrong? This question is examined with respect to two types of
explanatory model. Models based on labels and categories we shall
refer to as “representations." More complex models involving
stories, multiple algorithms, rules of thumb, questions, ambiguity we
shall refer to as “compressions." Both compressions and
representations are reductions. But representations are far more
reductive than compressions. Representations can be treated as a set
of defined meanings – coherence with regard to a representation is
the degree of fidelity between the item in question and the definition
of the representation, of the label. By contrast, compressions contain
enough degrees of freedom and ambiguity to allow us to make
internal predictions so that we may determine our potential actions in
the possibility space. Compressions are explanatory via mechanism.
Representations are explanatory via category. Managers are often
confusing their evocation of a representation (category inclusion) as
the creation of a context of compression (description of mechanism).
When this type of explanatory error occurs, more errors follow. In
the drive for efficiency such substitutions are all too often proclaimed
– at the manager-s peril..
Abstract: A potentially serious problem with current payment systems is that their underlying hard problems from number theory may be solved by either a quantum computer or unanticipated future advances in algorithms and hardware. A new quantum payment system is proposed in this paper. The suggested system makes use of fundamental principles of quantum mechanics to ensure the unconditional security without prior arrangements between customers and vendors. More specifically, the new system uses Greenberger-Home-Zeilinger (GHZ) states and Quantum Key Distribution to authenticate the vendors and guarantee the transaction integrity.
Abstract: Random Access Memory (RAM) is an important
device in computer system. It can represent the snapshot on how the
computer has been used by the user. With the growth of its
importance, the computer memory has been an issue that has been
discussed in digital forensics. A number of tools have been developed
to retrieve the information from the memory. However, most of the
tools have their limitation in the ability of retrieving the important
information from the computer memory. Hence, this paper is aimed
to discuss the limitation and the setback for two main techniques such
as process signature search and process enumeration. Then, a new
hybrid approach will be presented to minimize the setback in both
individual techniques. This new approach combines both techniques
with the purpose to retrieve the information from the process block
and other objects in the computer memory. Nevertheless, the basic
theory in address translation for x86 platforms will be demonstrated
in this paper.
Abstract: A novel method of individual level adaptive mutation rate control called the rank-scaled mutation rate for genetic algorithms is introduced. The rank-scaled mutation rate controlled genetic algorithm varies the mutation parameters based on the rank of each individual within the population. Thereby the distribution of the fitness of the papulation is taken into consideration in forming the new mutation rates. The best fit mutate at the lowest rate and the least fit mutate at the highest rate. The complexity of the algorithm is of the order of an individual adaptation scheme and is lower than that of a self-adaptation scheme. The proposed algorithm is tested on two common problems, namely, numerical optimization of a function and the traveling salesman problem. The results show that the proposed algorithm outperforms both the fixed and deterministic mutation rate schemes. It is best suited for problems with several local optimum solutions without a high demand for excessive mutation rates.
Abstract: The IFS is a scheme for describing and manipulating complex fractal attractors using simple mathematical models. More precisely, the most popular “fractal –based" algorithms for both representation and compression of computer images have involved some implementation of the method of Iterated Function Systems (IFS) on complete metric spaces. In this paper a new generalized space called Multi-Fuzzy Fractal Space was constructed. On these spases a distance function is defined, and its completeness is proved. The completeness property of this space ensures the existence of a fixed-point theorem for the family of continuous mappings. This theorem is the fundamental result on which the IFS methods are based and the fractals are built. The defined mappings are proved to satisfy some generalizations of the contraction condition.
Abstract: This paper deals about four items assembly process of
linear drive. This assembly will be realized in flexible assembly cell
on Institute of Manufacturing Systems and Applied Mechanics. There
is defined manufacturing cell, individual actuators created our
flexible cell. Next chapter is about control type, detailed describe a
sequence control type, which will be used in mentioned flexible
assembly cell. All cell control is divided in individual steps
instructions. There instructions illustrate table number III.
Abstract: In this paper, a novel deinterlacing algorithm is
proposed. The proposed algorithm approximates the distribution of the
luminance into a polynomial function. Instead of using one
polynomial function for all pixels, different polynomial functions are
used for the uniform, texture, and directional edge regions. The
function coefficients for each region are computed by matrix
multiplications. Experimental results demonstrate that the proposed
method performs better than the conventional algorithms.
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: This paper presents the theoretical background and
the real implementation of an automated computer system to
introduce machine vision in flower, fruit and vegetable processing
for recollection, cutting, packaging, classification, or fumigation
tasks. The considerations and implementation issues presented in this
work can be applied to a wide range of varieties of flowers, fruits and
vegetables, although some of them are especially relevant due to the
great amount of units that are manipulated and processed each year
over the world. The computer vision algorithms developed in this
work are shown in detail, and can be easily extended to other
applications. A special attention is given to the electromagnetic
compatibility in order to avoid noisy images. Furthermore, real
experimentation has been carried out in order to validate the
developed application. In particular, the tests show that the method
has good robustness and high success percentage in the object
characterization.
Abstract: QoS Routing aims to find paths between senders and
receivers satisfying the QoS requirements of the application which
efficiently using the network resources and underlying routing
algorithm to be able to find low-cost paths that satisfy given QoS
constraints. The problem of finding least-cost routing is known to be
NP-hard or complete and some algorithms have been proposed to
find a near optimal solution. But these heuristics or algorithms either
impose relationships among the link metrics to reduce the complexity
of the problem which may limit the general applicability of the
heuristic, or are too costly in terms of execution time to be applicable
to large networks. In this paper, we concentrate an algorithm that
finds a near-optimal solution fast and we named this algorithm as
optimized Delay Constrained Routing (ODCR), which uses an
adaptive path weight function together with an additional constraint
imposed on the path cost, to restrict search space and hence ODCR
finds near optimal solution in much quicker time.
Abstract: Skyline extraction in mountainous images can be used
for navigation of vehicles or UAV(unmanned air vehicles), but it is
very hard to extract skyline shape because of clutters like clouds, sea
lines and field borders in images. We developed the edge-based
skyline extraction algorithm using a proposed multistage edge filtering
(MEF) technique. In this method, characteristics of clutters in the
image are first defined and then the lines classified as clutters are
eliminated by stages using the proposed MEF technique. After this
processing, we select the last line using skyline measures among the
remained lines. This proposed algorithm is robust under severe
environments with clutters and has even good performance for
infrared sensor images with a low resolution. We tested this proposed
algorithm for images obtained in the field by an infrared camera and
confirmed that the proposed algorithm produced a better performance
and faster processing time than conventional algorithms.
Abstract: The evolutionary design of electronic circuits, or
evolvable hardware, is a discipline that allows the user to
automatically obtain the desired circuit design. The circuit
configuration is under the control of evolutionary algorithms. Several
researchers have used evolvable hardware to design electrical
circuits. Every time that one particular algorithm is selected to carry
out the evolution, it is necessary that all its parameters, such as
mutation rate, population size, selection mechanisms etc. are tuned in
order to achieve the best results during the evolution process. This
paper investigates the abilities of evolution strategy to evolve digital
logic circuits based on programmable logic array structures when
different mutation rates are used. Several mutation rates (fixed and
variable) are analyzed and compared with each other to outline the
most appropriate choice to be used during the evolution of
combinational logic circuits. The experimental results outlined in this
paper are important as they could be used by every researcher who
might need to use the evolutionary algorithm to design digital logic
circuits.
Abstract: Multiplication algorithms have considerable effect on
processors performance. A new high-speed, low-power
multiplication algorithm has been presented using modified Dadda
tree structure. Three important modifications have been implemented
in inner product generation step, inner product reduction step and
final addition step. Optimized algorithms have to be used into basic
computation components, such as multiplication algorithms. In this
paper, we proposed a new algorithm to reduce power, delay, and
transistor count of a multiplication algorithm implemented using low
power modified counter. This work presents a novel design for
Dadda multiplication algorithms. The proposed multiplication
algorithm includes structured parts, which have important effect on
inner product reduction tree. In this paper, a 1.3V, 64-bit carry hybrid
adder is presented for fast, low voltage applications. The new 64-bit
adder uses a new circuit to implement the proposed carry hybrid
adder. The new adder using 80 nm CMOS technology has been
implemented on 700 MHz clock frequency. The proposed
multiplication algorithm has achieved 14 percent improvement in
transistor count, 13 percent reduction in delay and 12 percent
modification in power consumption in compared with conventional
designs.
Abstract: In this paper, we propose a selective mutation method
for improving the performances of genetic algorithms. In selective
mutation, individuals are first ranked and then additionally mutated
one bit in a part of their strings which is selected corresponding to
their ranks. This selective mutation helps genetic algorithms to fast
approach the global optimum and to quickly escape local optima.
This results in increasing the performances of genetic algorithms.
We measured the effects of selective mutation with four function
optimization problems. It was found from extensive experiments that
the selective mutation can significantly enhance the performances of
genetic algorithms.
Abstract: The implementation of single-electron tunneling
(SET) simulators based on the master-equation (ME) formalism
requires the efficient and accurate identification of an exhaustive list
of active states and related tunnel events. Dynamic simulations also
require the control of the emerging states and guarantee the safe
elimination of decaying states. This paper describes algorithms for
use in the stationary and dynamic control of the lists of active states
and events. The paper presents results obtained using these
algorithms with different SET structures.
Abstract: This paper reviews the major contributions to the Motion Planning (MP) field throughout a 35-year period, from classic approaches to heuristic algorithms. Due to the NP-Hardness of the MP problem, heuristic methods have outperformed the classic approaches and have gained wide popularity. After surveying around 1400 papers in the field, the amount of existing works for each method is identified and classified. Especially, the history and applications of numerous heuristic methods in MP is investigated. The paper concludes with comparative tables and graphs demonstrating the frequency of each MP method's application, and so can be used as a guideline for MP researchers.
Abstract: This paper reports the study results on neural network
training algorithm of numerical optimization techniques multiface
detection in static images. The training algorithms involved are scale
gradient conjugate backpropagation, conjugate gradient
backpropagation with Polak-Riebre updates, conjugate gradient
backpropagation with Fletcher-Reeves updates, one secant
backpropagation and resilent backpropagation. The final result of
each training algorithms for multiface detection application will also
be discussed and compared.
Abstract: The goal of this paper is to segment the countries
based on the value of export from Iran during 14 years ending at 2005. To measure the dissimilarity among export baskets of different countries, we define Dissimilarity Export Basket (DEB) function and
use this distance function in K-means algorithm. The DEB function
is defined based on the concepts of the association rules and the
value of export group-commodities. In this paper, clustering quality
function and clusters intraclass inertia are defined to, respectively,
calculate the optimum number of clusters and to compare the
functionality of DEB versus Euclidean distance. We have also study
the effects of importance weight in DEB function to improve
clustering quality. Lastly when segmentation is completed, a
designated RFM model is used to analyze the relative profitability of
each cluster.
Abstract: In this contribution an innovative platform is being
presented that integrates intelligent agents and evolutionary
computation techniques in legacy e-learning environments. It
introduces the design and development of a scalable and
interoperable integration platform supporting:
I) various assessment agents for e-learning environments,
II) a specific resource retrieval agent for the provision of
additional information from Internet sources matching the
needs and profile of the specific user and
III) a genetic algorithm designed to extract efficient information
(classifying rules) based on the students- answering input
data.
The agents are implemented in order to provide intelligent
assessment services based on computational intelligence techniques
such as Bayesian Networks and Genetic Algorithms.
The proposed Genetic Algorithm (GA) is used in order to extract
efficient information (classifying rules) based on the students-
answering input data. The idea of using a GA in order to fulfil this
difficult task came from the fact that GAs have been widely used in
applications including classification of unknown data.
The utilization of new and emerging technologies like web
services allows integrating the provided services to any web based
legacy e-learning environment.
Abstract: Power system state estimation is the process of
calculating a reliable estimate of the power system state vector
composed of bus voltages' angles and magnitudes from telemetered
measurements on the system. This estimate of the state vector
provides the description of the system necessary for the operation
and security monitoring. Many methods are described in the
literature for solving the state estimation problem, the most important
of which are the classical weighted least squares method and the nondeterministic
genetic based method; however both showed
drawbacks. In this paper a modified version of the genetic
algorithm power system state estimation is introduced, Sensitivity of
the proposed algorithm to genetic operators is discussed, the
algorithm is applied to case studies and finally it is compared with
the classical weighted least squares method formulation.