亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關于我們
? 蟲蟲下載站

?? cfeaturefunction.cpp

?? 強化學習算法(R-Learning)難得的珍貴資料
?? CPP
字號:
// Copyright (C) 2003
// Gerhard Neumann (gerhard@igi.tu-graz.ac.at)

//                
// This file is part of RL Toolbox.
// http://www.igi.tugraz.at/ril_toolbox
//
// All rights reserved.
// 
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// 1. Redistributions of source code must retain the above copyright
//    notice, this list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright
//    notice, this list of conditions and the following disclaimer in the
//    documentation and/or other materials provided with the distribution.
// 3. The name of the author may not be used to endorse or promote products
//    derived from this software without specific prior written permission.
// 
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
// OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
// IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
// NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
// THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.



#include "cfeaturefunction.h"
#include <assert.h>
#include <math.h>


CFeature::CFeature(unsigned int Index, rlt_real updateValue)
{
	this->featureIndex = Index;
	this->factor = updateValue;
}

CFeature::CFeature()
{
	this->featureIndex = 0;
	this->factor = 0.0;
}

CFeature::~CFeature()
{
	featureIndex = 0;
}

CFeatureList::CFeatureList(int initMemSize, bool isSorted, bool sortAbs)
{
	freeResources = new std::list<CFeature *>();
	allResources = new std::list<CFeature *>();

	featureMap = new std::map<int, CFeature *>();

	for (int i = 0; i < initMemSize; i++)
	{
		CFeature *feat = new CFeature(0,0.0);
		freeResources->push_back(feat);
		allResources->push_back(feat);
	}
	this->isSorted = isSorted;
	this->sortAbs = sortAbs;
}

CFeatureList::~CFeatureList()
{
	delete freeResources;
	delete featureMap;

	std::list<CFeature *>::iterator it = allResources->begin();

	for (int i = 0; it != allResources->end(); it ++, i ++)
	{
		delete *it;
	}
}

CFeature *CFeatureList::getFreeFeatureResource()
{
	CFeature *freeFeat=NULL;
	if (freeResources->size() > 0)
	{
		freeFeat = *freeResources->begin();
		freeResources->pop_front();
	}
	else
	{
		freeFeat = new CFeature(0,0);
		allResources->push_back(freeFeat);
	}
	return freeFeat;
}

void CFeatureList::sortFeature(CFeature *feature)
{
	std::list<CFeature *>::remove(feature);
	CFeatureList::iterator it = begin();
	if (sortAbs)
	{
		while (it != end() && fabs((*it)->factor) > fabs(feature->factor))
		{
			it ++;
		}
	}
	else
	{
		while (it != end() && (*it)->factor > feature->factor)
		{
			it ++;
		}
	}
	
	std::list<CFeature *>::insert(it, feature);
}

void CFeatureList::add(CFeature *feature)
{
	CFeature *feat = NULL;
	if ((*featureMap)[feature->featureIndex] == NULL)
	{
		feat = getFreeFeatureResource();
		feat->featureIndex = feature->featureIndex;
		feat->factor = feature->factor;
		push_back(feat);
		(*featureMap)[feature->featureIndex] = feat;

	}
	else
	{
		feat = (*featureMap)[feature->featureIndex];
		feat->factor += feature->factor;
	}
	if (isSorted)
	{
		sortFeature(feat);
	}
}

void CFeatureList::add(CFeatureList *featureList, rlt_real factor)
{
	CFeatureList::iterator it = featureList->begin();

	for (;it != featureList->end(); it ++)
	{
		update((*it)->featureIndex, (*it)->factor * factor);
	}
}

rlt_real CFeatureList::multFeatureList(CFeatureList *featureList)
{
	CFeatureList::iterator it = featureList->begin();

	rlt_real sum = 0.0;
	for(; it != featureList->end(); it ++)
	{
		sum += getFeatureFactor((*it)->featureIndex) * (*it)->factor;
	}
	return sum;
}



void CFeatureList::set(int feature, rlt_real factor)
{
	CFeature *feat = NULL;
	if ((*featureMap)[feature] == NULL)
	{
		feat = getFreeFeatureResource();
		feat->featureIndex = feature;
		feat->factor = factor;
		push_back(feat);
		(*featureMap)[feature] = feat;

	}
	else
	{
		feat = (*featureMap)[feature];
		feat->factor = factor;
	}
	if (isSorted)
	{
		sortFeature(feat);
	}
}

void CFeatureList::update(int feature, rlt_real factor)
{
	CFeature *feat = NULL;
	if ((*featureMap)[feature] == NULL)
	{
		feat = getFreeFeatureResource();
		feat->featureIndex = feature;
		feat->factor = factor;
		push_back(feat);
		(*featureMap)[feature] = feat;

	}
	else
	{
		feat = (*featureMap)[feature];
		feat->factor += factor;
	}
	if (isSorted)
	{
		sortFeature(feat);
	}
}


