STRIP--a strip-based neural-network growth algorithm for learning multiple-valued functions

Conflict resolution in the case of convective weather cell circumvention

This research analyzes the area required for the conflict resolution between aircraft in two flows impacted by a convective weather cell (CWC). The CWC is introduced as a constrained area, forbidden to flight through, which affects the air traffic flows. Prior the conflict resolution, two flows and their intersection are relocated away from the CWC area (thus enabling circumvention of the CWC), which is followed by a tuning of the relocated flows intersection angle in order to create the minimal size of the conflict zone (CZ-a circular area centered at the intersection of two flows, which provides aircraft enough space to completely resolve the conflict within). Therefore, the essence of the proposed solution is in providing conflict free trajectories for the aircraft in intersecting flows that are affected by the CWC, with the goal of minimizing the CZ size, so the finite occupied airspace for the conflict resolution and the CWC circumvention could be reduced. Compared to the best solutions and current industry practice, this article is focused in reduction of the airspace required for aircraft to aircraft and aircraft to weather conflict resolution, and not to distance travelled, time savings, and fuel consumption minimization. The conducted analysis in the MicrosoftExcel2010 confirmed the relevance of the proposed model and demonstrated variations in efficiency of the utilized airspace. The proposed model's transdisciplinary nature makes it potentially applicable in other fields of study, such as the conflict resolution between unmanned aerial vehicles (UAVs) and fixed objects like buildings. Building on this model and taking in consideration large and complex data sets, such as weather related data and flight data (aircraft position, speed, and altitude), we believe it is possible to conduct more sophisticated analyses that would take advantage of Big Data.

Bi-objective Elite Differential Evolution Algorithm for Multivalued Logic Networks

In this paper, a novel algorithm called bi-objective elite differential evolution (BOEDE) is proposed to optimize multivalued logic (MVL) networks. It is a multiobjective algorithm completely different from all previous single-objective optimization ones. The two objective functions, error and optimality, are put into evaluating the fitness of individuals in evolution simultaneously. BOEDE innovatively uses an archive population with different ranks to store elite individuals and offsprings. Moreover, a characteristic updating method based on this archive structure is designed to produce the parent population. Because of the particularity of MVL network problems, the performance of BOEDE to solve them is further improved by strictly distinguishing elite solutions and Pareto optimal solutions, and by modifying the method of dealing with illegal variables. The simulations show that BOEDE can collect a great number of solutions to provide decision support for a variety of applications. The comparison results also indicate that BOEDE is significantly better than the existing algorithms.

Training of a feedforward multiple-valued neural network by error backpropagation with a multilevel threshold function

A technique for the training of multiple-valued neural networks based on a backpropagation learning algorithm employing a multilevel threshold function is proposed. The optimum threshold width of the multilevel function and the range of the learning parameter to be chosen for convergence are derived. Trials performed on a benchmark problem demonstrate the convergence of the network within the specified range of parameters.

On the number of multilinear partitions and the computing capacity of multiple-valued multiple-threshold perceptrons

We introduce the concept of multilinear partition of a point set V/spl sub/R/sup n/ and the concept of multilinear separability of a function f:Vtwo head right arrowK={0,...,k-1}. Based on well-known relationships between linear partitions and minimal pairs, we derive formulae for the number of multilinear partitions of a point set in general position and of the set K(2). The (n,k,s)-perceptrons partition the input space V into s+1 regions with s parallel hyperplanes. We obtain results on the capacity of a single (n,k,s)-perceptron, respectively, for V subset R(n) in general position and for V=K(2). Finally, we describe a fast polynomial-time algorithm for counting the multilinear partitions of K(2).