1 | /*
|
---|
2 | * Project: MoleCuilder
|
---|
3 | * Description: creates and alters molecular systems
|
---|
4 | * Copyright (C) 2014 Frederik Heber. All rights reserved.
|
---|
5 | *
|
---|
6 | *
|
---|
7 | * This file is part of MoleCuilder.
|
---|
8 | *
|
---|
9 | * MoleCuilder is free software: you can redistribute it and/or modify
|
---|
10 | * it under the terms of the GNU General Public License as published by
|
---|
11 | * the Free Software Foundation, either version 2 of the License, or
|
---|
12 | * (at your option) any later version.
|
---|
13 | *
|
---|
14 | * MoleCuilder is distributed in the hope that it will be useful,
|
---|
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
17 | * GNU General Public License for more details.
|
---|
18 | *
|
---|
19 | * You should have received a copy of the GNU General Public License
|
---|
20 | * along with MoleCuilder. If not, see <http://www.gnu.org/licenses/>.
|
---|
21 | */
|
---|
22 |
|
---|
23 | /*
|
---|
24 | * FitCompoundPotentialAction.cpp
|
---|
25 | *
|
---|
26 | * Created on: Sep 10, 2014
|
---|
27 | * Author: heber
|
---|
28 | */
|
---|
29 |
|
---|
30 | // include config.h
|
---|
31 | #ifdef HAVE_CONFIG_H
|
---|
32 | #include <config.h>
|
---|
33 | #endif
|
---|
34 |
|
---|
35 | // needs to come before MemDebug due to placement new
|
---|
36 | #include <boost/archive/text_iarchive.hpp>
|
---|
37 |
|
---|
38 | #include "CodePatterns/MemDebug.hpp"
|
---|
39 |
|
---|
40 | #include <algorithm>
|
---|
41 | #include <boost/filesystem.hpp>
|
---|
42 | #include <fstream>
|
---|
43 |
|
---|
44 | #include "Actions/PotentialAction/FitCompoundPotentialAction.hpp"
|
---|
45 |
|
---|
46 | #include "CodePatterns/Log.hpp"
|
---|
47 |
|
---|
48 | #include "Fragmentation/Homology/HomologyContainer.hpp"
|
---|
49 | #include "Fragmentation/Homology/HomologyGraph.hpp"
|
---|
50 | #include "Fragmentation/Summation/SetValues/Fragment.hpp"
|
---|
51 | #include "Potentials/PotentialTrainer.hpp"
|
---|
52 | #include "Potentials/PotentialRegistry.hpp"
|
---|
53 | #include "Potentials/SerializablePotential.hpp"
|
---|
54 | #include "World.hpp"
|
---|
55 |
|
---|
56 | using namespace MoleCuilder;
|
---|
57 |
|
---|
58 | // and construct the stuff
|
---|
59 | #include "FitCompoundPotentialAction.def"
|
---|
60 | #include "Action_impl_pre.hpp"
|
---|
61 | /** =========== define the function ====================== */
|
---|
62 |
|
---|
63 | ActionState::ptr PotentialFitCompoundPotentialAction::performCall() {
|
---|
64 | // check whether there are any potentials registered
|
---|
65 | if (PotentialRegistry::getInstance().getBeginIter() ==
|
---|
66 | PotentialRegistry::getInstance().getEndIter()) {
|
---|
67 | ELOG(1, "Cannot fit a compound potential as no potentials are registered yet.");
|
---|
68 | return Action::failure;
|
---|
69 | }
|
---|
70 |
|
---|
71 | // get homologies container
|
---|
72 | HomologyContainer &homologies = World::getInstance().getHomologies();
|
---|
73 |
|
---|
74 | // first we try to look into the HomologyContainer
|
---|
75 | LOG(1, "INFO: Listing all present homologies ...");
|
---|
76 | for (HomologyContainer::container_t::const_iterator iter =
|
---|
77 | homologies.begin(); iter != homologies.end(); ++iter) {
|
---|
78 | LOG(1, "INFO: graph " << iter->first
|
---|
79 | << " has Fragment " << iter->second.fragment
|
---|
80 | << ", associated energy " << iter->second.energy
|
---|
81 | << ", and sampled grid integral " << iter->second.charge_distribution.integral()
|
---|
82 | << ".");
|
---|
83 | }
|
---|
84 |
|
---|
85 | // fragment specifies the homology fragment to use
|
---|
86 | SerializablePotential::ParticleTypes_t fragmentnumbers =
|
---|
87 | PotentialTrainer::getNumbersFromElements(params.fragment.get());
|
---|
88 |
|
---|
89 | // then we ought to pick the right HomologyGraph ...
|
---|
90 | const HomologyGraph graph =
|
---|
91 | PotentialTrainer::getFirstGraphwithSpecifiedElements(homologies,fragmentnumbers);
|
---|
92 | if (graph != HomologyGraph()) {
|
---|
93 | LOG(1, "First representative graph containing fragment "
|
---|
94 | << fragmentnumbers << " is " << graph << ".");
|
---|
95 | } else {
|
---|
96 | STATUS("Specific fragment "+toString(fragmentnumbers)+" not found in homologies!");
|
---|
97 | return Action::failure;
|
---|
98 | }
|
---|
99 |
|
---|
100 | // next we use the set of homologous fragments for training from the present potentials
|
---|
101 | PotentialTrainer trainer;
|
---|
102 | const bool status = trainer(
|
---|
103 | homologies,
|
---|
104 | graph,
|
---|
105 | params.training_file.get(),
|
---|
106 | params.max_iterations.get(),
|
---|
107 | params.threshold.get(),
|
---|
108 | params.best_of_howmany.get());
|
---|
109 | if (!status) {
|
---|
110 | STATUS("No required parameter derivatives for a box constraint minimization known.");
|
---|
111 | return Action::failure;
|
---|
112 | }
|
---|
113 |
|
---|
114 | return Action::success;
|
---|
115 | }
|
---|
116 |
|
---|
117 | ActionState::ptr PotentialFitCompoundPotentialAction::performUndo(ActionState::ptr _state) {
|
---|
118 | return Action::success;
|
---|
119 | }
|
---|
120 |
|
---|
121 | ActionState::ptr PotentialFitCompoundPotentialAction::performRedo(ActionState::ptr _state){
|
---|
122 | return Action::success;
|
---|
123 | }
|
---|
124 |
|
---|
125 | bool PotentialFitCompoundPotentialAction::canUndo() {
|
---|
126 | return false;
|
---|
127 | }
|
---|
128 |
|
---|
129 | bool PotentialFitCompoundPotentialAction::shouldUndo() {
|
---|
130 | return false;
|
---|
131 | }
|
---|
132 | /** =========== end of function ====================== */
|
---|