rlt_real CFeatureList::getFeatureFactor(int featureIndex)
{
	if ((*featureMap)[featureIndex] != NULL)
	{
		return (*featureMap)[featureIndex]->factor;
	}
	else
	{
		return 0.0;
	}
}
	
CFeature* CFeatureList::getFeature(int featureIndex)
{
	return (*featureMap)[featureIndex];
}

void CFeatureList::normalize()
{
	CFeatureList::iterator it = begin();

	rlt_real sum = 0.0;
	for(; it != end(); it ++)
	{
		sum += (*it)->factor;
	}

	multFactor(1.0 / sum);
}

rlt_real CFeatureList::getLength()
{
	CFeatureList::iterator it = begin();

	rlt_real sum = 0.0;
	for(; it != end(); it ++)
	{
		sum += pow((*it)->factor, (rlt_real) 2.0);
	}

	return sqrt(sum);
}

void CFeatureList::remove(CFeature *feature)
{
	remove(feature->featureIndex);
}

void CFeatureList::remove(int feature)
{
	CFeature *feat = (*featureMap)[feature];
	if (feat != NULL)
	{
		std::list<CFeature *>::remove(feat);
		freeResources->push_back(feat);
		featureMap->erase(feature);
	}
}

void CFeatureList::clear()
{
	CFeatureList::iterator it = begin();
	for (; it !=end(); it ++)
	{
		freeResources->push_back(*it);
	}
	std::list<CFeature *>::clear();
	featureMap->clear();
}

void CFeatureList::multFactor(rlt_real factor)
{
	CFeatureList::iterator it = begin();
	for (; it !=end(); it ++)
	{
		(*it)->factor *= factor;
	}
}

void CFeatureList::addIndexOffset(int offset)
{
	CFeatureList::iterator it = begin();
	this->featureMap->clear();
	for (; it !=end(); it ++)
	{
		(*it)->featureIndex += offset;
		(*featureMap)[(*it)->featureIndex] = *it;
	}
}


CFeatureList::iterator CFeatureList::getFeaturePos(unsigned int feature)
{
	CFeatureList::iterator it = begin();
	for (int i = 0; it != end(); it ++, i ++)
	{
		if ((*it)->featureIndex >= feature)
		{
			break;
		}
	}
	return it;
}

void CFeatureList::saveASCII(FILE *stream)
{
	CFeatureList::iterator it = begin();

	fprintf(stream, "[");
	for (; it != end(); it++)
	{
		fprintf(stream, "(%d,%1.3f)", (*it)->featureIndex, (*it)->factor);
	}
	fprintf(stream, "]");
}

void CFeatureList::loadASCII(FILE *stream)
{
	clear();
	CFeatureList::iterator it = begin();

	fscanf(stream, "[");
	for (; it != end(); it++)
	{
		int index;
		rlt_real buffer;
		fscanf(stream, "(%d,%lf)", &index, &buffer);
		set(index, buffer);
	}
	fscanf(stream, "]");
}


CFeatureList::iterator CFeatureList::begin()
{
	return std::list<CFeature *>::begin();
}

CFeatureList::iterator CFeatureList::end()
{
	return std::list<CFeature *>::end();
}

CFeatureList::reverse_iterator CFeatureList::rbegin()
{
	return std::list<CFeature *>::rbegin();
}

CFeatureList::reverse_iterator CFeatureList::rend()
{
	return std::list<CFeature *>::rend();
}

CFeatureFunction::CFeatureFunction(unsigned int numFeatures)
{
	externFeatures = false;

	this->numFeatures = numFeatures;
	features = new rlt_real[numFeatures];

	for (unsigned int i = 0; i < numFeatures; i++)
	{
		 features[i] = 0.0;
	}
}

CFeatureFunction::CFeatureFunction(unsigned int numFeatures, rlt_real *features)
{
	externFeatures = true;
	this->numFeatures = numFeatures;
	this->features = features;
}


CFeatureFunction::~CFeatureFunction()
{
	if (!externFeatures) delete features;
}

void CFeatureFunction::randomInit(rlt_real min, rlt_real max)
{
	for (unsigned int i = 0; i < numFeatures; i++)
	{
		features[i] = ((rlt_real) rand()) / ((rlt_real) RAND_MAX) * (max - min) + min;
	}
}

void CFeatureFunction::init(rlt_real value)
{
	for (unsigned int i = 0; i < numFeatures; i++)
	{
		features[i] = value;
	}
}


void CFeatureFunction::setFeature(CFeature *update, rlt_real value)
{
	assert(update->featureIndex < numFeatures);

	features[update->featureIndex] = value * update->factor;
}

