C:\pc_archives\index.html
This site is written in plain HTML with addition of a little js coding. But why you even care to do it? Well... I'm tired of these 'new', 'modern' technologies wich didn't do job well and take care of your system stability. The project is itself developed for obsolete systems, obsolete projects, obsolete ideas and for a proper place for it.
You should find a place here where you could play old games multiplayer with your friends, post your project (cheer winprj - your ideas was awesome), find useful files - like drivers to your obsolete PC/Laptop or just docs for your electronic projects (I had 20GB of just pdf's)
Do you have a story you would care to share? Want to help me with this (I'm such a noob...) Mail me at<EMAIL_ADDRESS>Copyright note: 2013-2017 - devprj* | rethink. reuse. rebuild.
_


Chapter 11 Taxes and Stimulus
11.1 Compute for Equilibrium Tax
Taking advantage of snw_find_tax_rate from the PrjOptiSNW Package, this function solves for equilibrium tax rate.
11.1.1 Parameter Controls
clear all;
mp_params = snw_mp_param('default_docdense');
% mp_params = snw_mp_param('default_dense');
% mp_params = snw_mp_param('default_base');
% mp_params = snw_mp_param('default_small');
mp_params('beta') = 0.95;
xi=0.651; % Proportional reduction in income due to unemployment (xi=0 refers to 0 labor income; xi=1 refers to no drop in labor income)
b=1; % Unemployment insurance replacement rate (b=0 refers to no UI benefits; b=1 refers to 100 percent labor income replacement)
mp_params('xi') = xi;
mp_params('b') = b;
mp_controls = snw_mp_control('default_test');
Parameters for COVID related Costs:
% Average check per household, given COVID actual policy payment schedule
% And given distribution. The number is from averaging over the actual
% allocations given distribution.
Covid_checks_per_capita = 18.7255856*100/62502;
% Covid_checks_per_capita = 0;
% which tax parameter to change a2 is the deafult, a0 shifts max tax rate
bl_adjust_a0 = false;
bl_load_existing = false;
Graph Controls etc:
mp_controls('bl_timer') = true;
mp_controls('bl_print_vfi') = false;
mp_controls('bl_print_vfi_verbose') = false;
mp_controls('bl_print_ds') = false;
mp_controls('bl_print_ds_verbose') = false;
mp_controls('bl_print_find_tax_rate') = true;
mp_controls('bl_print_find_tax_rate_verbose') = true;
11.1.2 Solve for New Tax Rate
Solve for Equilibrium Tax rate that clears government costs and income. In the extreme bounding exercise, we assume the government will pay COVID costs all in one year. This is to test whether an extreme tax scenario will lead to changes in allocation results.
Given the checks that the government hands out and the taxes imposed, individual resources post-tax are different in 2020. Households’ savings decisions in 2020 vary with taxes and checks. However, the policy function post 2020 shifts back to thte previous non-COVID world’s policy function because the COVID shock is an one period surprise shock.
a2 = snw_find_tax_rate(mp_params, mp_controls, Covid_checks_per_capita, bl_adjust_a0, bl_load_existing);
Completed SNW_VFI_MAIN_BISEC_VEC;SNW_MP_PARAM=default_docdense;SNW_MP_CONTROL=default_test;time=315.585
Completed SNW_DS_MAIN_VEC;SNW_MP_PARAM=default_docdense;SNW_MP_CONTROL=default_test;time=1056.1907
Wage quintile cutoffs=0.4645 0.71528 1.0335 1.5632
Y_inc_agg=61.7582
A_agg=119.2022
Y_inc_agg_per_capita_1=1.3486
A_per_capita=2.6031
Gov_cons_per_capita=0.23703
Covid_checks_share_of_GDP=0.022215
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:1 of 83, time-this-age:0.40805
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:2 of 83, time-this-age:0.33319
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:3 of 83, time-this-age:0.41771
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:4 of 83, time-this-age:0.34531
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:5 of 83, time-this-age:0.33489
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:6 of 83, time-this-age:0.35842
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:7 of 83, time-this-age:0.35655
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:8 of 83, time-this-age:0.35122
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:9 of 83, time-this-age:0.33076
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:10 of 83, time-this-age:0.33222
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:11 of 83, time-this-age:0.32783
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:12 of 83, time-this-age:0.32957
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:13 of 83, time-this-age:0.33172
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:14 of 83, time-this-age:0.37079
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:15 of 83, time-this-age:0.36121
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:16 of 83, time-this-age:0.34383
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:17 of 83, time-this-age:0.32866
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:18 of 83, time-this-age:0.31896
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:19 of 83, time-this-age:0.32354
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:20 of 83, time-this-age:0.35757
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:21 of 83, time-this-age:0.35162
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:22 of 83, time-this-age:0.33998
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:23 of 83, time-this-age:0.32237
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:24 of 83, time-this-age:0.32174
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:25 of 83, time-this-age:0.38317
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:26 of 83, time-this-age:0.342
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:27 of 83, time-this-age:0.32267
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:28 of 83, time-this-age:0.34224
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:29 of 83, time-this-age:0.34442
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:30 of 83, time-this-age:0.35185
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:31 of 83, time-this-age:0.32489
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:32 of 83, time-this-age:0.32887
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:33 of 83, time-this-age:0.33332
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:34 of 83, time-this-age:0.32678
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:35 of 83, time-this-age:0.37362
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:36 of 83, time-this-age:0.38589
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:37 of 83, time-this-age:0.35322
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:38 of 83, time-this-age:0.32684
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:39 of 83, time-this-age:0.34446
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:40 of 83, time-this-age:0.40304
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:41 of 83, time-this-age:0.36362
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:42 of 83, time-this-age:0.32294
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:43 of 83, time-this-age:0.34509
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:44 of 83, time-this-age:0.32763
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:45 of 83, time-this-age:0.32328
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:46 of 83, time-this-age:0.3229
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:47 of 83, time-this-age:0.32421
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:48 of 83, time-this-age:0.36399
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:49 of 83, time-this-age:0.37545
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:50 of 83, time-this-age:0.37864
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:51 of 83, time-this-age:0.3443
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:52 of 83, time-this-age:0.3398
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:53 of 83, time-this-age:0.34794
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:54 of 83, time-this-age:0.36094
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:55 of 83, time-this-age:0.34198
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:56 of 83, time-this-age:0.36405
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:57 of 83, time-this-age:0.34572
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:58 of 83, time-this-age:0.34234
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:59 of 83, time-this-age:0.34115
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:60 of 83, time-this-age:0.36025
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:61 of 83, time-this-age:0.34223
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:62 of 83, time-this-age:0.34256
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:63 of 83, time-this-age:0.34432
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:64 of 83, time-this-age:0.34369
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:65 of 83, time-this-age:0.34474
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:66 of 83, time-this-age:0.36666
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:67 of 83, time-this-age:0.34095
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:68 of 83, time-this-age:0.34424
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:69 of 83, time-this-age:0.34722
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:70 of 83, time-this-age:0.34031
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:71 of 83, time-this-age:0.35799
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:72 of 83, time-this-age:0.34436
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:73 of 83, time-this-age:0.34066
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:74 of 83, time-this-age:0.34077
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:75 of 83, time-this-age:0.34236
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:76 of 83, time-this-age:0.34346
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:77 of 83, time-this-age:0.37815
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:78 of 83, time-this-age:0.3403
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:79 of 83, time-this-age:0.34125
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:80 of 83, time-this-age:0.34101
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:81 of 83, time-this-age:0.33996
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:82 of 83, time-this-age:0.3415
SNW_FIND_TAX_RATE: Aggregation, Finished Age Group:83 of 83, time-this-age:0.36096
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=1.8141;a0=0.258;err=0.20414;fl_total_costs=16.3562;Tax_revenues_aux=13.0173
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=2.0964;a0=0.258;err=0.17541;fl_total_costs=16.3562;Tax_revenues_aux=13.4871
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=2.3751;a0=0.258;err=0.15331;fl_total_costs=16.3562;Tax_revenues_aux=13.8486
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=2.65;a0=0.258;err=0.13583;fl_total_costs=16.3562;Tax_revenues_aux=14.1345
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=2.9208;a0=0.258;err=0.12169;fl_total_costs=16.3562;Tax_revenues_aux=14.3658
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=3.1877;a0=0.258;err=0.11003;fl_total_costs=16.3562;Tax_revenues_aux=14.5564
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=3.4506;a0=0.258;err=0.10028;fl_total_costs=16.3562;Tax_revenues_aux=14.7161
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=3.7096;a0=0.258;err=0.091993;fl_total_costs=16.3562;Tax_revenues_aux=14.8515
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=3.9648;a0=0.258;err=0.084884;fl_total_costs=16.3562;Tax_revenues_aux=14.9678
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=4.2162;a0=0.258;err=0.078718;fl_total_costs=16.3562;Tax_revenues_aux=15.0687
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=4.464;a0=0.258;err=0.073324;fl_total_costs=16.3562;Tax_revenues_aux=15.1569
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=4.7083;a0=0.258;err=0.068568;fl_total_costs=16.3562;Tax_revenues_aux=15.2347
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=4.9491;a0=0.258;err=0.064345;fl_total_costs=16.3562;Tax_revenues_aux=15.3038
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=5.1866;a0=0.258;err=0.060571;fl_total_costs=16.3562;Tax_revenues_aux=15.3655
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=5.4207;a0=0.258;err=0.05718;fl_total_costs=16.3562;Tax_revenues_aux=15.4209
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=5.6517;a0=0.258;err=0.054118;fl_total_costs=16.3562;Tax_revenues_aux=15.471
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=5.8796;a0=0.258;err=0.051339;fl_total_costs=16.3562;Tax_revenues_aux=15.5165
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=6.1044;a0=0.258;err=0.048807;fl_total_costs=16.3562;Tax_revenues_aux=15.5579
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=6.3263;a0=0.258;err=0.046491;fl_total_costs=16.3562;Tax_revenues_aux=15.5958
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=6.5454;a0=0.258;err=0.044365;fl_total_costs=16.3562;Tax_revenues_aux=15.6305
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=6.7616;a0=0.258;err=0.042406;fl_total_costs=16.3562;Tax_revenues_aux=15.6626
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=6.975;a0=0.258;err=0.040597;fl_total_costs=16.3562;Tax_revenues_aux=15.6922
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=7.1858;a0=0.258;err=0.03892;fl_total_costs=16.3562;Tax_revenues_aux=15.7196
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=7.394;a0=0.258;err=0.037362;fl_total_costs=16.3562;Tax_revenues_aux=15.7451
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=7.5996;a0=0.258;err=0.035911;fl_total_costs=16.3562;Tax_revenues_aux=15.7688
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=7.8027;a0=0.258;err=0.034557;fl_total_costs=16.3562;Tax_revenues_aux=15.791
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=8.0034;a0=0.258;err=0.03329;fl_total_costs=16.3562;Tax_revenues_aux=15.8117
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=8.2017;a0=0.258;err=0.032102;fl_total_costs=16.3562;Tax_revenues_aux=15.8311
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=8.3976;a0=0.258;err=0.030987;fl_total_costs=16.3562;Tax_revenues_aux=15.8494
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=8.5912;a0=0.258;err=0.029938;fl_total_costs=16.3562;Tax_revenues_aux=15.8665
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=8.7826;a0=0.258;err=0.028948;fl_total_costs=16.3562;Tax_revenues_aux=15.8827
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=8.9718;a0=0.258;err=0.028015;fl_total_costs=16.3562;Tax_revenues_aux=15.898
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=9.1588;a0=0.258;err=0.027132;fl_total_costs=16.3562;Tax_revenues_aux=15.9124
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=9.3437;a0=0.258;err=0.026296;fl_total_costs=16.3562;Tax_revenues_aux=15.9261
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=9.5265;a0=0.258;err=0.025504;fl_total_costs=16.3562;Tax_revenues_aux=15.939
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=9.7073;a0=0.258;err=0.024751;fl_total_costs=16.3562;Tax_revenues_aux=15.9514
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=9.886;a0=0.258;err=0.024036;fl_total_costs=16.3562;Tax_revenues_aux=15.963
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=10.0628;a0=0.258;err=0.023355;fl_total_costs=16.3562;Tax_revenues_aux=15.9742
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=10.2377;a0=0.258;err=0.022707;fl_total_costs=16.3562;Tax_revenues_aux=15.9848
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=10.4106;a0=0.258;err=0.022089;fl_total_costs=16.3562;Tax_revenues_aux=15.9949
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=10.5817;a0=0.258;err=0.021498;fl_total_costs=16.3562;Tax_revenues_aux=16.0046
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=10.7509;a0=0.258;err=0.020934;fl_total_costs=16.3562;Tax_revenues_aux=16.0138
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=10.9184;a0=0.258;err=0.020394;fl_total_costs=16.3562;Tax_revenues_aux=16.0226
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=11.084;a0=0.258;err=0.019877;fl_total_costs=16.3562;Tax_revenues_aux=16.0311
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=11.2479;a0=0.258;err=0.019382;fl_total_costs=16.3562;Tax_revenues_aux=16.0392
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=11.4101;a0=0.258;err=0.018907;fl_total_costs=16.3562;Tax_revenues_aux=16.0469
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=11.5706;a0=0.258;err=0.018451;fl_total_costs=16.3562;Tax_revenues_aux=16.0544
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=11.7294;a0=0.258;err=0.018013;fl_total_costs=16.3562;Tax_revenues_aux=16.0616
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=11.8866;a0=0.258;err=0.017592;fl_total_costs=16.3562;Tax_revenues_aux=16.0685
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=12.0421;a0=0.258;err=0.017187;fl_total_costs=16.3562;Tax_revenues_aux=16.0751
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=12.1961;a0=0.258;err=0.016797;fl_total_costs=16.3562;Tax_revenues_aux=16.0815
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=12.3485;a0=0.258;err=0.016421;fl_total_costs=16.3562;Tax_revenues_aux=16.0876
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=12.4994;a0=0.258;err=0.016059;fl_total_costs=16.3562;Tax_revenues_aux=16.0935
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=12.6487;a0=0.258;err=0.01571;fl_total_costs=16.3562;Tax_revenues_aux=16.0992
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=12.7965;a0=0.258;err=0.015373;fl_total_costs=16.3562;Tax_revenues_aux=16.1047
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=12.9429;a0=0.258;err=0.015048;fl_total_costs=16.3562;Tax_revenues_aux=16.1101
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=13.0877;a0=0.258;err=0.014733;fl_total_costs=16.3562;Tax_revenues_aux=16.1152
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=13.2312;a0=0.258;err=0.014429;fl_total_costs=16.3562;Tax_revenues_aux=16.1202
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=13.3732;a0=0.258;err=0.014135;fl_total_costs=16.3562;Tax_revenues_aux=16.125
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=13.5139;a0=0.258;err=0.013851;fl_total_costs=16.3562;Tax_revenues_aux=16.1296
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=13.6531;a0=0.258;err=0.013576;fl_total_costs=16.3562;Tax_revenues_aux=16.1341
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=13.791;a0=0.258;err=0.013309;fl_total_costs=16.3562;Tax_revenues_aux=16.1385
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=13.9275;a0=0.258;err=0.01305;fl_total_costs=16.3562;Tax_revenues_aux=16.1427
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=14.0628;a0=0.258;err=0.0128;fl_total_costs=16.3562;Tax_revenues_aux=16.1468
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=14.1967;a0=0.258;err=0.012557;fl_total_costs=16.3562;Tax_revenues_aux=16.1508
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=14.3293;a0=0.258;err=0.012321;fl_total_costs=16.3562;Tax_revenues_aux=16.1547
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=14.4606;a0=0.258;err=0.012092;fl_total_costs=16.3562;Tax_revenues_aux=16.1584
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=14.5907;a0=0.258;err=0.01187;fl_total_costs=16.3562;Tax_revenues_aux=16.162
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=14.7195;a0=0.258;err=0.011654;fl_total_costs=16.3562;Tax_revenues_aux=16.1656
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=14.8472;a0=0.258;err=0.011444;fl_total_costs=16.3562;Tax_revenues_aux=16.169
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=14.9736;a0=0.258;err=0.01124;fl_total_costs=16.3562;Tax_revenues_aux=16.1723
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=15.0988;a0=0.258;err=0.011041;fl_total_costs=16.3562;Tax_revenues_aux=16.1756
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=15.2228;a0=0.258;err=0.010848;fl_total_costs=16.3562;Tax_revenues_aux=16.1788
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=15.3456;a0=0.258;err=0.01066;fl_total_costs=16.3562;Tax_revenues_aux=16.1818
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=15.4673;a0=0.258;err=0.010477;fl_total_costs=16.3562;Tax_revenues_aux=16.1848
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=15.5879;a0=0.258;err=0.010299;fl_total_costs=16.3562;Tax_revenues_aux=16.1877
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=15.7073;a0=0.258;err=0.010126;fl_total_costs=16.3562;Tax_revenues_aux=16.1906
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=15.8257;a0=0.258;err=0.0099566;fl_total_costs=16.3562;Tax_revenues_aux=16.1933
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=15.9429;a0=0.258;err=0.0097918;fl_total_costs=16.3562;Tax_revenues_aux=16.196
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=16.059;a0=0.258;err=0.0096311;fl_total_costs=16.3562;Tax_revenues_aux=16.1987
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=16.1741;a0=0.258;err=0.0094744;fl_total_costs=16.3562;Tax_revenues_aux=16.2012
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=16.2881;a0=0.258;err=0.0093215;fl_total_costs=16.3562;Tax_revenues_aux=16.2037
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=16.4011;a0=0.258;err=0.0091723;fl_total_costs=16.3562;Tax_revenues_aux=16.2062
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=16.513;a0=0.258;err=0.0090267;fl_total_costs=16.3562;Tax_revenues_aux=16.2085
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=16.6239;a0=0.258;err=0.0088845;fl_total_costs=16.3562;Tax_revenues_aux=16.2109
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=16.7338;a0=0.258;err=0.0087457;fl_total_costs=16.3562;Tax_revenues_aux=16.2131
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=16.8426;a0=0.258;err=0.0086101;fl_total_costs=16.3562;Tax_revenues_aux=16.2154
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=16.9505;a0=0.258;err=0.0084776;fl_total_costs=16.3562;Tax_revenues_aux=16.2175
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=17.0574;a0=0.258;err=0.0083482;fl_total_costs=16.3562;Tax_revenues_aux=16.2196
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=17.1634;a0=0.258;err=0.0082216;fl_total_costs=16.3562;Tax_revenues_aux=16.2217
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=17.2684;a0=0.258;err=0.0080979;fl_total_costs=16.3562;Tax_revenues_aux=16.2237
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=17.3724;a0=0.258;err=0.0079769;fl_total_costs=16.3562;Tax_revenues_aux=16.2257
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=17.4755;a0=0.258;err=0.0078586;fl_total_costs=16.3562;Tax_revenues_aux=16.2277
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=17.5777;a0=0.258;err=0.0077428;fl_total_costs=16.3562;Tax_revenues_aux=16.2295
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=17.6789;a0=0.258;err=0.0076295;fl_total_costs=16.3562;Tax_revenues_aux=16.2314
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=17.7793;a0=0.258;err=0.0075186;fl_total_costs=16.3562;Tax_revenues_aux=16.2332
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=17.8787;a0=0.258;err=0.0074101;fl_total_costs=16.3562;Tax_revenues_aux=16.235
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=17.9773;a0=0.258;err=0.0073038;fl_total_costs=16.3562;Tax_revenues_aux=16.2367
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=18.075;a0=0.258;err=0.0071997;fl_total_costs=16.3562;Tax_revenues_aux=16.2384
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=18.1718;a0=0.258;err=0.0070978;fl_total_costs=16.3562;Tax_revenues_aux=16.2401
SNW_FIND_TAX_RATE tax a2 or a0 adjustments;a2=18.2678;a0=0.258;err=0.006998;fl_total_costs=16.3562;Tax_revenues_aux=16.2417
--------------------------------
--- SNW_FIND_TAX_RATE finished -
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
SNW_FIND_TAX_RATE: Number of a2-adjustments (for taxation) used to balance the government budget= 101
SNW_FIND_TAX_RATE info A;a2_new=18.2678;a2_guess_orig(mana-heaven)=1.5286;a0_new=0.258;a0_guess_orig=0.258
SNW_FIND_TAX_RATE info B;Y_inc_agg=61.7582;Y_inc_agg_COVID=58.8608;GPD_COVID_CHANGE=0.046915;Y_inc_agg_per_capita=1.3486;Y_inc_agg_per_capita_COVID=1.2854
SNW_FIND_TAX_RATE info C;Covid_checks_per_capita=0.02996;Covid_checks_share_of_GDP=0.022215
SNW_FIND_TAX_RATE info D;UI_benefits=1.9702;SS_spend=2.1597;Gov_cons=10.8544;Covid_checks=1.372;Tax_revenues_aux=16.2417
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
--------------------------------
11.2 Existing Stimulus as a Function of Income and Family Status
Taking advantage of snw_stimulus_checks from the PrjOptiSNW Package, this function presents stimulus checks at different income levels for households with different children count and martial status. The function considers the first as well as the second stimulus check.
11.2.1 Trump Stimulus Checks for Unmarried Households
Check base amount per adult and per child for the first and second rounds.
[fl_stimulus_adult_first, fl_stimulus_child_first] = deal(1200, 500);
[fl_stimulus_adult_second, fl_stimulus_child_second] = deal(600, 600);
bl_visualize = true;
Visualize stimulus check amounts.
bl_marital = 0;
for it_kids=0:1:4
snw_stimulus_checks(it_kids, bl_marital, ...
fl_stimulus_adult_first, fl_stimulus_child_first, ...
fl_stimulus_adult_second, fl_stimulus_child_second, ...
bl_visualize);
end
11.2.2 Trump Stimulus Checks for Married Households
Visualize stimulus check amounts.
bl_marital = 1;
for it_kids=0:1:4
snw_stimulus_checks(it_kids, bl_marital, ...
fl_stimulus_adult_first, fl_stimulus_child_first, ...
fl_stimulus_adult_second, fl_stimulus_child_second, ...
bl_visualize);
end
11.3 Existing Stimulus as a Function of Income and Family Status
Taking advantage of snw_stimulus_checks_biden from the PrjOptiSNW Package, this function presents stimulus checks at different income levels for households with different children count and martial status. This is for the Biden Stimulus under the American Rescue Plan Act.
11.3.1 Biden Stimulus Checks for Unmarried Households
Check base amount per adult and per child for the first and second rounds.
Visualize stimulus check amounts.
bl_visualize = true;
bl_marital = 0;
for it_kids=0:1:4
snw_stimulus_checks_biden(it_kids, bl_marital, bl_visualize);
end
11.3.2 Biden Stimulus Checks for Married Households
Visualize stimulus check amounts.
bl_marital = 1;
for it_kids=0:1:4
snw_stimulus_checks_biden(it_kids, bl_marital, bl_visualize);
end
11.4 Taxable Income and Tax Liabilities in 2008
Taking advantage of snw_tax_liability from the PrjOptiSNW Package, the function solves for tax liability.
We can study the effects of the 2008 Tax Rebate. The Tax rebate is a rebate based on how much tax was paid, so we need to know taxable income and tax liability. These differ by income, household marital status, and the count of children. Given an array of pre-tax income values, we compute for from 0 to 4 kids and both married and unmarried taxable-income and tax-liability at all points along the income array. Deductions are from 2008 income (2008 IRS f1040). Tax brackets from 2008 are here (2008 IRS 1040tt).
11.4.1 Taxable Income and Tax Liabilities in 2008 for 4 Income Levels
Call the function at four income levels. Solve for different kids count and by marital status.
bl_visualize = true;
ar_income = [20000, 30000, 50000, 70000];
snw_tax_liability(ar_income, true);
11.4.2 Taxable Income and Tax Liabilities in 2008 for 50 Income Levels
Call the function for incomes from 0 to 200k. Solve for different kids count and by marital status.
bl_visualize = true;
ar_income = linspace(0, 2e5, 50);
snw_tax_liability(ar_income, true);
11.5 Bush 2008 Stimulus as a Function of Income and Family Status
Taking advantage of snw_stimulus_checks_bush from the PrjOptiSNW Package, this function presents stimulus checks at different income levels for households with different children count and martial status. The function considers the bush stimulus checks from the Economic Stimulus Act of 2008. IRS information provides information at the Economic Stimulus Payment Information Center.
Note that the Bush stimulus is a tax rebate, so we compute tax liability based on snw_tax_liability.
The Stimulus policy is expressed in the following formula, first four components (\(M\) is marital status, equals to 1 for married, 0 for unmarried, \(K\) is the number of kids, \(Y\) is pre-tax income) :
\(\displaystyle \textrm{MinChk}(M)=300\cdot \left(1+M\right)\)
\(\displaystyle \textrm{CappedRebate}(Y,K,M)=\min \Big(\textrm{TaxLiability}\left(Y,K,M\right),600\cdot \left(1+M\right)\Big)\)
\(\displaystyle \textrm{PhaseOut}(Y,M)=\max \Big(0,Y-75000\cdot (1+M)\Big)\cdot 0.05\)
\(\displaystyle \textrm{KidsChk}(K)=300\cdot K\)
Overall Tax-rebate Stimulus is:
\[\textrm{Bush08StimulusTaxRebate}=\max \left(\max \bigg(\textrm{MinChk}(M),\textrm{CappedRebate}(Y,K,M)\bigg)+\textrm{KidsChk}(K)-\textrm{PhaseOut}(Y,M),0\right)\]
11.5.1 Bush Stimulus Checks for Unmarried Households
Check base amount per adult and per child for the first and second rounds.
Visualize stimulus check amounts.
bl_visualize = true;
[fl_stimulus_adult, fl_stimulus_child] = deal(600, 300);
bl_marital = 0;
for it_kids=0:1:4
snw_stimulus_checks_bush(it_kids, bl_marital, fl_stimulus_adult, fl_stimulus_child, bl_visualize);
end
11.5.2 Bush Stimulus Checks for Married Households
Visualize stimulus check amounts.
[fl_stimulus_adult, fl_stimulus_child] = deal(600, 300);
bl_marital = 1;
for it_kids=0:1:4
snw_stimulus_checks_bush(it_kids, bl_marital, fl_stimulus_adult, fl_stimulus_child, bl_visualize);
end


Lauren Paul and her husband spent all of last week cancelling their honeymoon. “We were devastated until we realized how dangerous not cancelling would have been for all of the hospitality workers we would have depended on.” Lauren reported.  “We had already done so much research on the food, the farming culture, the way people care for the land in Provence. We thought, why not spend a day pretending we’re there.”
If you’re anything like us here at Lost In Place, your much needed alone time (or family/roomate/coworker pile-on) has turned to much needed social time. But hanging out indoors and widening our circles of exposure is irresponsible at best. But with warmer weather, comes a lovely solution: the picnic. So we have outlined everything you need to meet up, be safe, and mangia.
Connection is one of the most vital aspects of human life. Not just entertainment, we need to form emotional attachments to survive.
When you’re commuting to a 9-to-5, you long for the weekends, the beach and the get-things-done, life-organizing staycation. Our current environment has turned life on its head, and now more than ever we dream of being anywhere but at home. Until a quick trip to a new locale is an option, we’ve got everything you need to get away at home.
My mother spoke Spanish with us at home from birth, through our disdainful teenage years, and on every phone call until the day she passed. When I was a youngster without the perspective that comes with experience, I asked her why she was so dedicated to us being bilingual. The simple answer, “If you and your sister do not know Spanish, you cannot teach it to your children.”
Our Look Up Column is normally dedicated to the different ways travel gets you out of your digital dungeon, and into a new way of experiencing life. Since our writers and photographers are at home for the foreseeable future, Look Up will now dedicate space to finding that same feeling in the sky. Each week a writer and a photographer will team up to show and tell how the sky has changed in their city, and how the act of slowing down and giving attention to something so simple has carried over into life.
Lauren Paul and her husband spent all of last week cancelling their honeymoon. “We were devastated until we realized how dangerous not cancelling would have been for all of the hospitality workers we would have depended on.” Lauren reported.  “We had already done so much research on the food, the farming culture, the way people care for the land in Provence. We thought, why not spend a day pretending we’re there.”


| I l@ve RuBoard |
Many databases need to have the input in a particular format in order to bind to an operation's input parameters. For example, if an input is destined for a DATE column, it must be bound to the database in a particular string format. Similar problems exist for "Row ID" columns or large binary items (e.g., BLOBs or RAW columns). This presents problems for Python since the parameters to the executeXXX() method are untyped. When the database module sees a Python string object, it doesn't know if it should be bound as a simple CHAR column, as a raw BINARY item, or as a DATE.
To overcome this problem, a module must provide the constructors defined here to create objects that can hold special values. When passed to the cursor methods, the module can then detect the proper type of the input parameter and bind it accordingly.
A cursor object's description attribute returns information about each of the result columns of a query. The type_code must compare equal to one of type objects defined here. Type objects may be equal to more than one type code (e.g., DATETIME could be equal to the type codes for date, time, and timestamp columns; see the implementation hints later in this appendix for details).
The module exports the following constructors and singletons:
This function constructs an object holding a date value.
This function constructs an object holding a time value.
This function constructs an object holding a timestamp value.
This function constructs an object holding a date value from the given ticks value (number of seconds since the epoch; see the documentation of the standard Python time module for details).
This function constructs an object holding a time value from the given ticks value (number of seconds since the epoch; see the documentation of the standard Python time module for details).
This function constructs an object holding a timestamp value from the given ticks value (number of seconds since the epoch; see the documentation of the standard Python time module for details).
This function constructs an object capable of holding a binary (long) string value.
This type object describes columns in a database that are string-based (e.g., CHAR).
This type object describes (long) binary columns in a database (e.g., LONG, RAW, BLOBs).
This type object describes numeric columns in a database.
This type object describes date/time columns in a database.
This type object describes the "Row ID" column in a database.
SQL NULL values are represented by the Python None singleton on input and output.
Using Unix ticks for database interfacing can cause troubles because of the limited date range they cover.
The preferred object types for the date/time objects are those defined in the mxDateTime package. It provides all necessary constructors and methods both at Python and C level.
The preferred object type for binary objects are the buffer types available in standard Python starting with Version 1.5.2. Please see the Python documentation for details. For information about the C interface have a look at Include/bufferobject.h and Objects/bufferobject.c in the Python source distribution.
Here is a sample implementation of the Unix ticks based constructors for date/time delegating work to the generic constructors:
import time def DateFromTicks(ticks): return apply(Date,time.localtime(ticks)[:3]) def TimeFromTicks(ticks): return apply(Time,time.localtime(ticks)[3:6]) def TimestampFromTicks(ticks): return apply(Timestamp,time.localtime(ticks)[:6])
This Python class allows implementing the above type objects even though the description type code field yields multiple values for on type object:
class DBAPITypeObject: def __init__(self,*values): self.values = values def __cmp__(self,other): if other in self.values: return 0 if other < self.values: return 1 else: return -1
The resulting type object compares equal to all values passed to the constructor.
Here is a snippet of Python code that implements the exception hierarchy defined previously:
import exceptions class Error(exceptions.StandardError): pass class Warning(exceptions.StandardError): pass class InterfaceError(Error): pass class DatabaseError(Error): pass class InternalError(DatabaseError): pass class OperationalError(DatabaseError): pass class ProgrammingError(DatabaseError): pass class IntegrityError(DatabaseError): pass class DataError(DatabaseError): pass class NotSupportedError(DatabaseError): pass
In C you can use the PyErr_NewException(fullname, base, NULL) API to create the exception objects.
| I l@ve RuBoard |


"x" "1" "YAMANAKA,H NAGAO,M AND SUGIMURA,T, MUTAGENICITY OF PYRROLIZIDINEALKALOIDS IN THE SALMONELLA/MAMMALIAN-MICROSOME TEST, MUTAT. RES. 68(3):211-216,1979"


A fork of Jekyll Incorporated by Kippt. See live at preview-incorporated.getbarley.com
Go to Barley. Sign up. Use!
Or, download the HTML source for yourself.
Ported to Barley by: Colin Devroe + http://twitter.com/cdevroe + http://github.com/cdevroe
Originally built for sendtoinc.com, your workspace for sharing and organizing knowledge
Karri Saarinen
Jori Lallo
Copyright 2013 Kippt Inc. under The MIT License


I am really looking forward to our next architect forum this Thursday. Our special guest star this time: Dave Green, architect within the Windows Workflow Foundation team at Microsoft Corp.
Finally we have put together a panel discussion for the forum. So I'd like to ask you - what would you ask the architect of Windows Workflow foundation? Do you have similar questions as I have (see my last post)? Do you have any questions according to standards (BPEL, BPMN, BPMI, WfMC...)? Proven practices and workflow patterns?
Let me know by just adding a comment to this post, I'll definitely forward your question:) Finally my dream of this is creating a whitepaper with the members of the architect forum. Of course we'll publish this paper through our austrian MSDN blog...


Window Administration |
2019 |
System Administration |
2019 |
Microsoft Dynamics 365 (Business Central) |
2019 |
Microsoft Dynamics 365 (CRM) |
2019 |
Microsoft Dynamics NAV (ERP) |
2018 |
ALC with Google |
2018 |
Front End Development |
|
Google Digital Skills for Africa |
2018 |
ALC with Microsoft |
2018 |
Front End Development |
|


Class TakteeFunction
Taktee Basic structure plugin class for writting additional functions for the Taktee code This is just template class, use it by extending
requires PHP version 5.3+
Package: Taktee
Category: Helper
Copyright: 2014 Junaid Atari
License: http://www.apache.org/licenses/LICENSE-2.0.html
Author: Junaid Atari<EMAIL_ADDRESS>Version: 0.2
See: TakteeFunctionCommands
Located at taktee/helpers/Function.php
Category: Helper
Copyright: 2014 Junaid Atari
License: http://www.apache.org/licenses/LICENSE-2.0.html
Author: Junaid Atari<EMAIL_ADDRESS>Version: 0.2
See: TakteeFunctionCommands
Located at taktee/helpers/Function.php
public
|
|
protected
|
|
protected
mixed
|
#
checkStatment( string $pattern, string & $matches = array(), mixed $flags = '' )
Check and validation the statment by PCRE pattern |
public
|
|
public
|
|
public
object
|
#
afterExecute( object $outputObj )
Event function: Execute this function after main Taktee execution |
public
mixed
|
|
protected
string
|
|
protected
string
|
|
protected
string
|
|
protected
string
|
|
protected
|
|
protected
|
|
final public
array
|
|
protected
boolean
|
|
protected
boolean
|
#
setCustomErrorOutput( integer $no, string $category, string $message, array $vars = array () )
Throw the custom Taktee error exception |
protected
integer
|
$lineNo | 0 |
#
Line number |
protected
array
|
$config | array () |
#
Configuration data |
protected
string
|
$expr | '' |
#
Code expression |
protected
integer
|
$sessionId | '' |
#
Session ID of line |
protected
mixed
|
$output | null |
#
Generated output |
protected
mixed
|
$baseOutput |
|
#
Taktee base generated output oubjects |
protected
string
|
$scriptPath |
|
#
Current executing code script |
protected
string
|
$basePath |
|
#
Base path of Taktee |
protected
string
|
$language |
|
#
Messages language |
public
array
|
$variables | array () |
#
variables cache |
protected
array
|
$librariesDirs | array () |
#
Additonal libraries for plugin |
protected
array
|
$functionsDirs | array () |
#
Additonal functions for plugin |


Saxon can take its input from a JAXP SAXSource
object, which essentially represents a sequence
of SAX events representing the output of an XML parser. A very useful technique is to
interpose a filter between the parser and Saxon. The filter will typically be an
instance of the SAX2 XMLFilter class.
There are a number of ways of using a Saxon XSLT transformation as part of a pipeline of filters. Some of these techniques also work with XQuery. The techniques include:
Generate the transformation as an XMLFilter
using the newXMLFilter()
method of the TransformerFactory
. This works with XSLT only. A drawback of this approach
is that it is not possible to supply parameters to the transformation using standard JAXP facilities. It
is possible, however, by casting the XMLFilter
to a net.sf.saxon.Filter
, and calling
its getTransformer()
method, which returns a Transformer
object offering the usual
addParameter()
method.
Generate the transformation as a SAX ContentHandler
using the newTransformerHandler()
method. The pipelines stages after the transformation can be added by giving the transformation a SAXResult
as its destination. This again is XSLT only.
Implement the pipeline step before the transformation or query as an XMLFilter
, and
use this as the XMLReader
part of a SAXSource
, pretending to be an XML parser.
This technique works with both XSLT and XQuery, and it can even be used from the command line, by nominating
the XMLFilter
as the source parser using the -x
option on the command line.
The -x
option on the Saxon command line specifies the parser that Saxon will
use to process the source files. This class must implement the SAX2 XMLReader interface, but it
is not required to be a real XML parser; it can take the input from any kind of source file,
so long as it presents it in the form of a stream of SAX events. When using the JAXP API, the
equivalent to the -x
option is to call transformerFactory.setAttribute(
net.sf.saxon.FeatureKeys.SOURCE_PARSER_CLASS, 'com.example.package.Parser')


THE RELATIONSHIPS OF OCCUPATIONAL STRESS
AND CERTAIN OTHER VARIABLES
an
toe
TO JOB SATISFACTION OF te
LICENSED PROFESSIONAL COUNSELORS IN VIRGINIA
by Clell R. Clemons, Jr.
Dissertation submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements for the degree of DOCTOR OF EDUCATION in
Counseling and Student Personnel Services
- n a APPROVED: = —. ~~ Carl 0. McDaniels, Chairman / 7 Ca "vwwv~ y Th 7 Dean L. Hummel Maril V. Lichtman "(wy ee) wa - .——er)>\
Martin Gerstein Hilay Getz!
October, 1988
Blacksburg, Virginia


MongoDB is the leading NoSQL database, empowering businesses to be more agile and scalable.
Express is a minimal and flexible node.js web application framework, providing a robust set of features for building single and multi-page, and hybrid web applications.
AngularJS lets you extend HTML vocabulary for your application. The resulting environment is extraordinarily expressive, readable, and quick to develop.
Node.js is a platform built on Chrome's JavaScript runtime for easily building fast, scalable network applications.
Checkout #mean, it's well made replacement for a traditional LAMP, I must do something fancy with it, in near future.
http://t.co/jYXdu2pmoD
— David Aizenberg (@neoromantique) April 15, 2014
I spent the whole day building my own #MEAN stack and then found out that @mean_io had already built a great one! Atleast i learned a lot.
— Jaakko Ojalehto (@Zeikko) March 25, 2014
love that @mean_io has a female ninja character! ...does that mean that #WomenInTechnology are #mean? ;) pic.twitter.com/kQcsrljzWQ
— Lisa Seacat DeLuca (@LisaSeacat) April 25, 2014
@mean_io Love mean.io!! Just what I was looking for :) This is really awesome!!
— Srinivas K Rao (@sreerao) February 25, 2014
http://t.co/zIdulSxB5y seems a really elegant way to structure JS projects.
— Alex O'Connor (@uberalex) September 6, 2013
Liking the MEAN stack, it's like the hipster younger cousin of LAMP. http://t.co/TbjkWXKbdA
— Georgi (@CatRapture) October 23, 2013
So happy with #MEANstack now. And proud to contribute. http://t.co/NYalGhRwyb #meanio
— Andrija Petrovic (@4ndraP) May 3, 2014
Major changes in @mean.io since I last looked at it. Least to say, I am super impressed. #modular #beautiful #MEAN
— Daniel Flynn (@dflynn15) April 22, 2014
#mean.io really looks great. All my favorite tools and frameworks bundled together. @mean_io
— Julian (@n3rdbeere) April 29, 2014
Gonna use this on my next project for sure. http://t.co/C2ZqBWOisq
— Matt Robenolt (@mattrobenolt) May 3, 2014
Wow! Awesome! Take a look #MEANIO http://t.co/PeSn7aE14A
— Sebastian Jimenez V (@sebasjimenezvel) April 21, 2014
わーすごい / “Mean by linnovate” http://t.co/yTOFgipNWl
— Takuya Kato (@katton) August 6, 2013
For the lazy: mean.io #mongodb #nodejs #express and #angularjs - all my true loves in one place :) http://t.co/ie3GN1jLCQ
— Oliver Tupman (@olivertupman) February 8, 2014
Excited to see that http://t.co/slmmId2u0g is integrating AngularUI/bootstrap (http://t.co/2ie7du8LPO) as part of the stack!
— Pawel Kozlowski (@pkozlowski_os) October 17, 2013
This @mean_io is pretty impressive. It took me days to build an environment like this. This one comes out of the box! #socbiz
— Jason Roy Gary (@jasonroygary) May 6, 2014
Are you going to build a new web app with Mongo, Express, Angular, Node?
Take a deep breath a check this out http://t.co/PCyB5cDwct
— Christian Fei (@christian_fei) August 28, 2013
mean.io - the most frikken awesome stack available. End to end Javascript. Stunning.
— CS Elaborations (@CSElaborations) February 26, 2014
Can't sleep, so time to do some work on mean.io. #insomnia #devproblems
— Drew Fyock (@drewfyock) April 30, 2014


