Home Conference 2005 Order Boxed Set Product Download VU Training FAQ Press and News Docs and Papers Partner Help Team     register/help User Name: Password: Login

Oenroll.cpp Go to the documentation of this file. //Filename : OEnroll.cpp //Description : EnrollRes Class Definition //Owner : Fred #include <obox.h> // for progress box #include <stdio.h> // for DEBUG #include <osys.h> // for progress box // ES library header file #include <ALL.H> #include <OGAMESET.H> #include <OMATH.H> // average_float, gammaCDF #include <OSTR.h> // strcmp #include <OLINALG.H> // for this calc_enroll_offers // CU header file #include <GAMEDEF.H> // enum { NONMINORITY_MALE, NONMINORITY_FEMALE, MINORITY_MALE, MINORITY_FEMALE }; #include <OPSCHOOL.H> #include <OPEERSCH.H> #include <OSCHLRES.H> #include <ODEPTRES.H> #include <OFINANCE.H> // for next_day #include <OINFO.H> // for next_day #include <ODEPT.H> // for calc_student_count #include <OSTUDENT.H> // for calc_student_count #include <OLIBTECH.H> #include <OATHLETI.H> #include <OSTUOFF.H> #include "OEnroll.h" // database come from data_to_db.xls // #define PREFERENCE_DB "STUPREF" #define APP_YIELD_DB "APPYIELD" #define PREFERENCE_DB2 "STUPREF2" #define TALENT_DB "STTALENT" //----------- Define constants -------------// //----------- Define static variables -------------// #if(GAME_VERSION>=200) short TRADIT_COUNT = 0; #define MAX_TRADITION_COUNT 5 #define MAX_NONTRA_COUNT 5 #define MAX_MASTER_COUNT 3 #define MAX_DOCTOR_COUNT 3 const RECORD_SEPARATOR_LEN = 2; static char *RECORD_SEPARATOR = "\r\n"; const FIELD_SEPARATOR_LEN = 1; static char *FIELD_SEPARATOR = "\t"; static char *export_num(int value) { static char num_str[20]; return itoa( value, num_str, 10 ); // 10 is radix } static char *export_num(double value) { static char num_str[20]; return gcvt( value, 7, num_str ); // a few more more than 7, for negative sign, decimal point and exponent } static char *export_percent(double value) { // value already multiplied by 100 static char num_str[20]; return gcvt( value*0.01, 7, num_str ); // a few more more than 7, for negative sign, decimal point and exponent } #define WRITE_FIELD_SEPARATOR(f) f->file_write(FIELD_SEPARATOR, FIELD_SEPARATOR_LEN) #define WRITE_STR_FIELD(f,s) { f->file_write(s, strlen(s)); } #define WRITE_NUM_FIELD(f,n) { char *s=export_num(n); f->file_write(s, strlen(s)); } #define WRITE_PERCENT_FIELD(f,n) { char *s=export_percent(n); f->file_write(s, strlen(s)); } #define WRITE_RECORD_SEPARATOR(f) f->file_write(RECORD_SEPARATOR, RECORD_SEPARATOR_LEN) #endif //----------- Define static class member variables -------------// const float EnrollRes::apps_latency[MAX_STUDENT_LEVEL] = { .4f, .4f, .5f, .6f, .7f }; // 990408 const float EnrollRes::yield_latency[MAX_STUDENT_LEVEL] = { .6f, .5f, .5f, .5f, .5f }; // elm 1-4 are useless // elm 1-4 are useless const float EnrollRes::yield_latency[MAX_STUDENT_LEVEL] = { .9f, .5f, .5f, .5f, .5f }; // (* given to minority scores *) const float EnrollRes::aidMinMultipliers[PRIORITY_LEVEL_COUNT] = { 1, 1.05f, 1.10f }; //const float aidAthMultipliers = {1, 1.25f, 1.50f}; // (* extra aid for athletes *) EnrollRes::EnrollRes() { } //----------- Define static functions -------------// static bool is_minority_group(char group) { return group == MINORITY_MALE || group == MINORITY_FEMALE; } static bool is_male_group(char group) { return group == MINORITY_MALE || group == NONMINORITY_MALE; } //----------- Begin of function EnrollRes::adjust_fraction_merit_aid --------// void EnrollRes::adjust_fraction_merit_aid(float& fraction) { if ( fraction > 0 && fraction < fraction_merit_top - .005f ) fraction = fraction_merit_top + .005f; else if ( fraction > 1 + .005f - fraction_merit_top ) fraction = (1 - .005f - fraction_merit_top) ; } //----------- Begin of function EnrollRes::adjust_fraction_merit_aid --------// //----------- Begin of function EnrollRes::init --------// void EnrollRes::init() { memset(this, 0, sizeof(EnrollRes)); load_db_student_pref(); load_db_student_pref2(); load_db_app_yield(); load_db_student_talent(); #if(GAME_VERSION>=200) distance_learner_acceptance = 1; #endif //-------- init constants ----------// s_lower_bound = 0.5f; s_upper_bound = 1.5f; s_slope = 5.0f; chance_avg = 1.0f; chance_sd = 1.0f; fraction_merit_top = 0.025f; // see section 2.4 last paragraph } //------------- End of function EnrollRes::init --------// //----------- Begin of function EnrollRes::deinit --------// void EnrollRes::deinit() { } //------------- End of function EnrollRes::deinit --------// //----------- Begin of function EnrollRes::load_db_student_pref ------// void EnrollRes::load_db_student_pref() { PreferenceRec *prefRec; Database *dbPreference = game_set.open_db(PREFERENCE_DB); int db_count = (short) dbPreference->rec_count(); err_when( db_count != PREFERECNE_COUNT * 2 ); // 2: average and deviation //askbillok: how to handle "na in cells like E119-120 // segment2 = segment1 //------ read in Preference information array -------// memset( preference_array, 0, sizeof(preference_array)); for( int i=0 ; i<db_count ; i++ ) { //----- odd row/record store average -----// prefRec = (PreferenceRec*) dbPreference->read(i+1); for( int j=0 ; j<INSTITU_SEGMENT_COUNT; j++ ) { preference_array[i/2][j].average = (float) m.atof( prefRec->value[j], 9 ); preference_array[i/2][j].weight = (float) m.atof( prefRec->weight, 9 ); } i++; //----- even row/record store deviation -----// prefRec = (PreferenceRec*) dbPreference->read(i+1); for( j=0 ; j<INSTITU_SEGMENT_COUNT; j++ ) preference_array[i/2][j].deviation = (float) m.atof( prefRec->value[j], 9 ); preference_array[i/2][j].tmp_fuzzy_value = 0.0f; } } //------------- End of function EnrollRes::load_db_student_pref ------// //----------- Begin of function EnrollRes::load_db_student_pref2 ------// void EnrollRes::load_db_student_pref2() { PreferenceRec2 *prefRec; Database *dbPreference = game_set.open_db(PREFERENCE_DB2); String tmpStr; int db_count = (short) dbPreference->rec_count(); err_when( db_count != PREFERECNE_COUNT2 * (SCHOOL_CONTROL_COUNT + MAX_STUDENT_LEVEL - 1) ); // make sure values of constants conformed to database column order err_when( NON_MINORITY != 0 ); err_when( PUBLIC != 1 || PRIVATE != 0 ); //------ read in Preference information array -------// memset( preference_array2, 0, sizeof(preference_array2)); // for sl1 int i, j, arrSL; char control = PRIVATE; for( i=0; i<PREFERECNE_COUNT2*SCHOOL_CONTROL_COUNT; i++ ) { if ( i >= PREFERECNE_COUNT2 ) { control = PUBLIC; j = i - PREFERECNE_COUNT2; } else { j = i; } prefRec = (PreferenceRec2*) dbPreference->read(i+1); m.rtrim_fld(tmpStr, prefRec->weight[0], 9); if ( strcmp(tmpStr, "") != 0 ) preference_array2[control][NON_MINORITY][j].apps_ratio = (float) m.atof( prefRec->weight[0], 9 ); else preference_array2[control][NON_MINORITY][j].apps_ratio = -1.0f; m.rtrim_fld(tmpStr, prefRec->weight[1], 9); if ( strcmp(tmpStr, "") != 0 ) preference_array2[control][MINORITY][j].apps_ratio = (float) m.atof( prefRec->weight[1], 9 ); else preference_array2[control][MINORITY][j].apps_ratio = -1.0f; m.rtrim_fld(tmpStr, prefRec->weight[2], 9); if ( strcmp(tmpStr, "") != 0 ) preference_array2[control][NON_MINORITY][j].yield_rate = (float) m.atof( prefRec->weight[2], 9 ); else preference_array2[control][NON_MINORITY][j].yield_rate = -1.0f; m.rtrim_fld(tmpStr, prefRec->weight[3], 9); if ( strcmp(tmpStr, "") != 0 ) preference_array2[control][MINORITY][j].yield_rate = (float) m.atof( prefRec->weight[3], 9 ); else preference_array2[control][MINORITY][j].yield_rate = -1.0f; } // for sl2-5; arrSL=0 -> sl2 for( i=0, arrSL=-1; i<PREFERECNE_COUNT2 * (MAX_STUDENT_LEVEL - 1); i++ ) { j = i % PREFERECNE_COUNT2; if ( j==0 ) { arrSL++; err_when(arrSL == MAX_STUDENT_LEVEL-1); } prefRec = (PreferenceRec2*) dbPreference->read(PREFERECNE_COUNT2*SCHOOL_CONTROL_COUNT + i+1); // for sl1 #if(GAME_VERSION>=200) if ( i == 63 ) { // start of SL5, Institutional Prestige preference_array2_sls[arrSL][PRIVATE][NON_MINORITY][0] = 0.1; preference_array2_sls[arrSL][PRIVATE][MINORITY][0] = 0.1; preference_array2_sls[arrSL][PUBLIC][NON_MINORITY][0] = 0.1; preference_array2_sls[arrSL][PUBLIC][MINORITY][0] = 0.1; } else if ( i == 75 ) { // % of minority preference_array2_sls[arrSL][PRIVATE][NON_MINORITY][12] = -1.0f; preference_array2_sls[arrSL][PRIVATE][MINORITY][12] = -1.0f; preference_array2_sls[arrSL][PUBLIC][NON_MINORITY][12] = -1.0f; preference_array2_sls[arrSL][PUBLIC][MINORITY][12] = -1.0f; } else if ( i == 78 ) { // Tuition: Private Institutions preference_array2_sls[arrSL][PRIVATE][NON_MINORITY][15] = 0.5; preference_array2_sls[arrSL][PRIVATE][MINORITY][15] = 0.5; preference_array2_sls[arrSL][PUBLIC][NON_MINORITY][15] = -1.0f; preference_array2_sls[arrSL][PUBLIC][MINORITY][15] = -1.0f; } else if ( i == 79 ) { // Blended Tuition: Public Institutions preference_array2_sls[arrSL][PRIVATE][NON_MINORITY][16] = -1.0f; preference_array2_sls[arrSL][PRIVATE][MINORITY][16] = -1.0f; preference_array2_sls[arrSL][PUBLIC][NON_MINORITY][16] = 0.3; preference_array2_sls[arrSL][PUBLIC][MINORITY][16] = 0.3; } else { #endif m.rtrim_fld(tmpStr, prefRec->weight[0], 9); preference_array2_sls[arrSL][PRIVATE][NON_MINORITY][j] = ( strcmp(tmpStr, "") != 0 ) ? (float) m.atof( prefRec->weight[0], 9 ) : -1.0f; m.rtrim_fld(tmpStr, prefRec->weight[1], 9); preference_array2_sls[arrSL][PRIVATE][MINORITY][j] = ( strcmp(tmpStr, "") != 0 ) ? (float) m.atof( prefRec->weight[1], 9 ) : -1.0f; m.rtrim_fld(tmpStr, prefRec->weight[2], 9); preference_array2_sls[arrSL][PUBLIC][NON_MINORITY][j] = ( strcmp(tmpStr, "") != 0 ) ? (float) m.atof( prefRec->weight[2], 9 ) : -1.0f; m.rtrim_fld(tmpStr, prefRec->weight[3], 9); preference_array2_sls[arrSL][PUBLIC][MINORITY][j] = ( strcmp(tmpStr, "") != 0 ) ? (float) m.atof( prefRec->weight[3], 9 ) : -1.0f; #if(GAME_VERSION>=200) } #endif } #if(GAME_VERSION>=200) // set new variable (Percent of courses redesigned for optimal IT) // just for SL-5 Distance Learning preference_array2_sls[3][PRIVATE][NON_MINORITY][21] = 0.4; preference_array2_sls[3][PRIVATE][MINORITY][21] = 0.4; preference_array2_sls[3][PUBLIC][NON_MINORITY][21] = 0.6; preference_array2_sls[3][PUBLIC][MINORITY][21] = 0.6; #endif } //------------- End of function EnrollRes::load_db_student_pref2 ------// //----------- Begin of function EnrollRes::load_db_app_yield ------// void EnrollRes::load_db_app_yield() { AppYieldRec *appRec; Database *dbAppYield = game_set.open_db(APP_YIELD_DB); int varOffset, stuSubSeg, stuSeg, iSeg, i=0; int db_count = (short) dbAppYield->rec_count(); err_when( db_count != STUDENT_SEGMENT_COUNT * STUDENT_SUBSEGMENT_COUNT * APP_YIELD_VAR_COUNT); //------ read in Preference information array -------// memset( app_yield_array, 0, sizeof(app_yield_array)); for ( varOffset=0; varOffset<APP_YIELD_VAR_COUNT; varOffset++ ) for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { appRec = (AppYieldRec*) dbAppYield->read(i+1); i++; for ( iSeg=0; iSeg<INSTITU_SEGMENT_COUNT; iSeg++ ) { app_yield_array[stuSubSeg][stuSeg][iSeg][varOffset] = (short) m.atoi( appRec->count[iSeg], 9 ); err_when(app_yield_array[stuSubSeg][stuSeg][iSeg][varOffset] < 0); } } #ifdef DEBUG_ debug_msg("----- begin enroll: app_yield -----"); for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { char str[100] = ""; for ( iSeg=0; iSeg<INSTITU_SEGMENT_COUNT; iSeg++ ) { sprintf(str, "%s, %d", str, app_yield_array[stuSubSeg][stuSeg][iSeg].apps); } debug_msg(str); } debug_msg("----- end enroll: app_yield -----"); #endif } //------------- End of function EnrollRes::load_db_app_yield ------// //----------- Begin of function EnrollRes::load_db_student_talent ------// //------- static var for the 2 func below ------------// static float income_growth[STUDENT_SUBSEGMENT_COUNT][STUDENT_SEGMENT_COUNT]; static float income_growth_last2[STUDENT_SUBSEGMENT_COUNT][STUDENT_SEGMENT_COUNT]; void EnrollRes::load_db_student_talent() { #define TALENT_VAR_PROPERTIES_COUNT 3 // mean, sd, count TalentRec *talentRec; Database *dbPreference = game_set.open_db(TALENT_DB); int db_count = (short) dbPreference->rec_count(); err_when( db_count != STUDENT_SUBSEGMENT_COUNT * TALENT_INCOME_VAR_COUNT * TALENT_VAR_PROPERTIES_COUNT); //------ read in array -------// memset( talent_array, 0, sizeof(talent_array)); int var, subSeg, seg, i=1; for ( subSeg=0; subSeg<STUDENT_SUBSEGMENT_COUNT; subSeg++ ) for ( var=0; var<TALENT_INCOME_VAR_COUNT; var++ ) { // read average row talentRec = (TalentRec*) dbPreference->read(i++); for ( seg=0; seg<STUDENT_SEGMENT_COUNT; seg++ ) { talent_array[subSeg][seg][var].average = (float) m.atof( talentRec->seg[seg], 9 ); } // read standard deviation row talentRec = (TalentRec*) dbPreference->read(i++); for ( seg=0; seg<STUDENT_SEGMENT_COUNT; seg++ ) { talent_array[subSeg][seg][var].variance = (float) m.atof( talentRec->seg[seg], 9 ); } // skip the row "count" for each talent rating //talentRec = (TalentRec*) dbPreference->read(i++); i++; } // adjust the talent_array // refer to mathca cell: // "Traditional Undergraduates: sL-1: Test financial data" // // 10 years const float INCOME_UPDATE = math.safe_pow(1.04f, 10); for ( subSeg=0; subSeg<STUDENT_SUBSEGMENT_COUNT; subSeg++ ) { for ( var=0; var<TALENT_VAR_COUNT; var++ ) for ( seg=0; seg<STUDENT_SEGMENT_COUNT; seg++ ) { talent_array[subSeg][seg][var].variance = math.safe_pow(talent_array[subSeg][seg][var].variance, 2); } for ( seg=0; seg<STUDENT_SEGMENT_COUNT; seg++ ) { talent_array[subSeg][seg][INCOME].average *= INCOME_UPDATE; talent_array[subSeg][seg][INCOME].variance // * INCOME_UPDATE = math.safe_pow(talent_array[subSeg][seg][var].variance / 10, 2); } } //--------------------------// // 1027 req26.txt for ( subSeg=0; subSeg<STUDENT_SUBSEGMENT_COUNT; subSeg++ ) { for ( seg=0; seg<STUDENT_SEGMENT_COUNT; seg++ ) { income_growth[subSeg][seg] = math.get_random_snd(0.015f, PSCH_SD(.0025f)); income_growth_last2[subSeg][seg] = 0; } } } //------------- End of function EnrollRes::load_db_student_talent ------// //----------- Begin of function EnrollRes::update_income ------// void EnrollRes::update_income() { // adjust this var: Talent talent_array[STUDENT_SUBSEGMENT_COUNT][STUDENT_SEGMENT_COUNT][TALENT_INCOME_VAR_COUNT]; // int subSeg, seg; float inflationRate = (float) finance.inflation_rate / 100.0f; for ( subSeg=0; subSeg<STUDENT_SUBSEGMENT_COUNT; subSeg++ ) { for ( seg=0; seg<STUDENT_SEGMENT_COUNT; seg++ ) { float lastValue = income_growth[subSeg][seg]; income_growth[subSeg][seg] = math.time_variation(lastValue, income_growth_last2[subSeg][seg], 0.9908f, -0.6314f, 0.003202690f); income_growth_last2[subSeg][seg] = lastValue; talent_array[subSeg][seg][INCOME].average *= (1+inflationRate+income_growth[subSeg][seg]); } } } //----------- End of function EnrollRes::update_income ------// //----------- Begin of function EnrollRes::calc_student_pref --------// void EnrollRes::calc_student_pref() { // column L // recalculate PeerSchool's properties to prefArray to speed up calculation // '10' is the additional field included in PREFERECNE_COUNT2 (pref_vars_array) // but not PREFERECNE_COUNT (prefArray) // PeerSchool* player = school_res.player_peer_school; float prefArray[PREFERECNE_COUNT]; int i, j; for (j=0, i=0; j<PREFERECNE_COUNT; j++, i++) { if ( j == 10 ) // skip in-state freshmen percent i++; prefArray[j] = player->pref_vars_array[i]; } err_when( PREFERECNE_COUNT != 20 ); // E129-K147: Fuzzy Logic Indices for Undergraduate Applications Ratios and Yield Rates Preference *prefPtr; for (j=0; j<PREFERECNE_COUNT; j++) for (i=0; i<INSTITU_SEGMENT_COUNT; i++) { prefPtr = (enroll_res.preference_array[j]) + i; //prefPtr++; prefPtr->tmp_fuzzy_value = (float) exp(-math.safe_pow(( math.safe_divide((prefPtr->average-prefArray[j]), prefPtr->deviation) ), 2)); } // E150-K150: weighted raw index value: update player's preference_array bool isPlayerSchoolPublic = player_school.is_public(); float tmpSumOfSum = 0.0f; for (i=0; i<INSTITU_SEGMENT_COUNT; i++) { float tmpSum = 0.0f; for (j=0; j<NON_FINANCIAL_PREFERECNE_COUNT; j++) { prefPtr = (enroll_res.preference_array[j]) + i; tmpSum += prefPtr->tmp_fuzzy_value * prefPtr->weight; } err_when(tmpSum==0); for (j=NON_FINANCIAL_PREFERECNE_COUNT; j<PREFERECNE_COUNT; j+=2) { prefPtr = (enroll_res.preference_array[j]) + i; if ( isPlayerSchoolPublic ) prefPtr++; tmpSum += prefPtr->tmp_fuzzy_value * prefPtr->weight; } pref_weight_array[i] = tmpSum; tmpSumOfSum += tmpSum; err_when(tmpSumOfSum==0); } // E151-K151: calc segment weight for (i=0; i<INSTITU_SEGMENT_COUNT; i++) pref_weight_array[i] /= tmpSumOfSum; } //------------- End of function EnrollRes::calc_student_pref --------// //----------- Begin of function EnrollRes::calc_app_yield --------// void EnrollRes::calc_app_yield() { float appYield[APP_YIELD_VAR_COUNT], totalMatrics=0; int varOffset, stuSubSeg, stuSeg, iSeg, i=0; // short *shortPtr // short *studenCountPtr; // refer to columns BM:QR for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { memset(appYield, 0, sizeof(appYield)); for ( varOffset=0; varOffset<APP_YIELD_VAR_COUNT; varOffset++ ) { //studenCountPtr = &( appYieldArray[varOffset] ); for ( iSeg=0; iSeg<INSTITU_SEGMENT_COUNT; iSeg++ ) { appYield[varOffset] += (enroll_res.app_yield_array[stuSubSeg][stuSeg][iSeg][varOffset] * pref_weight_array[iSeg]); err_when(appYield[varOffset] < 0); } } err_when( appYield[MATRICS] < 0.000001f || appYield[OFFERS] < 0.000001f ); //err_when( appYield[OFFERS] > appYield[APPS] ); //1117 err_when( appYield[MATRICS] > appYield[OFFERS] ); //TO use pointer to speed it up enroll_data_sl1[stuSubSeg][stuSeg].apps_ratio = float(appYield[APPS]) / appYield[MATRICS]; enroll_data_sl1[stuSubSeg][stuSeg].yield_rate = float(appYield[MATRICS]) / appYield[OFFERS]; enroll_data_sl1[stuSubSeg][stuSeg].fraction_matrics = appYield[MATRICS]; totalMatrics += appYield[MATRICS]; } // note: apps_ratio in enroll_data is not updated yearly, it's just for init_enroll err_when(totalMatrics <= 0); for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { enroll_data_sl1[stuSubSeg][stuSeg].fraction_matrics /= totalMatrics; } } //------------- End of function EnrollRes::calc_app_yield --------// //------------- End of function EnrollRes::set_app_yield --------// // void EnrollRes::set_app_yield(float appMultipler, float yieldMultiplier) { int stuSubSeg, stuSeg; for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { enroll_data_sl1[stuSubSeg][stuSeg].apps_ratio *= appMultipler; enroll_data_sl1[stuSubSeg][stuSeg].yield_rate *= yieldMultiplier; } } //------------- End of function EnrollRes::set_app_yield --------// //----------- static variables of class PeerSchool --------// float PeerSchool::pref_vars_average_array[PREFERECNE_COUNT2]; float PeerSchool::pref_vars_average_array_last[PREFERECNE_COUNT2]; //----------- Begin of function PeerSchool::calc_student_pref_vars_array --------// void PeerSchool::calc_student_pref_vars_array() { if ( this != school_res.player_peer_school ) { calc_student_pref_vars_array_peer(); return; } memcpy( pref_vars_array_last, pref_vars_array, sizeof(pref_vars_array) ); // calculate the column Q in [HE.STU.pref.xls]Sheet1 // // recalculate PeerSchool's properties to prefArray to speed up calculation // (refer to column L of [HE.initialization]stu_pref) // local var: float pref_vars_array[PREFERECNE_COUNT2]; // (minor bug) the following RHSs may NOT be updated during play // assume "this" is the player_peeer_school int studentEnrollCount[MAX_STUDENT_LEVEL]; int i; for ( i=0; i<MAX_STUDENT_LEVEL; i++ ) { studentEnrollCount[i] = enroll_res.student_count[i]; percent_female_sl[i] = (char) enroll_res.student_female_percent[i]; percent_minority_sl[i] = (char) enroll_res.student_minority_percent[i]; } pref_vars_array[0] = prestige; // by 1021 email pref_vars_array[1] = (float) athletics_office.ncaa_level_value; pref_vars_array[2] = float(student_life_staff_salaries+student_life_other_expense)/(full_time_undergrad+part_time_undergrad); pref_vars_array[3] = percent_traditional_ug_in_residence_halls / 100.0f; pref_vars_array[4] = percent_get_bacc_in_5_year / 100.0f; pref_vars_array[5] = enroll_res.applications_rate[UG_TRADITION]; pref_vars_array[6] = enroll_res.cur_yield_rate[UG_TRADITION]; pref_vars_array[7] = float(studentEnrollCount[1]) / float(studentEnrollCount[0]+studentEnrollCount[1]); float tmpCount = 0; pref_vars_array[8] = float(studentEnrollCount[0]+studentEnrollCount[1]) / enroll_res.total_student_count; pref_vars_array[9] = float(studentEnrollCount[4]) / enroll_res.total_student_count; // the additional field included in PREFERECNE_COUNT2 but not PREFERECNE_COUNT pref_vars_array[10] = float(percent_instate_freshmen) / 100; for (i = 0, tmpCount = 0; i<MAX_STUDENT_LEVEL; i++) tmpCount += float(studentEnrollCount[i]) * percent_female_sl[i] / 100; pref_vars_array[11] = float(tmpCount) / enroll_res.total_student_count; for (i = 0, tmpCount = 0; i<MAX_STUDENT_LEVEL; i++) tmpCount += studentEnrollCount[i] * percent_minority_sl[i] / 100; pref_vars_array[12] = float(tmpCount) / enroll_res.total_student_count; pref_vars_array[13] = doc_time_to_degree; pref_vars_array[14] = sponsored_research_rating; pref_vars_array[15] = (float) finance.tuition_rate; pref_vars_array[16] = pref_vars_array[15]; pref_vars_array[17] = percent_ug_students_on_aid / 100.0f; pref_vars_array[18] = pref_vars_array[17]; pref_vars_array[19] = institutional_aid_per_fte; pref_vars_array[20] = institutional_aid_per_fte; err_when( PREFERECNE_COUNT2 != 21 ); for (i=0; i<PREFERECNE_COUNT2; i++) err_when( pref_vars_array[i] < 0 ); } //------------- End of function PeerSchool::calc_student_pref_vars_array --------// //------------- Begin of function PeerSchool::calc_student_pref_vars_array_peer --------// void PeerSchool::calc_student_pref_vars_array_peer() { memcpy( pref_vars_array_last, pref_vars_array, sizeof(pref_vars_array) ); // calculate the column Q in [HE.STU.pref.xls]Sheet1 // // recalculate PeerSchool's properties to prefArray to speed up calculation // (refer to column L of [HE.initialization]stu_pref) // local var: float pref_vars_array[PREFERECNE_COUNT2]; // the following RHSs may NOT be updated during play pref_vars_array[0] = prestige; pref_vars_array[1] = (float) athletics_office.ncaa_level_value; #if(GAME_VERSION>=200) pref_vars_array[2] = math.safe_divide( float(student_life_staff_salaries+student_life_other_expense), (float)full_time_undergrad+part_time_undergrad ); #else pref_vars_array[2] = float(student_life_staff_salaries+student_life_other_expense)/(full_time_undergrad+part_time_undergrad); #endif pref_vars_array[3] = percent_traditional_ug_in_residence_halls / 100.0f; pref_vars_array[4] = percent_get_bacc_in_5_year / 100.0f; pref_vars_array[5] = ug_applications_rate; pref_vars_array[6] = ug_yield_rate / 100.0f; #if(GAME_VERSION>=200) pref_vars_array[7] = math.safe_divide( (float)part_time_undergrad, (float)full_time_undergrad+part_time_undergrad ); #else pref_vars_array[7] = part_time_undergrad/float(full_time_undergrad+part_time_undergrad); #endif int studentEnrollCount[MAX_STUDENT_LEVEL]; studentEnrollCount[0] = full_time_undergrad; studentEnrollCount[1] = part_time_undergrad; studentEnrollCount[2] = enrollment_masters; studentEnrollCount[3] = enrollment_doctoral; studentEnrollCount[4] = non_degree_seeking; float studentCount = 0.0f; int i, tmpCount=0; for (i=0; i<MAX_STUDENT_LEVEL; i++) studentCount += (float) studentEnrollCount[i]; #if(GAME_VERSION>=200) pref_vars_array[8] = math.safe_divide( (int)(full_time_undergrad+part_time_undergrad), (int)studentCount ); pref_vars_array[9] = math.safe_divide( (int)non_degree_seeking, (int)studentCount ); #else pref_vars_array[8] = (full_time_undergrad+part_time_undergrad) / studentCount; pref_vars_array[9] = non_degree_seeking / studentCount; #endif // the additional field included in PREFERECNE_COUNT2 but not PREFERECNE_COUNT pref_vars_array[10] = percent_instate_freshmen; for (i=0; i<MAX_STUDENT_LEVEL; i++) tmpCount += studentEnrollCount[i] * percent_female_sl[i] / 100; #if(GAME_VERSION>=200) pref_vars_array[11] = math.safe_divide( (int)tmpCount, (int)studentCount ); #else pref_vars_array[11] = tmpCount / studentCount; #endif for (i=0, tmpCount = 0; i<MAX_STUDENT_LEVEL; i++) tmpCount += studentEnrollCount[i] * percent_minority_sl[i] / 100; #if(GAME_VERSION>=200) pref_vars_array[12] = math.safe_divide( (int)tmpCount, (int)studentCount ); #else pref_vars_array[12] = tmpCount / studentCount; #endif pref_vars_array[13] = doc_time_to_degree; pref_vars_array[14] = sponsored_research_rating; pref_vars_array[15] = (float) tuition_rate; pref_vars_array[16] = pref_vars_array[15]; pref_vars_array[17] = percent_ug_students_on_aid / 100.0f; pref_vars_array[18] = pref_vars_array[17]; pref_vars_array[19] = institutional_aid_per_fte; pref_vars_array[20] = institutional_aid_per_fte; err_when( PREFERECNE_COUNT2 != 21 ); for (i=0; i<PREFERECNE_COUNT2; i++) err_when( pref_vars_array[i] < 0 ); } //------------- End of function PeerSchool::calc_student_pref_vars_array_peer --------// //----------- Begin of static function PeerSchool::calc_student_pref_vars_average_array --------// // // Refer to [HE.STU.pref.xls]Sheet1 // // Calc values for column Q for PGI and peer schools // void PeerSchool::calc_student_pref_vars_average_array() { memcpy( pref_vars_average_array_last, pref_vars_average_array, sizeof(pref_vars_average_array) ); float sum; short psCount = school_res.peer_school_count; // pref_vars_average_array is static // for (int var=0; var<PREFERECNE_COUNT2; var++) { sum = 0.0f; for (int i=0; i<psCount; i++) { PeerSchool *ps = &(school_res.peer_school_array[i]); if ( ps != school_res.player_peer_school ) sum += ps->pref_vars_array[var]; } pref_vars_average_array[var] = sum / psCount; } } //------------- End of static function PeerSchool::calc_student_pref_vars_average_array --------// //----------- Begin of function EnrollRes::calc_enroll_applications --------// void EnrollRes::calc_enroll_applications() { const int sl = 0; float prefVarsArray[PREFERECNE_COUNT2]; // column Q int i, j; // calc values for column Q // The data in column Q represent // the "ratio of the variable for the PGI to the average of the same variable // for the peer institutions." (from email req11_enroll.txt) // PeerSchool* player = school_res.player_peer_school; memcpy(prefVarsArray, player->pref_vars_array, sizeof(prefVarsArray)); for (i=0; i<PREFERECNE_COUNT2; i++) { // (* uses lagged financial aid variables; current values for all else *) // if ( i < PREFERECNE_COUNT2 - 4 ) prefVarsArray[i] = math.safe_divide(prefVarsArray[i], PeerSchool::pref_vars_average_array[i]); else prefVarsArray[i] = math.safe_divide(player->pref_vars_array_last[i], PeerSchool::pref_vars_average_array_last[i]); } // calc values for column R // bool isPublic = player_school.is_public(); float finalRatio[MINORITY_GROUP_COUNT]; float tmpRatio; float tmp, sign; for (j=0; j<MINORITY_GROUP_COUNT; j++) { finalRatio[j] = 1; for (i=0; i<PREFERECNE_COUNT2; i++) { sign = (pref_special_case(i))? -1.0f: 1.0f; // 1 tmp = enroll_res.preference_array2[isPublic][j][i].apps_ratio; if ( tmp <= 0.0 || prefVarsArray[i] == 0) tmpRatio = 1.0f; else tmpRatio = math.safe_pow(prefVarsArray[i], sign * tmp); // 2 finalRatio[j] *= tmpRatio; } if ( !(1+ (float) exp(-s_slope*(finalRatio[j]-1))) ) finalRatio[j] = 1; else finalRatio[j] = s_lower_bound+(s_upper_bound-s_lower_bound)/(1+ (float) exp(-s_slope*(finalRatio[j]-1))); err_when( finalRatio[j] < 0 ); } // refer to mathca code only this part // int minorGroup, stuSubSeg, stuSeg; EnrollDataSL1* ed; total_applications[sl] = 0; finalRatio[MINORITY] *= app_multiplier[sl]; finalRatio[NON_MINORITY] *= app_multiplier[sl]; //----------------// // total_applications[sl]=0; // ## CHWG062199 for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) { if ( is_minority_group(stuSubSeg) ) minorGroup = MINORITY; else minorGroup = NON_MINORITY; for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { ed = &enroll_data_sl1[stuSubSeg][stuSeg]; ed->applications = int( (1.0f-apps_latency[sl]) * math.get_random_snd(chance_avg, PSCH_SD(chance_sd), true) * finalRatio[minorGroup] * ed->base_apps // + 0.5 for float-int rounding + apps_latency[sl] * ed->applications + 0.5); err_when(ed->applications < 0); total_applications[sl] += ed->applications; } } } //---------------------////---------------------////---------------------// void EnrollRes::calc_enroll_matriculations() { const int sl = 0; //## chea 260899 try to use loop below float prefVarsArray[PREFERECNE_COUNT2]; // column Q int i, j; // calc values for column Q // The data in column Q represent // the "ratio of the variable for the PGI to the average of the same variable // for the peer institutions." (from email req11_enroll.txt) // PeerSchool* player = school_res.player_peer_school; memcpy(prefVarsArray, player->pref_vars_array, sizeof(prefVarsArray)); for (i=0; i<PREFERECNE_COUNT2; i++) { // (* uses current values for all variables *) // prefVarsArray[i] = math.safe_divide(prefVarsArray[i], PeerSchool::pref_vars_average_array[i]); } // calc values for column R // bool isPublic = player_school.is_public(); float finalRatio[MINORITY_GROUP_COUNT]; float tmpRatio; float tmp, sign; for (j=0; j<MINORITY_GROUP_COUNT; j++) { finalRatio[j] = 1; for (i=0; i<PREFERECNE_COUNT2; i++) { sign = (pref_special_case(i))? -1.0f: 1.0f; // 1 //tmp = enroll_res.preference_array2[isPublic][j][i].apps_ratio; tmp = enroll_res.preference_array2[isPublic][j][i].yield_rate; if ( tmp <= 0.0 ) // empty entry in database tmpRatio = 1; else if ( prefVarsArray[i] == 0 ) // 0.75: from mathca code tmpRatio = 0.75f; else { if ( i < PREFERECNE_COUNT2 - 4 ) tmpRatio = (float) math.safe_pow(prefVarsArray[i], sign * tmp); else if ( i < PREFERECNE_COUNT2 - 2 ) tmpRatio = (float) math.safe_pow(math.safe_divide(fraction_on_aid[j], prefVarsArray[i]), sign * tmp); else tmpRatio = (float) math.safe_pow(math.safe_divide(float(average_aid[j]), prefVarsArray[i]), sign * tmp); } if ( tmpRatio < -100 || tmpRatio > 100 ) // fix bug on fly tmpRatio = 1; // 2 finalRatio[j] *= tmpRatio; } if ( !(1+ (float) exp(-s_slope*(finalRatio[j]-1))) ) finalRatio[j] = 1; else finalRatio[j] = s_lower_bound+(s_upper_bound-s_lower_bound)/(1+ (float) exp(-s_slope*(finalRatio[j]-1))); } // refer to mathca code only for this part // int minorGroup, stuSubSeg, stuSeg; EnrollDataSL1* ed; { // BUG_HERE // for statement is missing in the original version..//## chwg0628 .. // for(sl=0;sl<MAX_STUDENT_LEVEL;sl++) // // for(int sl=0;sl<MAX_STUDENT_LEVEL;sl++) //## chea 260899 try adding total_matrics[sl] = 0; matrics_top_athletes = 0; male_matrics_top_athletes = 0; for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) { if ( is_minority_group(stuSubSeg) ) minorGroup = MINORITY; else minorGroup = NON_MINORITY; for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { ed = &enroll_data_sl1[stuSubSeg][stuSeg]; ed->yield_rate = (1.0f-yield_latency[sl]) * math.get_random_snd(chance_avg, PSCH_SD(chance_sd), true) * yield_multiplier[sl] * finalRatio[minorGroup] * ed->base_yield_rate + yield_latency[sl] * ed->yield_rate; // make yield_rate within [1:0] //min & max bug chea ed->yield_rate = max(0.0f, min(1.0f, ed->yield_rate)); // calc matriculations // + 0.5 for float-int rounding ed->matrics = int(ed->yield_rate * ed->offers+ 0.5); // calc total matriculations total_matrics[sl] += ed->matrics; } // calc number of top athletes *newly* recruited // which is the number of matriculants in stdent segment 4 (athlete) matrics_top_athletes += enroll_data_sl1[stuSubSeg][3].matrics; if(is_male_group(stuSubSeg)) male_matrics_top_athletes += enroll_data_sl1[stuSubSeg][3].matrics; } } #if(GAME_VERSION>=200) // do again to adjust total_matrics to target_enrollment if( (!info.prerun_year || info.prerun_year && info.game_year > 1 ) && total_matrics[sl] >= 10 ) { int oldTotalMatrics = total_matrics[sl]; int targetIntake = target_student_intake[sl]; total_matrics[sl] = 0; matrics_top_athletes = 0; male_matrics_top_athletes = 0; for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) { if ( is_minority_group(stuSubSeg) ) minorGroup = MINORITY; else minorGroup = NON_MINORITY; for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { ed = &enroll_data_sl1[stuSubSeg][stuSeg]; ed->yield_rate = ed->yield_rate * targetIntake / oldTotalMatrics; // make yield_rate within [1:0] //min & max bug chea ed->yield_rate = max(0.0f, min(1.0f, ed->yield_rate)); // calc matriculations // + 0.5 for float-int rounding ed->matrics = int(ed->yield_rate * ed->offers+ 0.5); // calc total matriculations total_matrics[sl] += ed->matrics; } // calc number of top athletes *newly* recruited // which is the number of matriculants in stdent segment 4 (athlete) matrics_top_athletes += enroll_data_sl1[stuSubSeg][3].matrics; if(is_male_group(stuSubSeg)) male_matrics_top_athletes += enroll_data_sl1[stuSubSeg][3].matrics; } } #endif for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) { for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { ed = &enroll_data_sl1[stuSubSeg][stuSeg]; if ( total_matrics[sl] > 0 ) ed->fraction_matrics = float(ed->matrics) / total_matrics[sl]; else ed->fraction_matrics = 0; } } } //------------- End of function EnrollRes::calc_enroll_matriculations --------// //------------- End of function EnrollRes::calc_enroll_applications --------// //----------- Begin of function EnrollRes::calc_enroll_offers --------// void EnrollRes::calc_enroll_offers() { // for sl1 temporarily const int sl = 0; int stuSubSeg, stuSeg; EnrollDataSL1* ed; float sum=0; total_offers[sl] = 0; //PeerSchool* player = school_res.player_peer_school; int targetIntake = target_student_intake[sl]; // calc sum for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { ed = &enroll_data_sl1[stuSubSeg][stuSeg]; sum += ed->yield_rate * ed->applications; } // check the calculated sum: (* If applications allow selectivity do QP, else admit all applicants. *) if ( sum <= targetIntake ) { // admit all applicants // for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { ed = &enroll_data_sl1[stuSubSeg][stuSeg]; ed->offers = ed->applications; total_offers[sl] += ed->offers; } } else { // use quadratic program to solve // const int size = STUDENT_SUBSEGMENT_COUNT*STUDENT_SEGMENT_COUNT; DiagonalMatrix mQ(size); ColumnVector mQdiag(size); DiagonalMatrix I(size); I = 1; Matrix mA = I; RowVector vA(size); ColumnVector vc(size); ColumnVector vb(size+1); //bug ColumnVector vtmp(1); vtmp(1) = targetIntake; ColumnVector vOffers(size); const int K_FACTOR = 5; int i=1; // init mQdiag, vA, vc for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { ed = &enroll_data_sl1[stuSubSeg][stuSeg]; mQdiag(i) = ed->applications; vA(i) = ed->yield_rate; vc(i) = - ed->util - K_FACTOR; i++; } // init mQ, mA, vb vb = mQdiag & vtmp; mA &= vA; mA *= -1; vb *= -1; for (i=1; i<=size; i++) mQdiag(i) = 2 * K_FACTOR / max(mQdiag(i), 0.001); mQ.set_diagonal(mQdiag); // here the main call if ( !LinearAlgebra::quadratic_prog(vc,mQ,mA,vb,vOffers) ) { vOffers = 0; } // "Partition" vOffers (a list) to ed->offers (list in list) int offs; i =1; for ( stuSubSeg=0; stuSubSeg<STUDENT_SUBSEGMENT_COUNT; stuSubSeg++ ) for ( stuSeg=0; stuSeg<STUDENT_SEGMENT_COUNT; stuSeg++ ) { offs = enroll_data_sl1[stuSubSeg][stuSeg].offers = int( vOffers(i++) +0.5); total_offers[sl] += offs; } } /* y as prior year's yield rates z as number of applications eU is expected (average) utility */ } //------------- End of function EnrollRes::calc_enroll_offers --------// //----------- Begin of function PeerSchool::calc_enroll_aid --------// void EnrollRes::calc_enroll_aid() { // for sl1 temporarily const int sl = 0; //-------------------// //---- Need Aid -----// //-------------------// float x = 60, lastDeviate, deviate; float inc = x / 100.f; // nH = FindMinimum[(needFrObj[sL1,x]-frOfTradUGsWithNeed)^2,{x,60}][[2,1,2]]; // FindMinimum is used in lieu of Golden Section // if ( calc_need_aid(x+inc) > calc_need_aid(x-inc) ) inc *= -1; deviate = calc_need_aid(x); do { x += inc; lastDeviate = deviate; deviate = calc_need_aid(x); } while ( deviate < lastDeviate && deviate > 0 ); need_upper = x; need_lower = need_upper - max_aid; //-------------------// //---- Merit Aid ----// //-------------------// adjust_fraction_merit_aid(fraction_sl1_offered_merit_aid); // mL = FindMinimum[(meritFrObj[sL1,x]-frStudentsOfferedMeritAid)^2,{x,5}][[2,1,2]]; x = 5; inc = x / 100.f; if ( calc_merit_aid(x+inc, fraction_sl1_offered_merit_aid) > calc_merit_aid(x-inc, fraction_sl1_offered_merit_aid) ) inc *= -1; deviate = calc_merit_aid(x, fraction_sl1_offered_merit_aid); do { x += inc; lastDeviate = deviate; deviate = calc_merit_aid(x, fraction_sl1_offered_merit_aid); } while ( deviate < lastDeviate && deviate > 0 ); merit_lower[sl] = x; // mH = FindMinimum[(meritFrObj[sL1,x]-frMeritTop)^2,{x,6}][[2,1,2]]; x = 6; inc = x / 100.f; if ( calc_merit_aid(x+inc, fraction_merit_top) > calc_merit_aid(x-inc, fraction_merit_top) ) inc *= -1; deviate = calc_merit_aid(x, fraction_merit_top); do { x += inc; lastDeviate = deviate; deviate = calc_merit_aid(x, fraction_merit_top); } while ( deviate < lastDeviate && deviate > 0 ); merit_upper[sl] = x; } //------------- End of function EnrollRes::calc_enroll_aid --------// //----------- Begin of function EnrollRes::calc_need_aid --------// float EnrollRes::calc_need_aid(float aid) { // for sl1 temporarily const int sl = 0; PeerSchool* player = school_res.player_peer_school; // (* Equals the max of % stu with need and % with need given need aid (cols DR & DS); // taking the max is and approximation to mitigate data problems *) //min & max bug chea const float frOfTradUGsWithNeed = max(player->percent_freshmen_with_need, (float)(player->freshmen_offered_aid)) / 100.0f; // constant mulitpliers // refer also to "Genral: helper function: Minority, athletics, and non-traditional multipliers" float deviate = 0, cdfTmp; float aidMinMultiplier; int subSeg, seg; //EnrollDataSL1 *ed; Talent *talentPtr; for ( subSeg=0; subSeg<STUDENT_SUBSEGMENT_COUNT; subSeg++ ) { if ( subSeg == NONMINORITY_MALE || subSeg == NONMINORITY_FEMALE ) aidMinMultiplier = 1.0f; else aidMinMultiplier = aidMinMultipliers[minority_aid_special]; for ( seg=0; seg<STUDENT_SEGMENT_COUNT; seg++ ) { //ed = &enroll_data_sl1[subSeg][seg]; talentPtr = &(enroll_res.talent_array[subSeg][seg][INCOME]); cdfTmp = math.get_random_gamma_CDF( aidMinMultiplier * talentPtr->average, PSCH_SD(talentPtr->variance), aid ); deviate += cdfTmp * enroll_data_sl1[subSeg][seg].fraction_matrics; } } return math.safe_pow(deviate - frOfTradUGsWithNeed, 2); /* nH = FindMinimum[(needFrObj[sL1,x]-frOfTradUGsWithNeed)^2,{x,60}][[2,1,2]]; nL = nH-maxAid; needFrObj[sL1,nH_] := Plus@@Flatten[needFrObj[sL1,nH,#]&/@gegs]; needFrObj[sL1,nH_,geg_] := With[{cdfTmp = cdf[inc,geg,nH]}, cdfTmp[[#]]*frPriorMatrics[geg][[#]]&/@Range[7]]; cdf[var_,geg_,x_] := gammaCDF[minMultF[aid,geg]*means[var,geg][[#]], variances[var,geg][[#]], x]&/@Range[7]; */ } //------------- End of function EnrollRes::calc_need_aid --------// //----------- Begin of function EnrollRes::calc_merit_aid --------// float EnrollRes::calc_merit_aid(float aid, float base) { // for sl1 temporarily const int sl = 0; // constant mulitpliers // refer also to "Genral: helper function: Minority, athletics, and non-traditional multipliers" float deviate = 0, cdfTmp; float aidMinMultiplier; int subSeg, seg; EnrollDataSL1 *ed; //Talent *talentPtr; for ( subSeg=0; subSeg<STUDENT_SUBSEGMENT_COUNT; subSeg++ ) { if ( subSeg == NONMINORITY_MALE || subSeg == NONMINORITY_FEMALE ) aidMinMultiplier = 1.0f; else aidMinMultiplier = aidMinMultipliers[minority_aid_special]; for ( seg=0; seg<STUDENT_SEGMENT_COUNT; seg++ ) { ed = &enroll_data_sl1[subSeg][seg]; cdfTmp = 1 - math.get_random_gamma_CDF( aidMinMultiplier * ed->util, PSCH_SD(ed->util_variance), aid ); deviate += cdfTmp * enroll_data_sl1[subSeg][seg].fraction_matrics; } } return math.safe_pow(deviate - base, 2); /* meritFrObj[sL1,mL_] := Plus@@Flatten[meritFrObj[sL1,mL,#]&/@gegs]; meritFrObj[sL1,mL_,geg_] := With[{cdfTmp = 1-cdf[util,geg,mL]}, cdfTmp[[#]]*frPriorMatrics[geg][[#]]&/@Range[7]]; */ } //------------- End of function EnrollRes::calc_merit_aid --------// //----------- Begin of function EnrollRes::player_change_offers_priority --------// void EnrollRes::player_change_offers_priority() { // for sl1 temporarily const int sl = 0; // constant mulitpliers // refer also to "Genral: helper function: Minority, athletics, and non-traditional multipliers" // // (* these respresent the "boost" *) const float admMinMultipliers[PRIORITY_LEVEL_COUNT] = { 1.0f, 2.0f, 3.0f }; int subSeg, seg, var; float admMinMultiplier; EnrollDataSL1 *ed; // update utility on player input // for ( subSeg=0; subSeg<STUDENT_SUBSEGMENT_COUNT; subSeg++ ) { if ( subSeg == NONMINORITY_MALE || subSeg == NONMINORITY_FEMALE ) admMinMultiplier = 1.0f; else admMinMultiplier = admMinMultipliers[minority_offers_special]; for ( seg=0; seg<STUDENT_SEGMENT_COUNT; seg++ ) { ed = &enroll_data_sl1[subSeg][seg]; ed->util = ed->util_variance = 0.0f; for ( var=0; var<TALENT_VAR_COUNT; var++ ) { ed->util += float(offers_priority[var]) / MAX_TALENT_PRIORITY_LEVEL * admMinMultiplier * enroll_res.talent_array[subSeg][seg][var].average; ed->util_variance += math.safe_pow(offers_priority[var] / MAX_TALENT_PRIORITY_LEVEL,2) * enroll_res.talent_array[subSeg][seg][var].variance; } } } } //------------- End of function EnrollRes::player_change_offers_priority --------// //----------- Begin of function EnrollRes::calc_doctoral_intake_target --------// void EnrollRes::calc_doctoral_intake_target() { // 0113 if ( player_school.doctoral_program_intensity == 0 ) { target_student_intake[DOCTOR] = 0; return; } int i,j; int targetTotal = 0; CourseArray* courArr; Department* deptPtr; for ( i=department_array.size(); i>0; i-- ) { if ( department_array.is_deleted(i) ) continue; deptPtr = department_array[i]; int totalBreakoutSections = 0; courArr = &(department_array[i]->course_array); for (j=courArr->size(); j>0; j--) { if ( courArr->operator[](j)->teaching_method == BREAKOUT_LAB ) totalBreakoutSections++; } targetTotal += (int) max(deptPtr->doctors_per_research_dollar * deptPtr->total_research_dollar_direct * 1000, deptPtr->init_doctor_count + deptPtr->breakout_section_by_doctor * (totalBreakoutSections - deptPtr->init_breakout_section_count)); } target_student_intake[DOCTOR] = max(0, targetTotal - student_count[DOCTOR]); if ( target_student_intake[DOCTOR] > 3000 ) target_student_intake[DOCTOR] = 3000; // possibly above has bug // else if ( target_student_intake[DOCTOR] <= 0 ) // target_student_intake[DOCTOR] = target_student_intake[MASTER]; err_when(targetTotal < 0); //-------- fix: use the updated target_student_intake[] to recalculate base_apps --------// if( info.prerun_year==1 ) { EnrollData* edSL; int sl=3; // 0.3 -> 30% float studentGenderPct[STUDENT_SUBSEGMENT_COUNT]; err_when(GENDER_ETHNIC_TYPE_COUNT != STUDENT_SUBSEGMENT_COUNT); float femalePercent = student_female_percent[sl] / 100.0f; float minorityPercent = student_minority_percent[sl] / 100.0f; //askbill inital gender percent affect future enrollment? BUG? = 0 when sl=5 studentGenderPct[MINORITY_FEMALE] = femalePercent*minorityPercent; studentGenderPct[NONMINORITY_FEMALE] = femalePercent*(1.0f - minorityPercent); studentGenderPct[MINORITY_MALE] = (1.0f - femalePercent)*minorityPercent; studentGenderPct[NONMINORITY_MALE] = (1.0f - femalePercent)*(1.0f - minorityPercent); for ( int subSeg=0; subSeg<STUDENT_SUBSEGMENT_COUNT; subSeg++ ) { //--------- calc enroll_data_sls[][].apps_ratio, applications and conversion_rate ---------// edSL = &enroll_data_sls[sl-1][subSeg]; edSL->base_apps // 0.5: rounding = int(edSL->apps_ratio * studentGenderPct[subSeg] * target_student_intake[sl] + 0.5); } } } //------------- End of function EnrollRes::calc_doctoral_intake_target --------// //----------- Begin of function EnrollRes::calc_app_multiplier --------// void EnrollRes::calc_app_multiplier(char sl) { const int VAR_COUNT = 3; float input[VAR_COUNT]; int i; err_when(UG_TRADITION != 0); err_when(sl>=MAX_STUDENT_LEVEL); if ( sl == DISTANCE_LEARN ) { float in=0; for (int m=THIS_MONTH; m>=THIS_MONTH-info.graph_month_passed+1; m--) in += library_tech_office.tech_utilization_history[m]; //## org. in = math.single_response_func(0.0f, 1.5f, 10.0f, 5.0f, in/100); // app_multiplier[sl] = math.latency_func(0.3f, app_multiplier[sl], in); //## chea 300899 change latency_func(HE.RespF_Defs.Rev 230899 E-mail) app_multiplier[sl] = player_school.latency_func(0.25f, app_multiplier[sl], in); } else { // Applications multiplier: on-campus students // 1009 response_func // memset(input, 0, sizeof(input)); //-------------------// input[0] = school_res.player_peer_school->prestige; //-------------------// // (minor bug) should depend on [sl] input[1] = player_school.satisfaction_overall[THIS_MONTH]; //-------------------// int totalTargetIntake = 0; for (i=0; i<MAX_STUDENT_LEVEL; i++) totalTargetIntake += target_student_intake[i]; //min & max bug chea input[2] = max(1000.0f, float(finance.projected_expense_array[AC_ENROLLMENT_MANAGEMENT].this_year.total)) / totalTargetIntake; if ( input[2] == 0 ) input[2] = 1; input[2] *= (float) finance.cost_rise_policy_array[PL_ENROLLMENT_MANAGEMENT].penalty_multiplier1; //-------------------// float weight[VAR_COUNT] = { 0.35f, 0.3f, 0.35f }; float newValue = 0; for (i=0; i<VAR_COUNT; i++) newValue += input[i] * weight[i]; //-------------------// //## chea 300899 change latency_func(HE.RespF_Defs.Rev 230899 E-mail) app_multiplier[sl] = max(0.7f,min(1.3f, player_school.latency_func(0.8f, app_multiplier[sl], newValue))); } //-------------------// // calc yield_multiplier //-------------------// float weight[VAR_COUNT] = { 0.35f, 0.5f, 0.15f}; float newValue = 0; for (i=0; i<VAR_COUNT; i++) newValue += input[i] * weight[i]; //-------------------// //## chea 300899 change latency_func(HE.RespF_Defs.Rev 230899 E-mail) yield_multiplier[sl] = max(0.7f,min(1.3f, player_school.latency_func(0.80f, yield_multiplier[sl], newValue))); } //----------- End of function EnrollRes::calc_app_multiplier --------// //----------- Begin of function EnrollRes::calc_post_enroll --------// void EnrollRes::calc_post_enroll() { // for sl1 temporarily const int sl = UG_TRADITION; // 0305 //-------------------------// // generate student // //-------------------------// // refer to td3.4 section 2.7 char subSeg, seg; int newStudentCount, i, t, aid=0; // temp vars storing new sim properties float talentArr[TALENT_VAR_COUNT]; int maleCount=0, femaleCount=0; avg_athletic_talent_male_matrics = 0; avg_athletic_talent_female_matrics = 0; for ( subSeg=0; subSeg<