void CFeatureFunction::setFeature(unsigned int featureIndex, rlt_real value)
{
	features[featureIndex] = value;
}

void CFeatureFunction::setFeatureList(CFeatureList *updateList, rlt_real value)
{
	CFeatureList::iterator it = updateList->begin();
	for (; it != updateList->end(); it ++)
	{
		setFeature(*it, value);
	}
}

void CFeatureFunction::updateFeature(CFeature *update, rlt_real difference)
{
	assert(update->featureIndex < numFeatures);

	rlt_real oldV = features[update->featureIndex];
	features[update->featureIndex] += difference * update->factor;

	DebugPrint('f', "Feature (%d %f) Update: %2.4f -> %2.4f\t\n", update->featureIndex,update->factor, oldV, features[update->featureIndex]);
}

void CFeatureFunction::updateFeature(int feature, rlt_real difference)
{
	features[feature] += difference;
}

void CFeatureFunction::updateFeatureList(CFeatureList *updateList, rlt_real difference)
{
	CFeatureList::iterator it = updateList->begin();

	for (; it != updateList->end(); it ++)
	{
		updateFeature(*it, difference);
	}
}

rlt_real CFeatureFunction::getFeature(unsigned int featureIndex)
{
	assert(featureIndex < numFeatures);

	return features[featureIndex];
}

rlt_real CFeatureFunction::getFeatureList(CFeatureList *featureList)
{
	rlt_real sum = 0.0;
	CFeatureList::iterator it = featureList->begin();

	for (; it != featureList->end(); it ++)
	{
		sum += (*it)->factor * getFeature((*it)->featureIndex);
	}

	return sum;
}

void CFeatureFunction::saveFeatures(FILE *stream) {
    fprintf (stream, "FeatureFunction (Features: %d)\n", numFeatures);
    for (unsigned int i = 0; i < numFeatures; i++) 
	{
        fprintf (stream, " %8.4lf", features[i]);          
    }
	fprintf(stream, "\n");
}

void CFeatureFunction::loadFeatures(FILE *stream) {
    
    unsigned int nfields, tmpnumFeatures;
	
	char tmpName[100];

    nfields = fscanf (stream, "%s (Features: %d)\n", tmpName, &tmpnumFeatures);

	if (features != NULL)
	{
		assert(tmpnumFeatures == numFeatures);	
	}
	else
	{
		numFeatures = tmpnumFeatures;
		features = new rlt_real[numFeatures];
	}

	 for (unsigned int j = 0; j < numFeatures; j++) 
	{
         assert(fscanf (stream, " %lf", &features[j]) == 1);			
    }
    fscanf(stream, "\n");			
}

void CFeatureFunction::printFeatures()
{
    saveFeatures(stdout);	
}

unsigned int CFeatureFunction::getNumFeatures()
{
	return numFeatures;
}


?? 快捷鍵說明