Facebook introduces option to turn off the notification dots
by Tech DeskFacebook reveals features that enhance user experience and this time around the social network has introduced a feature that allows you to edit your shortcut bar in the iOS app.
According to TechCrunch, the new feature enables the user to omit individual items from the bar that show red notification dots.
You could turn on the updated feature by long-pressing on an item in between those icons such as Groups, News, Marketplace, Profile and Watch in the shortcut bar which will direct you to the pop-up menu allowing you to turn notification dots on or off.
These icons can be easily added back to the shortcut bar, under the Settings -Notification dots, where you can turn on and off the red notification dots.
This way users will not be disturbed constantly with notifications on emails that are not of their interest.
The feature has rolled out for iOS users and will be available shortly on Android.
This article originally published on Mashable.


17.6 Implementation and Analysis of
Convex Hulls
To compute the
convex hull of a set of points, we begin with a list
containing each point. Each point in the list is a
Point structure. This structure consists of
three members, x, y, and
z, which are the coordinates of a point.
Recall that we ignore all z-coordinates since the operation
works in two dimensions.
The cvxhull
operation (see Example
17.3) begins by locating the lowest point passed to it in
P. To determine this, we traverse all points
while keeping track of which has the smallest y-coordinate. If two points share the
smallest y-coordinate, we
choose the point that has the smallest x-coordinate. This results in the
lowest and leftmost point. Once we have identified this point,
we set p0 to it.
The actual process of constructing the convex
hull takes place within a nested loop. At the start of the
outer loop, we insert p0 into the convex hull.
On the first iteration of the loop, p0 is the
lowest point. As the algorithm progresses, each successive
iteration of the outer loop yields a new p0.
Within the inner loop, we traverse each point
pi in P to determine the next
p0. Specifically, as we traverse each point,
pc maintains the point determined to be
clockwise from all others thus far with respect to the current
p0. To determine whether a given
pi is clockwise from the current
pc, we use the method presented earlier. That
is, if z is greater than 0, pi
is clockwise from pc, in which case we reset
pc to pi. If
pi and pc are collinear, we
set pc to pi only if
pi is further from p0 than
pc. Thus, once we have traversed all of the
points in the list, pc is the point that is
clockwise to all others with respect to p0. At
this point, we reset p0 to pc
and repeat the process until p0 is the point
at which we started. Once we reach this point, all points in
the convex hull have been inserted into
polygon at the top of the outer loop.
The runtime complexity of cvxhull is O
(nh), where n is the
total number of points, and h
is the number of points in the convex hull. The loop in which
the lowest point is determined runs in O (n) time because we must traverse
all points to determine which is the lowest. The nested loops
together are O (nh) because for
each point inserted into the convex hull, we must traverse all
other points to determine which is next to insert. Since
locating the lowest point and constructing the convex hull are
carried out sequentially, the runtime complexity of cvxhull is O
(nh).
Example 17.3.
Implementation for Computing Convex Hulls /*****************************************************************************
* *
* ------------------------------- cvxhull.c ------------------------------ *
* *
*****************************************************************************/
#include <math.h>
#include <stdlib.h>
#include "geometry.h"
#include "list.h"
/*****************************************************************************
* *
* -------------------------------- cvxhull ------------------------------- *
* *
*****************************************************************************/
int cvxhull(const List *P, List *polygon) {
ListElmt *element;
Point *min,
*low,
*p0,
*pi,
*pc;
double z,
length1,
length2;
int count;
/*****************************************************************************
* *
* Find the lowest point in the list of points. *
* *
*****************************************************************************/
min = list_data(list_head(P));
for (element = list_head(P); element != NULL; element = list_next(element)) {
p0 = list_data(element);
/**************************************************************************
* *
* Keep track of the lowest point thus far. *
* *
**************************************************************************/
if (p0->y < min->y) {
min = p0;
low = list_data(element);
}
else {
/***********************************************************************
* *
* If a tie occurs, use the lowest and leftmost point. *
* *
***********************************************************************/
if (p0->y == min->y && p0->x < min->x) {
min = p0;
low = list_data(element);
}
}
}
/*****************************************************************************
* *
* Initialize the list for the convex hull. *
* *
*****************************************************************************/
list_init(polygon, NULL);
/*****************************************************************************
* *
* Perform Jarvis's march to compute the convex hull. *
* *
*****************************************************************************/
p0 = low;
do {
/**************************************************************************
* *
* Insert the new p0 into the convex hull. *
* *
**************************************************************************/
if (list_ins_next(polygon, list_tail(polygon), p0) != 0) {
list_destroy(polygon);
return -1;
}
/**************************************************************************
* *
* Find the point pc that is clockwise from all others. *
* *
**************************************************************************/
count = 0;
for (element = list_head(P); element != NULL; element =
list_next(element)) {
/***********************************************************************
* *
* Skip p0 in the list of points. *
* *
***********************************************************************/
if ((pi = list_data(element)) == p0)
continue;
/***********************************************************************
* *
* Count how many points have been explored. *
* *
***********************************************************************/
count++;
/***********************************************************************
* *
* Assume the first point to explore is clockwise from all others *
* until proven otherwise. *
* *
***********************************************************************/
if (count == 1) {
pc = list_data(element);
continue;
}
/***********************************************************************
* *
* Determine whether pi is clockwise from pc. *
* *
***********************************************************************/
if ((z = ((pi->x - p0->x) * (pc->y - p0->y)) - ((pi->y - p0->y) * (pc->x
- p0->x))) > 0) {
/********************************************************************
* *
* The point pi is clockwise from pc. *
* *
********************************************************************/
pc = pi;
}
else if (z == 0) {
/********************************************************************
* *
* If pi and pc are collinear, select the point furthest from p0. *
* *
********************************************************************/
length1 = sqrt(pow(pi->x - p0->x, 2.0) + pow(pi->y - p0->y, 2.0));
length2 = sqrt(pow(pc->x - p0->x, 2.0) + pow(pc->y - p0->y, 2.0));
if (length1 > length2) {
/*****************************************************************
* *
* The point pi is further from p0 than pc. *
* *
*****************************************************************/
pc = pi;
}
}
}
/**************************************************************************
* *
* Prepare to find the next point for the convex hull. *
* *
**************************************************************************/
p0 = pc;
/**************************************************************************
* *
* Continue until reaching the lowest point again. *
* *
**************************************************************************/
} while (p0 != low);
return 0
;
}
|


