Uses of Interface
org.uma.jmetal.solution.Solution
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.agemoea
Classes in org.uma.jmetal.algorithm.multiobjective.agemoea with type parameters of type Solution Modifier and Type Class Description class
AGEMOEA<S extends Solution<?>>
Implementation of AGE-MOEA (Adaptive GEometry-based Many-objective Evolutionary Algorithm).class
AGEMOEABuilder<S extends Solution<?>>
Builder class for AGE-MOEA -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.agemoea.util
Classes in org.uma.jmetal.algorithm.multiobjective.agemoea.util with type parameters of type Solution Modifier and Type Class Description class
AGEMOEAEnvironmentalSelection<S extends Solution<?>>
Environmental Selection used in AGE-MOEA (Adaptive GEometry-based Many-Objective Evolutionary Algorithm)class
SurvivalScoreComparator<S extends Solution<?>>
Comparator based on the survival score of AGE-MOEA -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.agemoeaii
Classes in org.uma.jmetal.algorithm.multiobjective.agemoeaii with type parameters of type Solution Modifier and Type Class Description class
AGEMOEAII<S extends Solution<?>>
Implementation of AGE-MOEA-II (Adaptive GEometry-based Many-objective Evolutionary Algorithm II).class
AGEMOEAIIBuilder<S extends Solution<?>>
Builder class for AGE-MOEA -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.agemoeaii.util
Classes in org.uma.jmetal.algorithm.multiobjective.agemoeaii.util with type parameters of type Solution Modifier and Type Class Description class
AGEMOEA2EnvironmentalSelection<S extends Solution<?>>
Environmental Selection used in AGE-MOEA-II (Adaptive GEometry-based Many-Objective Evolutionary Algorithm II) -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.cdg
Classes in org.uma.jmetal.algorithm.multiobjective.cdg with type parameters of type Solution Modifier and Type Class Description class
AbstractCDG<S extends Solution<?>>
Abstract class for implementing versions of the CDG algorithm. -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.espea
Classes in org.uma.jmetal.algorithm.multiobjective.espea with type parameters of type Solution Modifier and Type Class Description class
ESPEA<S extends Solution<?>>
Implementation of the Electrostatic Potential Energy Evolutionary Algorithm (ESPEA) from the paper "Obtaining Optimal Pareto Front Approximations using Scalarized Preference Information" by M.class
ESPEABuilder<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.espea.util
Classes in org.uma.jmetal.algorithm.multiobjective.espea.util with type parameters of type Solution Modifier and Type Class Description class
AchievementScalarizationComparator<S extends Solution<?>>
Compares solutions based on their achievement scalarization value (ASV).class
EnergyArchive<S extends Solution<?>>
The archive that is used within theESPEA
algorithm.class
ScalarizationValue<S extends Solution<?>>
Scalarization attribute.Methods in org.uma.jmetal.algorithm.multiobjective.espea.util with type parameters of type Solution Modifier and Type Method Description static <S extends Solution<?>>
voidScalarizationUtils. angleUtility(java.util.List<S> solutionsList)
Scalarization values based on angle utility (see Angle-based Preference Models in Multi-objective Optimization by Braun et al.).static <S extends Solution<?>>
voidScalarizationUtils. angleUtility(java.util.List<S> solutionsList, double[][] extremePoints)
Scalarization values based on angle utility (see Angle-based Preference Models in Multi-objective Optimization by Braun et al.).static <S extends Solution<?>>
voidScalarizationUtils. chebyshev(java.util.List<S> solutionsList)
Scalarization values based on the Chebyshev function.static <S extends Solution<?>>
voidScalarizationUtils. chebyshev(java.util.List<S> solutionsList, double[] idealValues)
Scalarization values based on the Chebyshev function.<S extends Solution<?>>
voidScalarizationWrapper. execute(java.util.List<S> solutionsList)
Computes scalarization values and assigns them asScalarizationValue
attribute to the solutions.static <S extends Solution<?>>
voidScalarizationUtils. nash(java.util.List<S> solutionsList)
Scalarization values based on the Nash bargaining solution.static <S extends Solution<?>>
voidScalarizationUtils. nash(java.util.List<S> solutionsList, double[] nadirValues)
Scalarization values based on the Nash bargaining solution.static <S extends Solution<?>>
voidScalarizationUtils. productOfObjectives(java.util.List<S> solutionsList)
Objective values are multiplied.static <S extends Solution<?>>
voidScalarizationUtils. sumOfObjectives(java.util.List<S> solutionsList)
Scalarization values is computed by summing objective values.static <S extends Solution<?>>
voidScalarizationUtils. tradeoffUtility(java.util.List<S> solutionsList)
Scalarization values based on tradeoff utility, also known as proper utility (see "Theory and Algorithm for Finding Knees" by Shukla et al.)static <S extends Solution<?>>
voidScalarizationUtils. uniform(java.util.List<S> solutionsList)
Uniform preferences.static <S extends Solution<?>>
voidScalarizationUtils. weightedChebyshev(java.util.List<S> solutionsList, double[] weights)
Chebyhsev function with weighted objectives.static <S extends Solution<?>>
voidScalarizationUtils. weightedChebyshev(java.util.List<S> solutionsList, double[] idealValues, double[] weights)
Scalarization values based on the weighted Chebyshev function.static <S extends Solution<?>>
voidScalarizationUtils. weightedProduct(java.util.List<S> solutionsList, double[] weights)
Objectives are exponentiated by a positive weight and afterwards multiplied.static <S extends Solution<?>>
voidScalarizationUtils. weightedSum(java.util.List<S> solutionsList, double[] weights)
Objective values are multiplied by weights and summed. -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.gwasfga
Classes in org.uma.jmetal.algorithm.multiobjective.gwasfga with type parameters of type Solution Modifier and Type Class Description class
GWASFGA<S extends Solution<?>>
This class executes the GWASFGA algorithm described in: Saborido, R., Ruiz, A. -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.gwasfga.util
Classes in org.uma.jmetal.algorithm.multiobjective.gwasfga.util with type parameters of type Solution Modifier and Type Class Description class
GWASFGARanking<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.ibea
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.microfame
Classes in org.uma.jmetal.algorithm.multiobjective.microfame with type parameters of type Solution Modifier and Type Class Description class
MicroFAME<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.microfame.util
Classes in org.uma.jmetal.algorithm.multiobjective.microfame.util with type parameters of type Solution Modifier and Type Class Description class
HVTournamentSelection<S extends Solution<?>>
class
WFGHypervolumeV2<S extends Solution<?>>
This class implements the hypervolume indicator. -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.mocell
Classes in org.uma.jmetal.algorithm.multiobjective.mocell with type parameters of type Solution Modifier and Type Class Description class
MOCell<S extends Solution<?>>
class
MOCellBuilder<S extends Solution<?>>
Created by juanjo -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.moead
Classes in org.uma.jmetal.algorithm.multiobjective.moead with type parameters of type Solution Modifier and Type Class Description class
AbstractMOEAD<S extends Solution<?>>
Abstract class for implementing versions of the MOEA/D algorithm.Fields in org.uma.jmetal.algorithm.multiobjective.moead declared as Solution Modifier and Type Field Description protected Solution<?>[]
AbstractMOEAD. indArray
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.moead.util
Classes in org.uma.jmetal.algorithm.multiobjective.moead.util with type parameters of type Solution Modifier and Type Class Description class
ViolationThresholdComparator<S extends Solution<?>>
This class implements the ViolationThreshold ComparatorMethods in org.uma.jmetal.algorithm.multiobjective.moead.util with type parameters of type Solution Modifier and Type Method Description static <S extends Solution<?>>
java.util.List<S>MOEADUtils. getSubsetOfEvenlyDistributedSolutions(java.util.List<S> solutionList, int newSolutionListSize)
This method selects a subset of evenly spread solutions from a solution list. -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.mombi
Classes in org.uma.jmetal.algorithm.multiobjective.mombi with type parameters of type Solution Modifier and Type Class Description class
AbstractMOMBI<S extends Solution<?>>
Abstract class representing variants of the MOMBI algorithmclass
MOMBI<S extends Solution<?>>
class
MOMBI2<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.mombi.util
Classes in org.uma.jmetal.algorithm.multiobjective.mombi.util with type parameters of type Solution Modifier and Type Class Description class
AbstractUtilityFunctionsSet<S extends Solution<?>>
class
ASFUtilityFunctionSet<S extends Solution<?>>
class
ASFWASFGA<S extends Solution<?>>
class
MOMBI2History<T extends Solution<?>>
Created by ajnebro on 10/9/15.class
R2Ranking<S extends Solution<?>>
class
R2RankingAttribute<T extends Solution<?>>
Created by ajnebro on 10/9/15.class
R2RankingNormalized<S extends Solution<?>>
class
TchebycheffUtilityFunctionsSet<S extends Solution<?>>
This class implements a set of utility functions based on the Tchebycheff aggregation approach -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.mosa
Classes in org.uma.jmetal.algorithm.multiobjective.mosa with type parameters of type Solution Modifier and Type Class Description class
MOSA<S extends Solution<?>>
Fields in org.uma.jmetal.algorithm.multiobjective.mosa declared as Solution Modifier and Type Field Description protected S
MOSA. currentSolution
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.nsgaii
Classes in org.uma.jmetal.algorithm.multiobjective.nsgaii with type parameters of type Solution Modifier and Type Class Description class
DNSGAII<S extends Solution<?>>
Created at 10:45 am, 2019/1/29 This algorithm (DIR-Enhanced NSGA-II [DNSGA-II]) is according to "Cai X, Sun H, Fan Z.class
DynamicNSGAII<S extends Solution<?>>
class
NSGAII<S extends Solution<?>>
class
NSGAII45<S extends Solution<?>>
Implementation of NSGA-II following the scheme used in jMetal4.5 and former versions, i.e, without implementing theAbstractGeneticAlgorithm
interface.class
NSGAIIBuilder<S extends Solution<?>>
class
NSGAIIMeasures<S extends Solution<?>>
class
NSGAIIStoppingByTime<S extends Solution<?>>
This class shows a version of NSGA-II having a stopping condition depending on run-timeclass
SteadyStateNSGAII<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.nsgaii.util
Classes in org.uma.jmetal.algorithm.multiobjective.nsgaii.util with type parameters of type Solution Modifier and Type Class Description class
CoverageFront<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.nsgaiii
Classes in org.uma.jmetal.algorithm.multiobjective.nsgaiii with type parameters of type Solution Modifier and Type Class Description class
NSGAIII<S extends Solution<?>>
Created by ajnebro on 30/10/14.class
NSGAIIIBuilder<S extends Solution<?>>
Builder class -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.nsgaiii.util
Classes in org.uma.jmetal.algorithm.multiobjective.nsgaiii.util with type parameters of type Solution Modifier and Type Class Description class
EnvironmentalSelection<S extends Solution<?>>
static class
EnvironmentalSelection.Builder<S extends Solution<?>>
class
ReferencePoint<S extends Solution<?>>
Created by ajnebro on 5/11/14. -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.paes
Classes in org.uma.jmetal.algorithm.multiobjective.paes with type parameters of type Solution Modifier and Type Class Description class
PAES<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.pesa2
Classes in org.uma.jmetal.algorithm.multiobjective.pesa2 with type parameters of type Solution Modifier and Type Class Description class
PESA2<S extends Solution<?>>
class
PESA2Builder<S extends Solution<?>>
Created by Antonio J. -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.pesa2.util
Classes in org.uma.jmetal.algorithm.multiobjective.pesa2.util with type parameters of type Solution Modifier and Type Class Description class
AdaptiveGridArchive<S extends Solution<?>>
This class implements an archive (solution list) based on an adaptive grid used in PAESclass
PESA2Selection<S extends Solution<?>>
This class implements a selection operator as the used in the PESA-II algorithm -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.randomsearch
Classes in org.uma.jmetal.algorithm.multiobjective.randomsearch with type parameters of type Solution Modifier and Type Class Description class
RandomSearch<S extends Solution<?>>
This class implements a simple random search algorithm.class
RandomSearchBuilder<S extends Solution<?>>
This class implements a simple random search algorithm. -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.rnsgaii
Classes in org.uma.jmetal.algorithm.multiobjective.rnsgaii with type parameters of type Solution Modifier and Type Class Description class
RNSGAII<S extends Solution<?>>
class
RNSGAIIBuilder<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.rnsgaii.util
Classes in org.uma.jmetal.algorithm.multiobjective.rnsgaii.util with type parameters of type Solution Modifier and Type Class Description class
PreferenceNSGAII<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.smsemoa
Classes in org.uma.jmetal.algorithm.multiobjective.smsemoa with type parameters of type Solution Modifier and Type Class Description class
SMSEMOA<S extends Solution<?>>
class
SMSEMOABuilder<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.spea2
Classes in org.uma.jmetal.algorithm.multiobjective.spea2 with type parameters of type Solution Modifier and Type Class Description class
SPEA2<S extends Solution<?>>
class
SPEA2Builder<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.spea2.util
Classes in org.uma.jmetal.algorithm.multiobjective.spea2.util with type parameters of type Solution Modifier and Type Class Description class
EnvironmentalSelection<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.wasfga
Classes in org.uma.jmetal.algorithm.multiobjective.wasfga with type parameters of type Solution Modifier and Type Class Description class
WASFGA<S extends Solution<?>>
Implementation of the preference based algorithm named WASF-GA on jMetal5.0class
WASFGAMeasures<S extends Solution<?>>
Implementation of the preference based algorithm named WASF-GA on jMetal5.0 -
Uses of Solution in org.uma.jmetal.algorithm.multiobjective.wasfga.util
Classes in org.uma.jmetal.algorithm.multiobjective.wasfga.util with type parameters of type Solution Modifier and Type Class Description class
WASFGARanking<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.singleobjective.coralreefsoptimization
Classes in org.uma.jmetal.algorithm.singleobjective.coralreefsoptimization with type parameters of type Solution Modifier and Type Class Description class
CoralReefsOptimizationBuilder<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.singleobjective.evolutionstrategy
Classes in org.uma.jmetal.algorithm.singleobjective.evolutionstrategy with type parameters of type Solution Modifier and Type Class Description class
ElitistEvolutionStrategy<S extends Solution<?>>
Class implementing a (mu + lambda) Evolution Strategy (lambda must be divisible by mu)class
EvolutionStrategyBuilder<S extends Solution<?>>
Class implementing a (mu , lambda) Evolution Strategy (lambda must be divisible by mu)class
NonElitistEvolutionStrategy<S extends Solution<?>>
Class implementing a (mu , lambda) Evolution Strategy (lambda must be divisible by mu) -
Uses of Solution in org.uma.jmetal.algorithm.singleobjective.geneticalgorithm
Classes in org.uma.jmetal.algorithm.singleobjective.geneticalgorithm with type parameters of type Solution Modifier and Type Class Description class
GenerationalGeneticAlgorithm<S extends Solution<?>>
class
GeneticAlgorithmBuilder<S extends Solution<?>>
Created by ajnebro on 10/12/14.class
SteadyStateGeneticAlgorithm<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.algorithm.singleobjective.localsearch
Classes in org.uma.jmetal.algorithm.singleobjective.localsearch with type parameters of type Solution Modifier and Type Class Description class
BasicLocalSearch<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.auto.parameter.catalogue
Classes in org.uma.jmetal.auto.parameter.catalogue with type parameters of type Solution Modifier and Type Class Description class
DensityEstimatorParameter<S extends Solution<?>>
class
ExternalArchiveParameter<S extends Solution<?>>
class
RankingParameter<S extends Solution<?>>
class
SelectionParameter<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.component.algorithm
Classes in org.uma.jmetal.component.algorithm with type parameters of type Solution Modifier and Type Class Description class
EvolutionaryAlgorithm<S extends Solution<?>>
Template for evolutionary algorithms.class
RandomSearchAlgorithm<S extends Solution<?>>
Class representing a random search algorithm. -
Uses of Solution in org.uma.jmetal.component.algorithm.multiobjective
Classes in org.uma.jmetal.component.algorithm.multiobjective with type parameters of type Solution Modifier and Type Class Description class
MOEADBuilder<S extends Solution<?>>
Class to configure and build an instance of the MOEA/D algorithmclass
NSGAIIBuilder<S extends Solution<?>>
Class to configure and build an instance of the NSGA-II algorithmclass
SMSEMOABuilder<S extends Solution<?>>
Class to configure and build an instance of the SMS-EMOA algorithm -
Uses of Solution in org.uma.jmetal.component.algorithm.singleobjective
Classes in org.uma.jmetal.component.algorithm.singleobjective with type parameters of type Solution Modifier and Type Class Description class
GeneticAlgorithmBuilder<S extends Solution<?>>
Class to configure and build an instance of a genetic algorithm -
Uses of Solution in org.uma.jmetal.component.catalogue.common.evaluation
Classes in org.uma.jmetal.component.catalogue.common.evaluation with type parameters of type Solution Modifier and Type Interface Description interface
Evaluation<S extends Solution<?>>
Interface representing entities that evaluate a list of solutions -
Uses of Solution in org.uma.jmetal.component.catalogue.common.evaluation.impl
Classes in org.uma.jmetal.component.catalogue.common.evaluation.impl with type parameters of type Solution Modifier and Type Class Description class
MultiThreadedEvaluation<S extends Solution<?>>
Class that evaluates a list of solutions using threads.class
SequentialEvaluation<S extends Solution<?>>
Class that evaluates a list of solutions sequentially.class
SequentialEvaluationWithArchive<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.component.catalogue.common.solutionscreation
Classes in org.uma.jmetal.component.catalogue.common.solutionscreation with type parameters of type Solution Modifier and Type Interface Description interface
SolutionsCreation<S extends Solution<?>>
Interface representing entities that create a list of solutions applying some strategy (e.g, random) -
Uses of Solution in org.uma.jmetal.component.catalogue.common.solutionscreation.impl
Classes in org.uma.jmetal.component.catalogue.common.solutionscreation.impl with type parameters of type Solution Modifier and Type Class Description class
RandomSolutionsCreation<S extends Solution<?>>
Class that creates a list of randomly instantiated solutions. -
Uses of Solution in org.uma.jmetal.component.catalogue.ea.replacement
Classes in org.uma.jmetal.component.catalogue.ea.replacement with type parameters of type Solution Modifier and Type Interface Description interface
Replacement<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.component.catalogue.ea.replacement.impl
Classes in org.uma.jmetal.component.catalogue.ea.replacement.impl with type parameters of type Solution Modifier and Type Class Description class
MOEADReplacement<S extends Solution<?>>
class
MuCommaLambdaReplacement<S extends Solution<?>>
(mu , lambda) replacement.class
MuPlusLambdaReplacement<S extends Solution<?>>
(mu + lambda) replacement.class
PairwiseReplacement<S extends Solution<?>>
Given two populations of equal size, the returned population is composed of the result of the pairwise comparison between the solutions of both populations.class
RankingAndDensityEstimatorReplacement<S extends Solution<?>>
class
SingleSolutionReplacement<S extends Solution<?>>
Given an offspring population composed of a single solution, this solution is compared against a particular solution of the population given by aSequenceGenerator
object.class
SMSEMOAReplacement<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.component.catalogue.ea.selection
Classes in org.uma.jmetal.component.catalogue.ea.selection with type parameters of type Solution Modifier and Type Interface Description interface
Selection<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.component.catalogue.ea.selection.impl
Classes in org.uma.jmetal.component.catalogue.ea.selection.impl with type parameters of type Solution Modifier and Type Class Description class
NaryTournamentSelection<S extends Solution<?>>
class
NeighborhoodSelection<S extends Solution<?>>
This class produces a mating pool composed of solutions belonging to a neighborhood.class
PopulationAndNeighborhoodSelection<S extends Solution<?>>
This class allows to select N different solutions that can be taken from a solution list (i.e, population or swarm) or from a neighborhood according to a given probability.class
RandomSelection<S extends Solution<?>>
Randomly select a number of solutions from a list, with or without replacement -
Uses of Solution in org.uma.jmetal.component.catalogue.ea.variation
Classes in org.uma.jmetal.component.catalogue.ea.variation with type parameters of type Solution Modifier and Type Interface Description interface
Variation<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.component.catalogue.ea.variation.impl
Classes in org.uma.jmetal.component.catalogue.ea.variation.impl with type parameters of type Solution Modifier and Type Class Description class
CrossoverAndMutationVariation<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.lab.experiment
Classes in org.uma.jmetal.lab.experiment with type parameters of type Solution Modifier and Type Class Description class
Experiment<S extends Solution<?>,Result extends java.util.List<S>>
Class for describing the configuration an experimental study.class
ExperimentBuilder<S extends Solution<?>,Result extends java.util.List<S>>
Builder for classExperiment
-
Uses of Solution in org.uma.jmetal.lab.experiment.component.impl
Classes in org.uma.jmetal.lab.experiment.component.impl with type parameters of type Solution Modifier and Type Class Description class
ComputeQualityIndicators<S extends Solution<?>,Result extends java.util.List<S>>
This class computes theQualityIndicator
s of an org.uma.jmetal.experiment.class
ExecuteAlgorithms<S extends Solution<?>,Result extends java.util.List<S>>
This class executes the algorithms the have been configured with a instance of classExperiment
.class
GenerateBoxplotsWithR<Result extends java.util.List<? extends Solution<?>>>
This class generates a R script that generates an eps file containing boxplots The results are a set of R files that are written in the directory#getExperimentBaseDirectory()
/R.class
GenerateFriedmanHolmTestTables<Result extends java.util.List<? extends Solution<?>>>
This class computes the Friedman test ranking and generates a Latex script that produces a table per quality indicator containing the ranking and the result of the Holm post hoc test.class
GenerateFriedmanTestTables<Result extends java.util.List<? extends Solution<?>>>
This class computes the Friedman test ranking and generates a Latex script that produces a table per quality indicator containing the ranking The results are a set of Latex files that are written in the directory#getExperimentBaseDirectory()
/latex.class
GenerateHtmlPages<Result extends java.util.List<? extends Solution<?>>>
This class executes a StudyVisualizer on the experiment provided.class
GenerateWilcoxonTestTablesWithR<Result extends java.util.List<? extends Solution<?>>>
This class generates a R script that computes the Wilcoxon Signed Rank Test and generates a Latex script that produces a table per quality indicator containing the pairwise comparison between all the algorithms on all the solved problems. -
Uses of Solution in org.uma.jmetal.lab.experiment.util
Classes in org.uma.jmetal.lab.experiment.util with type parameters of type Solution Modifier and Type Class Description class
AlgorithmReturningASubSetOfSolutions<S extends Solution<?>>
class
ExperimentAlgorithm<S extends Solution<?>,Result extends java.util.List<S>>
Class defining tasks for the execution of algorithms in parallel.class
ExperimentProblem<S extends Solution<?>>
Class used to add a tag field to a problem. -
Uses of Solution in org.uma.jmetal.operator.crossover.impl
Classes in org.uma.jmetal.operator.crossover.impl with type parameters of type Solution Modifier and Type Class Description class
NullCrossover<S extends Solution<?>>
This class defines a null crossover operator: the parent solutions are returned without any change.Methods in org.uma.jmetal.operator.crossover.impl that return types with arguments of type Solution Modifier and Type Method Description java.util.List<Solution<T>>
NPointCrossover. execute(java.util.List<Solution<T>> s)
java.util.List<Solution<T>>
TwoPointCrossover. execute(java.util.List<Solution<T>> solutions)
java.util.List<CrossoverOperator<Solution<?>>>
CompositeCrossover. getOperators()
Method parameters in org.uma.jmetal.operator.crossover.impl with type arguments of type Solution Modifier and Type Method Description java.util.List<Solution<T>>
NPointCrossover. execute(java.util.List<Solution<T>> s)
java.util.List<Solution<T>>
TwoPointCrossover. execute(java.util.List<Solution<T>> solutions)
-
Uses of Solution in org.uma.jmetal.operator.localsearch.impl
Classes in org.uma.jmetal.operator.localsearch.impl with type parameters of type Solution Modifier and Type Class Description class
BasicLocalSearch<S extends Solution<?>>
This class implements a basic local search operator based in the use of a mutation operator. -
Uses of Solution in org.uma.jmetal.operator.mutation.impl
Methods in org.uma.jmetal.operator.mutation.impl that return types with arguments of type Solution Modifier and Type Method Description java.util.List<MutationOperator<Solution<?>>>
CompositeMutation. getOperators()
-
Uses of Solution in org.uma.jmetal.operator.selection.impl
Classes in org.uma.jmetal.operator.selection.impl with type parameters of type Solution Modifier and Type Class Description class
BinaryTournamentSelection<S extends Solution<?>>
Applies a binary tournament selection to return the best solution between two that have been chosen at random from a solution list.class
NaryTournamentSelection<S extends Solution<?>>
Applies a N-ary tournament selection to return the best solution between N that have been chosen at random from a solution list.class
RankingAndCrowdingSelection<S extends Solution<?>>
This class implements a selection for selecting a number of solutions from a solution list.class
RankingAndDirScoreSelection<S extends Solution<?>>
created at 11:47 am, 2019/1/29 Used for DIR-enhanced NSGA-II (D-NSGA-II) to select the joint solutions for next iteration this code implemented according to "Cai X, Sun H, Fan Z.class
RankingAndPreferenceSelection<S extends Solution<?>>
class
SpatialSpreadDeviationSelection<S extends Solution<?>>
Spatial Spread Deviation selection operator -
Uses of Solution in org.uma.jmetal.parallel.asynchronous.algorithm.impl
Classes in org.uma.jmetal.parallel.asynchronous.algorithm.impl with type parameters of type Solution Modifier and Type Class Description class
AsynchronousMultiThreadedGeneticAlgorithm<S extends Solution<?>>
class
AsynchronousMultiThreadedNSGAII<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.parallel.synchronous
Classes in org.uma.jmetal.parallel.synchronous with type parameters of type Solution Modifier and Type Class Description class
SparkEvaluation<S extends Solution<?>>
Class implementing anEvaluation
based on Apache Spark. -
Uses of Solution in org.uma.jmetal.problem
Classes in org.uma.jmetal.problem with type parameters of type Solution Modifier and Type Interface Description interface
DynamicProblem<S extends Solution<?>,D>
Interface representing dynamic problems. -
Uses of Solution in org.uma.jmetal.solution
Classes in org.uma.jmetal.solution that implement Solution Modifier and Type Class Description class
AbstractSolution<T>
Abstract class representing a generic solutionMethods in org.uma.jmetal.solution that return Solution Modifier and Type Method Description Solution<T>
Solution. copy()
-
Uses of Solution in org.uma.jmetal.solution.binarysolution
Subinterfaces of Solution in org.uma.jmetal.solution.binarysolution Modifier and Type Interface Description interface
BinarySolution
Interface representing binary (bitset) solutions -
Uses of Solution in org.uma.jmetal.solution.binarysolution.impl
Classes in org.uma.jmetal.solution.binarysolution.impl that implement Solution Modifier and Type Class Description class
DefaultBinarySolution
This defines an implementation of a binary solution. -
Uses of Solution in org.uma.jmetal.solution.compositesolution
Classes in org.uma.jmetal.solution.compositesolution that implement Solution Modifier and Type Class Description class
CompositeSolution
Class representing solutions composed of a list of solutions.Methods in org.uma.jmetal.solution.compositesolution that return Solution Modifier and Type Method Description Solution<Solution<?>>
CompositeSolution. copy()
Methods in org.uma.jmetal.solution.compositesolution that return types with arguments of type Solution Modifier and Type Method Description Solution<Solution<?>>
CompositeSolution. copy()
Constructor parameters in org.uma.jmetal.solution.compositesolution with type arguments of type Solution Constructor Description CompositeSolution(java.util.List<Solution<?>> solutions)
Constructor. -
Uses of Solution in org.uma.jmetal.solution.doublesolution
Subinterfaces of Solution in org.uma.jmetal.solution.doublesolution Modifier and Type Interface Description interface
DoubleSolution
Interface representing double solutions, where the variables are a list of bounded double values. -
Uses of Solution in org.uma.jmetal.solution.doublesolution.impl
Classes in org.uma.jmetal.solution.doublesolution.impl that implement Solution Modifier and Type Class Description class
DefaultDoubleSolution
Defines an implementation of the interface -
Uses of Solution in org.uma.jmetal.solution.integersolution
Subinterfaces of Solution in org.uma.jmetal.solution.integersolution Modifier and Type Interface Description interface
IntegerSolution
Interface representing integer solutions, where the variables are a list of bounded integer values. -
Uses of Solution in org.uma.jmetal.solution.integersolution.impl
Classes in org.uma.jmetal.solution.integersolution.impl that implement Solution Modifier and Type Class Description class
DefaultIntegerSolution
Defines an implementation of the interface -
Uses of Solution in org.uma.jmetal.solution.permutationsolution
Subinterfaces of Solution in org.uma.jmetal.solution.permutationsolution Modifier and Type Interface Description interface
PermutationSolution<T>
Interface representing permutation based solutions -
Uses of Solution in org.uma.jmetal.solution.permutationsolution.impl
Classes in org.uma.jmetal.solution.permutationsolution.impl that implement Solution Modifier and Type Class Description class
IntegerPermutationSolution
Defines an implementation of solution composed of a permutation of integers. -
Uses of Solution in org.uma.jmetal.solution.pointsolution
Classes in org.uma.jmetal.solution.pointsolution that implement Solution Modifier and Type Class Description class
PointSolution
Solution used to wrap a point, i.e., an array of double values which are considered as objective values.Constructors in org.uma.jmetal.solution.pointsolution with parameters of type Solution Constructor Description PointSolution(Solution<?> solution)
Constructor -
Uses of Solution in org.uma.jmetal.solution.sequencesolution
Subinterfaces of Solution in org.uma.jmetal.solution.sequencesolution Modifier and Type Interface Description interface
SequenceSolution<T>
Interface representing a sequence of values of the same type -
Uses of Solution in org.uma.jmetal.solution.sequencesolution.impl
Classes in org.uma.jmetal.solution.sequencesolution.impl that implement Solution Modifier and Type Class Description class
CharSequenceSolution
Defines an implementation of solution representing sequences of chars. -
Uses of Solution in org.uma.jmetal.util
Classes in org.uma.jmetal.util with type parameters of type Solution Modifier and Type Class Description class
AdaptiveGrid<S extends Solution<?>>
This class defines an adaptive grid over a list of solutions as the one used by algorithm PAES.Methods in org.uma.jmetal.util with type parameters of type Solution Modifier and Type Method Description static <S extends Solution<?>>
doubleSolutionUtils. averageDistanceToSolutionList(S solution, java.util.List<S> solutionList)
Returns the average euclidean distance of a solution to the solutions of a list.static <S extends Solution<?>>
java.util.List<S>SolutionListUtils. distanceBasedSubsetSelection(java.util.List<S> originalSolutionList, int finalListSize)
Method implements a version of the distance-based subset selection algorithm described in: H.static <S extends Solution<?>>
doubleSolutionUtils. distanceBetweenObjectives(S firstSolution, S secondSolution)
Returns the euclidean distance between a pair of solutions in the objective spacestatic <S extends Solution<?>>
double[][]SolutionListUtils. distanceMatrix(java.util.List<S> solutionSet)
Returns a matrix with the euclidean distance between each pair of solutions in the population.static <S extends Solution<?>>
doubleConstraintHandling. feasibilityRatio(java.util.List<S> solutions)
Returns the ratio of feasible solutions in a solution liststatic <S extends Solution<?>>
voidAlgorithmDefaultOutputData. generateMultiObjectiveAlgorithmOutputData(java.util.List<S> solutionList, long computingTime)
static <S extends Solution<?>>
voidAlgorithmDefaultOutputData. generateSingleObjectiveAlgorithmOutputData(S solution, long computingTime)
static <S extends Solution<?>>
SSolutionUtils. getBestSolution(S solution1, S solution2, java.util.Comparator<S> comparator)
Return the best solution between those passed as arguments.static <S extends Solution<?>>
SSolutionUtils. getBestSolution(S solution1, S solution2, java.util.Comparator<S> comparator, java.util.function.BinaryOperator<S> equalityPolicy)
Return the best solution between those passed as arguments.static <S extends Solution<?>>
SSolutionUtils. getBestSolution(S solution1, S solution2, java.util.Comparator<S> comparator, RandomGenerator<java.lang.Double> randomGenerator)
Return the best solution between those passed as arguments.static <S extends Solution<?>>
java.util.List<S>SolutionListUtils. getInvertedFront(java.util.List<S> solutionSet)
This method receives a normalized list of non-dominated solutions and return the inverted one.static <S extends Solution<?>>
double[][]SolutionListUtils. getMatrixWithObjectiveValues(java.util.List<S> solutionList)
Given a list of solutions, returns a matrix with the objective values of all the solutionsstatic <S extends Solution<?>>
java.util.List<S>SolutionListUtils. getNonDominatedSolutions(java.util.List<S> solutionList)
static <S extends Solution<?>>
double[]SolutionListUtils. getObjectiveArrayFromSolutionList(java.util.List<S> solutionList, int objective)
Given a solution list and the identifier of an objective (0, 1, etc), returns an array with the values of that objective in all the solutions of the liststatic <S extends Solution<?>>
booleanConstraintHandling. isFeasible(S solution)
Given a solution, it is feasible if the number of violated constraints is zerostatic <S extends Solution<?>>
booleanSolutionListUtils. isSolutionDominatedBySolutionList(S solution, java.util.List<? extends S> solutionSet)
static <S extends Solution<?>>
SSolutionUtils. normalize(S solution, double[] minValues, double[] maxValues)
It returns the normalized solution given the minimum and maximum values for each objectivestatic <S extends Solution<?>>
doubleSolutionUtils. normalizedDistanceBetweenObjectives(S firstSolution, S secondSolution, double[] maxs, double[] mins)
static <S extends Solution<?>>
double[][]SolutionListUtils. normalizedDistanceMatrix(java.util.List<S> solutionSet, double[] maxs, double[] mins)
static <S extends Solution<?>>
java.util.List<S>SolutionListUtils. normalizeSolutionList(java.util.List<S> solutions)
This method receives a list of non-dominated solutions and maximum and minimum values of the objectives, and returns a normalized set of solutions.static <S extends Solution<?>>
java.util.List<S>SolutionListUtils. normalizeSolutionList(java.util.List<S> solutions, double[] minValues, double[] maxValues)
This method receives a list of non-dominated solutions and maximum and minimum values of the objectives, and returns a normalized set of solutions.static <S extends Solution<?>>
intConstraintHandling. numberOfViolatedConstraints(S solution)
Returns the number of constraints a solution violates.static <S extends Solution<?>>
voidConstraintHandling. numberOfViolatedConstraints(S solution, int numberOfViolatedConstraints)
Sets the number of violated constraints in a solutionstatic <S extends Solution<?>>
doubleConstraintHandling. overallConstraintViolationDegree(S solution)
Returns the overall constraint violation degree of a solution.static <S extends Solution<?>>
voidConstraintHandling. overallConstraintViolationDegree(S solution, double constraintViolationDegreeValue)
Sets the overall constraint violation degree of a solutionstatic <S extends Solution<?>>
voidAbstractAlgorithmRunner. printQualityIndicators(java.util.List<S> population, java.lang.String paretoFrontFile)
Deprecated.static <S extends Solution<?>>
double[][]SolutionListUtils. writeObjectivesToMatrix(java.util.List<S> solutionList)
static <S extends Solution<?>>
voidStoredSolutionsUtils. writeToOutput(java.util.List<S> solutionList, FileOutputContext context)
Method parameters in org.uma.jmetal.util with type arguments of type Solution Modifier and Type Method Description static void
AbstractAlgorithmRunner. printFinalSolutionSet(java.util.List<? extends Solution<?>> population)
Write the population into two files and prints some data on screen -
Uses of Solution in org.uma.jmetal.util.archive.impl
Classes in org.uma.jmetal.util.archive.impl with type parameters of type Solution Modifier and Type Class Description class
AbstractBoundedArchive<S extends Solution<?>>
class
BestSolutionsArchive<S extends Solution<?>>
Archive that select the best solutions of another archive by applying theSolutionListUtils.distanceBasedSubsetSelection(List, int)
} function.class
CrowdingDistanceArchive<S extends Solution<?>>
Created by Antonio J.class
GenericBoundedArchive<S extends Solution<?>>
This class implements a generic bound archive.class
HypervolumeArchive<S extends Solution<?>>
Created by Antonio J.class
KNNDistanceArchive<S extends Solution<?>>
Created by Antonio J.class
NonDominatedSolutionListArchive<S extends Solution<?>>
This class implements an archive containing non-dominated solutionsclass
SpatialSpreadDeviationArchive<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.util.archivewithreferencepoint
Classes in org.uma.jmetal.util.archivewithreferencepoint with type parameters of type Solution Modifier and Type Class Description class
ArchiveWithReferencePoint<S extends Solution<?>>
This class defines a bounded archive that has associated a reference point as described in the paper "Extending the Speed-constrained Multi-Objective PSO (SMPSO) With Reference Point Based Preference Articulation Accepted in PPSN 2018.Fields in org.uma.jmetal.util.archivewithreferencepoint declared as Solution Modifier and Type Field Description protected S
ArchiveWithReferencePoint. referencePointSolution
-
Uses of Solution in org.uma.jmetal.util.archivewithreferencepoint.impl
Classes in org.uma.jmetal.util.archivewithreferencepoint.impl with type parameters of type Solution Modifier and Type Class Description class
CrowdingDistanceArchiveWithReferencePoint<S extends Solution<?>>
Class representing aArchiveWithReferencePoint
archive using a crowding distance based density estimatorclass
HypervolumeArchiveWithReferencePoint<S extends Solution<?>>
Class representing aArchiveWithReferencePoint
archive using a hypervolume contribution based density estimator. -
Uses of Solution in org.uma.jmetal.util.artificialdecisionmaker
Classes in org.uma.jmetal.util.artificialdecisionmaker with type parameters of type Solution Modifier and Type Class Description class
DecisionTreeEstimator<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.util.artificialdecisionmaker.impl
Classes in org.uma.jmetal.util.artificialdecisionmaker.impl with type parameters of type Solution Modifier and Type Class Description class
ArtificialDecisionMakerDecisionTree<S extends Solution<?>>
Class implementing the Towards automatic testing of reference point based interactive methods described in: Ojalehto, V., Podkopaev, D., & Miettinen, K. (2016, September).class
ArtificiallDecisionMakerBuilder<S extends Solution<?>>
-
Uses of Solution in org.uma.jmetal.util.chartcontainer
Classes in org.uma.jmetal.util.chartcontainer with type parameters of type Solution Modifier and Type Class Description class
ChartForDynamicProblemsContainer<S extends Solution<?>>
Class for configuring and displaying a XChart.class
GenericChartContainer<S extends Solution<?>>
Class for configuring and displaying a XChart. -
Uses of Solution in org.uma.jmetal.util.comparator
Classes in org.uma.jmetal.util.comparator with type parameters of type Solution Modifier and Type Class Description class
DirScoreComparator<S extends Solution<?>>
created at 10:34 pm, 2019/1/28 The comparator of DIR score used in D-NSGA-IIclass
EqualSolutionsComparator<S extends Solution<?>>
This class implements aComparator
(a method for comparingSolution
objects) based whether all the objective values are equal or not.class
FitnessComparator<S extends Solution<?>>
This class implements aComparator
(a method for comparingSolution
objects) based on the fitness value returned by the methodgetFitness
.class
HypervolumeContributionComparator<S extends Solution<?>>
Compares two solutions according to the crowding distance attribute.class
ObjectiveComparator<S extends Solution<?>>
This class implements a comparator based on a given objectiveclass
RankingAndCrowdingDistanceComparator<S extends Solution<?>>
class
RankingAndDirScoreDistanceComparator<S extends Solution<?>>
created at 10:29 pm, 2019/1/28 Comparator combining dominance-ranking comparator and DIR-score comparatorclass
RankingAndSSDComparator<S extends Solution<?>>
class
SpatialSpreadDeviationComparator<S extends Solution<?>>
Compares two solutions according to the Spatial Spread Deviation attribute. -
Uses of Solution in org.uma.jmetal.util.comparator.constraintcomparator
Classes in org.uma.jmetal.util.comparator.constraintcomparator with type parameters of type Solution Modifier and Type Interface Description interface
ConstraintComparator<S extends Solution<?>>
Interface representing constraint comparators -
Uses of Solution in org.uma.jmetal.util.comparator.constraintcomparator.impl
Classes in org.uma.jmetal.util.comparator.constraintcomparator.impl with type parameters of type Solution Modifier and Type Class Description class
NumberOfViolatedConstraintsComparator<S extends Solution<?>>
This class implements aComparator
forSolution
objects based on the number of violated constraints of solutions.class
OverallConstraintViolationDegreeComparator<S extends Solution<?>>
This class implements aComparator
(a method for comparingSolution
objects) based on the overall constraint violation of the solutions, as done in NSGA-II. -
Uses of Solution in org.uma.jmetal.util.comparator.dominanceComparator
Classes in org.uma.jmetal.util.comparator.dominanceComparator with type parameters of type Solution Modifier and Type Interface Description interface
DominanceComparator<S extends Solution<?>>
Interface representing dominance comparators -
Uses of Solution in org.uma.jmetal.util.comparator.dominanceComparator.impl
Classes in org.uma.jmetal.util.comparator.dominanceComparator.impl with type parameters of type Solution Modifier and Type Class Description class
DefaultDominanceComparator<S extends Solution<?>>
This class implements a solution comparator for dominance checkingclass
DominanceWithConstraintsComparator<S extends Solution<?>>
This class implements a solution comparator taking into account the violation constraintsclass
EpsilonDominanceComparator<S extends Solution<?>>
This class implements a solution comparator taking into account the violation constraints and an optional epsilon value (i.e, implements an epsilon dominance comparator)class
GDominanceComparator<S extends Solution<?>>
This class implements a solution comparator according to the concept of g-dominance (https://doi.org/10.1016/j.ejor.2008.07.015) -
Uses of Solution in org.uma.jmetal.util.densityestimator.impl
Classes in org.uma.jmetal.util.densityestimator.impl with type parameters of type Solution Modifier and Type Class Description class
CosineSimilarityDensityEstimator<S extends Solution<?>>
This class implements the a density estimator based on the cosine similarityclass
CrowdingDistanceDensityEstimator<S extends Solution<?>>
This class implements the crowding distanceclass
GridDensityEstimator<S extends Solution<?>>
This class implements the density estimator based on the adaptive grid scheme used in the PAES algorithm.class
HypervolumeContributionDensityEstimator<S extends Solution<?>>
This class implements a density estimator based on the hypervolume contributionclass
KnnDensityEstimator<S extends Solution<?>>
This class implements a density estimator based on the distance to the k-th nearest solutionclass
SpatialSpreadDeviationDensityEstimator<S extends Solution<?>>
This class implements the a density estimator based on the distance to the k-th nearest solutionclass
StrenghtRawFitnessDensityEstimator<S extends Solution<?>>
This class implements the density estimator based on the distance to the k-th nearest solution -
Uses of Solution in org.uma.jmetal.util.distance.impl
Classes in org.uma.jmetal.util.distance.impl with type parameters of type Solution Modifier and Type Class Description class
DistanceBetweenSolutionAndKNearestNeighbors<S extends Solution<?>>
Class for calculating the Euclidean distance between twoDoubleSolution
objects in solution space.class
EuclideanDistanceBetweenSolutionAndASolutionListInObjectiveSpace<S extends Solution<?>,L extends java.util.List<S>>
class
EuclideanDistanceBetweenSolutionsInObjectiveSpace<S extends Solution<?>>
Class for calculating the Euclidean distance between twoSolution
objects in objective space.class
EuclideanDistanceBetweenSolutionsInSolutionSpace<S extends Solution<java.lang.Double>>
Class for calculating the Euclidean distance between twoDoubleSolution
objects in solution space. -
Uses of Solution in org.uma.jmetal.util.extremevalues.impl
Method parameters in org.uma.jmetal.util.extremevalues.impl with type arguments of type Solution Modifier and Type Method Description java.util.List<java.lang.Double>
SolutionListExtremeValues. findHighestValues(java.util.List<Solution<?>> solutionList)
java.util.List<java.lang.Double>
SolutionListExtremeValues. findLowestValues(java.util.List<Solution<?>> solutionList)
-
Uses of Solution in org.uma.jmetal.util.fileoutput
Method parameters in org.uma.jmetal.util.fileoutput with type arguments of type Solution Modifier and Type Method Description void
SolutionListOutput. printObjectivesToFile(FileOutputContext context, java.util.List<? extends Solution<?>> solutionList)
void
SolutionListOutput. printObjectivesToFile(FileOutputContext context, java.util.List<? extends Solution<?>> solutionList, java.util.List<java.lang.Boolean> minimizeObjective)
void
SolutionListOutput. printVariablesToFile(FileOutputContext context, java.util.List<? extends Solution<?>> solutionList)
Constructor parameters in org.uma.jmetal.util.fileoutput with type arguments of type Solution Constructor Description SolutionListOutput(java.util.List<? extends Solution<?>> solutionList)
-
Uses of Solution in org.uma.jmetal.util.legacy.front.impl
Constructor parameters in org.uma.jmetal.util.legacy.front.impl with type arguments of type Solution Constructor Description ArrayFront(java.util.List<? extends Solution<?>> solutionList)
Constructor -
Uses of Solution in org.uma.jmetal.util.legacy.front.util
Methods in org.uma.jmetal.util.legacy.front.util that return types with arguments of type Solution Modifier and Type Method Description java.util.List<? extends Solution<?>>
FrontNormalizer. normalize(java.util.List<? extends Solution<?>> solutionList)
Deprecated.Returns a normalized frontMethod parameters in org.uma.jmetal.util.legacy.front.util with type arguments of type Solution Modifier and Type Method Description java.util.List<? extends Solution<?>>
FrontNormalizer. normalize(java.util.List<? extends Solution<?>> solutionList)
Deprecated.Returns a normalized frontConstructor parameters in org.uma.jmetal.util.legacy.front.util with type arguments of type Solution Constructor Description FrontNormalizer(java.util.List<? extends Solution<?>> referenceFront)
Deprecated.Constructor. -
Uses of Solution in org.uma.jmetal.util.legacy.qualityindicator.impl.hypervolume.impl
Classes in org.uma.jmetal.util.legacy.qualityindicator.impl.hypervolume.impl with type parameters of type Solution Modifier and Type Class Description class
PISAHypervolume<S extends Solution<?>>
Deprecated.class
WFGHypervolume<S extends Solution<?>>
Deprecated. -
Uses of Solution in org.uma.jmetal.util.neighborhood.impl
Classes in org.uma.jmetal.util.neighborhood.impl with type parameters of type Solution Modifier and Type Class Description class
C25<S extends Solution<?>>
Class defining an C25 neighborhood of a solution belonging to a list of solutions which is structured as a bi-dimensional mesh.class
C49<S extends Solution<?>>
Class defining an C49 neighborhood of a solution belonging to a list of solutions which is structured as a bi-dimensional mesh.class
C9<S extends Solution<?>>
Class defining an L9 neighborhood of a solution belonging to a list of solutions which is structured as a bi-dimensional mesh.class
KNearestNeighborhood<S extends Solution<?>>
This class implements a neighborhood that select the k-nearest solutions according to a distance measure.class
L13<S extends Solution<?>>
Class defining an L9 neighborhood of a solution belonging to a list of solutions which is structured as a bi-dimensional mesh.class
L25<S extends Solution<?>>
Class representing neighborhoods for a solution into a list of solutionsclass
L41<S extends Solution<?>>
Class representing neighborhoods for a solution into a list of solutionsclass
L5<S extends Solution<?>>
Class defining an L5 neighborhood of a solution belonging to a list of solutions which is structured as a bi-dimensional mesh.class
RingNeighborhood<S extends Solution<?>>
This class implements a ring-based neighborhood.class
WeightVectorNeighborhood<S extends Solution<?>>
This class implements a neighborhood based on the weight vectors of MOEA/D -
Uses of Solution in org.uma.jmetal.util.observer.impl
Classes in org.uma.jmetal.util.observer.impl with type parameters of type Solution Modifier and Type Class Description class
ExternalArchiveObserver<S extends Solution<?>>
This observer add the solutions of population to an archive.class
RunTimeChartObserver<S extends Solution<?>>
This observer prints a chart in real time showing the current Pareto front approximation produced by an algorithm.class
RunTimeForDynamicProblemsChartObserver<S extends Solution<?>>
This observer prints a chart in real time showing the current Pareto front approximation produced by an algorithm. -
Uses of Solution in org.uma.jmetal.util.point.impl
-
Uses of Solution in org.uma.jmetal.util.ranking.impl
Classes in org.uma.jmetal.util.ranking.impl with type parameters of type Solution Modifier and Type Class Description class
ExperimentalFastNonDominanceRanking<S extends Solution<?>>
This is an implementation of theRanking
interface using non-dominated sorting algorithms from the non-dominated sorting repository.class
FastNonDominatedSortRanking<S extends Solution<?>>
This class implements a solution list ranking based on dominance ranking.class
MergeNonDominatedSortRanking<S extends Solution<?>>
This class implements a solution list ranking based on dominance ranking.class
StrengthRanking<S extends Solution<?>>
This class implements a solution list ranking based on the strength concept defined in SPEA2. -
Uses of Solution in org.uma.jmetal.util.restartstrategy
Classes in org.uma.jmetal.util.restartstrategy with type parameters of type Solution Modifier and Type Interface Description interface
CreateNewSolutionsStrategy<S extends Solution<?>>
interface
RemoveSolutionsStrategy<S extends Solution<?>>
interface
RestartStrategy<S extends Solution<?>>
Created by antonio on 6/06/17. -
Uses of Solution in org.uma.jmetal.util.restartstrategy.impl
Classes in org.uma.jmetal.util.restartstrategy.impl with type parameters of type Solution Modifier and Type Class Description class
CreateNRandomSolutions<S extends Solution<?>>
Created by antonio on 6/06/17.class
DefaultRestartStrategy<S extends Solution<?>>
Created by antonio on 6/06/17.class
RemoveFirstNSolutions<S extends Solution<?>>
Created by antonio on 6/06/17.class
RemoveNRandomSolutions<S extends Solution<?>>
Created by antonio on 6/06/17.class
RemoveNSolutionsAccordingToTheCrowdingDistance<S extends Solution<?>>
Created by antonio on 6/06/17.class
RemoveNSolutionsAccordingToTheHypervolumeContribution<S extends Solution<?>>
Created by antonio on 6/06/17. -
Uses of Solution in org.uma.jmetal.util.solutionattribute.impl
Classes in org.uma.jmetal.util.solutionattribute.impl with type parameters of type Solution Modifier and Type Class Description class
DirScore<S extends Solution<?>>
created at 11:09 pm, 2019/1/28 Estimate DIR scores for solutions, used in D-NSGA-IIclass
Fitness<S extends Solution<?>>
class
GenericSolutionAttribute<S extends Solution<?>,V>
Generic class for implementingSolutionAttribute
classes.class
HypervolumeContributionAttribute<S extends Solution<?>>
class
LocationAttribute<S extends Solution<?>>
Assign to each solution in a solution list an attribute containing the position of the solutions in the list.class
NumberOfViolatedConstraints<S extends Solution<?>>
class
OverallConstraintViolation<S extends Solution<?>>
class
PreferenceDistance<S extends Solution<?>>
class
SpatialSpreadDeviation<S extends Solution<?>>
This class implements the Spatial Spread Deviation density estimator


THE PEOPLE VS. LARRY FLYNT A film review by Scott Renshaw Copyright 1996 Scott Renshaw
(Columbia/Phoenix) Starring: Woody Harrelson, Courtney Love, Edward Norton, Brett Harrelson, Crispin Glover, Richard Paul, Donna Hanover, James Cromwell. Screenplay: Scott Alexander and Larry Karaszewski. Producers: Oliver Stone, Janet Yang, Michael Hausman. Director: Milos Forman.  Reviewed by Scott Renshaw.
THE PEOPLE VS. LARRY FLYNT is such an intriguing and entertaining film biography that it is almost a shame that it had to have a "message." Milos Forman's study of "Hustler" magazine publisher Larry Flynt is an examination of the challenge of accepting potentially offensive material as protected speech under the Constitution, and as such it is not in the same class as solemnly liberal films which congratulate themselves for championing radical notions like "racism is a bad thing." Still, there is a slickness to the way Flynt's legal battles are portrayed which makes it too easy to choose sides. When the film focuses on Flynt as a character and on his relationships, THE PEOPLE VS. LARRY FLYNT soars. When Flynt becomes an icon, it slips.
The film opens in 1952 -- with young Larry and his brother Jimmy selling moonshine in Kentucky -- then flashes forward twenty years to find Larry (Woody Harrelson) and Jimmy (Woody's real-life brother Brett Harrelson) selling a different vice. Their Ohio-based Hustler strip bar is only barely staying afloat, however, and Larry starts up a glossy newsletter to help promote the club. The newsletter unexpectedly takes on a life of its own, and "Hustler" is born, much to the consternation of conservative civic leaders. In 1977, Flynt is arrested for selling pornography, and takes on young civil rights attorney Alan Isaacman (Edward Norton) for his defense. Though he ultimately wins his first case, there always seems to be another one close behind, as Flynt becomes a favored target for anti-pornography legal action. His legal troubles are only part of his life's challenges, though, as a would-be assassin's bullet paralyzes him and his troubled wife Althea (Courtney Love) struggles with her own demons.
Screenwriters Scott Alexander and Larry Karaszewski also wrote the script for Tim Burton's ED WOOD, and FLYNT demonstrates once again that they have a marvelous sense for crafting structure out of eccentricity. Flynt is rendered variously as a libertine capitalist selling what America is buying, as a half-hearted Christian convert and as a bitter, unpredictable paraplegic, yet every facet of his character becomes part of a fascinating whole in Woody Harrelson's performance.  He is brought most fully to life in both respects through his interactions with the cast's other two stand-outs, Edward Norton and Courtney Love. It has taken Norton only a year to become one of the most impressive young actors in film, and he is top-notch as the attorney and unlikely friend who tries to rein in Flynt. Love, meanwhile, simply gives a clinic in creating a complex character. She is dazzling even as Althea dissolves in a losing battle with AIDS, and she appears not at all concerned over whether or not the audience likes her. Few actors can muster that kind of fearlessness.
THE PEOPLE VS. LARRY FLYNT is frequently hilarious as it explores the characters' relationships and challenging in its reluctance to offer embraceable heroes. When it hits the courtrooms, the lines become more clearly drawn, to the film's detriment. The self-aggrandizing pornographer is too easy to side with when opposed by a villainous judge, or such obvious symbols of hypocrisy as savings and loan magnate/ soon-to-be felon Charles Keating (James Cromwell); Jerry Falwell (Richard Paul), whose libel suit becomes the basis for Flynt's Supreme Court challenge, is rendered similarly as a scowling buffoon. Giving Flynt's enemies a face which is easy to laugh at diffuses the point of the film when it is no longer "the people" who are versus Flynt, but simply some nasty stuffed shirts. Flynt's speech is deserving of protection not because he is better than his accusers, but because it shouldn't matter who is better; when Flynt tells reporters that a victory for him would be important because he is "the worst," it is fairly obvious that Alexander, Karaszewski and Forman don't agree.
All the legal wranglings come to a thrilling conclusion, however, in what may be the best courtroom scene I have ever seen. As Isaacson argues Flynt's case before the Supreme Court, the courtroom becomes an opportunity not for sermons, but for the exchange of ideas. At that moment, the issues at the heart of THE PEOPLE VS. LARRY FLYNT matter profoundly, with Norton's passionate defense shattering the earlier dichotomies of right vs. wrong. It made me more disappointed in an earlier scene in which Flynt gives a sincere speech to civil libertarians which is presented without a hint of irony. Larry Flynt, manic smut-peddler, makes for a much more compelling protagonist than Larry Flynt, First Amendment hero.
On the Renshaw scale of 0 to 10 porn in the U.S.A.'s: 8.
Visit Scott Renshaw's MoviePage http://www-leland.stanford.edu/~srenshaw Subscribe to receive reviews directly via email See details on the MoviePage
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


R/get_repsandsenate.R
get_reps_senate.Rd
`get_reps_senate()` generates a dataset for members' service time for the Australian House of Representatives, the Australian Senate, or a joined dataset containing values for both the HoR and Senate. Additionally, will produce a set of arguments that can be used as request codes for the individual datasets.
get_reps_senate(x)
| x | A character string used to request a printout of the request code arguments, *see Request Codes* below, or one of three prepared datasets. |
|---|
A console printout of a tibble containing arguments to be used with the function,
or the requested dataset using x
assigned to a user created variable.
There are four request codes: `reps_senate`, `reps`, `senate` and `codes`.
The specifics of these are:
- `reps_senate` - generates a dataset of HoRs and Senate members; - `reps` - generates a dataset of HoRs members; - `senate` - generates a dataset of Senate members; and - `codes` - returns a tibble of codes used to request data.
An incorrect request code (an argument not associated with a dataset or non-character string argument) will stop function processes and return an error message.


40 days left for Bekasi to generate Rp 1 trillion in local income, mayor says
by News DeskThe city administration of Bekasi in West Java has 40 days left until the end of the year to reach its locally generated income target of Rp 3.3 trillion (US$234 million). According to the Bekasi Local Income Agency, the city has only achieved Rp 2.2 trillion, or 71 percent of its target.
“This is an executive matter and strategy that the agency has discussed. I want it to be optimized,” Bekasi Mayor Rahmat Effendi said on Wednesday, tempo.co reported.
Rahmat said that if the local income was disrupted, Bekasi’s spending would have to be cut back. For the remainder of the budgetary year, Bekasi was therefore trying to add more income from several sources, including taxes and fines.
“That’s why we must optimize it. We have 40 days left,” Rahmat said.
He said income that could be tapped included billboard taxes, land and building taxes and restaurant taxes.
Recently, Bekasi was under fire for cooperating with a local organization (ormas) to increase tax collection efforts.
“[Parking] fees have already almost reached the target (Rp 6 billion),” Rahmat said.
On Monday, the Bekasi administration and Bekasi Council discussed the city’s locally generated income target.
“If the locally generated income drops, a lot of our spending will be in deficit,” Bekasi Council Commission 3 head Abdul Muin Hafidz said. (ami)


Overview
Example Neapolitan Document
Here is an example Neapolitan template, ‘vanilla.np’:
output: vanilla.html --- erb rdoc = Yummy Vanilla Hi <%= name %>, I know you want some of that yummy stuff. --- coderay.ruby %{v a n i l l a}.each do |letter| puts "Give me a #{letter}!" end puts "What's that spell?" --- liquid html <quote> {{ yield }} </quote> --- textile | | 2009 | 2010 | | Has Vanilla? | No | Yes! | As you can see. It's all _fun_ and _games_ here.
Loading the Library
Require the library.
require 'neapolitan'
Reading a Neapolitan File
To load our example template, we can either pass a File object to the Template initializer.
path = "vanilla.np" template = Neapolitan::Template.new(File.new(path))
Or we can use the shortcut file method.
template = Neapolitan.file(path)
Rendering Data Sources
Neapolitan uses Malt on the backend. Malt supports a three separate ways to pass data into a template.
The most obvious data source is a Hash.
data = {:name=>"Tom"} text = template.render(data).to_s text.assert =~ /Hi Tom/
Templates can also be rendered given a Binding.
name = "Huck" text = template.render(binding).to_s text.assert =~ /Hi Huck/
Lastly, they can be rendered with the scope of any other type of Object, including an instance of a Struct.
scope = Struct.new(:name).new("Becky") text = template.render(scope).to_s text.assert =~ /Hi Becky/
FAQ
How do I limit the section formats that can be used?
There are two methods that can be used to limit the formats that of a Neapolitan template, namely, #select and #reject.
After creating a Template object, use the #select and/or the #reject methods to filter out any unwanted formats.
template = Neapolitan.file('example.np') template.reject{ |format| %w{liquid}.include?(format) } template.render(:name=>"Tom")
These methods can be used for more aggressive validation by raising an error.
template = Neapolitan.file('example.np') template.reject do |format| raise TypeError if %w{liquid}.include?(format) false end expect TypeError do template.render(:name=>"Tome") end
Why should template formats be listed before markup format?
Consider what happens if have a document section proccessed by RDoc before applying templating such as ERB:
= Example Hi, <%= name %>
The result never ends up utilizing ERB properly because RDoc transformed the document into:

Example
 Hi, <%= name >
Therefore you should always list the template format before markup formats. Of course usually template formats are not used on section by section basis in anycase, so this won’t be an issue, but it’s good to know just in case.


@* * Copyright 2019 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @(name: String, form: Form[_])(implicit messages: Messages)


Through obeying the GREAT COMMISSION (Matthew 28:18-20):
... to go and make disciples of all nations . . .
We believe the Bible to be the inspired, the only infallible, authoritative Word of God.
We believe that there is one God, eternally existent in three persons: Father, Son and Holy Spirit.
We believe in the deity of our Lord Jesus Christ, in His virgin birth, in His sinless life, in His miracles, in His vicarious and atoning death through His shed blood, in His bodily resurrection, in His ascension to the right hand of the Father, and in His personal return in power and glory.
We believe that for the salvation of lost and sinful people, regeneration by the Holy Spirit is absolutely essential.
We believe in the present ministry of the Holy Spirit by whose indwelling the Christian is enabled to live a godly life.
We believe in the resurrection of both the saved and the lost; they that are saved unto the resurrection of life and they that are lost unto the resurrection of damnation.
We believe in the spiritual unity of believers in our Lord Jesus Christ.


I created a new set of directories and files inside an existing repo. I created an html file and pasted a template into it. I also created a css stylesheet and linked it with the html page.
I got through the session quite quickly, I have some minor experience already with html and css so understanding what I was doing didnt take too long.
I used freeCodeCamp. I wanted to take a more practical approach to learning HTML and CSS. I found it was nice being able to have a way of seeing if what I am learning is actually retained instead of watching a video and assuming that I will remember it.
Something I have always had a bit of trouble with in CSS is positioning. I learnt a lot more about it in FreeCodeCamp, the strategy was to simply pay extra attention to it in my exercises as well as seeking more resources online to assist with my understanding of what I was doing wrong and how to approach positioning differently.
I think there was a lot of satisfaction in the FreeCodeCamp exercises. Being able to create your own html and CSS in the browser and then see it being run correctly was a nice way to positively encourage myself to keep focussed. Getting through all the required sections plus one or two more sections with not too much trouble was something I was really happy with.
I got through the sections quicker than what I expected, but to make the use of the extra time available, I did a couple more sections in the FreeCodeCamp curriculum to try and further my CSS knowledge. I am considering utilizing the feature more perhaps if I need more stretch materials.
I think with the small amount of html and CSS I did before starting the course, it made this section smoother than expected. However after learning all of the extra things I didnt know, I would likely be able to run through these courses much quicker and more efficiently.
Meet HTML and CSS. They work together to make books! It was not always like this though. Before they met eachother, HTML was an author and a good one at that. However, nobody ever read his great stories because the cover was ugly and there were no pictures. CSS was also an author, he made amazing looking covers and had beautiful pictures to accompany his writing. The only problem was that his stories were boring and nobody finished reading his books. One fateful day when they both visited their favorite bookstore "Chromebooks" they bumped into eachother. HTML noticed how beautiful CSS's book covers looked and asked him "did you make those?". HTML had an amazing idea that the two should linkup and work together! From that day on, every book that HTML wrote was accompanied by the beautiful covers and pictures of CSS.
The main obstacle for me was getting the position of elements right in CSS. I wanted to try and apply a bit of everything that I learnt in FreeCodeCamp without overcrowding the blog page. But to keep it clean I needed to correctly position everything. It came down to a bit more research as to how to position elements in the way that I wanted. I figure that this will be a regular approach because every layout is different and will have its own problems.
Launching the blog page on my browser and seeing that the little keyframe animation I created actually worked. Nothing lifechanging, but definitely nice to see some kind of a visual progression of my learning!
HTML would be a Dog, because it understands basic commands and pretty much everyone gets along with it. CSS would be a peacock because it is only known for how pretty it is and how it boasts its looks to others.


During my time in coding, I've accomplished various projects in which I would like to share to the world
Below is a project which entails another's person idea on how her web page would appear and also to advertise it
Anita's Kitchen
Below is a description of a project in which number divisible by 3, we say its "ping", numbers divisible by 5, we say its "pong" and numbers which are both divisible by 3 and 5, we say its "ping-pong"
Ping-pong
Those are my accomplishments currently and more are to come later


Riemann Sums can be used to describe multi-dimensional objects by breaking them down into cross sections. Consider the follow equation that is graphed to the right. I we want to know the area under the curve, we can simply take the integral from -4 to 4:
This gives us an answer, but where did that answer come from? The fact that the integral yeilds the area is proven by the Riemann Sum.
The region under a graph can be represented as a series of rectangles. Adding the area of all of these rectangles is the Riemann Sum. This can be thought of as an approximation of the region under the curve. Use the slider below to play with the number of rectangles. You can see the Riemann Sum calculated below.
As the number of regions(partitions) increases, the approximation becomes closer and closer to the actual answer. No matter how many partitions we create, we will never reach the actual area. We will always be some tiny amount away. This addition of the regions produces a long summation:
Since this notation can become very long and repetitive, a special symbol is used to describe the sum of these terms that follow a similar pattern:
The first thing we can do to simplify this equation is to remove the region width term. This is because the width of every region is the same by the definition of the Riemann Sum. The width term can be pulled off of each term, which allows it to come out of the summation procedure as a constant multiple:
Our next step is to solve for the w and h terms to make our equation generic to any function. Our region width is simply the length of the interval divided by the number of regions. The height of each region is the function value of the left side of the current region. This is simply the left bounds plus the ratio of current region over total regions times the total interval.
Plugging all of this in yields this duanting equation:
This can be used to calculate Riemann Sums for normal intervals of a function. The higher the value used for r, the more accurate your answer becomes but at the tradeoff of taking longer to compute. For those familiar with programming, the summation can be thought of as a for loop that loops r times.
(Left) and (Right) to change the function
(Esc) to exit
Function: Parabola | Partitions: 0 | Riemann Area: 0 | True Area: 0
(Down) decrease partitions
(Up) increase partitions


Quite a few reports on buprenorphine… most of them involve puking. I'm trying to avoid that if possible. Ive never puked from an opiate before and don’t want to start now.
Experienced opiate user, but no tolerance… I do random drugs every couple weeks. 30mg oxy or 40mg hydrocodne is the most I'd take in a night.
Somewhere between 0.4mg-0.6mg suboxone taken sublingually. (An 8mg divided into 4 pieces, one piece divided in half once, and one of those divided in half again.)
0:01 - Watching jeopardy.
0:50 - Slightly dizzy, could be placebo effect or being tired from the soccer. About to take a shower.
1:10 – Out of the shower and feeling normal. I realized the dizziness was from staring at my computer for too long.
1:40 – Light buzz kicked in, feels kinda like the start of an oxy high. Bout to head out to blockbuster and publix.
2:00-4:00 – Light buzz continues, never actually gets me that high.
4:00+ I feel pretty baseline. I'm guessing some must have flaked off when I cut the pill so I ended up taking close to 0.4mg which seems like a pretty small dose. The only problem that I had with my stomach while I was on it was some sharp pains that felt like hunger pangs. This was probably due to the fact that it was around 12am and I had last eaten at about 3pm.
Next time I do it I'll double the dose and see how that works out.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Half Glass=400
Full Glass=550
Half Glass=450
Full Glass=600
Half Glass=550
Full Glass=650
Half Glass=600
Full Glass=700


title=About date=2015-10-15 type=page status=published ~~~~~~ skysail is a modular, domain-centric and RESTful BaaS (Backend as a Service).
Some links for further reading


Save the openvr_api.dll file somewhere on your computer where the user running Firefox can read it (e.g., c:\openvr\).
In Firefox Nightly, navigate to about:config; change the value of dom.vr.openvr.enabled to true and gfx.vr.openvr-runtime to the full path of the openvr_api.dll file (e.g., c:\openvr\openvr_api.dll).
Ensure that your Oculus Home settings allow for Unknown Sources.


When you fill out your registered email address, you will be sent instructions on how to reset your password.


Drag and drop courses, semesters or years to reorder them
Double click on a course to edit its information or delete it
Click on a year title to edit it
Browse - Look at other public plans from your school
Plan
-Download Plan - Save the plan in a JSON format
-Upload Plan - Import a JSON file into a plan
-Edit Colors - Select the colors for all of the departments in your plan
-Make Public - Share your hard work with the world
Username
-Edit Info - Change display name or school
Feedback - Let us know what you think
New - Create a new plan
Save - Save your plan (Only Avaliable when Logged in)
Open - Open a saved plan


The Tale of Tommy Fox
by Arthur Scott Bailey
The Tale of Tommy Fox is a story about the adventures of the mischievous Tommy Fox and his escapades with the Farmer, his dog, and his boy.
Source: Bailey, A. S. (1917). The Tale of Tommy Fox. New York: Grosset and Dunlap.
- Chapter 1: “Tommy Enjoys Himself”
- Tommy Fox plays with a feather and runs in circles to distract a dog’s scent trail. On his way home, he gets hungry and picks up the scent of Old Mother Grouse.
- Chapter 2: “Johnnie Green Goes Hunting”
- Tommy sees Old Mother Grouse and tries to eat her but she flies away just in time. He hears Johnny Green and runs home.
- Chapter 3: “Tommy Fox Learns to Hunt”
- Mrs. Fox teaches Tommy how to hunt by using a woodchuck.
- Chapter 4: “Mother Grouse’s Children”
- Tommy learns a lesson about cleverness when he is fooled by Old Mother Grouse and is unable to catch her or her children.
- Chapter 5: “Tommy Fox is Hungry”
- When Tommy Fox plays ill, a squirrel is fooled.
- Chapter 6: “Mr. Gray Squirrel’s Mistake”
- Tommy Fox opens one eye a little bit to see the squirrel. The squirrel saw this and Tommy missed catching the squirrel.
- Chapter 7: “Tommy Chases Mr. Woodchuck”
- Tommy Fox plays a cat-and-mouse game with Mr. Woodchuck and Mr. Woodchuck escapes down a hole.
- Chapter 8: “Something Makes Tommy Very Proud”
- Tommy hunts Mr. Woodchuck and brings him home.
- Chapter 9: “Tommy Fox in Trouble”
- Despite a warning from his mother, Tommy tries to steal one of Farmer Green’s hens.
- Chapter 10: “Mrs. Fox Outwits Dog Spot”
- When Tommy is chased by Farmer Green’s dog for trying to steal a hen, he runs straight for home.
- Chapter 11: “Tommy Grows Too Careless”
- Tommy was older now and loved to have Spot, the dog, chase him. When Spot almost catches him, Tommy runs home. Spot discovers Tommy’s home and Tommy is worried.
- Chapter 12: “Old Mr. Crow Is Pleased”
- When Mrs. Fox returns home, she finds a trap outside her house. She warns Tommy not to step on the trap, but when Mr. Crow yells out something, Tommy is frightened and steps in the trap.
- Chapter 13: “Johnnie Green and His New Pet”
- When Tommy is caught in a trap, Farmer Green’s son wants to keep him as a pet.
- Chapter 14: “Tommy Fox Makes a Strange Friend”
- Tommy and Spot become friends. Farmer Green discovers hen feathers near Tommy.
- Chapter 15: “Johnnie Green Feels Sad”
- When Farmer Green discovers that Tommy was stealing his hens, he wants to kill Tommy. Johnnie feels sad for Tommy, but luckily Tommy escapes.
- Chapter 16: “Tommy Becomes Boastful”
- Johnnie lets Tommy loose. Tommy runs to his new home with his mother. He tells the forest animals his adventures with Farmer Green.
- Chapter 17: “Paying a Call on a Friend”
- Mr. Crow tricks Tommy into paying a call on his new friend Spot. When Tommy sees that Farmer Green has a new dog, he runs home.
- Chapter 18: “The World Turns White”
- Tommy and his mother are chased by Farmer Green’s new dog. They try to outwit and outrun him.
- Chapter 19: “Tommy Fox Learns a New Trick”
- Tommy and his mother outwit and outrun the farmer’s dogs.
- Chapter 20: “The Drummer of the Woods”
- Tommy makes up his mind to catch a grouse and chases Mr. Grouse.
- Chapter 21: “The Biggest Surprise of All”
- Tommy tries to catch Mr. Grouse. Mrs. Fox has five babies.


Age
12
13
15
Hobby
football
boxing
swimming
Message
City
Select city
Kyiv
Vinnitsa
Dnepr
submit
clear


Police: Missing endangered 73-year-old woman could be headed to Durham from Charlotte
by WBTV Web StaffCHARLOTTE, N.C. (WBTV) - Police in North Carolina are asking for the public’s help locating a missing 73-year-old woman who could be endangered.
Linda McClinton Ross was last seen at a McDonald’s in Dunn, N.C. This is about 3 hours and less than 200 miles away from Charlotte and and hour and a half and 60 miles from Durham, N.C., where police say she could be heading.
Officials say Ross is believed to be suffering from dementia or some other cognitive impairment.
 She was last seen wearing a green head wrap, a blue jacket and jeans.
She is driving a silver 2005 Volvo S60 with N.C. plate ZVW7239.
Anyone who sees Ross or has information on her whereabouts is asked to call Detective K. Childers at the Mecklenburg Police Department at<PHONE_NUMBER>.


Week 8 - Blog Redesign
The Challenge
I'm in the final stretch for my phase 0 prep work for DBC. These last two weeks are all about review and we have some freedom to choose what we work on. One of those options was to update the design of our personal github.io websites that we use to blog.
I've been pretty satisfied with my layout but there have been some things bothering me about the design since I got it up and running back in week 2. That seems forever ago now. Here is the list of things that were bothering me and what I did to address them.
- Color Scheme to Dark
- Gradient Color Backgrounds made some text hard to read
- Blog posts not easily accessed from central location
- Font for general text to small and spacing to close
- List items poorly spaced and formatted with no bullets
- Background not fun enough
Color Scheme to Dark
From the get go I felt the background color was to dark for idea of a mountain scene that I wanted to depict. I attempted some changes but ran out of time back in week 2. This time around I was sure to go much lighter with not only the background but also the background color of the nav bar, main section, and footer elements. The lighter color really makes reading text much easier on the eyes and provides a much more pleasant reading experience.
Gradient Color Backgrounds Distracting
The gradients for backgrounds was a cool idea but it was distracting and made it hard to read some text depending on its location. The main background still retains it's gradient but it is much more subtle and gives the impression of the sky.
The gradient for the nav bar, main section, and footer were removed all together. The solid lighter color looks much more pleasing and makes reading text simple.
Blog posts not organized and easily accessed
The more we get into DBC the more I started to realize that the blog posts are the main point of our github.io websites. It's here that we want to show off what we are learning as well as our ability to contribute to the tech community at large. Because of this I wanted my website to really be about my blog posts.
I moved the posts all to their own directory and then provided a main page where you can scroll through my posts by date. Each preview on this page is just a small excerpt from the larger post and allows for quick access to the full post.
I also left the blog posts linked in my unit directory for phase 0 that I now moved under the DBC link. This makes for a cleaner approach and works well I think.
Rethinking Font Size and Spacing
My Font size and spacing was driving me nuts! I looked at other peoples blogs and started to notice that their font sizes where much larger and had a greater spacing between lines. After some research and some playing I finally came to a font, font size, and font spacing that I think really makes for an easy read.
Hats off to Whitney O'Banner and her blog for giving me the inspiration for getting my fonts right!
List items poorly formatted
My CSS for unordered list items was horrid! The padding and margins made lists indent way to far. I also hated that I had no bullet icons for each item in the list. Since I love lists, I had to take the time to fix this!
I knocked back the padding and margin and then followed up by using FontAwesome to add some checks as bullets. I also decreased the font size on unordered lists so that they stand out a bit more. The end result turned out great.
Back ground needs to be fun!
Not that the mountains weren't fun but I wanted to add some clouds and a sun. Once I did that I had to make them move!
I dug into jQuery and found the animation method that allows for moving HTML elements around the page and I was soon having fun. A word of caution! Memory leaks through JavaScript are real and I had one that I had to solve from implementing my animations. Making sure to end each animation before starting the next solved the problem and the end result is pretty cool. Take a look at my.js files if you want to see how I get things moving.
Feedback
Next I sent my redesign over to Matt Chan to get some feedback. It's always nice to have some ideas as to what is working and what is nice. Matt was nice enough to point out that my landing page was a bit much with my twitter feed and about me all crammed together into a single page.
He showed me some examples of simple and clean landing pages that really looked nice so I decided to opt for simple vs crazy. I removed the nav bar, main section, and footer elements all together and simply spelled out my name, centered it in the middle of my mountain scene and added a couple of links below it. The effect is pretty cool and I have to thank Matt for the idea.
Conclusion
A much needed revamp and a more professional and fun website as a result. The process was fun but I fear I spent a good amount of time playing around with jQuery animations. Please send me feed back on the changes and let me know what you think. I had fun getting it set up and I hope you enjoy it.


TechFolio Designer (TFD) is a cross-platform desktop application, implemented using Electron, which is intended to simplify the management of your professional portfolios.
Prior to the development of TFD, creating a personal TechFolio required choosing between the following:
Edit TechFolio files in the cloud using GitHub’s browser-based editing tools. This requires no setup, but browser-based editing is very primitive and error-prone. In particular, it is very easy to make mistakes while editing the bio.json file.
Edit TechFolio files locally. This requires you to use a git client (so that you can download the files to edit, and upload them back to GitHub after you’ve finished), and to use an IDE to edit the files. This requires some sophistication with git as well as knowledge of an IDE. In addition, as the IDE does not “know” about the structure of TechFolio files, it is still relatively easy to make errors.
TFD provides a third alternative, one where the desktop application builds in knowledge about TechFolio portfolios and the need to use git to host them at GitHub. This means:
TFD provides a simplified interface to Git and GitHub. After authenticating, TechFolio provides simple menu commands to obtain your portfolio files from GitHub for editing and to upload them back to GitHub for publication.
TFD provides editors for Projects and Essays. Since these editors are designed to be used only for TechFolio files, they can build in knowledge about Markdown and YAML front matter to prevent common problems.
TFD provides a simplified, form-driven user interface for editing the bio.json file. This ensures that the JSON file syntax is maintained.
TFD is still under initial development, and does not yet implement all of the potentially helpful features such an application could have.


From time to time I encounter this question. Time to think a little about it really. This is not just my opinion, it is the universal truth.
So, is it okay to be "just a programmer". It depends, I'd say:
Yes, if you feel delight when you can help a colleague with a problem. You want to encourage peers to think, generally want to discuss on making things better.
No, if you think this is everyone for her/himself kind of business. You secretly smirk and take joy of other people's problems.
 Heck, even I might think so sometimes. But still you listen, understand that even if most of it is fad, there's something that's worth hearing out. You comment with insight, not with repulsion or violence.

Yes, if your programming is dictated by customer demand and your goal is for them to be satisfied. You could be lean start-up sort of being, or anything.
No, if you not only think that things people are asking for are worth shit, but the people too.
Yes, if you want to know why you program. How you program. What are the reasons you currently program and what benefit it gives.
No, if you'd actually want to do something else than be a programmer.
Yes, if you want to continuously improve your programming.
No, if you think programming is something others tell you to do.
Yes, if you care about the way you do so, that you want to know why work items are in the list
No, if you just want someone to give you the mentioned item, do it in five minutes and watch kittens from internet for rest of the day.
No, if you'd like to use Jira on your spare time projects.
No, if you think everything new, languages, tools, methods, sounds, tastes, colors are just there to bug you.
No, if you like to be bugged by everything new and also like to complain about that.
No, if you think it's your employers duty to teach you EVERYTHING.

Yes, if you are a programming motherfucker, armed with yearning to solve all problems with the power that is given.

Generally, being "just a programmer" is mighty fine. Programming is something that makes us powerful, it also gives us responsibility. If just programming means making trouble, slowing things intentionally down it also means costs. Costs for others, and costs for you. But it is the others that pay.
I am just a programmer.


To understand the what Selenium Poetry is and what you can do with it, keep reading this tutorial. However, if you just want to take a look at the API, you'll find it at doc/api/index.html.
In this tutorial we will assume the development of a tiny application: The Postcard Galley.
There's this artist who designs very fancy postcards. He sells them using his web site. To see it load the following file in your web browser:
doc/tutorial/app/index.html
Or look the image and code below:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
"http://www.w3.org/TR/html4/strict.dtd">

<meta http-equiv="Content-type" content="text/html; charset=utf-8">
<link rel="stylesheet" href="application.css" type="text/css" media="screen" charset="utf-8">
<title>Postcard Gallery</title>

Postcard Gallery

Drag the postcards you like to the area on the right. After that, click on Buy.

Buy

The application has only three pages. The postcards are located in the very homepage. A visitor interested in buying a few of them can drag them to the selection area on the right. Clicking on 'Buy' the visitor is presented with a form where he should provide contact info. Finally, after submitting the form, the visitor will see a thank-you-page.
It isn't a completely automated sales process. But, it's enough for the purposes of this tutorial. Oh, it's not completely functional either, but you'll get the picture.
There are two sets of tests for this application. One of them uses Selenium Poetry while the other uses just regular Selenium commands. Both sets test the same aspects of the application, but you'll see that there's a dramatic improvement in test readability when Selenium Poetry is used, compared with the regular Selenium version.
The tests are located in the directories:
doc/tutorial/test/selenium_poetry
doc/tutorial/test/selenium_regular
Let's begin with the tests for the homepage. Look at the file:
doc/tutorial/test/selenium_poetry/index.rsel
Or look the code below:
load_selectors :index
should_have_text "page heading", "Postcard Gallery"
should_have "postcard of rio de janeiro",
"postcard of recife",
"postcard of norway",
"postcard of littleboy",
"selection area",
"postcards area",
"buy button"
should_equal "number of postcards" => 4
should_be "empty selection area"
should_drag_and_drop "postcard of rio de janeiro", "selection area"
should_wait_for_equal "number of postcards" => 3,
"number of postcards selected" => 1
should_not_be "empty selection area"
should_store "number of postcards" => "numberOfPostarcdsAvaliable"
should_drag_and_drop "postcard of recife", "selection area"
should_be "less postcards after drag"
click_on_and_wait "buy button"
Take a moment and try to read it all. As you go, try to figure out what the purpose of the test is.
Are you done? Then, let's move on. Open the file:
doc/tutorial/test/selenium_regular/index.rsel
Or look the code below:
assert_text "//h1", "Postcard Gallery"
assert_element_present<EMAIL_ADDRESS>and @alt="Rio de Janeiro" and @title="Rio de Janeiro"]'
assert_element_present<EMAIL_ADDRESS>and @alt="Recife" and @title="Recife"]'
assert_element_present<EMAIL_ADDRESS>and @alt="Norway" and @title="Norway"]'
assert_element_present<EMAIL_ADDRESS>and @alt="Littleboy" and @title="Littleboy"]'
assert_element_present '//div[@id="selection"]'
assert_element_present '//div[@id="postcards"]'
assert_element_present 'buy button'
assert_eval "this.page().findElement('postcards').select('img').length;", 4
assert_eval "this.page().findElement('selection').select('img').length == 0;", true
drag_and_drop_to_object<EMAIL_ADDRESS>and @alt="Rio de Janeiro" and @title="Rio de Janeiro"]', '//div[@id="selection"]'
wait_for_eval 'this.page().findElement('postcards').select('img').length;', 3
wait_for_eval 'this.page().findElement('selection').select('img').length;', 1
assert_eval "this.page().findElement('selection').select('img').length == 0;", false
store_eval "this.page().findElement('postcards').select('img').length;", "numberOfPostarcdsAvaliable"
drag_and_drop_to_object<EMAIL_ADDRESS>and @alt="Recife" and @title="Recife"]', '//div[@id="selection"]'
assertEval "this.page().findElement('selection').select('img').length < numberOfPostarcdsAvaliable;", true
click_and_wait<EMAIL_ADDRESS>and text()="Buy"]'
This tests the very same things as the previous one. But, boy, what a difference! Isn't that much more confusing and polluted?
The source of the problem is the use of XPath selectors in the same file where we place the test actions. To understand that, let's forget about Selenium mechanics for a moment. Say we're just writing a test script on a piece of paper. We'd probably write things like these:
This is straightforward and easy to communicate to anyone else, except the computer. It demands more precision from ourselves. It wants to know what part of the HTML are we referring to. That's why we must use XPath selectors, or any kind of selector that Selenium would allow.
We solved this problem separating concerns. We decided to place test purposes in one place and selectors in another. Take a look at the file:
doc/tutorial/test/selenium_poetry/selectors/index.yml
Or look the code below:
page heading:
//h1
postcard of rio de janeiro:
<EMAIL_ADDRESS>and @alt="Rio de Janeiro" and @title="Rio de Janeiro"]
postcard of recife:
<EMAIL_ADDRESS>and @alt="Recife" and @title="Recife"]
postcard of norway:
<EMAIL_ADDRESS>and @alt="Norway" and @title="Norway"]
postcard of littleboy:
<EMAIL_ADDRESS>and @alt="Littleboy" and @title="Littleboy"]
selection area:
//div[@id="selection"]
postcards area:
//div[@id="postcards"]
buy button:
<EMAIL_ADDRESS>and text()="Buy"]
number of postcards:
this.page().findElement('postcards').select('img').length;
number of postcards selected:
this.page().findElement('selection').select('img').length;
empty selection area:
this.page().findElement('selection').select('img').length == 0;
less postcards after drag:
this.page().findElement('selection').select('img').length < numberOfPostarcdsAvaliable;
This file contains only selectors. Actually that's not completely true. There are selectors and keys. It's like a Ruby Hash. There's a key and value. In this case, the key is a phrase that describes the selector, while the value is the selector itself. Let's see an example. In the selector's file, you might find something like this:
postcard of rio de janeiro:
<EMAIL_ADDRESS>and @alt="Rio de Janeiro" and @title="Rio de Janeiro"]
When Selenium Poetry loads this file, it creates a Ruby Hash like the one below:
{ 'postcard of rio de janeiro' =><EMAIL_ADDRESS>and @alt="Rio de Janeiro" and @title="Rio de Janeiro"]' }
From then on, you don't need to think about the HTML selector anymore. You just use the keys ('postcard of rio de janeiro', in the last case).
This separation of concerns not only helps you to write more readable tests, but also creates opportunities for reuse. You can use the same key in several test cases. If the corresponding selector changes, you just have to change in one place, so it's also much DRYer.
In order to use the keys in your Selenium tests, all you have to do is to load them in the beginning of the test. That's how you do it:
load_selectors :index
This will load the keys in the file index.yml, which must be placed in the directory test/selectors of your Rails application. If you need to load keys from several selector files, you just do like this:
load_selectors :checkout, :finish
The keys placed in the files checkout.yml and finish.yml will be loaded. You can spread your keys in as many files as you want.
Authors: Vinícius Teles and Marcos Tapajós
Pictures from Flickr (Creative Commons):
Norway - Ken Douglas
Rio de Janeiro - Daniël Silveira
Recife - Antonio Serra
LittleBoy - Marcus Correa