added more projects

LICENSE

@@ -1,21 +1,21 @@
-MIT License
-
-Copyright (c) Multi Expression Programming X
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
+MIT License
+
+Copyright (c) Multi Expression Programming X
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

README.md

@@ -1,21 +1,21 @@
-# MEPX - cross-platform software implementing Multi Expression Programming technique
-
-Data analysis (symbolic regression, binary and multi-class classification) with a friendly user interface. Runs on Windows (32bit and 64bit), Mac OSX (64bit) and Ubuntu (64bit).
-
-Download the binaries from the Release section of this repository.
-
-#More info:
-
-https://www.mepx.org
-
-https://mepx.github.io/
-
-https://github.com/mepx
-
-#Discussion Group:
-
-https://groups.google.com/d/forum/mepx
-
-#Contact author:
-
+# MEPX - cross-platform software implementing Multi Expression Programming technique
+
+Data analysis (symbolic regression, binary and multi-class classification) with a friendly user interface. Runs on Windows (32bit and 64bit), Mac OSX (64bit) and Ubuntu (64bit).
+
+Download the binaries from the Release section of this repository.
+
+#More info:
+
+https://www.mepx.org
+
+https://mepx.github.io/
+
+https://github.com/mepx
+
+#Discussion Group:
+
+https://groups.google.com/d/forum/mepx
+
+#Contact author:
+
 mihai.oltean@gmail.com

mepx-projects/time series/Josephus_sequence.xml

@@ -0,0 +1,123 @@
+<?xml version="1.0"?>
+<project>
+	<mepx_version>2022.08.20.0-beta</mepx_version>
+	<problem_description>A006257 Josephus sequence
+
+0,1,1,3,1,3,5,7,1,3
+
+taken from OEIS</problem_description>
+	<algorithm>
+		<training>
+			<num_data>10</num_data>
+			<num_cols>1</num_cols>
+			<num_outputs>1</num_outputs>
+			<num_classes>0</num_classes>
+			<data_type>2</data_type>
+			<list_separator>;</list_separator>
+			<data>
+				<row>0</row>
+				<row>1</row>
+				<row>1</row>
+				<row>3</row>
+				<row>1</row>
+				<row>3</row>
+				<row>5</row>
+				<row>7</row>
+				<row>1</row>
+				<row>3</row>
+			</data>
+		</training>
+		<validation>
+			<num_data>0</num_data>
+			<num_cols>0</num_cols>
+			<num_outputs>1</num_outputs>
+			<num_classes>0</num_classes>
+			<data_type>0</data_type>
+			<list_separator>;</list_separator>
+		</validation>
+		<test>
+			<num_data>0</num_data>
+			<num_cols>0</num_cols>
+			<num_outputs>0</num_outputs>
+			<num_classes>0</num_classes>
+			<data_type>0</data_type>
+			<list_separator>;</list_separator>
+		</test>
+		<parameters>
+			<mutation_probability>0.01</mutation_probability>
+			<crossover_probability>0.9</crossover_probability>
+			<crossover_type>0</crossover_type>
+			<chromosome_length>100</chromosome_length>
+			<subpopulation_size>400</subpopulation_size>
+			<num_subpopulations>8</num_subpopulations>
+			<tournament_size>2</tournament_size>
+			<number_of_generations>500</number_of_generations>
+			<problem_type>3</problem_type>
+			<random_seed>0</random_seed>
+			<operators_probability>0.5</operators_probability>
+			<variables_probability>0.4</variables_probability>
+			<constants_probability>0.1</constants_probability>
+			<num_runs>10</num_runs>
+			<use_validation_data>1</use_validation_data>
+			<simplified>0</simplified>
+			<num_threads>8</num_threads>
+			<random_subset_selection_size_percent>100</random_subset_selection_size_percent>
+			<error_measure>0</error_measure>
+			<num_generations_for_which_random_subset_is_kept_fixed>1</num_generations_for_which_random_subset_is_kept_fixed>
+			<time_series_mode>0</time_series_mode>
+			<num_predictions>10</num_predictions>
+			<window_size>2</window_size>
+			<data_type>2</data_type>
+		</parameters>
+		<constants>
+			<data_type>2</data_type>
+			<type>1</type>
+			<num_automatic_constants>5</num_automatic_constants>
+			<min_interval>0</min_interval>
+			<max_interval>10</max_interval>
+			<stddev>1</stddev>
+			<evolve>1</evolve>
+			<can_evolve_outside_initial_interval>0</can_evolve_outside_initial_interval>
+			<num_user_defined_constants>0</num_user_defined_constants>
+		</constants>
+		<operators>
+			<use_addition>1</use_addition>
+			<use_subtraction>1</use_subtraction>
+			<use_multiplication>1</use_multiplication>
+			<use_division>1</use_division>
+			<use_power>0</use_power>
+			<use_sqrt>0</use_sqrt>
+			<use_exp>0</use_exp>
+			<use_pow10>0</use_pow10>
+			<use_ln>0</use_ln>
+			<use_log10>0</use_log10>
+			<use_log2>0</use_log2>
+			<use_floor>0</use_floor>
+			<use_ceil>0</use_ceil>
+			<use_abs>0</use_abs>
+			<use_inv>0</use_inv>
+			<use_neg>0</use_neg>
+			<use_x2>0</use_x2>
+			<use_min>0</use_min>
+			<use_max>0</use_max>
+			<use_not>0</use_not>
+			<use_and>0</use_and>
+			<use_or>0</use_or>
+			<use_xor>0</use_xor>
+			<use_nand>0</use_nand>
+			<use_nor>0</use_nor>
+			<use_sin>0</use_sin>
+			<use_cos>0</use_cos>
+			<use_tan>0</use_tan>
+			<use_asin>0</use_asin>
+			<use_acos>0</use_acos>
+			<use_atan>0</use_atan>
+			<use_iflz>0</use_iflz>
+			<use_ifalbcd>0</use_ifalbcd>
+			<use_if_a_or_b_cd>0</use_if_a_or_b_cd>
+			<use_if_a_xor_b_cd>0</use_if_a_xor_b_cd>
+			<use_fmod>1</use_fmod>
+		</operators>
+		<results />
+	</algorithm>
+</project>