ARCH_PRCTL
Section: Linux Programmer's Manual (2)
Updated: 2007-12-26
Index
Return to Main Contents
NAME
arch_prctl - set architecture-specific thread state
SYNOPSIS
#include <asm/prctl.h>
#include <sys/prctl.h>
int arch_prctl(int code, unsigned long addr);
int arch_prctl(int code, unsigned long *addr);
DESCRIPTION
The
arch_prctl()
function sets architecture-specific process or thread state.
code
selects a subfunction
and passes argument
addr
to it;
addr
is interpreted as either an
unsigned long
for the "set" operations, or as an
unsigned long *,
for the "get" operations.
Subfunctions for x86-64 are:
- ARCH_SET_FS
-
Set the 64-bit base for the
FS
register to
addr.
- ARCH_GET_FS
-
Return the 64-bit base value for the
FS
register of the current thread in the
unsigned long
pointed to by
addr.
- ARCH_SET_GS
-
Set the 64-bit base for the
GS
register to
addr.
- ARCH_GET_GS
-
Return the 64-bit base value for the
GS
register of the current thread in the
unsigned long
pointed to by
addr.
RETURN VALUE
On success,
arch_prctl()
returns 0; on error, -1 is returned, and
errno
is set to indicate the error.
ERRORS
- EFAULT
-
addr
points to an unmapped address or is outside the process address space.
- EINVAL
-
code
is not a valid subcommand.
- EPERM
-
addr
is outside the process address space.
CONFORMING TO
arch_prctl()
is a Linux/x86-64 extension and should not be used in programs intended
to be portable.
NOTES
arch_prctl()
is supported only on Linux/x86-64 for 64-bit programs currently.
The 64-bit base changes when a new 32-bit segment selector is loaded.
ARCH_SET_GS
is disabled in some kernels.
Context switches for 64-bit segment bases are rather expensive.
It may be a faster alternative to set a 32-bit base using a
segment selector by setting up an LDT with
modify_ldt(2)
or using the
set_thread_area(2)
system call in kernel 2.5 or later.
arch_prctl()
is needed only when you want to set bases that are larger than 4GB.
Memory in the first 2GB of address space can be allocated by using
mmap(2)
with the
MAP_32BIT
flag.
As of version 2.7, glibc provides no prototype for
arch_prctl().
You have to declare it yourself for now.
This may be fixed in future glibc versions.
FS
may be already used by the threading library.
SEE ALSO
mmap(2),
modify_ldt(2),
prctl(2),
set_thread_area(2)
AMD X86-64 Programmer's manual
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- RETURN VALUE
-
- ERRORS
-
- CONFORMING TO
-
- NOTES
-
- SEE ALSO
-
This document was created by
man2html,
using the manual pages.
Time: 02:54:50 GMT, September 18, 2014


