Dynamic Replication of Fault-Tolerant Scheduling Algorithm
|
|
- Roberta Wright
- 5 years ago
- Views:
Transcription
1 Send Orders for Reprins o reprins@benhamscience.ae 2670 The Open Cyberneics & Sysemics Journal, 2015, 9, Dynamic Replicaion of Faul-Toleran Scheduling Algorihm Open Access Wang Hongxia * Fang Haoran and Qiu Xin School of Compuer Science and Engineering, Shenyang Ligong Universiy, Shenyang, , P.R. China Absrac: In order o reduce he impac on he grid scheduling caused by he resource error, for complex dependen asks, designed a dynamic replicaion of faul-oleran scheduling algorihm (DRFT). This algorihm build ask model by applying hypergraph heory, using primary-backup ask as backup mode, ake he acive execuion mode combined wih he passive execuion mode o perform he backup ask, se up dynamic backup level according o he level of imporance and resources securiy condiion of dependen ask, pursui ime of he ask execuion is minimized, he simulaion resul shows ha he algorihm can sill be accomplished scheduling quickly in case of error caused by he resource, o make up he shorage of common algorihms in erms of faul-oleran. Keywords: Dependen ask, dynamic replicaion, faul-oleran scheduling, hypergraph. 1. INTRODUCTION In order o improve he reliabiliy of grid sysem, commonly used error prevenion, error verificaion, error predicion and faul-oleran four mehods [1-3]. Among hem, he faul-oleran is a common and efficien soluion. Faul-oleran mehod includes rery, N version of he program design, he recovery block, primary-backup scheduling echnology, he primary-backup scheduling echnique is he mos commonly used of Faul-oleran mehod [4, 5]. The primary-backup scheduling echnique is backup ask on oher resource, if he main ask execuion error, began o perform he backup ask. The execue mehod of backup ask can also be divided ino acive backup mehod, passive backup mehod and he combinaion of acive and passive backup mehod [6-8]. Acive backup mehod, refers o he resource wihou faul are also required o perform he backup ask, his will undoubedly increase he burden on resource; passive backup mehod is a mehod of execuion only afer he main ask execue error, he faul-oleran of such a sysem is no very high; he combinaion of acive and passive backup mehod is a kind of backup ask execuion mode combine wih acive execuion and passive execuion, can achieve a relaively small cos bu also improve he fauloleran of he sysem, so his paper uses he combinaion of acive and passive backup mehod. The researches apply primary-backup mehod o improve faul-oleran on grid sysem are as follows, lieraure [9] were designed mea-ask and dependen ask of primarybackup faul-oleran scheduling algorihm, hough effecively achieve faul-oleran, bu wihou considering he size of he burden he backup o resource; lieraure [10] in order o minimize backup coss as he main arge, designed a differed backup- copy of primary/backup copy, by delay backup-copy sar ime as far as possible, o achieve he purpose of minimize he duy cos, bu he aricle does no consider he imporance of he ask; lieraure [11] designed a primary/backup-copy scheduling algorihm based on dependen ask, o seek he balance beween he minimal cos and he earlies compleion of he backup ask, bu i can no achieve he backup cos and he compleion ime are all small. In a word, he above aricle are no consider he backup issues according o he imporance of he ask, he effec of minimize he backup level and execuion ime is no very obvious. Hypergraph heory [12] was firs proposed by C. Berge in 1970, sudy on he muliple relaionship. Applicaion hypergraph heory o build a model, provides a lo of convenience in describing he problem, conducive o solving pracical problems, herefore, his paper use hypergraph model o express dependencies beween asks, no only can express he basic informaion of ask clearly, bu also can express he inerdependence beween asks. Therefore, his paper aimed a he problem of ask scheduling in grid faul-oleran, designed a dynamic replicaion of faul-oleran scheduling algorihm (DRFT), his mehod akes ino accoun he complexiy of dependen ask, based on he applicaion of hypergraph heory build ask model, using primary-backup ask as backup mode, ake he acive execuion mode combined wih he passive execuion mode o execue he backup asks, se up dynamic backup level according o he level of imporance and resources securiy condiion of dependen ask, pursui ime of he ask execuion is minimized. Compared wih he classical algorihm GS-Min-min algorihm, even in he case of ask execuion error, his mehod is sill able o quickly X/ Benham Open
2 Dynamic Replicaion of Faul-oleran Scheduling Algorihm The Open Cyberneics & Sysemics Journal, 2015, Volume complee he scheduling, reduce he impac of resource failure for ask scheduling. 2. MODEL CONSTITUTION In his paper, he backup ask execuion mode using a combinaion of acive and passive execuion mode. In order o reduce he backup excessive use of resources, here is only one backup ask, he backup ask is spli ino acive execuion par and passive execuion par by calculaion uni, execuion mode is he combinaion of acive execuion and passive execuion, ha is he acive execuion iniiaive implemen, passive execuion passive implemen. The acive par of backup asks iniiaive implemen, only when he main ask execuion fails, anoher par of he backup ask, ha is passive par, will be acivaed o execue. So o a cerain exen can reduce backup coss, and if he main ask execuion fails, backup ask can be compleed quickly. Fig. (1) shows he primary-backup ask. 2) rca is he ask compuaion. 3) rs is he sae of he ask, he sae of he ask is divided ino idle sae, has been mached sae, wai sae, execuion sae and finish sae, he sae of he ask changes wih scheduling process. Expressed as follows: rs={rfree, rmach, rwai, rwork, rdone b) RE= {re 1, re 2,,re m is a se of hyperedge, m= RE is he number of hyperedge, hyperedge re i composed by a hree-elemen-array (Pre, Des, rv i ). Pre is all he predecessor ask of he ask se rv i, predecessor ask is ha have a direc dependencies of ask rv i, if and only if afer all asks finished in he se Pre, ask rv i can execue. Des is a collecion of all pos-ask of ask rv i, pos-ask is ha have a direc dependencies of ask rv i, ask rv i finish execuing is a prerequisie for any of he asks can be execued of Des. Any ask node has is corresponding hyperedge, he weigh D i of hyperedge re i is he number of seps of ask node rv i. The number of seps is he maximum number of seps ask node o he exi node. The ask node has no posask is he exi node. Direced hypergraph ask model is shown in Fig. (2). Fig. (1). The Primary-backup ask The Main Task of The Hypergraph Model Because here are inerdependencies beween asks, herefore fusion hypergraph heory building he main ask hypergraph model, ask hypergraph model consis of ask noe and hyperedge, hyperedge can deailed express dependencies beween asks. The ask mainly consider he dependen ask, and all are he compuing ask, dependen ask have inerdependencies beween asks, only he curren ask all predecessor ask is compleed, his ask can execue. Because of he inerdependencies beween asks, hypergraph model is direced hypergraph. Hypohesis resource ransmission speed very quickly, ignore he raffic load problems beween asks. Tasks node consiss of a hree-elemen-array, ha is he ask ID, ask compuaion and he sae of he ask, he sae of he ask includes five saes: idle, have been mached, waiing, execue, finish. The primary ask of direced hypergraph model is described as follows: RH= (RX,RE) is he ask model of he hypergraph represenaion. a) RX ={rv 1,rv 2,,rv rn is he se of node ask, where rv i ={rid, rca, rs is a aribue se of ask node, i [1,rn]. 1) rid is he ask ID. Fig. (2). Direced hypergraph ask model. As shown in Fig. (2), ask rv 1,rv 2,,rv rn, hyperedge re 1, re 2,,re m, e.g. re 3 ({rv 1, {rv 6, rv 7, rv 3 ), he weigh of he re 3 is D 3 =2; re 7 ({rv 1,rv 3, rv 4, rv 5,, {rv 9, rv 7 ), he weigh of he re 7 is D 7 = The Backup Task Model Backup ask are copy from he main ask, so he backup ask inheris is main ask ID, compuaion and dependencies beween asks, he backup ask is one o one corresponding relaion o main ask. In addiion, he backup ask should also have he properies main ask do no have, ha is he acive par and he passive par. Backup ask model and he main ask model are he same, as follows: RH= (RX, RE) is he hypergraph represenaion of backup ask.
3 2672 The Open Cyberneics & Sysemics Journal, 2015, Volume 9 Hongxia e al. a) RX= {rv 1, rv 2,, rv rn is he backup ask node se, where rv i = {rid, vrca, rca, rs, i[1, r n ]. 1) rca is backup ask compuaion of acive execuion, vrca is backup ask compuaion of passive execuion. 2) rs={rfree, rmach, rwai, rwork, vrwork, rdone is he saes of he backup ask, rwork is acive execuion working sae of backup ask, vrwork is passive execuion working sae of backup ask. b) RE= {re 1 re 2 re m is a se of hyperedge, m= RE is he number of hyperedge, hyperedge re i (Pre, Des, rv i ), here consisen wih he main ask model The Resource Model Resource node consiue by resource ID, resource handling, resource load and he safey facor of resource, resources are described as follow: RE= {v 1, v 2,, v n is a se of resource node, where v i is he i-h resource, v i = {ID, P, Load SA is a resource properies collecion, i[1 n]. a) ID is he resource ID. b) P is he abiliy of resource processing. c) Load is a resource load, resource load include he acual load and he virual load. The acual load is he compuaion of backup ask acive execuion par, he virual load is he compuaion of backup ask passive execuion par. Resource load value equal o he acual load value, ha is he load backup asks acually execued. d) SA is he safey facor of resource, se he safey facor for he resource, can dynamically view he securiy of resource, has a direc effec on he scheduling success rae. Number of mission success SA i = (1) Number of mission accep 3. SCHEDULING STRATEGY 3.1. Backup Level Calculaion Faul-oleran backup for dependen asks, wih he influence exen of ask failed o pos-ask execuion, dynamically se of faul-oleran backup level, if he ask error is larger, he more i is necessary o increase he level of backup and here is a direc relaionship beween he level of imporance of ask and he number of sep, he number of sep is he maximum number of seps ask node o he exi node. The larger he number of seps of he ask, he greaer degree of influence on he pos- ask, herefore, he exen of heir backup should be more, and he resource securiy siuaion he main ask of backup ask also need o be considered, so we can ge he formula of he level of backup: -SArv i rcai B( i) = Dmax + 1 Di Di 0 (2) 0 Di =0 SA rvi The safey facor of he main ask of rv i resource; Adjusmen coefficien, can adjus he level of backup; rca The calculaion of ask; D The number of sep; When he number of sep is no zero, he backup level have a relaionship wih ask sep, compuaion and is main ask he safey facor of resources; when he sep number is zero, ask is dependen ask of exi node ask, his ask has no grea influence on he pos-ask, so is no need o backup, ha is backup level is zero. Main ask sequencing and backup level calculaion process: //: sequencing for (all main asks) { Breadh-firs raversal dependen ask graph o ge he number of sep for each ask; Consolidaed he same sep of hyperedge ask and in descending order; hyperedge wihin he same ask, in descending order by prioriy value formula; //: Backup level calculaion for (all backup asks) { Inheri heir main ask dependencies and he number of sep; Calculae he level of he backup; 3.2. Mach Scheduling Breadh-firs raversal ask graph, in descending order based on he mission maximum number of sep, and more han one ask a each sep, so every sep needed o sor. Because of dependencies beween asks, only a predecessor ask complees, all pos-ask can be execued, herefore, he execuion ime of a predecessor ask deermines he sar ime of he pos-ask, if no considered he resource processing capabiliy, he execuion ime of he ask is only concerned wih he compuaional ask. So he prioriy value o each ask is equal o he maximum value of he predecessor ask compuaion and he curren ask o calculae ogeher, see he formula (3). (3) In descending order according o he prioriy value of he ask, herefore, he ask of sor resul deermine ask prioriy maching. Main ask and backup ask can no be on he same resource, because here are differen maching requiremens beween main ask and backup ask, so he main ask and backup ask using differen maching mode a) The main ask of maching According o he ask of sor resul, mach scheduling sar sequenially, maching wih he resources of smalles SL.
4 Dynamic Replicaion of Faul-oleran Scheduling Algorihm The Open Cyberneics & Sysemics Journal, 2015, Volume Load -Load SA -SA P -P i min max i max i SL = + + (4) i Load -Load SA -SA P -P max min max min max min Load i Load of resource i; SA i The safey facor of Resource i; P i Processing capaciy of resource i. By equaion (4) shows, a small value of SL indicaes ha he resource load is small, high safey coefficien and srong processing abiliy, hoping ask o scheduling o such resources. b) Maching backup ask Backup ask mach resource, requires maching high safey coefficien and small load resource, he mos imporan is ha his resource can no be consisen wih he main ask resource. The backup ask scheduling sequence, followed by he main ask. Tha is rv 1, rv 1, rv 2, rv 2,, rv rn, rv rn. If he main ask and he backup ask execuion error, need o reurn o he ask waiing queue, reallocaion of execuion. If he backup ask has no been execued or being execued, and is main ask has been finished, sop execue backup ask, his can reduce backup coss o a cerain exen. Dynamic replicaion of faul-oleran scheduling algorihm (DRFT) scheduling process: Le T be a ask waiing queue, copy of each ask; //: sequencing //: Backup level calculaion for (each ask rv i of T) { main ask rv i mach he minimum value resources of SL; Backup asks rv i '() { Looking for a high safey coefficien resource; Exclude resource of he main ask; Maching resource o which he load is minimal; Scheduling asks rvi o resources v j ; Delee asks rv i, rv i ' in T; Updaed resource load Load, updae ask sae; if (ask execuion success) { if (main ask rv i execuion success) { Oupu scheduling resul; else if (backup asks rv i 'execuion success) { Oupu scheduling resul; else { Task reurns o he waiing queue T, reassigned; Backup ask he acive execuion par is he acual load, he passive execuion par is he virual load. Resource load is he acual load, bu on condiion when he main ask execuion error, passive par is acivaed o execue, a his poin he passive par of he load, which is he virual load will be ransformed ino he acual load, so he acual load and he virual load is consanly changing. 4. PERFORMANCE ANALYSIS The backup ask is an implemenaion of faul-oleran echnology, here is a direc relaionship beween he success of he backup ask execuion and backup ask posiion, ha is for a ask he main ask and is backup ask are no on he same resource, as shown in Fig. (3). Main ask and backup ask of differen asks can be on he same resource, as shown in Fig. (4). Fig. (3). Error backup ask paern. Fig. (4). Correc backup ask paern. Backup 2 Task2 Variable level of faul-oleran backup scheduling is a faul-oleran algorihm based on dependen ask, only under he condiion of he predecessor ask is compleed, o be able o execue pos-ask. If he ask error, and here are oher ask on he backup ask resource, as shown in Fig. (5), if his ask is being execued, as shown in Figure 6, sops he execuion of he ask, reurn o he ask queue waiing o reallocae. Fig. (5) and Fig. (6) shows ha a ime, resource 1 is broken, a his ime he main ask of ask 1 is no finished ye, he acive par of he backup ask of ask 1 is being execued, a his ime need o acivae he passive par of he backup ask, bu he resource is no idle, he passive par is urgen for execuion, hus, he ask 2 will reurn o he ask queue waiing o reallocae. If he main ask is compleed in execuion, i has no ye begin o execue backup asks as shown in Fig. (7), or being
5 2674 The Open Cyberneics & Sysemics Journal, 2015, Volume 9 Hongxia e al. execued as shown in Fig. (8), a his ime he backup ask should sop execuion, o a cerain exen, can reduce he cos of backup, save he scheduling ime. acive execuion and passive execuion, wih he flexibiliy o adjus he cos of backup, pursui of he execuion ime is minimized. Compared wih he classical dependen ask scheduling algorihm GS-Min-min algorihm, in he case of resource error, DRFT algorihm scheduled for execuion can sill be compleed in a shor ime. Task 2 Fig. (5). Failure occurs when he backup ask execuion. Fig. (8). Main ask is complee, backup is being performed. Task 2 Fig. (6). Failure occurred afer he backup ask is compleed. Fig. (9). Backup ask error. Fig. (7). Main ask is complee, backup is no performed. If he backup ask execuion error, a his ime is main ask is execuing sae, as shown in Fig. (9), if he main ask can be execued successfully, will no affec he pos-ask execuion; If he main ask fails, his ask will reurn o he ask queue waiing o reallocae. 5. SIMULATION ANALYSIS This aricle is designed a dynamic replicaion of fauloleran scheduling algorihm (DRFT), according o he imporance level of ask, he ask is spli ino wo pars, GS-Min-min algorihm is based on he dependen ask scheduling, if his algorihm is applied in he faul-oleran sysem, when ask error occurred will reurn o he ask queue waiing o reallocae. Compared he scheduling simulaion experimen of DRFT algorihm and GS-Min-min algorihm, according o he ask dependency of Fig. (2), build differen properies of he ask and he differen aribues of he resource, in he case of he probabiliy of error resource, comparing he maximum compleion ime Makespan. Assuming compuaional ask in he range of 250 o 350, resource processing capaciy in he range of 30 o 60, resource safey facor beween 0.4 and 0.7, a he momen 1=9S, resource 4 fails, a he momen 2=17S, resource 6 fails, assuming resource does no recover afer he failure. Fig. (10) is DRFT algorihm Gan char, Fig. (11) is GS- Min-min algorihm Gan char, from he wo figures i is clear ha even afer he resource fails, DRFT algorihm sill complee he execuion of 23S, bu GS-Min-min algorihm finished execuing using 29S.
6 Dynamic Replicaion of Faul-oleran Scheduling Algorihm The Open Cyberneics & Sysemics Journal, 2015, Volume Fig. (10). DRFT algorihm gan char. Fig. (11). GS-min-min algorihm gan char. Resource error will grealy affec he operaion of posask, and can no predic he probabiliy of resource error, Fig. (12). shows wih he probabiliy of resource error increasing, he maximum compleion ime of DRFT algorihm and GS-Min-min algorihm. I was concluded ha he greaer probabiliy of resource error, DRFT algorihm is more superior. In he grid environmen, dynamic resource canno accuraely predic, he probabiliy of resource error can only be based on he sae of pas o predic, mehod o deal wih resource emergency is imporan, ake dynamic backup level scheduling algorihm of primary-backup, can reduce or even does no affec he pos-ask performance. Analysis he simulaion of DRFT algorihm and GS-Min-min algorihm, can be clearly seen he superior of he DRFT algorihm. Fig. (12). The probabiliy of resource error impac on Makespan.
7 2676 The Open Cyberneics & Sysemics Journal, 2015, Volume 9 Hongxia e al. CONCLUSION This aricle designed he dynamic replicaion of fauloleran scheduling algorihm (DRFT), use ask relaionship caused by he imporance of he ask and he securiy of resource of dependen ask as parameers, consiue a variable level of backup and combine wih acive and passive of primary-backup scheduling algorihm, dynamic flexibiliy o adjus he level of backup asks, pursui of scheduling ime is minimized, a he same ime he faul-oleran algorihm perform excellen. Compared wih he classical algorihm GS-Min-min algorihm, even in he case of error resources, he algorihm can sill finish scheduling quickly. CONFLICT OF INTEREST The auhor confirms ha his aricle conen has no conflic of ineres. ACKNOWLEDGEMENTS This research was parially funded by he Naional Naural Science Foundaion of China (Gran No ), suppored by Program for Liaoning Excellen Talens in Universiy (No. LJQ ). REFERENCES [1] M. Amoon, A faul-oleran scheduling sysem for compuaional grids, Compuers & Elecrical Engineering, vol. 38, no. 2, pp , [2] K.J. Naik, and N. Sayanarayana, A novel faul-oleran ask scheduling algorihm for compuaional grids, In: 15h Inernaional Conference on Advanced Compuing Technologies, Rajampe, pp.1-6, [3] S. Jain, and J. Chaudhary, New faul oleran scheduling algorihm implemened using check poining in grid compuing environmen, In: Inernaional Conference on, Opimizaion, Reliabily, and Informaion Technology, Faridabad, pp , [4] S. Xu, Faul-oleran compuing sysems, Hubei:Wuhan Universiy Press, pp , [5] W. Luo, A Real-Time Faul-Toleran Scheduling Algorihm of Periodic Tasks in Heerogeneous Disribued Sysems, Chinese Journal of Compuers, vol. 30, no. 10, pp , [6] C. Yang, G. Deconinck, and W. Gui, Faul-oleran scheduling for real-ime embedded conrol sysems, Journal of Compuer Science and Technology, vol. 19, no. 2, pp , [7] Q. Zheng, B. Veeravalli, and C.K. Tham, On he design of fauloleran scheduling sraegies using primary-backup approach for compuaional girds wih low replicaion coss, IEEE Transacions on compuers, vol. 58, no. 3, pp , [8] A. Benoi, M. Hakem, and Y. Rober, Conenion awareness and faul-oleran scheduling for precedence consrained asks in heerogeneous sysems, Parallel Compuing, vol. 35, no. 2, pp , [9] H. Liu, Research On Primary-Backup Based Faul-Toleran Scheduling Algorihms For Cloud Compuing, M.D. hesis. Zhejiang Gongshang Universiy, On Hangzhou, [10] W. Luo, A Real-Time Faul-Toleran Scheduling Algorihm for Disribued Sysems Based on Deferred Acive Backup-Copy, Journal of Compuer Research and Developmen, vol. 44, no. 3, pp , [11] W. Jing, Faul-oleran scheduling algorihm for precedence consrained asks, Journal of Tsinghua Universiy(Science and Technology), vol. 51, no. S1, pp , [12] C. Berge, Graphs and Hypergraphs, Norh Holland, Amserdam Received: June 10, 2015 Revised: July 29, 2015 Acceped: Augus 15, 2015 Hongxia e al.; Licensee Benham Open. This is an open access aricle licensed under he erms of he (hps://creaivecommons.org/licenses/by/4.0/legalcode), which permis unresriced, noncommercial use, disribuion and reproducion in any medium, provided he work is properly cied.
An Effiecient Approach for Resource Auto-Scaling in Cloud Environments
Inernaional Journal of Elecrical and Compuer Engineering (IJECE) Vol. 6, No. 5, Ocober 2016, pp. 2415~2424 ISSN: 2088-8708, DOI: 10.11591/ijece.v6i5.10639 2415 An Effiecien Approach for Resource Auo-Scaling
More informationNeural Network Model of the Backpropagation Algorithm
Neural Nework Model of he Backpropagaion Algorihm Rudolf Jakša Deparmen of Cyberneics and Arificial Inelligence Technical Universiy of Košice Lená 9, 4 Košice Slovakia jaksa@neuron.uke.sk Miroslav Karák
More informationMyLab & Mastering Business
MyLab & Masering Business Efficacy Repor 2013 MyLab & Masering: Business Efficacy Repor 2013 Edied by Michelle D. Speckler 2013 Pearson MyAccouningLab, MyEconLab, MyFinanceLab, MyMarkeingLab, and MyOMLab
More informationInformation Propagation for informing Special Population Subgroups about New Ground Transportation Services at Airports
Downloaded from ascelibrary.org by Basil Sephanis on 07/13/16. Copyrigh ASCE. For personal use only; all righs reserved. Informaion Propagaion for informing Special Populaion Subgroups abou New Ground
More informationFast Multi-task Learning for Query Spelling Correction
Fas Muli-ask Learning for Query Spelling Correcion Xu Sun Dep. of Saisical Science Cornell Universiy Ihaca, NY 14853 xusun@cornell.edu Anshumali Shrivasava Dep. of Compuer Science Cornell Universiy Ihaca,
More informationChannel Mapping using Bidirectional Long Short-Term Memory for Dereverberation in Hands-Free Voice Controlled Devices
Z. Zhang e al.: Channel Mapping using Bidirecional Long Shor-Term Memory for Dereverberaion in Hands-Free Voice Conrolled Devices 525 Channel Mapping using Bidirecional Long Shor-Term Memory for Dereverberaion
More information1 Language universals
AS LX 500 Topics: Language Uniersals Fall 2010, Sepember 21 4a. Anisymmery 1 Language uniersals Subjec-erb agreemen and order Bach (1971) discusses wh-quesions across SO and SO languages, hypohesizing:...
More informationMore Accurate Question Answering on Freebase
More Accurae Quesion Answering on Freebase Hannah Bas, Elmar Haussmann Deparmen of Compuer Science Universiy of Freiburg 79110 Freiburg, Germany {bas, haussmann}@informaik.uni-freiburg.de ABSTRACT Real-world
More informationMultiple Intelligence Theory into College Sports Option Class in the Study To Class, for Example Table Tennis
Multiple Intelligence Theory into College Sports Option Class in the Study ------- To Class, for Example Table Tennis LIANG Huawei School of Physical Education, Henan Polytechnic University, China, 454
More informationEmpirical research on implementation of full English teaching mode in the professional courses of the engineering doctoral students
Empirical research on implementation of full English teaching mode in the professional courses of the engineering doctoral students Yunxia Zhang & Li Li College of Electronics and Information Engineering,
More informationFaculty Schedule Preference Survey Results
Faculty Schedule Preference Survey Results Surveys were distributed to all 199 faculty mailboxes with information about moving to a 16 week calendar followed by asking their calendar schedule. Objective
More informationDetecting English-French Cognates Using Orthographic Edit Distance
Detecting English-French Cognates Using Orthographic Edit Distance Qiongkai Xu 1,2, Albert Chen 1, Chang i 1 1 The Australian National University, College of Engineering and Computer Science 2 National
More informationOPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS
OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS Václav Kocian, Eva Volná, Michal Janošek, Martin Kotyrba University of Ostrava Department of Informatics and Computers Dvořákova 7,
More informationRole of Blackboard Platform in Undergraduate Education A case study on physiology learning in nurse major
I.J. Education and Management Engineering 2012, 5, 31-36 Published Online May 2012 in MECS (http://www.mecs-press.net) DOI: 10.5815/ijeme.2012.05.05 Available online at http://www.mecs-press.net/ijeme
More informationA Study of Metacognitive Awareness of Non-English Majors in L2 Listening
ISSN 1798-4769 Journal of Language Teaching and Research, Vol. 4, No. 3, pp. 504-510, May 2013 Manufactured in Finland. doi:10.4304/jltr.4.3.504-510 A Study of Metacognitive Awareness of Non-English Majors
More informationA Study of Video Effects on English Listening Comprehension
Studies in Literature and Language Vol. 8, No. 2, 2014, pp. 53-58 DOI:10.3968/4348 ISSN 1923-1555[Print] ISSN 1923-1563[Online] www.cscanada.net www.cscanada.org Study of Video Effects on English Listening
More informationOn-Line Data Analytics
International Journal of Computer Applications in Engineering Sciences [VOL I, ISSUE III, SEPTEMBER 2011] [ISSN: 2231-4946] On-Line Data Analytics Yugandhar Vemulapalli #, Devarapalli Raghu *, Raja Jacob
More informationHow to set up gradebook categories in Moodle 2.
How to set up gradebook categories in Moodle 2. It is possible to set up the gradebook to show divisions in time such as semesters and quarters by using categories. For example, Semester 1 = main category
More informationAn Introduction to Simio for Beginners
An Introduction to Simio for Beginners C. Dennis Pegden, Ph.D. This white paper is intended to introduce Simio to a user new to simulation. It is intended for the manufacturing engineer, hospital quality
More informationXinyu Tang. Education. Research Interests. Honors and Awards. Professional Experience
Xinyu Tang Parasol Laboratory Department of Computer Science Texas A&M University, TAMU 3112 College Station, TX 77843-3112 phone:(979)847-8835 fax: (979)458-0425 email: xinyut@tamu.edu url: http://parasol.tamu.edu/people/xinyut
More informationISFA2008U_120 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM
Proceedings of 28 ISFA 28 International Symposium on Flexible Automation Atlanta, GA, USA June 23-26, 28 ISFA28U_12 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM Amit Gil, Helman Stern, Yael Edan, and
More informationAustralian Journal of Basic and Applied Sciences
AENSI Journals Australian Journal of Basic and Applied Sciences ISSN:1991-8178 Journal home page: www.ajbasweb.com Feature Selection Technique Using Principal Component Analysis For Improving Fuzzy C-Mean
More informationRunning head: DELAY AND PROSPECTIVE MEMORY 1
Running head: DELAY AND PROSPECTIVE MEMORY 1 In Press at Memory & Cognition Effects of Delay of Prospective Memory Cues in an Ongoing Task on Prospective Memory Task Performance Dawn M. McBride, Jaclyn
More informationIn Workflow. Viewing: Last edit: 10/27/15 1:51 pm. Approval Path. Date Submi ed: 10/09/15 2:47 pm. 6. Coordinator Curriculum Management
1 of 5 11/19/2015 8:10 AM Date Submi ed: 10/09/15 2:47 pm Viewing: Last edit: 10/27/15 1:51 pm Changes proposed by: GODWINH In Workflow 1. BUSI Editor 2. BUSI Chair 3. BU Associate Dean 4. Biggio Center
More informationI N T E R P R E T H O G A N D E V E L O P HOGAN BUSINESS REASONING INVENTORY. Report for: Martina Mustermann ID: HC Date: May 02, 2017
S E L E C T D E V E L O P L E A D H O G A N D E V E L O P I N T E R P R E T HOGAN BUSINESS REASONING INVENTORY Report for: Martina Mustermann ID: HC906276 Date: May 02, 2017 2 0 0 9 H O G A N A S S E S
More informationSIE: Speech Enabled Interface for E-Learning
SIE: Speech Enabled Interface for E-Learning Shikha M.Tech Student Lovely Professional University, Phagwara, Punjab INDIA ABSTRACT In today s world, e-learning is very important and popular. E- learning
More informationDesigning a Computer to Play Nim: A Mini-Capstone Project in Digital Design I
Session 1793 Designing a Computer to Play Nim: A Mini-Capstone Project in Digital Design I John Greco, Ph.D. Department of Electrical and Computer Engineering Lafayette College Easton, PA 18042 Abstract
More informationSession 2B From understanding perspectives to informing public policy the potential and challenges for Q findings to inform survey design
Session 2B From understanding perspectives to informing public policy the potential and challenges for Q findings to inform survey design Paper #3 Five Q-to-survey approaches: did they work? Job van Exel
More informationApplication of Multimedia Technology in Vocabulary Learning for Engineering Students
Application of Multimedia Technology in Vocabulary Learning for Engineering Students https://doi.org/10.3991/ijet.v12i01.6153 Xue Shi Luoyang Institute of Science and Technology, Luoyang, China xuewonder@aliyun.com
More informationComputer Organization I (Tietokoneen toiminta)
581305-6 Computer Organization I (Tietokoneen toiminta) Teemu Kerola University of Helsinki Department of Computer Science Spring 2010 1 Computer Organization I Course area and goals Course learning methods
More informationThe 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, / X
The 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, 2013 10.12753/2066-026X-13-154 DATA MINING SOLUTIONS FOR DETERMINING STUDENT'S PROFILE Adela BÂRA,
More informationTransfer Learning Action Models by Measuring the Similarity of Different Domains
Transfer Learning Action Models by Measuring the Similarity of Different Domains Hankui Zhuo 1, Qiang Yang 2, and Lei Li 1 1 Software Research Institute, Sun Yat-sen University, Guangzhou, China. zhuohank@gmail.com,lnslilei@mail.sysu.edu.cn
More informationThought and Suggestions on Teaching Material Management Job in Colleges and Universities Based on Improvement of Innovation Capacity
Thought and Suggestions on Teaching Material Management Job in Colleges and Universities Based on Improvement of Innovation Capacity Lihua Geng 1 & Bingjun Yao 1 1 Changchun University of Science and Technology,
More informationACTIVITY: Comparing Combination Locks
5.4 Compound Events outcomes of one or more events? ow can you find the number of possible ACIVIY: Comparing Combination Locks Work with a partner. You are buying a combination lock. You have three choices.
More informationDeveloping True/False Test Sheet Generating System with Diagnosing Basic Cognitive Ability
Developing True/False Test Sheet Generating System with Diagnosing Basic Cognitive Ability Shih-Bin Chen Dept. of Information and Computer Engineering, Chung-Yuan Christian University Chung-Li, Taiwan
More informationMalicious User Suppression for Cooperative Spectrum Sensing in Cognitive Radio Networks using Dixon s Outlier Detection Method
Malicious User Suppression for Cooperative Spectrum Sensing in Cognitive Radio Networks using Dixon s Outlier Detection Method Sanket S. Kalamkar and Adrish Banerjee Department of Electrical Engineering
More informationNational Taiwan Normal University - List of Presidents
National Taiwan Normal University - List of Presidents 1st Chancellor Li Ji-gu (Term of Office: 1946.5 ~1948.6) Chancellor Li Ji-gu (1895-1968), former name Zong Wu, from Zhejiang, Shaoxing. Graduated
More informationMathematics textbooks the link between the intended and the implemented curriculum? Monica Johansson Luleå University of Technology, Sweden
Mathematics textbooks the link between the intended and the implemented curriculum? Monica Johansson Luleå University of Technology, Sweden Textbooks are a predominant source in mathematics classrooms
More informationPredicting Student Attrition in MOOCs using Sentiment Analysis and Neural Networks
Predicting Student Attrition in MOOCs using Sentiment Analysis and Neural Networks Devendra Singh Chaplot, Eunhee Rhim, and Jihie Kim Samsung Electronics Co., Ltd. Seoul, South Korea {dev.chaplot,eunhee.rhim,jihie.kim}@samsung.com
More informationMy first english teacher essay. To teacher first on research andor english, simply order an essay from us..
My first english teacher essay. To teacher first on research andor english, simply order an essay from us.. My first english teacher essay >>>CLICK HERE
More informationSoftware Maintenance
1 What is Software Maintenance? Software Maintenance is a very broad activity that includes error corrections, enhancements of capabilities, deletion of obsolete capabilities, and optimization. 2 Categories
More informationImproving software testing course experience with pair testing pattern. Iyad Alazzam* and Mohammed Akour
244 Int. J. Teaching and Case Studies, Vol. 6, No. 3, 2015 Improving software testing course experience with pair testing pattern Iyad lazzam* and Mohammed kour Department of Computer Information Systems,
More informationVisual CP Representation of Knowledge
Visual CP Representation of Knowledge Heather D. Pfeiffer and Roger T. Hartley Department of Computer Science New Mexico State University Las Cruces, NM 88003-8001, USA email: hdp@cs.nmsu.edu and rth@cs.nmsu.edu
More informationData Fusion Models in WSNs: Comparison and Analysis
Proceedings of 2014 Zone 1 Conference of the American Society for Engineering Education (ASEE Zone 1) Data Fusion s in WSNs: Comparison and Analysis Marwah M Almasri, and Khaled M Elleithy, Senior Member,
More informationMultimedia Courseware of Road Safety Education for Secondary School Students
Multimedia Courseware of Road Safety Education for Secondary School Students Hanis Salwani, O 1 and Sobihatun ur, A.S 2 1 Universiti Utara Malaysia, Malaysia, hanisalwani89@hotmail.com 2 Universiti Utara
More informationCircuit Simulators: A Revolutionary E-Learning Platform
Circuit Simulators: A Revolutionary E-Learning Platform Mahi Itagi Padre Conceicao College of Engineering, Verna, Goa, India. itagimahi@gmail.com Akhil Deshpande Gogte Institute of Technology, Udyambag,
More informationFort Hays State University
Fort Hays State University Operations Manual for Faculty and Staff at Chinese Partner Schools 2013-2014 Office of Strategic Partnerships Updated July 18, 2013 Approved by Provost Council October 18, 2011
More informationParallel Evaluation in Stratal OT * Adam Baker University of Arizona
Parallel Evaluation in Stratal OT * Adam Baker University of Arizona tabaker@u.arizona.edu 1.0. Introduction The model of Stratal OT presented by Kiparsky (forthcoming), has not and will not prove uncontroversial
More informationA Grammar for Battle Management Language
Bastian Haarmann 1 Dr. Ulrich Schade 1 Dr. Michael R. Hieb 2 1 Fraunhofer Institute for Communication, Information Processing and Ergonomics 2 George Mason University bastian.haarmann@fkie.fraunhofer.de
More informationFrom Empire to Twenty-First Century Britain: Economic and Political Development of Great Britain in the 19th and 20th Centuries 5HD391
Provisional list of courses for Exchange students Fall semester 2017: University of Economics, Prague Courses stated below are offered by particular departments and faculties at the University of Economics,
More informationReading Horizons. Organizing Reading Material into Thought Units to Enhance Comprehension. Kathleen C. Stevens APRIL 1983
Reading Horizons Volume 23, Issue 3 1983 Article 8 APRIL 1983 Organizing Reading Material into Thought Units to Enhance Comprehension Kathleen C. Stevens Northeastern Illinois University Copyright c 1983
More informationMandarin Lexical Tone Recognition: The Gating Paradigm
Kansas Working Papers in Linguistics, Vol. 0 (008), p. 8 Abstract Mandarin Lexical Tone Recognition: The Gating Paradigm Yuwen Lai and Jie Zhang University of Kansas Research on spoken word recognition
More informationSetting Up Tuition Controls, Criteria, Equations, and Waivers
Setting Up Tuition Controls, Criteria, Equations, and Waivers Understanding Tuition Controls, Criteria, Equations, and Waivers Controls, criteria, and waivers determine when the system calculates tuition
More informationGeo spatial application and pro-rata issues Henrik Berg Denmark
Geo spatial application and pro-rata issues Henrik Berg Denmark 1 Agenda Current situation Decisions so far Challenges Rules and principles for pro-rata Model for pro-rata in DK Examples Conclusion 2 1
More informationGiven a directed graph G =(N A), where N is a set of m nodes and A. destination node, implying a direction for ow to follow. Arcs have limitations
4 Interior point algorithms for network ow problems Mauricio G.C. Resende AT&T Bell Laboratories, Murray Hill, NJ 07974-2070 USA Panos M. Pardalos The University of Florida, Gainesville, FL 32611-6595
More informationWhat s in a Step? Toward General, Abstract Representations of Tutoring System Log Data
What s in a Step? Toward General, Abstract Representations of Tutoring System Log Data Kurt VanLehn 1, Kenneth R. Koedinger 2, Alida Skogsholm 2, Adaeze Nwaigwe 2, Robert G.M. Hausmann 1, Anders Weinstein
More informationResearch computing Results
About Online Surveys Support Contact Us Online Surveys Develop, launch and analyse Web-based surveys My Surveys Create Survey My Details Account Details Account Users You are here: Research computing Results
More informationLanguage Model and Grammar Extraction Variation in Machine Translation
Language Model and Grammar Extraction Variation in Machine Translation Vladimir Eidelman, Chris Dyer, and Philip Resnik UMIACS Laboratory for Computational Linguistics and Information Processing Department
More informationTeaching Algorithm Development Skills
International Journal of Advanced Computer Science, Vol. 3, No. 9, Pp. 466-474, Sep., 2013. Teaching Algorithm Development Skills Jungsoon Yoo, Sung Yoo, Suk Seo, Zhijiang Dong, & Chrisila Pettey Manuscript
More informationActive Learning. Yingyu Liang Computer Sciences 760 Fall
Active Learning Yingyu Liang Computer Sciences 760 Fall 2017 http://pages.cs.wisc.edu/~yliang/cs760/ Some of the slides in these lectures have been adapted/borrowed from materials developed by Mark Craven,
More informationAnalyzing the Usage of IT in SMEs
IBIMA Publishing Communications of the IBIMA http://www.ibimapublishing.com/journals/cibima/cibima.html Vol. 2010 (2010), Article ID 208609, 10 pages DOI: 10.5171/2010.208609 Analyzing the Usage of IT
More informationChinese Language Parsing with Maximum-Entropy-Inspired Parser
Chinese Language Parsing with Maximum-Entropy-Inspired Parser Heng Lian Brown University Abstract The Chinese language has many special characteristics that make parsing difficult. The performance of state-of-the-art
More informationStudies on Key Skills for Jobs that On-Site. Professionals from Construction Industry Demand
Contemporary Engineering Sciences, Vol. 7, 2014, no. 21, 1061-1069 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ces.2014.49133 Studies on Key Skills for Jobs that On-Site Professionals from
More informationResearch Design & Analysis Made Easy! Brainstorming Worksheet
Brainstorming Worksheet 1) Choose a Topic a) What are you passionate about? b) What are your library s strengths? c) What are your library s weaknesses? d) What is a hot topic in the field right now that
More informationReflective Peer Review: A Metacognitive Approach
Georgia Southern University Digital Commons@Georgia Southern Student Success in Writing Conference Apr 7th, 9:00 AM - 9:45 AM Reflective Peer Review: A Metacognitive Approach Krista Petrosino Georgia Southern
More informationPROFESSIONAL INTEGRATION
Shared Practice PROFESSIONAL INTEGRATION THE COLLÈGE DE MAISONNEUVE EXPERIMENT* SILVIE LUSSIER Educational advisor CÉGEP de Maisonneuve KATIA -- TREMBLAY Educational -- advisor CÉGEP de Maisonneuve At
More informationGCSE Mathematics B (Linear) Mark Scheme for November Component J567/04: Mathematics Paper 4 (Higher) General Certificate of Secondary Education
GCSE Mathematics B (Linear) Component J567/04: Mathematics Paper 4 (Higher) General Certificate of Secondary Education Mark Scheme for November 2014 Oxford Cambridge and RSA Examinations OCR (Oxford Cambridge
More informationNCU IISR English-Korean and English-Chinese Named Entity Transliteration Using Different Grapheme Segmentation Approaches
NCU IISR English-Korean and English-Chinese Named Entity Transliteration Using Different Grapheme Segmentation Approaches Yu-Chun Wang Chun-Kai Wu Richard Tzong-Han Tsai Department of Computer Science
More informationLevel 1 Mathematics and Statistics, 2015
91037 910370 1SUPERVISOR S Level 1 Mathematics and Statistics, 2015 91037 Demonstrate understanding of chance and data 9.30 a.m. Monday 9 November 2015 Credits: Four Achievement Achievement with Merit
More informationGACE Computer Science Assessment Test at a Glance
GACE Computer Science Assessment Test at a Glance Updated May 2017 See the GACE Computer Science Assessment Study Companion for practice questions and preparation resources. Assessment Name Computer Science
More informationEvolutive Neural Net Fuzzy Filtering: Basic Description
Journal of Intelligent Learning Systems and Applications, 2010, 2: 12-18 doi:10.4236/jilsa.2010.21002 Published Online February 2010 (http://www.scirp.org/journal/jilsa) Evolutive Neural Net Fuzzy Filtering:
More informationA Variation-Tolerant Multi-Level Memory Architecture Encoded in Two-state Memristors
A Variation-Tolerant Multi-Level Memory Architecture Encoded in Two-state Memristors Bin Wu and Matthew R. Guthaus Department of CE, University of California Santa Cruz Santa Cruz, CA 95064 {wubin6666,mrg}@soe.ucsc.edu
More informationApproaches to control phenomena handout Obligatory control and morphological case: Icelandic and Basque
Approaches to control phenomena handout 6 5.4 Obligatory control and morphological case: Icelandic and Basque Icelandinc quirky case (displaying properties of both structural and inherent case: lexically
More informationLEGO MINDSTORMS Education EV3 Coding Activities
LEGO MINDSTORMS Education EV3 Coding Activities s t e e h s k r o W t n e d Stu LEGOeducation.com/MINDSTORMS Contents ACTIVITY 1 Performing a Three Point Turn 3-6 ACTIVITY 2 Written Instructions for a
More informationASSESSMENT OF LEARNING STYLES FOR MEDICAL STUDENTS USING VARK QUESTIONNAIRE
ASSESSMENT OF LEARNING STYLES FOR MEDICAL STUDENTS USING VARK QUESTIONNAIRE 1 MARWA. M. EL SAYED, 2 DALIA. M.MOHSEN, 3 RAWHEIH.S.DOGHEIM, 4 HAFSA.H.ZAIN, 5 DALIA.AHMED. 1,2,4 Inaya Medical College, Riyadh,
More informationTeam Formation for Generalized Tasks in Expertise Social Networks
IEEE International Conference on Social Computing / IEEE International Conference on Privacy, Security, Risk and Trust Team Formation for Generalized Tasks in Expertise Social Networks Cheng-Te Li Graduate
More informationAn Effective Framework for Fast Expert Mining in Collaboration Networks: A Group-Oriented and Cost-Based Method
Farhadi F, Sorkhi M, Hashemi S et al. An effective framework for fast expert mining in collaboration networks: A grouporiented and cost-based method. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(3): 577
More informationScienceDirect. A Framework for Clustering Cardiac Patient s Records Using Unsupervised Learning Techniques
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 98 (2016 ) 368 373 The 6th International Conference on Current and Future Trends of Information and Communication Technologies
More informationCourses below are sorted by the column Field of study for your better orientation. The list is subject to change.
Provisional list of courses for Exchange students Spring semester 2017: University of Economics, Prague Courses stated below are offered by particular departments and faculties at the University of Economics,
More informationMathematics subject curriculum
Mathematics subject curriculum Dette er ei omsetjing av den fastsette læreplanteksten. Læreplanen er fastsett på Nynorsk Established as a Regulation by the Ministry of Education and Research on 24 June
More informationReinforcement Learning by Comparing Immediate Reward
Reinforcement Learning by Comparing Immediate Reward Punit Pandey DeepshikhaPandey Dr. Shishir Kumar Abstract This paper introduces an approach to Reinforcement Learning Algorithm by comparing their immediate
More informationCommittee to explore issues related to accreditation of professional doctorates in social work
Committee to explore issues related to accreditation of professional doctorates in social work October 2015 Report for CSWE Board of Directors Overview Informed by the various reports dedicated to the
More informationNew Features & Functionality in Q Release Version 3.1 January 2016
in Q Release Version 3.1 January 2016 Contents Release Highlights 2 New Features & Functionality 3 Multiple Applications 3 Analysis 3 Student Pulse 3 Attendance 4 Class Attendance 4 Student Attendance
More informationAn Introduction to Simulation Optimization
An Introduction to Simulation Optimization Nanjing Jian Shane G. Henderson Introductory Tutorials Winter Simulation Conference December 7, 2015 Thanks: NSF CMMI1200315 1 Contents 1. Introduction 2. Common
More information2014 State Residency Conference Frequently Asked Questions FAQ Categories
2014 State Residency Conference Frequently Asked Questions FAQ Categories Deadline... 2 The Five Year Rule... 3 Statutory Grace Period... 4 Immigration... 5 Active Duty Military... 7 Spouse Benefit...
More informationOCR for Arabic using SIFT Descriptors With Online Failure Prediction
OCR for Arabic using SIFT Descriptors With Online Failure Prediction Andrey Stolyarenko, Nachum Dershowitz The Blavatnik School of Computer Science Tel Aviv University Tel Aviv, Israel Email: stloyare@tau.ac.il,
More informationUpdate on the Next Accreditation System Drs. Culley, Ling, and Wood. Anesthesiology April 30, 2014
Accreditation Council for Graduate Medical Education Update on the Next Accreditation System Drs. Culley, Ling, and Wood Anesthesiology April 30, 2014 Background of the Next Accreditation System Louis
More informationMedia Literacy in the Information Society. Cyprus, 4 February 2011
Media Literacy in the Information Society Cyprus, 4 February 2011 Beware the hype, but prepare students for life in the Information Age Frank Webster City University London 3 points Media Literacy as a
More informationRendezvous with Comet Halley Next Generation of Science Standards
Next Generation of Science Standards 5th Grade 6 th Grade 7 th Grade 8 th Grade 5-PS1-3 Make observations and measurements to identify materials based on their properties. MS-PS1-4 Develop a model that
More informationBMBF Project ROBUKOM: Robust Communication Networks
BMBF Project ROBUKOM: Robust Communication Networks Arie M.C.A. Koster Christoph Helmberg Andreas Bley Martin Grötschel Thomas Bauschert supported by BMBF grant 03MS616A: ROBUKOM Robust Communication Networks,
More informationMeasures of the Location of the Data
OpenStax-CNX module m46930 1 Measures of the Location of the Data OpenStax College This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 3.0 The common measures
More informationHow to read a Paper ISMLL. Dr. Josif Grabocka, Carlotta Schatten
How to read a Paper ISMLL Dr. Josif Grabocka, Carlotta Schatten Hildesheim, April 2017 1 / 30 Outline How to read a paper Finding additional material Hildesheim, April 2017 2 / 30 How to read a paper How
More informationChen Zhou. June Room 492, Darla Moore School of Business Office: (803) University of South Carolina 1014 Greene Street
Chen Zhou June 2017 Room 492, Darla Moore School of Business Office: (803) 777-4914 University of South Carolina 1014 Greene Street Email: chen.zhou@moore.sc.edu Columbia, SC, 29201 USA ACADEMIC APPOINTMENT
More informationA Neural Network GUI Tested on Text-To-Phoneme Mapping
A Neural Network GUI Tested on Text-To-Phoneme Mapping MAARTEN TROMPPER Universiteit Utrecht m.f.a.trompper@students.uu.nl Abstract Text-to-phoneme (T2P) mapping is a necessary step in any speech synthesis
More informationThe Moodle and joule 2 Teacher Toolkit
The Moodle and joule 2 Teacher Toolkit Moodlerooms Learning Solutions The design and development of Moodle and joule continues to be guided by social constructionist pedagogy. This refers to the idea that
More informationSchock Financial Aid Office 030 Kershner Student Service Center Phone: (610) University Avenue Fax: (610)
Schock Financial Aid Office 030 Kershner Student Service Center Phone: (610) 436-2627 25 University Avenue Fax: (610) 436-2574 West Chester, PA 19383 E-Mail: finaid@wcupa.edu Title IV Federal Student Aid
More informationImplementing the English Language Arts Common Core State Standards
1st Grade Implementing the English Language Arts Common Core State Standards A Teacher s Guide to the Common Core Standards: An Illinois Content Model Framework English Language Arts/Literacy Adapted from
More informationSpring 2015 IET4451 Systems Simulation Course Syllabus for Traditional, Hybrid, and Online Classes
Spring 2015 IET4451 Systems Simulation Course Syllabus for Traditional, Hybrid, and Online Classes Instructor: Dr. Gregory L. Wiles Email Address: Use D2L e-mail, or secondly gwiles@spsu.edu Office: M
More informationMulti-Year Guaranteed Annuities
Guarantee Product 1st Year Rate Average Period Company Name Rate Thereafter Annual Yield (Lower for older ages) 3 years American National Palladium MYG ($100k +) 2.10% 2.10% 2.10% 1.50% 3 years Lincoln
More information