復制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
99v久久综合狠狠综合久久| 在线精品亚洲一区二区不卡| 国产成人精品亚洲日本在线桃色| 成人午夜在线视频| 777午夜精品视频在线播放| 中文字幕一区二区三区在线播放 | 麻豆91精品视频| 欧美伦理电影网| 日韩精品一二三区| 欧美午夜精品久久久久久超碰 | 日韩一区二区在线观看视频播放 | 不卡av在线免费观看| 国产日韩欧美在线一区| 国产成人在线免费观看| 久久精品亚洲一区二区三区浴池| 久久国产剧场电影| 久久精品视频网| 在线亚洲+欧美+日本专区| 亚洲日本在线a| 日韩视频免费观看高清完整版在线观看 | 伊人开心综合网| 91福利精品视频| 麻豆精品视频在线观看免费| 精品粉嫩aⅴ一区二区三区四区| 国产综合色产在线精品| 国产亚洲精品久| 欧美色图一区二区三区| 极品少妇一区二区| 亚洲综合另类小说| 2021国产精品久久精品| 色婷婷精品大视频在线蜜桃视频| 亚洲成人高清在线| 精品国产制服丝袜高跟| 色视频成人在线观看免| 日本不卡在线视频| 亚洲欧美综合另类在线卡通| 91精品久久久久久蜜臀| thepron国产精品| 久久精品国产秦先生| 亚洲精品视频在线看| 久久久久久久久久久久久久久99 | 日韩精品一区二区三区视频播放 | 亚洲成人午夜影院| 亚洲视频在线观看一区| 久久综合色播五月| 欧美一区二区视频免费观看| 成人福利视频网站| 高清在线观看日韩| 精品一区二区在线观看| 免费成人在线影院| 亚洲高清在线精品| 亚洲成精国产精品女| 一区二区在线观看免费视频播放| 欧美激情一区二区三区不卡| 精品国内二区三区| www一区二区| 欧美激情综合在线| 欧美激情综合网| 国产精品卡一卡二卡三| ㊣最新国产の精品bt伙计久久| 国产精品网站在线观看| 国产日产欧美一区| 亚洲少妇30p| 日韩av中文字幕一区二区三区 | 亚洲bdsm女犯bdsm网站| 婷婷综合另类小说色区| 日本网站在线观看一区二区三区 | 久久亚洲捆绑美女| 久久久久99精品国产片| 欧美国产一区视频在线观看| 综合久久久久综合| 日韩二区在线观看| 国产999精品久久| 欧美中文字幕不卡| 久久网站最新地址| 亚洲欧洲一区二区三区| 午夜久久久影院| 豆国产96在线|亚洲| 日本高清不卡视频| 久久久九九九九| 偷窥国产亚洲免费视频| 粉嫩在线一区二区三区视频| 色哟哟一区二区三区| 精品电影一区二区| 亚洲一区二区三区在线播放| 国产精品自拍网站| 日本乱码高清不卡字幕| 久久综合久久99| 视频一区二区中文字幕| 91在线免费看| 欧美国产综合一区二区| 久久精品国产99| 欧美嫩在线观看| 亚洲午夜激情av| www.色精品| 国产精品超碰97尤物18| 国产精品白丝av| 337p粉嫩大胆色噜噜噜噜亚洲| 亚洲第一av色| 日本高清无吗v一区| 亚洲精品写真福利| 色婷婷精品大在线视频 | 欧美α欧美αv大片| 亚洲超碰精品一区二区| 欧美久久久久中文字幕| 一区二区三区小说| 91成人看片片| 秋霞影院一区二区| 日韩欧美一区二区免费| 美洲天堂一区二卡三卡四卡视频| 欧美日韩一级视频| 日本不卡视频在线观看| 久久久久久久久久久电影| 国产91对白在线观看九色| 自拍偷拍亚洲综合| 91高清在线观看| 精品制服美女丁香| 国产精品毛片高清在线完整版| 99久久精品免费| 天涯成人国产亚洲精品一区av| 91精品国产色综合久久| 国产精品一二一区| 亚洲综合视频在线观看| 欧美大片日本大片免费观看| 国产毛片精品视频| 亚洲最新在线观看| 精品成人一区二区三区| 一本大道久久a久久精品综合| 亚洲国产欧美在线| 国产精品丝袜91| 日韩欧美一二三| 欧美性色欧美a在线播放| 国产在线一区观看| 免费在线观看一区| 亚洲欧美成aⅴ人在线观看 | 欧美在线短视频| 国产99久久久国产精品潘金 | 欧美一区二区三区视频免费| 国v精品久久久网| 久久成人免费网| 日韩精品欧美精品| 亚洲成人在线免费| 日韩美女久久久| **性色生活片久久毛片| 亚洲国产经典视频| 亚洲精品一区在线观看| 欧美电影精品一区二区| 欧美高清你懂得| 欧美日韩精品三区| 欧美高清hd18日本| 欧美色视频一区| 欧美日韩美少妇| 欧美精品高清视频| 日韩一级完整毛片| 久久亚洲私人国产精品va媚药| 91精品国产综合久久小美女| 欧美高清一级片在线| 69堂成人精品免费视频| 日韩一区二区三区三四区视频在线观看| 色综合久久九月婷婷色综合| 99精品一区二区| 欧美丝袜自拍制服另类| 欧美电影一区二区三区| 亚洲精品一区二区精华| 久久精品在线观看| 亚洲一区中文日韩| 日韩av在线免费观看不卡| 国产麻豆成人传媒免费观看| 高清不卡一区二区在线| 91女神在线视频| 欧美电影一区二区| 国产精品电影一区二区| 图片区小说区区亚洲影院| 国产成人在线视频播放| 欧美日韩精品专区| 亚洲一区二区三区小说| 95精品视频在线| 色美美综合视频| 欧美一区二区在线看| 欧美精品一卡两卡| 97se狠狠狠综合亚洲狠狠| 国产一区二区三区四区五区入口 | 国产日韩欧美高清在线| 欧美日韩在线播| 欧美一区二区三区婷婷月色| 精品电影一区二区三区| 中文字幕久久午夜不卡| 伊人色综合久久天天人手人婷| 亚洲福利视频一区二区| 国产麻豆精品95视频| 欧美日韩精品一区二区三区蜜桃| 欧美日韩亚洲丝袜制服| 久久久精品国产免大香伊| 亚洲免费观看高清完整版在线观看熊| 老司机免费视频一区二区三区| 免费看黄色91| 91在线免费视频观看| 欧美一区二区成人| 中文字幕免费不卡| 国产在线日韩欧美|