Cli Migrator is a web based tool that helps cisco customers to convert from 16.10 configurations to corresponding 16.11 configurations


Gokongwei matriarch dies at 85
Elizabeth Yu Gokongwei dies a week after her husband John passed away
by Ralf RivasSubscribe
Email Address
Newsletters
- Glenda Gloria's Take this Tuesday
- Huddle by Miriam Grace Go
- The Newsbreak Agenda by Chay Hofileña
- Sometimes, all you need is video by Lilibeth Frondoso


We offer air tickets to almost every country for unbelievable rates. Please get in touch with our agents through the "Contact Us" page and they will help you out.
Domestic Flights
We offer air tickets to almost every every place within India for unbelievable rates. Please get in touch with our agents through the "Contact Us" page and they will help you out.


This is the step where we learn what the true problem is and how best to leverage technology to fix it.


| OUTB(2) | Linux Programmer's Manual | OUTB(2) |
#include <sys/io.h>
unsigned char inb(unsigned short int port); unsigned char inb_p(unsigned short int port); unsigned short int inw(unsigned short int port); unsigned short int inw_p(unsigned short int port); unsigned int inl(unsigned short int port); unsigned int inl_p(unsigned short int port);
void outb(unsigned char value, unsigned short int port); void outb_p(unsigned char value, unsigned short int port); void outw(unsigned short int value, unsigned short int port); void outw_p(unsigned short int value, unsigned short int port); void outl(unsigned int value, unsigned short int port); void outl_p(unsigned int value, unsigned short int port);
void insb(unsigned short int port, void *addr, unsigned long int count); void insw(unsigned short int port, void *addr, unsigned long int count); void insl(unsigned short int port, void *addr, unsigned long int count); void outsb(unsigned short int port, const void *addr, unsigned long int count); void outsw(unsigned short int port, const void *addr, unsigned long int count); void outsl(unsigned short int port, const void *addr, unsigned long int count);
They are primarily designed for internal kernel use, but can be used from user space.
You must compile with -O or -O2 or similar. The functions are defined as inline macros, and will not be substituted in without optimization enabled, causing unresolved references at link time.
You use ioperm(2) or alternatively iopl(2) to tell the kernel to allow the user space application to access the I/O ports in question. Failure to do this will cause the application to receive a segmentation fault.
| 2017-09-15 | Linux |


CS612 Learning Objectives and Expected Outcomes
- Students will master the key language processing
concepts and skills, and be able to
- understand the function of major language
processing components include lexical analysis, grammars, parsers, and
interpreters;
- use XML technologies to model and validate business
data;
- implement Web-based GUI with HTML;
- use XSL and XSLT to transform data from XML to HTML
for presentation in Web browsers.
- Students will master basic database programming
skills, and be able to
- understand the basic concepts and components of
relational databases;
- understand basic SQL language features for creating
tables, inserting/deleting data into tables and making inquiries through
JDBC;
- design and implement Java applications based on
both ACCESS and MySQL databases.
- Students will master the networking fundamentals, and
be able to
- understand the layered network architecture and
fundamental properties of TCP/IP;
- understand and conduct multi-thread programming and
thread synchronization;
- use the socket abstraction to implement simple
client/server applications.
- Students will master the fundamental Web application
architecture and concepts, and be able to
- jusify the tiered Web architecture;
- understand HTTP requests/responses and HTML form
processing;
- use servelts to implement a simple Web application
on the Tomcat;
- understand the proxy design pattern underlying all
remote method/function invocation technologies, and redo an existing Web
application as a Web service on Tomcat.
- Students will master the importance and fundamental
concepts of software framework based programming, and be able to
- explain the relationship among object-oriented
programming, component-based programming, and service-oriented
architecture;
- understand the design and implementation of a
simple software framework for networking;
- redo an existing networking application with a
simple software framework to see how we can hide networking and
multithreading from programmers.
- Students will get the roadmap of the Internet
computing, and be able to
- understand the fundamental concepts of
cluster-based computing and grid computing;
- understand fundamentals of server-based computing
technologies;
- understand fundamentals of service-oriented
computing;
- write a simple parallel program in Java that can
run on a cluster of PCs.


Norman Reynolds
british production designer and film director, best known for his work on the original Star Wars trilogy


Option selectby: 'name'
Simplemenu links sections to the menu by an attribute, which is defined by selectby
. By default it is 'id', but you can also set it to 'name' as in this example.
Set the selectby option to 'name'.
…
Reveal.initialize({
simplemenu: {
selectby: 'name',
},
plugins: [ Simplemenu ]
Make sure that the text content of your links is the same as the 'name' attribute of your sections. In the example below it is literally "Put some text here".

Put some text here

//...

//...


-
Lecturer, University of Koblenz, Institute for Web Science and Technologies
Machine Learning and Data Mining
Web
The course Machine Learning and Data Mining (MLDM) covers the fundamentals and basics of machine learning and data mining. The course provides an overview of a variety of MLDM topics and related areas such as clustering and classification.
Collaborators: Zeyd Boukhers and Tjitze Rienstra
-
Lecturer, University of Koblenz, Institute for Web Science and Technologies
Proseminar "Eye Tracking" (German)
Web
Other Supervisors: Matthias Thimm
-
Tutor, University of Koblenz, Institute for Web Science and Technologies
The master programme course Machine Learning and Data Mining covers the fundamentals and basics of machine learning and data mining. The course provides an overview of a variety of MLDM topics and related areas such as optimization and deep learning.
Lecturers: Steffen Staab and Zeyd Boukhers
Collaborators: Qusai Ramadan, Akram Sadat Hosseini, and Mahdi Bohlouli
-
Supervisor, University of Koblenz, Institute for Web Science and Technologies
Research Lab: Eye Tracking in Word Processing
Web
Exploring the future of word processing with eye tracking.
Other Supervisors: Matthias Thimm
-
Supervisor, University of Koblenz, Institute for Web Science and Technologies
Research Lab: Eye Tracking Visualization Platform
WebGitHub
The platform was created during a research lab project that set the goal to find new ways of visualizing eye tracking data.
Other Supervisors: Chandan Kumar
-
Supervisor, University of Koblenz, Institute for Web Science and Technologies
Research Lab: GazeTheWeb - Watch
GitHub
YouTube application controlled with gaze and processing of gaze and EEG sensor data, part of the EU-funded research project MAMEM.
Other Supervisors: Chandan Kumar and Korok Sengupta
-
Supervisor, University of Koblenz, Institute for Web Science and Technologies
Research Lab: GazeTheWeb - Tweet
GitHub
Twitter application controlled with gaze, part of the EU-funded research project MAMEM.
Other Supervisors: Chandan Kumar and Korok Sengupta
-
Thesis Supervisor, University of Koblenz, Institute for Web Science and Technologies
Master Thesis: Intelligent Mapping of Eye-Tracking Gaze-Data on Fixed Web Page Elements
PDFGitHub
Student: Hanadi Tamimi
Other Supervisors: Steffen Staab and Christoph Schaefer
Bachelor Thesis: Visualization of Transitions on Web Sites for Usability Studies with Eye Tracking (German)
PDFGitHub
Student: Christian Brozmann
Other Supervisors: Steffen Staab
Bachelor Thesis: Optical Text Recognition in the Web (German)
PDFGitHub
Student: Christopher Dreide
Other Supervisors: Steffen Staab
Bachelor Thesis: Shot Detection in Screencasts of Web Browsing with Convolutional Neural Networks
PDFGitHub
Student: Daniel Vossen
Other Supervisors: Steffen Staab
Bachelor Thesis: Semantical Classification of Icons
Student: Pierre Krapf
Other Supervisors: Steffen Staab
-
Tutor, University of Koblenz, Institute of Arts, Digital Media Group
Creation of games using the Blender Game Engine.
-
Tutor, University of Koblenz, Institute of Arts, Digital Media Group
Introduction to Unreal Development Kit (German)
Slides
Level building, materials, visual programming, and particles.
-
Tutor, University of Koblenz, Institute of Arts, Digital Media Group
Modeling, sculpting, painting, and animation for games.


Font Stack
Common, classic font stacks shared amongst most devices. 'Stack' refers to a sequence of similar looking 'backup fonts' which are automatically used if the main font is not installed on a device.
font-[stack]
Experience design made simple
for living design systems
font-arial
Experience design made simple
for living design systems
font-arial-black
Experience design made simple
for living design systems
font-courier-new
Experience design made simple
for living design systems
font-georgia
Experience design made simple
for living design systems
font-helvetica
Experience design made simple
for living design systems
font-menlo
Experience design made simple
for living design systems
font-monaco
Experience design made simple
for living design systems
font-times
Experience design made simple
for living design systems
font-times-new

Experience design made simple
for living design systems

Create an HTML tag suitable for displaying text such as

or

, and apply a font-[stack] class such as font-times-new
The default font families for each font stack are defined in /variables/_font.scss.
font-native experimental
Font experience design made simple
for living design systems

Experience design made simple
for living design systems

Create an HTML tag suitable for displaying text such as

or

, and apply the font-native
class. The default font-native 'stack' can be adjusted in /variables/_font.scss. Based on the Bootstrap 4 native font stack.


| BUILD ${build.result ?: 'COMPLETED'} | |
| Project: | ${project.name} |
| Build #${build.number}: | ${rooturl}${build.url} |
| Date: | ${it.timestampString} |
| Duration: | ${build.durationString} |
| Cause: | <% build.causes.each() { cause -> %> ${cause.shortDescription} <% } %> |
| Report: | ${rooturl}${build.url}cucumber-html-reports/overview-features.html |


Hey,
recently I interest in a topic of generating a static typescript client directly from C# controllers code. I decided that it would be a nice idea to generate such agreement in the project, in which I am currently working. For this purpose, I decided I want to try the TypeWriter library to create the contract. However, it turns out that in the case of such contract, it requires some actions which would help in gathering return types and types of accepted parameters by controllers actions.
So I started with deleting all occurrences of a parameter(s) deserialization in actions, so the signature of a function would accept parameters of concrete types, cause at this point actions looks similar to this one:
As we could see that accepted argument has a type of string. Which in fact hides a concrete type which is passed to an action. There were sometimes issues when we use concrete types instead of a string because passed objects are far more complicated than an object like this:
This is because the default ASP.NET deserializer sometimes didn’t work correctly. So to define concrete types I have to use ModelBinder, which gives an ability to do something with coming parameters. In our case, deserializing them by Newtonsoft.Json library. The main advantage of using the ModelBinder is that the deserialization phase took place in one place instead of every action. Implementation of such ModelBinder looks like that:
Of course, the implementation of ModelBinder is not enough. We have to “tell” somehow to the project, how to use this implementation. To achieve this we have to register Binder for concrete types in global.asax.cs file. Which we could do like that:
Thanks to above, the signature of function could evolve to the following:
At this moment I would know exactly what types are required by controller action parameters in a static client. But because I decided to create a static client, I also need an information about return types. When actions are defined like that they return JsonResult or ActionResult, the return type is boxed and this is not what we expect. So to return the concrete type from each action I have to implement an ActionInvoker, which has a job to do something right after the body of actions. Thanks to which the signature of an action would tell us what concrete type would be returned. But in fact somewhere below (in ActionInvoker) this value would be boxed into ActionResult or JsonResult.
Implementation of ActionInvoker looks like that:
Similar to the Binder, we have to tell somehow, how to use Invoker. We could achieve that in few ways. Use it in controller constructor in which we want to use it or set it in a controller factory which is responsible for creating them.
In concrete controller:
In controller factory:
Because ActionInvoker has been used for all controllers, there is a possibility, that someone still wants to return ActionResult or JsonResult for some reason. What if someone creates a function which has a return type of ActionResult od JsonResult and returns null inside of it? What is the expected behavior for this type of return types? The expected behavior is different, in case of ActionResult, the new EmptyResult should be returned in case of JSON a null as a JSON. So when we look at the implementation of WebApiInvoker right now it seems to be invalid, cause when we return null it will return a null as a JsonResult what could cause such errors:
So if we want to avoid such errors we have to check what type is expected to be returned. How could we achieve that? By reflection? Of course, but we could do it slightly easier, what could be seen here:
We could see here that thanks to code like that, we handle all cases and the code is still clear and readable, cause in comparison to the first result, the corrected solution contains only a check what return type is expected.
At this moment I was ready to generate a contract. To achieve that goal I use a TypeWriter library and I based on a basic template.
You could install TypeWriter as a NuGet package like that:
TypeWriter templates are located in .tst files. Below is a basic template to generate a contract for actions from controllers.
This code should be located in our web project.
After saving a template file. The contract should be generated and all .ts files should be attached to the template (.tst file). When we look at the generated files, we could notice a couple of things that need improvement. The first one is that this template generates a contract for all controllers. This behavior is not intentional in my case because some of the controllers are not called from a typescript code. So I want to generate contract only for files located in namespace .Public..
This issue could be fixed by code like that:
After a while, I noticed that I would like to exclude some specific controllers from the generation. For this purpose, I wrote a function which should be located in curly braces. This piece of code is not a rocket science, its only check if the namespace of a controller starts with .Public. and if the file is not this one which should be excluded from generation.
Invocation of this method looks like this:
Next thing is that methods in C# code sometimes have the same names, but they differ in parameters and route, it is okay for C# code, but typescript code where a class contains methods with the same names wouldn’t compile. So because of that, I decided that methods in typescript contract should have names corresponding to the last part of a route. To generate such names, we need to write a function like that:
And use it in the template like that:
We could see, that everything should work fine until someone defines a route like that /get/{userId}
. We rather do not want to have a function with name {userId}
. So to easily go around such problems, for such actions the name of typescript function will match C# method name, the fixed code looks like this:
Another thing that should be fixed is getting the type of an action, when it is defined via several HttpVerbs options, the generated method looks like that:
It was not exactly what I expected, therefore I wrote a very simple code which, when method accepts verbs instead of concrete HttpType it should return the last specified verb (since in case of my project if method contains a couple of verbs it is always a get and then post and from a typescript code we use only a post one)
The next thing which I spot is a strange way of gathering an action type. For a method which looks like that:
The type of HttpMethod has not been set as HttpGet but as a HttpDelete (the question is why Delete function is a HttpGet ;)?). Of course, this is a bug in a code, but the behavior of generator is weird. It is a possibility that there is also some bug in TypeWriter library, although a solution to that problem was to set a proper Http type to an action in C# code (in my case HttpPost…).
The last thing which we need is to add all necessary imports at the top of each generated file. To do that I have to write a function which scans all return types, accepted parameters types, generic types and for all of them generates import statements. In our case it is a little bit simplified because a contract for classes/enums is generated via another .tst file, so they are located in one place/folder. Thanks to that construction of import statement are pretty straightforward and the whole method looks like that:
And finally a full template looks like that:
Summarizing, thanks to the above steps, controllers in our code base are much more clear and readable and don’t contain unnecessary things like explicit deserialization. Also, we are able to generate a static contract for typescript code, so we could avoid hardcoding paths to actions in typescript code.
Thank you for reading :)


{# Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to You under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. #} {% extends "airflow/master.html" %} {% block head_css %} {{ super() }} {% endblock %} {% block title %} {{ title }} {% endblock %} {% block body %} {{ super() }} {% if embed %}


Hear from an Organization Like Yours
After completing a data-driven study of a hybrid care cohort at Alliance Physical Therapy Partners in which patients were using a combination of MedBridge Telehealth Virtual Visits and in-person visits, we found that a hybrid care model decreased the cost per episode of care by 47% compared to in-person visits alone, while also significantly improving pain and function.
View the full customer story here


A wrapper library for d3 that simplifies building charts without removing the flexibility of the d3 library. I was a major contributor and maintained this library for more than two years.
This library has been starred more than 4,000 times on Github and forked more than 1,000 times. Available here


Our Activities
Our Activities
{{item.text}}
{{item.text}}
Regular Events
| Day | {{element.day}} | Time | {{element.time}} | Location | {{element.location}} | Topic | {{element.topic}} |
|---|
Somavara Pooja
Somavara (Monday) is auspicious day for Shiva pooja. Every Monday, we perform Rudra Abhishekam followed by Arati and Prasdam.
Pradosham Pooja
Pradhosha pooja is one of the most important poojas performed to the Graceful Lord Shiva. The evening of the trayodasi (thirteenth day of the lunar fortnight) is called Pradhosha. Pradhosha time is especially meant for praying Lord Shiva. Praying in that time will free us from our sins and gives moksha finally (hence the name Pradhosha). Pradosha Pooja with Rudrabhishekam and Shiva Ashtothra Archana is held every Pradosham day from 6:30 pm - 7:30 pm followed by Arati and Prasadam.
Pournami Pooja
Pournami - the day of full moon - is sacred for Hindus. On the evening of Pournami, poojas are performed to Satyanarayana and Arunachala. Pooja will commence at 5.30 pm. Vinayaka Pooja will be followed by Satyanarayana Pooja and Arunachala pradakshinam(Giri Valam) which is done here as circumbulation of the temple with main deity Shiva. Followed by Arati and Prasadam.
Sankatahara Chaturthi Pooja
Sankashti Chaturthi vrat and puja are described in the Bavishyat Purana and Narasimha Purana. Lord Krishna narrated the efficacy of Sankashti Chaturthi to Yudhishtira. Pooja is performed with Ganapathi Homam, Abhishekam, Ayappa Padi paatu & deepam followed by Arati and Prasdam.
Shukla Sashti Pooja
Shukla Shashti is the name for the 6th Tithi (lunar day). It's the 6th Tithi of Shuklapaksha. Lord Karttikeya (Lord of valor) presides over this day. Pooja is performed with Abhishekam and Alankaram to Lord Muruga followed by Arari and Prasadam.
Anusham Pooja
Anusham is the birth star of Kanchi Mahaperiyava. Rudra Abhisheka is performed to Mahaperiya paduka and vigraham followed by Thotaka astakam, Bhajan, Arati and Prasadam.
Sastha Mandala Pooja
Sastha Mandala Pooja is the worship of Sree Dharma Sastha for the blessing of his divine grace. Lord Sasta, also popularly known as Lord Ayyappa is known to be the offspring of Shiva and Vishnu (as Mohini, in his female form). Sastha having earned a name of Annadhana Prabhu, mass feasts are arranged for this function .The Sabha begins the new year with aplomb celebrating with abishekam, archana, bhajans to Lord Ayyappa and prasadam.
Maha
Sivaratri Pooja
Maha Shivaratri is celebrated on the Krishna Paksha Chaturdashi of the month of Maasi
which falls in February or March. Of the twelve Shivaratris in the year, the Maha
Shivarathri is the most holy. On this night abishekam is offered to Lord Shiva
throughout the night and he is celebrated by offerings of Bilva leaves.
Sri Rama Navami
Pooja
Rama Navami celebrates the birth of Lord Rama. Rama Navami falls in the Shukla Paksha on
the Navami, the ninth day of the month of Chaitra in the Hindu calendar and marks the
end of the nine-day Vasanta Navaratri celebrations. Rama Navami is celebrated with
bhajans, pooja and the distribution of neer mor (buttermilk) and panagam.
Hanuman
Jayanthi
Hanuman Jayanthi is observed either in Chaitra (usually on the day of Chaitra Pournimaa)
or in Dhanu (called Margazhi in Tamil). Hanuman is the symbol of strength and energy.
Chanting of Hanuman Chalisa, it removes all obstacles in life.
Upakarma, Gayatri Japam
and Homam
The learning of the Vedas begins in the month of Aavani with the Upakarma and is
temporarily terminated six months later with an Utsarjana ritual, to be restarted in the
next Aavani. On this day, a Prayachittam is performed to pardon all the sins committed
during the year. Homams are held and Poonal, the sacred thread, is changed on this day.
This day is also auspicious as the Brahmins offer libations of water to their ancestors
to whom they owe their birth and to the great Rishis to whom they are highly indebted
for spiritual knowledge and the Vedas themselves.
The Gayatri mantra is a powerful vedic mantra, the chanting of which bestows upon the
chanter many benefits including clarity of intellect. Every year, on the day of Gayatri
Japam, the Gayatri mantra is chanted 1008 times, as a prayaschitta (atonement) for
faults that one has knowlingly and unknowingly committed. Performing the Gayatri Homam,
enhances the power of the mantra to bestow clarity of intellect.
Krishna Janmashtami Pooja
Krishna Janmashtami, also known Gokulashtami, is festival that celebrates the birth of Lord Krishna, the eighth avatar of Vishnu. It is observed on the eighth day (Ashtami) of the Krishna Paksha (dark fortnight) in Shraavana maasa and which overlaps with August and September. It is celeberated with abhishekam, archana, arati and prasadam followed by devotional singing through the midnight.
Guru
Poornima Pooja
The Full Moon Day in the month of Ashadha (July-August) is known as Guru Purnima.This
was the day, when Krishna-Dwaipayana Vyasa was born to sage Parashara and Satyavati,
thus this day is also celebrated as Vyasa Purnima. This day is celebrated in honour of
the great sage Vyasa, who is seen as one of the greatest gurus in ancient Hindu
traditions and a symbol of the Guru-shishya tradition. This day is observed by offering
puja to one’s guru and the guru parampara.
Chandi Homam
The Worship of Goddess Chandi highlights the importance of feminine energy. Chandi Homam
is one of the most popular Homas and the Sabha conducts the Chandi Homam during
Navarathri. The core of the ceremony involves a recitation of 700 verses of the Durga
Saptashati. With the recitation of each verse, offerings are made in the sacrificial
fire invoking the Goddess. The performance of Chandi Homa, frees one of curses,
obstacles and blesses them with a lasting health, wealth and prosperity.
Skanda Sashti Kavacham (கந்த சஷ்டி கவசம்) was composed by Sri Devaraya Swamigal in
19th century.  Sri Devaraya Swamigal
asserts in this composition:
VEDA Circle began organising a Skanda Sashti Utsavam at 6 different locations in
USA similar to 6 veedu at Tamilnadu and celeberate Sashti Utsavam and Soora Samharam for
the welfare of community.


NIRSpec data-trending monitors
How it works
The NIRSpec data-trending dashboard is a web based application that allows engineers and general users to keep track of a subset of key NIRSpec performance parameters (“mnemonics”) such as voltages, currents, sensor signals and temperatures. In total 200+ mnemonics are tracked for NIRSpec. This telemetry data is retrieved from the engineering data base (EDB) on the Mikulski Archive for Space Telescopes (MAST) at STScI and some statistical analysis is performed (number of samples considered, mean, standard deviation).The processed data is stored in a separate database and also presented by a series of plots in the dashboard below. Each point on a specific graph represents the data collected for one specific day. As such, the application allows the user to perform (long term) trending on key NIRSpec performance parameters and identify potential changes in instrument behaviour in case these would appear.
In total there are 7 different tabs: 1) Power 2) Reference Voltages 3) Temperatures 4) MSA and MCE 5) FPA and FPE 6) CAA Lamps and 7) Filter and Grating Wheel. Each of these tabs has its own specific set of plots. One can hover over the data points and detailed statistics will appear. Also, there are various zoom and pan tools implemented allowing the user to manipulate the graphs. Curves can be activated and muted by clicking on the legend.
In the future, a cron job referring to the EDB will populate the database over time.
{{ dashboard[0] | safe }}
{{ dashboard[1] | safe }}


See: Description
| Class | Description |
|---|---|
| BrightnessFilter |
BrightnessFilter child of Filter object.
|
| Filter |
Derived from suggestions made in the book, "Objects First with
Java" by David Barnes and Michael Kolling.
|
| MonoFilter |
Derived from the suggestions made in "Objects First with Java" by Michael
Kolling and David Barnes, along with the methods used originally within the
Editor class of the prototype Fotoshop project.
|
| RotateFilter |
Derived from the suggestions made in "Objects First with Java" by Michael
Kolling and David Barnes, along with the methods used originally within the
Editor class of the prototype Fotoshop project.
|
Filter
: The super class for all Filters. Contains
basic name field, and methods for retrieving/setting the name and applying
the filterBrightnessFilter
: Filter for adjusting the brightness
of the current image being edited. Receives a value to adjust the brightness
level of the image byMonoFilter
: Filter for applying a monochrome effect
to the current image being worked on.RotateFilter
: Filter that will rotate the image
by 90 degrees. Can also receive an integer value and will apply this filter
that many times.


---
title: calcGBPD
sidebar: function_reference_sidebar
permalink: grainBoundary.calcGBPD.html
folder: function_reference
toc: false
---
compute the grain boundary plane distribution
Syntax
{% highlight matlab %}
GBPD = calcGBPD(gB,ebsd)
{% endhighlight %}
{% highlight matlab %}
% use a specific halfwidth
GBPD = calcGBPD(gB,ebsd,'halfwidth',10*degree)
{% endhighlight %}
Input
Output
References
- R. Hielscher, R. Kilian, E. Wünsche: Efficient computation of the grain boundary normal distribution from two dimensional EBSD data, not yet published.
See also