| Program | Source File | Description |
|---|---|---|
| add_pert_where_high_refl | add_pert_where_high_refl.f90 | |
| advance_cymdh | advance_cymdh.f90 | |
| advance_time | advance_time.f90 | Compute with time quantities |
| am2_to_dart | am2_to_dart.f90 | |
| barot_obs_file | barot_obs_file.f90 | |
| barot_obs_random | barot_obs_random.f90 | |
| cam_to_dart | cam_to_dart.f90 | |
| CHAMP_density_text_to_obs | CHAMP_density_text_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| check_in_grid | check_in_grid.f90 | |
| check_in_grid | check_in_grid.f90 | |
| cice_to_dart | cice_to_dart.f90 | This program reads in ensemble CICE parameters (2D) and attach them to the CICE restart files |
| cice_to_obs | cice_to_obs.f90 | cice_to_obs - read binary files from the national snow and ice data center and convert percentages into sea ice concentration observation sequence files. |
| clm_to_dart | clm_to_dart.f90 | |
| closest_member_tool | closest_member_tool.f90 | Select the member closest to the ensemble mean. |
| CNOFS_text_to_obs | CNOFS_text_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| column_rand | column_rand.f90 | |
| column_rand | column_rand.f90 | |
| column_rand | column_rand.f90 | |
| column_rand | column_rand.f90 | |
| column_rand | column_rand.f90 | |
| compare_states | compare_states.f90 | program to take 2 netCDF DART diagnostic files and compare the state variable, or whatever variables are listed in the namelist. prints the min, max values and the min/max difference for each field listed. |
| compute_error | compute_error.f90 | Program to read true_state.nc and preassim.nc (or analysis.nc) and print out the time-mean total error and spread. The matlab macros do this with graphics, but if you want numerical output suitable for shell scripting/automation this should be easier to incorporate. |
| convert_airs_L2 | convert_airs_L2.f90 | |
| convert_aura | convert_aura.f90 | |
| convert_aviso | convert_aviso.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_cosmic_gps_cdf | convert_cosmic_gps_cdf.f90 | |
| convert_cosmic_ionosphere | convert_cosmic_ionosphere.f90 | An observation sequence converter for ionosphere profiles from the CDAAC web site http://cosmic-io.cosmic.ucar.edu/cdaac The usual mission is 'cosmic2013', the file type is 'ionPrf'. |
| convert_f16_edr_dsk | convert_f16_edr_dsk.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_gpspw | convert_gpspw.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_gpspw | convert_gpspw.f90 | |
| convert_gpsro_bufr | convert_gpsro_bufr.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_L2b | convert_L2b.f90 | |
| convert_madis_acars | convert_madis_acars.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_madis_marine | convert_madis_marine.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_madis_mesonet | convert_madis_mesonet.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_madis_metar | convert_madis_metar.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_madis_profiler | convert_madis_profiler.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_madis_rawin | convert_madis_rawin.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_madis_satwnd | convert_madis_satwnd.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_ok_mesonet | convert_ok_mesonet.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_roms_obs | convert_roms_obs.f90 | program that converts ROMS observations PLUS FORWARD OPERATOR VALUES (estimated values computed during the ROMS run). this program needs to read 1 obs input file to get the original obs value, time, location, error, etc; plus N (ensemble size) ROMS "mod" files to extract the forward operators. possibly also a third type of file to get the grid information - we are currently hoping that we can get lat/lon/depth directly from the ROMS input obs file, but if not we have to add more code. the input obs files currently has X,Y,Z values relative to the ROMS grid - we'd have to open a grid file and compute the lat/lon values from that. |
| convert_saber_cdf | convert_saber_cdf.f90 | |
| convert_ssec_satwnd | convert_ssec_satwnd.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| convert_tpw | convert_tpw.f90 | |
| convertdate | convertdate.f90 | |
| COSMOS_development | COSMOS_development.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| COSMOS_to_obs | COSMOS_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| create_fixed_network_seq | create_fixed_network_seq.f90 | |
| create_increment | create_increment.f90 | |
| create_mean_std | create_mean_std.f90 | |
| create_mean_std | create_mean_nogaps.f90 | |
| create_obs_grid | create_obs_grid.f90 | program intended to create a set of observations located on a regular grid. obs have no data values - the output obs_seq (suggested name obs_seq.in) must go through a program like perfect_model_obs to give the observations values. this code doesn't look like it was very polished; seems quick and dirty. |
| create_obs_radar_sequence | create_obs_radar_sequence.f90 | |
| create_obs_sequence | create_obs_sequence.f90 | |
| create_ocean_obs | create_ocean_obs.f90 | |
| create_sphere_obs | create_sphere_obs.f90 | |
| dart_to_am2 | dart_to_am2.f90 | |
| dart_to_cam | dart_to_cam.f90 | |
| dart_to_cice | dart_to_cice.f90 | |
| dart_to_clm | dart_to_clm.f90 | |
| dart_to_lmdz | dart_to_lmdz.f90 | |
| dart_to_model | dart_to_model.f90 | |
| dart_to_model | dart_to_model.f90 | |
| dart_to_model | dart_to_model.f90 | |
| dart_to_model | dart_to_model.f90 | method: Read DART state vector. Reform state vector back into TIEGCM fields. Replace those fields on the TIEGCM restart file with the new values, |
| dart_to_naaps | dart_to_naaps.f90 | |
| dart_to_ncommas | dart_to_ncommas.f90 | |
| dart_to_noah | dart_to_noah.f90 | |
| dwl_to_obs | dwl_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| ensemble_init | ensemble_init.f90 | |
| error_handler_test | error_handler_test.f90 | |
| exhaustion | exhaustion.f90 | |
| extract | extract.f90 | $ if (psfc(1,1) /= 0.0 .and. time_string_last /= time_string) then $ endif |
| file_utils_test | file_utils_test.f90 | |
| fill_inflation_restart | fill_inflation_restart.f90 | Generate initial inflation files from namelist values. This way an experiment can always start from a restart file without having to alter the namelist between cycles 1 and 2. |
| filter | filter.f90 | Main DART Ensemble Filtering Program |
| filter | filter.separate_seq.f90 | filter.separate_seq.f90 is filter.f90 (circa 2014) but each task updates its own sequence in obs_space_diagnostics, included here just for future reference. The sequences would need to be merged together for output. Not sure why every task has a full sequence (all copies) allocated, since only task 0 ever fills the seq. |
| find_enclosing_indicies_test | find_enclosing_indices_test.f90 | |
| find_first_occurrence_test | find_first_occurrence_test.f90 | |
| ftest | ftest_f90.f90 | |
| ftest_go | ftest_go.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| ftest_mpi | ftest_mpi.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| ftest_nc | ftest_nc.f90 | |
| ftest_sendrecv | ftest_sendrecv.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| ftest_stop | ftest_stop.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| gau_param_main | gau_param.f90 | |
| gen_sampling_err_table | gen_sampling_err_table.f90 | Correct covariances for fixed ensemble sizes. |
| gitm_blocks_to_netcdf | gitm_blocks_to_netcdf.f90 | , restart_file_to_statevector |
| gitm_to_netcdf | gitm_to_netcdf.f90 | |
| gnd_gps_vtec_text_to_obs | gnd_gps_vtec_text_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| grid_refl_obs | grid_refl_obs.f90 | |
| gsi_to_dart | gsi_to_dart.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| gts_to_dart | gts_to_dart.f90 | do i = 1, ob%num_satem |
| gtspp_to_obs | gtspp_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| id_set_def_stdin | id_set_def_stdin.f90 | |
| innov_to_obs_seq | innov_to_obs_seq.f90 | |
| integrate_model | integrate_model.f90 | Program to integrate assimilation model forward for asynchronous filter execution. |
| integrate_model | integrate_model_parallel.f90 | Program to integrate assimilation model forward without assimilation. Can be used for forecasts after an assimilation, spinning a model up before assimilation, or for advancing subroutine-callable models from a separate executable during an assimilation. |
| level4_to_obs | level4_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| littler_tf_dart | littler_tf_dart.f90 | $ if (which_vert == -1) then $ obs_kind = map_type_of_obs_table(get_obs_def_type_of_obs(obs_def)) $ if (obs_kind == RADIOSONDE_SURFACE_PRESSURE) then $ call get_obs_values(obs, obs_value, 1) $ tst_Psfc = obs_value(1) $ endif $ endif |
| lmdz_to_dart | lmdz_to_dart.f90 | |
| location_test | location_test.f90 | |
| location_test2 | location_test2.f90 | |
| location_test3 | location_test3.f90 | |
| main | do_id_set_def_stdin.f90 | |
| main | ps_id_stdin.f90 | |
| make_fake_obs | make_fake_obs.f90 | |
| MIDAS_to_obs | MIDAS_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| MOD15A2_to_obs | MOD15A2_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| model_mod_check | model_mod_check.f90 | |
| model_mod_check | model_mod_check.f90 | Tests model_mod routines. Very useful when adding a new model. This version works for models with any location type. Depends on a location-specific module for test_interpolate_single and test_interpolate_range. |
| model_to_dart | model_to_dart.f90 | |
| model_to_dart | model_to_dart.f90 | |
| model_to_dart | model_to_dart.f90 | |
| model_to_dart | model_to_dart.f90 | method: Read TIEGCM restart file (netCDF format). Reform fields into a DART state vector. Write out state vector in DART format. |
| modis_ist_to_obs_netcdf | modis_ist_to_obs_netcdf.f90 | modis_ist_to_obs_netcdf - input is a seaice temperature file that has been converted from HDF to netCDF with 'ncl_convert2nc'. This program then reads the netCDF file and creates an observation sequence file of the seaice temperatures. |
| mpas_dart_obs_preprocess | mpas_dart_obs_preprocess.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| naaps_to_dart | naaps_to_dart.f90 | |
| ncommas_to_dart | ncommas_to_dart.f90 | |
| netcdf_to_gitm_blocks | netcdf_to_gitm_blocks.f90 | , statevector_to_restart_file |
| nml_test | nml_test.f90 | |
| noah_to_dart | noah_to_dart.f90 | |
| obs_assim_count | obs_assim_count.f90 | prints out a quick table of obs types and counts, overall start and stop times, and metadata strings and counts. you can get more info by running the obs_diag program. |
| obs_assim_count | obs_assim_count.f90 | Prints out a quick table of obs types and counts, overall start and stop times, and metadata strings and counts. You can get more info by running the obs_diag program. right now this program counts up the number of obs for each possible 'DART quality control' value (0-8). (it could also check for a 'posterior ensemble mean' copy and count how many are missing_r8 and how many are not.) It does the former right now. |
| obs_common_subset | obs_common_subset.f90 | This program takes as input one or more sets of N obs_seq filenames.
N is usually 2, but can be any number of files to compare together.
It opens the obs_seq files N at a time and does an obs-by-obs comparison. |
| obs_data_denial | obs_data_denial.f90 | open an obs_seq file and randomly change the error variance of N of each obs type to a huge value before copying obs over to the output file. the value of N is namelist-settable. this effectively removes the impact of those observations on the assimilation. it is intended to help implement a data-denial experiment where you assimilate all obs (the original obs_seq file) and then with some obs disabled (the output obs_seq from this program) and compare the results. the default is to remove N of each obs type but the types of obs is also namelist-settable. THIS IS NOT YET DONE! it was cloned from obs_keep_a_few and has not been implemented yet. |
| obs_diag | obs_diag.f90 | The programs defines a series of epochs (periods of time) and geographic regions and accumulates statistics for these epochs and regions. All 'possible' observation types are treated separately. The results are written to a netCDF file. |
| obs_diag | obs_diag.f90 | The programs defines a series of epochs (periods of time) and geographic regions and accumulates statistics for these epochs and regions. All 'possible' observation types are treated separately. The results are written to a netCDF file. |
| obs_diag | obs_diag.f90 | The programs defines a series of epochs (periods of time) and geographic regions and accumulates statistics for these epochs and regions. All 'possible' observation types are treated separately. The results are written to a netCDF file. |
| obs_impact_tool | obs_impact_tool.f90 | This program users to construct a table that is read by filter at run-time to localize the impact of sets of observation types on sets of state vector quantities. The standard DART algorithms compute increments for an observation and then compute corresponding increments for each model state variable due to that observation. To do this, DART computes a sample regression coefficient using the prior ensemble distributions of a state variable and the observation. The increments for each member of the observation are multiplied by this regression coefficient and then added to the corresponding prior ensemble member for the state variable. However, in many cases, it is appropriate to reduce the impact of an observation on a state variable; this is called localization. The standard DART algorithms allow users to specify a localization that is a function of the horizontal (and optionally vertical) distance between the observation and the state variable. The localization is a value between 0 and 1 and multiplies the regression coefficient when updating state ensemble members. |
| obs_info | obs_info.f90 | print out information about observation sequence file(s). summarizes obs types, times, counts. |
| obs_keep_a_few | obs_keep_a_few.f90 | open an obs_seq file and copy over the first N of each obs type to the output file. the value of N is namelist-settable. intended to subset a large obs_seq file for testing or other purposes but still keep examples of each type of obs from the input. |
| obs_loop | obs_loop.f90 | simple program that opens an obs_seq file and loops over the obs and copies them to a new output file. this is intended to be a template for programs that want to alter existing obs in some simple way. |
| obs_remove_dups | obs_remove_dups.f90 | program that opens an obs_seq file and loops over the obs and copies them to a new output file. this is intended to be a template for programs that want to alter existing obs in some simple way. |
| obs_rwtest | obs_rwtest.f90 | test program that tries to open an obs_sequence file, print out basic information about it, and write the same information out. intended to test read_obs_seq() and write_obs_seq() routines. |
| obs_selection | obs_selection.f90 | This specialized tool selects a subset of input observations from an observation sequence file. |
| obs_seq_coverage | obs_seq_coverage.f90 | This program queries a bunch of obs_seq.xxxx files and tries to figure out 'voxel coverage' ... what locations are consistently reported through time. Absolutely a 'reverse-engineering exercise'. |
| obs_seq_to_netcdf | obs_seq_to_netcdf.f90 | converts an observation sequence file to a netCDF file but only retains basic metadata. Metadata to specific observation types is not converted. For example, the location of the radar and direction are not converted, but the location of the observation IS converted. |
| obs_seq_verify | obs_seq_verify.f90 | This program creates a netCDF file suitable for forecast evaluation. |
| obs_sequence_tool | obs_sequence_tool.f90 | Change observation sequence files by adding or removing observations based on type, location, values, time. Long list of options based on namelist settings. See the html documention for extensive examples. |
| obs_sort | obs_sort.f90 | |
| obs_timejitter | obs_timejitter.f90 | |
| obs_total_error | obs_total_error.f90 | Prints out a quick summary number of the total error in the mean and spread. This should be run on an obs_seq file which has been through both perfect_model_obs and filter, so it has both a copy of the 'truth' as well as 'ensemble mean' and 'ensemble spread'. You can get more info by running the obs_diag program |
| oi_sst_to_obs | oi_sst_to_obs.f90 | title = "NOAA High-resolution Blended Analysis: Daily Values using AVHRR only" ; institution = "NOAA/NCDC" ; source = "NOAA/NCDC ftp://eclipse.ncdc.noaa.gov/pub/OI-daily-v2/" ; comment = "Reynolds, et al., 2007: Daily High-Resolution-Blended Analyses for Sea Surface Temperature. J. Climate, 20, 5473-5496. Climatology is based on 1971-2000 OI.v2 SST, Satellite data: Navy NOAA17 NOAA18 AVHRR, Ice data: NCEP ice." ; references = "https://www.esrl.noaa.gov/psd/data/gridded/data.noaa.oisst.v2.highres.html" ; dataset_title = "NOAA Daily Optimum Interpolation Sea Surface Temperature" ; |
| perfect_model_obs | perfect_model_obs.f90 | Program to build an obs_sequence file from simulated observations. |
| pert_sounding | pert_sounding.f90 | |
| pert_wrf_bc | pert_wrf_bc.f90 | |
| perturb_bndy | perturb_bndy.f90 | |
| perturb_init | perturb_init.f90 | |
| perturb_single_instance | perturb_single_instance.f90 | |
| Precision_Check | PrecisionCheck.f90 | |
| preprocess | preprocess.f90 | Takes a list of observation type module path names. These modules contain multiple fragments of standard F90 that may be required to implement forward observation operators for DART. The sections are retrieved from the files by this program and inserted into the appropriate blanks in the DEFAULT_obs_def_mod.F90 and DEFAULT_obs_kind_mod.F90 templates. The final obs_def_mod.f90 and obs_kind_mod.f90 that are created contain the default code plus all the code required from the selected observation type modules. Preprocess also inserts the required identifier and string for the corresponding observation kinds (and only those kinds). |
| prog_dobsdx | dobsdx.f90 | |
| ps_rand_local | ps_rand_local.f90 | |
| rad_3dvar_to_dart | rad_3dvar_to_dart.f90 | |
| read_geo | read_geo.f90 | |
| read_qscat2b | read_qscat2b.f | |
| read_qscat_info | read_qscat_info.f | |
| recntr_bndyperts | recntr_bndyperts.f90 | |
| replace_wrf_fields | replace_wrf_fields.f90 | |
| resample | resample.f90 | |
| restart_file_tool | restart_file_tool.f90 | This tool is no longer supported. |
| scale_coamps_perts | scale_coamps_perts.f90 | |
| scale_nogaps_perts | scale_nogaps_perts.f90 | |
| seaice_aggre_to_obs_netcdf | seaice_aggre_to_obs_netcdf.f90 | seaice_aggre_to_obs_netcdf This program creates an observation sequence file that has a synthetic observation at every location in the netCDF file. 'make_obs_aggre.ncl' was used to add noise to a cice state which is then used as input to this program. |
| select | select.f90 | $ if(time /= prev_time) call print_time(time) |
| snow_to_obs | snow_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| snow_to_obs_netcdf | snow_to_obs_netcdf.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| sort_test | sort_test.f90 | |
| sqg | sqg.f90 | |
| sst_to_obs | sst_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| stacktest | stacktest.f90 | |
| tc_to_obs | tc_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| test_cf_conventions | test_cf_conventions.f90 | |
| test_corr | test_corr.f90 | |
| test_diag_structure | test_diag_structure.f90 | |
| test_diff | test_diff.f90 | |
| test_dipole_interp | test_dipole_interp.f90 | |
| test_exp | test_exp.f90 | |
| test_gamma | test_gamma.f90 | |
| test_gaussian | test_gaussian.f90 | |
| test_hist | test_hist.f90 | |
| test_inv_gamma | test_inv_gamma.f90 | |
| test_io_read_transpose | test_io.f90 | Test harness for a limited transpose code |
| test_io_read_transpose | test_io.f90 | Test harness for a limited transpose code |
| test_quad_irreg_interp | test_quad_irreg_interp.f90 | |
| test_quad_reg_interp | test_quad_reg_interp.f90 | |
| test_random | test_random.f90 | |
| test_read_write_restarts | test_read_write_restarts.f90 | |
| test_read_write_time | test_read_write_time.f90 | |
| test_reseed | test_reseed.f90 | |
| test_state_structure | test_state_structure.f90 | |
| text_to_obs | text_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| text_to_obs | text_to_obs.f90 | Some times are supplied as number of seconds since some reference date. To support that, set a base/reference time and then add the number of seconds to it. (time_types support adding two time types together, or adding a scalar to a time_type.) Here is an example of setting a reference date, giving the call: year, month, day, hours, mins, secs |
| thinned_gtspp_to_obs | thinned_gtspp_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| timetest | timetest.f90 | |
| trans_coamps_to_dart | trans_coamps_to_dart.f90 | |
| trans_coamps_to_dart | trans_coamps_to_dart.f90 | |
| trans_coamps_to_statevec | trans_coamps_to_statevec.f90 | |
| trans_coamps_to_statevec | trans_coamps_to_statevec.f90 | |
| trans_dart_to_coamps | trans_dart_to_coamps.f90 | |
| trans_dart_to_coamps | trans_dart_to_coamps.f90 | |
| trans_dart_to_MITgcm | trans_dart_to_MITgcm.f90 | |
| trans_date_to_dart | trans_date_to_dart.f90 | |
| trans_MITgcm_to_dart | trans_MITgcm_to_dart.f90 | |
| trans_perfect_ics | trans_perfect_ics.f90 | |
| trans_pv_sv | trans_pv_sv.f90 | |
| trans_statevec_to_coamps | trans_statevec_to_coamps.f90 | |
| trans_sv_pv | trans_sv_pv.f90 | |
| update_datahd_file | update_datahd_file.f90 | |
| update_mpas_states | update_mpas_states.f90 | |
| update_wrf_bc | update_wrf_bc.f90 | |
| wakeup_filter | wakeup_filter.f90 | spread out on the processors in the same order as the executable model and filter programs, and echo into the fifo (named pipe) a message to wake up the sleeping filter program. |
| wod_to_obs | wod_to_obs.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| wodFOR | wodFOR.f | Parameters (constants): |
| wrf_dart_obs_preprocess | wrf_dart_obs_preprocess.f90 | !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! |
| write_sqg_restart | write_sqg_restart.f90 | |
| x_plus_delta | x_plus_delta.f90 |


Jared here, just learning about flexbox so I can do some awesome responsive web pages. I really need to keep my mind on something and just practicing web development, mostly CSS and JavaScript for now, seems like a really constructive thing to do.
Jared here, just learning about flexbox so I can do some awesome responsive web pages. I really need to keep my mind on something and just practicing web development, mostly CSS and JavaScript for now, seems like a really constructive thing to do.
A movie I like? There are so many, I don't think I can pick just one as a favorite. There are 3 trilogies that top the list; The Matrix (now a 4 part saga), The Lord of the Rings and original Starwars. Even when I like movies I don't care to usually see them more than once or twice. These trilogies I have watched each in its entirety over 4 times.
A tv show I like? I watch so many tv series. TV time is something I have seemed to cut back on. One show that I have followed from the beginning, so I might say it's my favorite is The Walking Dead. Really, anything set in the Walking Dead Universe has my interest but the original series has held a place in my heart for 11 years.
A band I listen to? At one time listening to music was the one thing I did the most of. Listening to music or going to local shows. I would see smaller bands in other cities quite often. This is no longer something I do. I am an older, out of shape man. One band from that time that I still listen too all of their stuff is Madball. I have seen and heard a lot of bands and no other band has been on the top of my list of fantastic bands. They have also released a lot of material over a good part of my youth. All of which I loved.


In International Relations, Cyberspace has become a significant focus. Cyber-espionage, cyberattack, hacktivism, internet censorship, and other technical issues get mentioned as national security issues, or in the news of diplomatic tension between nations. Therefore, cyberspace has become a contested political space, shaped by diverging interests, norms, and values.
Subscribe to our newsletter to recieve bi-Weekly report on geopolitical event concerning cyberspace
Subscribe


Reps Committee frowns as NCS fails to appear on allegations of extra judicial killings
by The Eagle OnlineThe House of Representatives Committee on Public Petition has expressed concern about the refusal of the Nigerian Customs Service to appear and respond to a petition on extra judicial killings by its men.
The acting Chairman of the Committee, Hon. Lawan Kenken at the hearing on Wednesday in Abuja, said that the NCS was given seven days notice.
He said that the committee received a petition by Assemblywoman Sikirat Ajibola, a member of the Ogun House of Assembly.
Kenken explained that the petitioner accused the NCS of extra judicial killings and other unlawful acts of men of the service against the people of Idiroko/Ipokia State Constituency.

“From the stamp of the Comptroller-General office, they were served this hearing notice and the notice of petition was received by the NCS on the November 6.
“Today is November 13, which means they revived it seven days ago and they are not here.
“To be honest with you, we do not hear a case when one side is not present because of the fundamental role of natural justice,” he said.
The chairman, however, said that the hearing would be rescheduled for a later date for the NSC to appear.


Position
Player to move
Castling possibilities
EnPassant target square
Position
Player to move
Castling possibilities
EnPassant target square


High Priest Marie:
Of course, the Wizard is no exception. Anyone wishing to become a Wizard must have achieved at least level 20 and passed the appropriate test.
You've passed the test but your level is insufficient. Come back to see me when you've raised your level.


{% extends "driving/layout.html" %} {% block page_title %} Disability and medical conditions {% endblock %} {% block content %} {% include "includes/phase_banner_beta.html" %} {{formData | safe}} Do you have any of the following disabilities or health conditions? Do you have any of the following disabilities or health conditions? Severe learning disability Diabetes controlled by insulin Epilepsy Any condition affecting your eyes Any condition affecting your field of vision, other than needing to wear glasses or contact lenses Total loss of sight in one eye Any stroke symptoms lasting longer than one month Fits or blackouts Any type of brain surgery or severe head injury involving in-patient treatment Brain tumour An implanted cardiac pacemaker An implanted cardiac defibrilator (ICD) Repeated attacks of sudden disabling giddiness Any chronic neurological condition including Multiple Sclerosis, Motor Neurone and Huntington's Disease A serious problem with memory or periods of confusion Persistent alcohol problem or dependence Persistent drug problem or dependence Serious psychiatric illness or mental ill health Parkinson's disease Narcolepsy Obstructive Sleep apnoea syndrome {% endblock %}


Cras justo odio, dapibus ac facilisis in, egestas eget quam.
Like More
CommuniCode is a coding social network integrated with git. You can upload and download projects freely, including tutorials and unfinished projects.
CommuniCode has a focus on learning and is designed to be easy to use.


To query if a TopComponent is a multiview component, use
{@link org.netbeans.core.api.multiview.MultiViews#findMultiViewHandler}.
If a {@link org.netbeans.core.api.multiview.MultiViewHandler} instance is
returned, it is a multiview component.
MultiViewHandler
can be used to examine the multiview component.
Array
of defined perspectives (elements) and the currently selected
perspective are available.
The handler can be used to switch the
current selection programatically.
Possible usecases include:


After all cycles for a measurement are finished and any outliers are rejected, the summed raw data for the individual cycles are used to calculate the final rates. The final standard deviations for the rates depend on the calculation method selected. If the errors are calculated from theory, then they are calculated from the summed raw data. If they are calculated from the sample standard deviations, then the relative error of the average rate is the sample standard deviation divided by the average rate of the individual cycles and then divided by the square root of the number of cycles.


Most people believe that a secretly precise Left Hand Milk Stout falls in love with a Pilsner behind the Full Sail IPA, but they need to remember how barely the smelly Miller goes to sleep.


| 030:028 Khan | : |
He sets forth for you a parable from your ownselves, - Do you have partners among those whom your right hands possess (i.e your slaves) to share as equals in the wealth We have bestowed on you? Whom you fear as you fear each other? Thus do We explain the signs in detail to a people who have sense. |
| 030:028 Maulana | : |
He sets forth to you a parable related to yourselves. Have you among those whom your right hands possess partners in that which We have provided you with, so that with respect to it you are alike -- you fear them as you fear each other? Thus do We make the messages clear for a people who understand. |
| 030:028 Pickthal | : |
He coineth for you a similitude of yourselves. Have ye, from among those whom your right hands possess, partners in the wealth We have bestowed upon you, equal with you in respect thereof, so that ye fear them as ye fear each other (that ye ascribe unto Us partners out of that which We created)? Thus We display the revelations for people who have sense. |
| 030:028 Rashad | : |
He cites for you herein an example from among yourselves: Do you ever elevate your servants or subordinates to the level where they rival you, and to the point that you pay them as much allegiance as is being paid to you? We thus explain the revelations for people who understand. |
| 030:028 Sarwar | : |
God has told you this parable about yourselves: Could your slaves share your wealth equally with you and could you fear them as you fear yourselves? Thus, do We clarify the evidence (of the truth) for the people of understanding. |
| 030:028 Shakir | : |
He sets forth to you a parable relating to yourselves: Have you among those whom your right hands possess partners in what We have given you for sustenance, so that with respect to it you are alike; you fear them as you fear each other? Thus do We make the communications distinct for a people who understand. |
| 030:028 Sherali | : |
HE sets forth for you a parable concerning yourselves.  Thus do WE explain the Signs to a people who understand. |
| 030:028 Yusufali | : |
He does propound to you a similitude from your own (experience): do ye have partners among those whom your right hands possess, to share as equals in the wealth We have bestowed on you? Do ye fear them as ye fear each other? Thus do we explain the Signs in detail to a people that understand. |
Concepts/Themes Covered: أركان الإسلام > التوحيد > الشرك والمشركون > تنزيه الله جلّ جلاله عن الشريك Pillars of Islam> Islamic> Polytheism and the Polytheists> Allah's Freedom from Partnership
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.


Dear Sir/Madam, I am Mr.Peter Jackson of Shanghai Joysky Machinery & Equipment Co, Ltd Import Corporation .We are a company who deal on mechanical equipment,hardware and minerals,electrical products,Medical & Chemicals, light industrial products and office equipment, and export into the Canada/America and Europe.We are exporting our products to our customers in Europe,USA, and some Asian countries for many years. Our company is looking for an agent who can be our purchasing officer.An agent who can be buying materials for our company to finish production and also receiving payments for products supplied. You will be paid for whatever transaction you carry out on behalf of our company, in respect to buying materials/equipments for our company,as well as recieving payment for products/materials supplied. Please if you are interested forward to us your full name, phone number/fax and your full contact addresses. You can reach me via email<EMAIL_ADDRESS>Thanks in advance Mr.Peter Jackson Managing Director.


My cat's favorite toys
These are my cat's favorite toys to play with.
Catnip
Different types of round objects:
ball of yarn
crumpled paper
String
Paper bag
Cardboard box
Favorite hobbies
Sleep
Eat
Meow
Thanks for reading about my cat!
Dark Theme
Light Theme
Original Theme


You are now connected to your LinkedIn account. Click here to see some entries from your LinkedIn feed.


Intro
Are you looking for a portfolio that you can update via API instead of inputing each transaction manually? But you do not trust any external provider with your API keys? Than this project is for you.
What
- 1) Import transactions from CSV files (GDAX, Cryptopia, Binance & Coinbase)
- 2) Import transactions via API (GDAX, Cryptopia & Binance)
- 3) Manual transaction import
- 3) Portfolio page with graphs, coins price, last 24h evolution
- 4) Ledger page with all imported transaction
- 5) A page per coin with current market order on GDAX, Cryptopia & Binance
Installation
- 1) Download & install Octobercms on your local computer or on your server
- 2) Login to the administration panel and download the following plugins:
- 3) From the administration panel download the XX theme
- 4) From the administration panel go to the "XX/exchanges" and add the following (order is important since code is based on IDs):
- - Cryptopia
- - Binance
- - GDAX
- - Coinbase
Technical info
This project is based on Octobercms a Laravel based CMS.
Theme is based on "Octaskin" template from Larafy
Thanks to
- Octobercms
- Larafy (for the theme template)
- u/waveon3 for the overall theme design
Help
Feel free to share your ideas & improvement on reddit:
We would really appreciate help with:
- - the template
- - code review
Any donation is more than welcomed:
- - Doge DNQ2FNybQmU28bejcAKuMJTrFbS41epTcW
- - Eth 0xdbCB7602fBe55C53563400C4827e9f6e6e892690
- - LTC LdJ5JbSHQUgbLGj6xWzxRU1fUd5EfXunHx
- - XMR 45kNrpPZDnjDdnYUj1HFy9HVDVcobL4CwJpwWbhWCNxJbYVBPwFDU4YfFJRtxCzfXkeid5VYFqrC3JSb3rsm4kJPECBNzj4


The Brown Fairy Book
by Andrew Lang
The Sacred Milk of Koumongoe
by Andrew Lang
Additional Information
- Year Published: 1904
- Language: English
- Country of Origin: England
- Source: Lang, A. (Ed.). (1904). The Brown Fairy Book. London: Longmans, Green & Co.
-
Readability:
- Flesch–Kincaid Level: 5.9
- Word Count: 2,935
- Genre: Fairy Tale/Folk Tale
- Keywords: justice, salvation
- ✎ Cite This
Downloads
Far way, in a very hot country, there once lived a man and woman who had two children, a son named Koane and a daughter called Thakane.
Early in the morning and late in the evenings the parents worked hard in the fields, resting, when the sun was high, under the shade of some tree. While they were absent the little girl kept house alone, for her brother always got up before the dawn, when the air was fresh and cool, and drove out the cattle to the sweetest patches of grass he could find.
One day, when Koane had slept later than usual, his father and mother went to their work before him, and there was only Thakane to be seen busy making the bread for supper.
‘Thakane,’ he said, ‘I am thirsty. Give me a drink from the tree Koumongoe, which has the best milk in the world.’
‘Oh, Koane,’ cried his sister, ‘you know that we are forbidden to touch that tree. What would father say when he came home? For he would be sure to know.’
‘Nonsense,’ replied Koane, ‘there is so much milk in Koumongoe that he will never miss a little. If you won’t give it to me, I sha’n’t take the cattle out. They will just have to stay all day in the hut, and you know that they will starve.’ And he turned from her in a rage, and sat down in the corner.
After a while Thakane said to him: ‘It is getting hot, had you better drive out the cattle now?’
 If I have to do without milk, they shall do without grass.’
Thakane did not know what to do. She was afraid to disobey her parents, who would most likely beat her, yet the beasts would be sure to suffer if they were kept in, and she would perhaps be beaten for that too.
‘Here is the milk you wanted,’ said she, going up to Koane, who was still sulking in his corner.
‘What is the use of that?’ grumbled Koane; ‘why, there is not enough to drown a fly.
Trembling with fright, Thakane returned to the tree, and struck it a sharp blow with the axe. In an instant there poured forth such a stream of milk that it ran like a river into the hut.
‘Koane! Koane!’ cried she, ‘come and help me to plug up the hole. There will be no milk left for our father and mother.’ But Koane could not stop it any more than Thakane, and soon the milk was flowing through the hut downhill towards their parents in the fields below.
The man saw a white stream a long way off, and guessed what had happened.
‘Wife, wife,’ he called loudly to the woman, who was working at a little distance: ‘Do you see Koumongoe running fast down the hill? That is some mischief of the children’s, I am sure. I must go home and find out what is the matter.’ And they both threw down their hoes and hurried to the side of Koumongoe.
Kneeling on the grass, the man and his wife made a cup of their hands and drank the milk from it. And no sooner had they done this, than Koumongoe flowed back again up the hill, and entered the hut.
‘Thakane,’ said the parents, severely, when they reached home panting from the heat of the sun, ‘what have you been doing? Why did Koumongoe come to us in the fields instead of staying in the garden?’
‘It was Koane’s fault,’ answered Thakane. ‘He would not take the cattle to feed until he drank some of the milk from Koumongoe. So, as I did not know what else to do, I gave it to him.’
The father listened to Thakane’s words, but made no answer. Instead, he went outside and brought in two sheepskins, which he stained red and sent for a blacksmith to forge some iron rings. The rings were then passed over Thakane’s arms and legs and neck, and the skins fastened on her before and behind. When all was ready, the man sent for his servants and said:
‘I am going to get rid of Thakane.’
‘Get rid of your only daughter?’ they answered, in surprise. ‘But why?’
‘Because she has eaten what she ought not to have eaten. She has touched the sacred tree which belongs to her mother and me alone.’ And, turning his back, he called to Thakane to follow him, and they went down the road which led to the dwelling of an ogre.
They were passing along some fields where the corn was ripening, when a rabbit suddenly sprang out at their feet, and standing on its hind legs, it sang:
Why do you give to the ogre Your child, so fair, so fair?
‘You had better ask her,’ replied the man, ‘she is old enough to give you an answer.’
Then, in her turn, Thakane sang:
I gave Koumongoe to Koane, Koumongoe to the keeper of beasts; For without Koumongoe they could not go to the meadows: Without Koumongoe they would starve in the hut; That was why I gave him the Koumongoe of my father.
And when the rabbit heard that, he cried: ‘Wretched man! it is you whom the ogre should eat, and not your beautiful daughter.’
But the father paid no heed to what the rabbit said, and only walked on the faster, bidding Thakane to keep close behind him. By-and-by they met with a troop of great deer, called elands, and they stopped when they saw Thakane and sang:
Why do you give to the ogre Your child, so fair, so fair?
‘You had better ask her, replied the man, ‘she is old enough to give you an answer.’
Then, in her turn, Thakane sang:
I gave Koumongoe to Koane, Koumongoe to the keeper of beasts; For without Koumongoe they could not go to the meadows: Without Koumongoe they would starve in the hut; That was why I gave him the Koumongoe of my father.
And the elands all cried: ‘Wretched man! it is you whom the ogre should eat, and not your beautiful daughter.’
By this time it was nearly dark, and the father said they could travel no further that night, and must go to sleep where they were. Thakane was thankful indeed when she heard this, for she was very tired, and found the two skins fastened round her almost too heavy to carry. So, in spite of her dread of the ogre, she slept till dawn, when her father woke her, and told her roughly that he was ready to continue their journey.
Crossing the plain, the girl and her father passed a herd of gazelles feeding.
‘You had better ask her, replied the man, ‘she is old enough to answer for herself.’
Then, in her turn, Thakane sang:
I gave Koumongoe to Koane, Koumongoe to the keeper of beasts; For without Koumongoe they could not go to the meadows: Without Koumongoe they would starve in the hut; That was why I gave him the Koumongoe of my father.
And the gazelles all cried: ‘Wretched man! it is you whom the ogre should eat, and not your beautiful daughter.’
At last they arrived at the village where the ogre lived, and they went straight to his hut. He was nowhere to be seen, but in his place was his son Masilo, who was not an ogre at all, but a very polite young man. He ordered his servants to bring a pile of skins for Thakane to sit on, but told her father he must sit on the ground. Then, catching sight of the girl’s face, which she had kept down, he was struck by its beauty, and put the same question that the rabbit, and the elands, and the gazelles had done.
Thakane answered him as before, and he instantly commanded that she should be taken to the hut of his mother, and placed under her care, while the man should be led to his father. Directly the ogre saw him he bade the servant throw him into the great pot which always stood ready on the fire, and in five minutes he was done to a turn. After that the servant returned to Masilo and related all that had happened.
Now Masilo had fallen in love with Thakane the moment he saw her. At first he did not know what to make of this strange feeling, for all his life he had hated women, and had refused several brides whom his parents had chosen for him. However, they were so anxious that he should marry, that they willingly accepted Thakane as their daughter-in-law, though she did not bring any marriage portion with her.
After some time a baby was born to her, and Thakane thought it was the most beautiful baby that ever was seen. But when her mother-in-law saw it was a girl, she wrung her hands and wept, saying:
‘O miserable mother! Miserable child! Alas for you! why were you not a boy!’
Thakane, in great surprise, asked the meaning of her distress; and the old woman told her that it was the custom in that country that all the girls who were born should be given to the ogre to eat.
Then Thakane clasped the baby tightly in her arms, and cried:
‘But it is not the customer in MY country! There, when children die, they are buried in the earth. No one shall take my baby from me.’
That night, when everyone in the hut was asleep, Thakane rose, and carrying her baby on her back, went down to a place where the river spread itself out into a large lake, with tall willows all round the bank. Here, hidden from everyone, she sat down on a stone and began to think what she should do to save her child.
Suddenly she heard a rustling among the willows, and an old woman appeared before her.
‘What are you crying for, my dear?’ said she.
And Thakane answered: ‘I was crying for my baby—I cannot hide her forever, and if the ogre sees her, he will eat her; and I would rather she was drowned than that.’
‘What you say is true,’ replied the old woman. ‘Give me your child, and let me take care of it. And if you will fix a day to meet me here I will bring the baby.’
Then Thakane dried her eyes, and gladly accepted the old woman’s offer. When she got home she told her husband she had thrown it in the river, and as he had watched her go in that direction he never thought of doubting what she said.
On the appointed day, Thakane slipped out when everybody was busy, and ran down the path that led to the lake. As soon as she got there, she crouched down among the willows, and sang softly:
Bring to me Dilah, Dilah the rejected one, Dilah, whom her father Masilo cast out!
And in a moment the old woman appeared holding the baby in her arms. Dilah had become so big and strong, that Thakane’s heart was filled with joy and gratitude, and she stayed as long as she dared, playing with her baby. At last she felt she must return to the village, lest she should be missed, and the child was handed back to the old woman, who vanished with her into the lake.
Children grow up very quickly when they live under water, and in less time than anyone could suppose, Dilah had changed from a baby to a woman. Her mother came to visit her whenever she was able, and one day, when they were sitting talking together, they were spied out by a man who had come to cut willows to weave into baskets. He was so surprised to see how like the face of the girl was to Masilo, that he left his work and returned to the village.
 We have been deceived, for we all thought she was dead.’
When he heard this, Masilo tried to look shocked because his wife had broken the law; but in his heart he was very glad.
‘But what shall we do now?’ asked he.
‘Make sure for yourself that I am speaking the truth by hiding among the bushes the first time Thakane says she is going to bathe in the river, and waiting till the girl appears.’
For some days Thakane stayed quietly at home, and her husband began to think that the man had been mistaken; but at last she said to her husband: ‘I am going to bathe in the river.’
‘Well, you can go,’ answered he. But he ran down quickly by another path, and got there first, and hid himself in the bushes. An instant later, Thakane arrived, and standing on the bank, she sang:
Bring to me Dilah, Dilah the rejected one, Dilah, whom her father Masilo cast out!
Then the old woman came out of the water, holding the girl, now tall and slender, by the hand. And as Masilo looked, he saw that she was indeed his daughter, and he wept for joy that she was not lying dead in the bottom of the lake. The old woman, however, seemed uneasy, and said to Thakane: ‘I feel as if someone was watching us. I will not leave the girl to-day, but will take her back with me’; and sinking beneath the surface, she drew the girl after her. After they had gone, Thakane returned to the village, which Masilo had managed to reach before her.
 And his mother passed on, and left him alone.
In the evening he said to his wife: ‘I have seen my daughter, in the place where you told me you had drowned her. Instead, she lives at the bottom of the lake, and has now grown into a young woman.’
‘I don’t know what you are talking about,’ replied Thakane. ‘I buried my child under the sand on the beach.’
Then Masilo implored her to give the child back to him; but she would not listen, and only answered: ‘If I were to give her back you would only obey the laws of your country and take her to your father, the ogre, and she would be eaten.’
But Masilo promised that he would never let his father see her, and that now she was a woman no one would try to hurt her; so Thakane’s heart melted, and she went down to the lake to consult the old woman.
‘What am I to do?’ she asked, when, after clapping her hands, the old woman appeared before her. ‘Yesterday Masilo beheld Dilah, and ever since he has entreated me to give him back his daughter.’
‘If I let her go he must pay me a thousand head of cattle in exchange,’ replied the old woman. And Thakane carried her answer back to Masilo.
‘Why, I would gladly give her two thousand!’ cried he, ‘for she has saved my daughter.’ And he bade messengers hasten to all the neighbouring villages, and tell his people to send him at once all the cattle he possessed. When they were all assembled he chose a thousand of the finest bulls and cows, and drove them down to the river, followed by a great crowd wondering what would happen.

And Dilah came from the waters holding out her hands to Masilo and Thakane, and in her place the cattle sank into the lake, and were driven by the old woman to the great city filled with people, which lies at the bottom.


Toggle navigation
DF
|
Full Stack Web Developer
Back to the Home Page
Call Daniel
Children's message of the day:
{{clr.message}} {{clr.message2}}
Field1:
Field2:
Copy Text
Click Me
{{post.id}} monkey(s) jumping on the bed. {{post.id}} fell down. Mommy called the doctor and the doctor said "No more jumping on the bed."


Class jala.ImageFilter
Object
|
+--jala.ImageFilter
- class
jala.ImageFilter
This class provides several image manipulating
methods. Most of this filter library is based on filters created
by Janne Kipinš for JAlbum. For more information have a look
at http://www.ratol.fi/~jakipina/java/
Defined in ImageFilter.js
|
Constructor Summary |
jala.ImageFilter
(<Object> img)
Constructs a new ImageFilter object
|
|
Method Summary |
void
|
gaussianBlur(<Number> radius, <Number> amount)
Performs a gaussian blur operation on the image
|
byte[]
|
getBytes()
Returns the wrapped image as byte array, to use eg.
|
helma.image.ImageWrapper
|
getImage()
Returns the image that has been worked on
|
void
|
sharpen(<Number> amount)
Sharpens the image using a plain sharpening kernel.
|
void
|
unsharpMask(<Number> radius, <Number> amount)
Performs an unsharp mask operation on the image
|
jala.ImageFilter
jala.ImageFilter(<Object> img)
Constructs a new ImageFilter object
Parameters:
img
- Either - an instance of helma.image.ImageWrapper
- the path to the image file as String
- an instance of helma.File representing the image file
- an instance of java.io.File representing the image file
gaussianBlur
void gaussianBlur(<Number> radius, <Number> amount)
Performs a gaussian blur operation on the image
getBytes
byte[] getBytes()
Returns the wrapped image as byte array, to use eg. in conjunction
with res.writeBinary()
Returns:
The wrapped image as byte array
getImage
helma.image.ImageWrapper getImage()
Returns the image that has been worked on
Returns:
An instance of helma.image.ImageWrapper
sharpen
void sharpen(<Number> amount)
Sharpens the image using a plain sharpening kernel.
Parameters:
amount
- The amount of sharpening to apply
unsharpMask
void unsharpMask(<Number> radius, <Number> amount)
Performs an unsharp mask operation on the image
Documentation generated by
JSDoc on Tue Jan 8 15:45:31 2008


Lack of Affordable Housing
In King County, it is difficult for low-income individuals and families to find housing. For a two-bedroom unit in King County, a worker must earn over $17 per hour to afford, making it nearly unattainable for poor families.
Limited Access to Mental Health Support
Mental illness is an affliction which can affect anyone in a severe way, making individuals unable to care of necessary daily responsibilities and limit their ability to form stable relationships. Mental health services combat both mental illness and homelessness, making it an important policy issue.
Lack of support
A single crisis can bring an individual to homelessness.  Families, churches, neighborhoods, and other community resources can act as a support network


| DOSE: |
360 mg |
oral |
DXM |
(pill / tablet) |
| |
|
oral |
Chlorpheniramine Maleate |
|
I'm going to start off with a background of my drug experience. I've been smoking pot for the last 2 years or so, and I've done ecstacy 5 times, done acid 3 times, and done DXM once before the following experience.
The first time, I had a good trip, or 'swirl' as my friends like to call the effects of DXM. I took 15 [Coricidin Cold & Cough] the first time, and felt fine, and had a good time. I expected this time to be much the same.
I was on a full stomach, and feeling a bit upset to my stomach as well, and I took the 12 caps, all at once, around 4:30 PM. I was with a couple of my friends, J and R, and my girlfriend, B. We were all at B's house, and hers was already kicking in, having been taken about an hour earlier. She was tripping nicely at this point, and in a very good mood.
Before mine kicked in, J and R had B convinced that World War III was happening, and that we all need to get to shelter. I told her, though, that everything was ok, and that we weren't at war, nor are we going to die. Mine still had not taken affect at this point. It was around 5:30
Mine didn't kick in until about 2 hours after I took it, around 6:30. I was in the bathroom, washing my hands, and all of a sudden, I looked up at the mirror, and the room was spinning, and my reflection was deep in the mirror, at the end of what looked like a long hall in the mirror. I went back out, into B's kitchen, and got a notebook which was lying on the counter. B and I went outside to smoke a cigarette, as I wrote. By this time, I was just feeling very depressed, and I felt as if I was doing something horrible, and unforgivable, and this made me an equally horrible person. I wrote an entire page on this theme.
We both, then, went back up to her room, as R and J went on the internet in the next room. I read to her what I had written, and she got very scared for me. It was just evidence that I was very depressed; nothing really bad.
After this, at about 8:00, R and J decided they wanted to go drive and get some pot. We drove, and B and I sat in the back seat, and I just stared out the window, unable to feel anything. The world went by, and there seemed to be nothing I could do to make any difference in any of it. It was like I was in a dream, and I would soon wake up, with nothing changed. I couldn't feel a thing, physically, or emotionally. B was getting concerned, and scared for my well being, as I wouldn't say a word, except that I was ok, and that I would explain everything I was feeling to her later.
After we got back, at around 9:00, I still couldn't feel anything, and it didn't even seem like B and I were together. It felt like we were semi-good friends. We are normally an extremely affectionate couple. Soon, she went to her room, to listen to music, and I tried to help J write an email to his girlfriend. Trying to do this was the most difficult task I've ever attempted. I could not hit the correct key, no matter how hard I tried. My coordination was completely gone. I soon gave up, and decided to go check on B, to see if she was ok. I found her sitting in her closet, listening to Staind, crying. She was angry, sad, and empty. Almost as empty as me. She began to alternate between utter rage, and nothingness.
We both went back to the computer room, having difficulty walking down the hall, but we eventually made it. We got there, and, until about 10:15, we just touched each other's arms, and tried to feel again. It was awful. The presence of her fingers was evident, but it couldn't be described as good or bad. I was just empty, and emotionless. It was a strain to even smile.
I finally started to come down around 10:30, when I had to leave, to go back home. I actually started to feel extraordinarily good, and relaxed. It was more like this the first time, a week and a half before, when I tried DXM for the first time. I got home, and fell asleep quickly, listening to Christopher Lawrence, a trance DJ I like alot.
The day after, I woke up feeling very uncomfortable, shaking, and unable to eat. It was very scary, but I made it through quite okay. I went back to hang out with, and to talk about the previous day with the same people I was with the day before.
I wouldn't necessarily reccomend this to anyone, who has trouble with drastic after-effects the morning after. Also, if you do decide to take this drug, make sure youre very healthy when you do, and make sure you stay in a good mind set before and during the trip. DONNOT TAKE ON A FULL STOMACH!
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Content Area
OK, so if you can see this, your ready to begin working on your web project.
Sidebar
Here is a sidebar, you can use this to list content aside from the main content.
OK, so if you can see this, your ready to begin working on your web project.
Here is a sidebar, you can use this to list content aside from the main content.


Copyright (c) 2003-2006 by The BioBike Team (contact<EMAIL_ADDRESS>for more information)
This short tour of BioBike is intended to get users started. Once you have completed this tour, you can request an account on the "real" server by filling in the form accessible from the demo server login page.
The BioBike web service is called a "Listener" because it listens to your commands and executes them. Once you're successfully logged in to BioBike, you'll be talking directly to the Web Listener! Aside from the buttons on the bottom, there are three basic parts to this page:
The entry and eval boxes do nearly the same thing. Anything that you can type into one, you can type into the other, and it will work just the same way. The only differences are how you get the listener to evaluate what you've entered. To get commands that you've entered into the command entry box evaluated, you hit ENTER (or press the ENTER button on the right of the box). To get what you type into the larger, expression entry box evaluated, you have to click on the EVAL button that's just underneath it.
The first thing that we need to do is to get access to the knowledge about an organism. Let's use Synechocystis (pcc 6803) as our example organism. Before referring to knowledge about an organism, you have to "load" it, using the LOAD-ORGANISM function. We'll also save the result in a variable for easy reference:
>> (setf syn (load-organism "syn6803")) :: ... maybe lots of junk printed out here ... :: #$synechocystis_pcc6803(Lines preceded by >> are ones that you are supposed to enter. You can enter these into either the command box and press ENTER, or the expression box and press EVAL. Don't enter the ">>" part, that's just to indicate what you're supposed to enter. The easiest way to do this is to cut and paste from the tutorial into the listener. Output is similarly preceded by ::)
Notice that you got back a lot of uninterpretable output, and the final result is this odd looking thing with a #$ in front of it. This is another data type (along with numbers, symbols, and lists), called a "frame", and is special to BioBike. A frame is a unit of knowledge. We'll work a lot more with frames as we get into biological examples.
So, we've seen that LOAD-ORGANISM loads up the knowledge for Synechocystis, and we got back this frame thing, which is now the value of the symbol SYN. Now all you need to do to get to the organism knowledge is to use SYN.
Example:
>> (length (#^genes syn)) :: 3721
Notice that in the output above, #$synechocystis_pcc6803 is a live (web) link. If you click on it you can browse the contents of the Synechocystis PCC 6803 organism's knowledge! (The PCC 6803 part is a particular species -- or mutant -- of Synechocystis, which is an important model cyanobacterium. Here's a bunch more information about it, with lots of nice pictures!)
So go ahead and click on #$synechocystis_pcc6803. Notice that there are LOTS of slots and they have LOTS of things in them, including other frames! Specifically, each gene is another frame that you can click on to explore its slots, and the things that it connects to, etc. Find the GENES slot of the #$synechocystis_pcc6803 frame and click on the first gene (#$S6803.slr0612). Notice that the gene has a slot called "GO-ID", and that its value is a list with one entry: #$Go.LyaseActivity. If you click on that you'll be browsing the Gene Ontology knowledge backbone.
Explore, but don't get too lost, and back up to the BioBike Listener eventually using repeated BACKs or the 'Listener' link under the page title.
Let's try to find the Synechocystis gene for gluokinase, using one of BioBike's searching function:
>> (find-frames "Glucokinase") :: (#$Go.GlucokinaseActivity #$Go.PhosphoglucokinaseActivity)
FIND-FRAMES returns a list of all the frames that contain the exact string we gave. It looks like the frame we want is called #$Go.GlucokinaseActivity.
Let's look at the contents of the GO's GlucokinaseActivity frame:
>> (df #$go.GlucokinaseActivity) :: Slots of #$Go.GlucokinaseActivity: #$go.related-genes: (#$S6803.sll0593) #$GO.products: (#$Mol.Adp #$Mol.D-Glucose6-Phosphate) #$GO.reactants: (#$Mol.Atp #$Mol.D-Glucose) #$GO.DBXRefs: (("EC" "<IP_ADDRESS>") ("MetaCyc" "GLUCOKIN-RXN") ("InterPro" "IPR003836") ("InterPro" "IPR004654") ("HAMAP" "MF_00524") ("Pfam" "PF02685 Glucokinase") ("TIGR_TIGRFAMS" "TIGR00749 glucokinase")) #$GO.ECRef: (#$Ec.<IP_ADDRESS>) #$isA: (#$GO.Reaction #$Go.CarbohydrateKinaseActivity #$Go.PhosphotransferaseActivity,AlcoholGroupAsAcceptor) #$GO.definition: "Catalysis of the reaction: ATP + D-glucose = ADP + D-glucose 6-phosphate." #$GO.prettyname: "glucokinase activity" #$GO.goid: 4340DF is a function that describes the contents of a frame. (This is similar to clicking on the link, but it prints it out instead of actually going to a new page.) Notice that there's only one gene for Synechocystis in this category (in the #$go.related-genes slot: (#$S6803.sll0593)) and that the GO frame actually has a lot of information, including the reactants and products for the reaction for Glucokinase! Explore these by clicking through them into the frame browser.
Suppose that we want to find all the genes in Synechocystis 6803 that are involved in glycolysis. We know how to do that already by carefully examining the slot names in the above, and using what we've learned:
>> (#^go.related-genes #$go.glycolysis) :: (#$S6803.slr0752 #$S6803.sll1342 #$S6803.sll0745 #$S6803.sll0587 ...etc...But what if we wanted only the kinases involved in glycolysis? We can get the kinases like this (you might be able to figure this out by yourself!):
>> (#^go.related-genes #$go.kinaseactivity) :: ... a really long list ....How can we find those that are on BOTH lists? That is, the intersection of those lists? Well, as it turns out, Lisp has an INTERSECTION function called, oddly enough, INTERSECTION, so let's use it:
>> (intersection (#^go.related-genes #$go.glycolysis) (#^go.related-genes #$go.kinaseactivity)) :: (#$S6803.sll1196 #$S6803.sll1275 #$S6803.slr0394 #$S6803.sll0593 #$S6803.sll0587 #$S6803.sll0745 #$A7120.alr2973 #$A7120.all4131 #$A7120.all7335)(Since this is a more than one line long, you'll have to put it in the larger eval box, and press [EVAL] to get it to work. Your results may be somewhat different that the above because the database might have changed since we wrote this example. That's ok.)
Let's do that again, setting some variables along the way so that we can use them later on.
>> (setf glycolytic-genes (#^go.related-genes #$go.glycolysis)) >> (setf kinases (#^go.related-genes #$go.kinaseactivity)) >> (intersection glycolytic-genes kinases) :: (#$S6803.sll1196 #$S6803.sll1275 #$S6803.slr0394 #$S6803.sll0593 ... etc ...
Let's assign this list of genes to a symbol so that we can use it, and then let's get a couple of the genes individually to work with:
>> (setf gk-genes *) (* refers to the just previous result) >> (setf g1 (first gk-genes) g2 (second gk-genes)) (notice that you can put multiple assignments in the same SETF although you only get the last one back as a result, they both get set)Now, suppose that we want the sequence of one of these genes. No problem:
>> (extract-sequence g1) :: "ATGGGGGAAATTAAACGCATTGGTATTT ... and so on ...  The first thing we'll do is grab a small part of the gene sequence for expository purposes:
>> (setq g1-init (subseq g1s 0 30)) :: "ATGGGGGAAATTAAACGCATTGGTATTTTA"Now we'll do something biologically specific -- complement the nucleotide sequence (note that it's both complemented and reversed!):
>> (nt-complement g1-init) :: "TAAAATACCAATGCGTTTAATTTCCCCCAT"There is a built in function in BioBike, called ALIGN, that will align two or more sequences. It uses the CLUSTAL tool, which is a standard tool used by the BioInformatics community. Watch:
>> (align '("the rain in spain falls mainly on the plain" "the plain in spain is mainly in the rain")) :: #$ClustalWResult1The result is a frame. To actually see the alignments, you have to either click to the frame browser on that frame, or use the #^ accessor to get the alignment from the frame. We'll use the DF function that we learned earlier to see all the slots in the frame.
(df *) :: Slots of #$ClustalWResult25: #$fName: "ClustalWResult25" #$consensus: "*** **********: ::******* **** :***" #$alignments: (("the rain in spain falls mainly on the plain" "THER-AININSPAINFALLSMAINLY-NTHEPLAIN") ("the plain in spain is mainly in the rain" "THEPLAININSPAIN---ISMAINLYINTHER-AIN")) #$instanceOf: #$ClustalWResult NILThe alignment itself lives in a slot called #^alignments. This is a bit confusing because CLUSTAL removes all the spaces from the strings it aligns and even uppercases all the letters (which makes sense when doing Biology, but not so with English!). If you look closely you'll see that the two strings sans spaces are both there and aligned so that most of the characters match. There is also a consensus string, which tells us where the strings matched exactly (*).
Let's align the two genes that we selected. ALIGN calls ClustalW on a list of things that have sequences (genes, proteins, or whatever). So...
>> (setq cr (align (list g1 g2))) :: #$ClustalWResult1 >> (#^alignments cr) :: ((#$S6803.sll1196 "[lots of dashes --- left out here] -------ATGGGGGAAATTAAACGCATTGGTATTAACC--AGTGGAGGAGACTGTGCCGGACTAAACGCCGTAAT ..." (#$S6803.sll1275 "[lots of characters left out here] CTGGACCAAGGGGTGGACTGGGTGGCCCTGAGTTGTTCGTAATCCCCAGGATATTGATGAGATTAAGGGGTTAAT ..."))You'll have to scroll over quite a ways to see where they align because one sequence is much longer than the other and CLUSTAL decided that the best alignment matched the ends of both sequences, not the beginnings. Perhaps not the world's best alignment, but not the worst either.
Now, of course we actually have the list of ALL the genes that are glycolysis-related kinases; we left that in the symbol called GK-GENES. How about aligning all of those just for yucks:
>> (#^consensus (align gk-genes)) :: ... a real long string of mostly blanks -- not very interesting! ...One thing to notice is that we've been working with genes from different organisms. This brings up an interesting idea: Since the related-genes slots of the GO frames contain genes from various organisms, we can use the GO as a sort of lingua franca -- or "common language" to inter-translate gene functions between organisms. Let's look at the genes that catalyze the glucokinase reaction:
>> (find-frames "glucokin") :: (#$Go.GlucokinaseActivity #$GlucokinaseActivity #$Go.PhosphoglucokinaseActivity) >> (setf gkframe (first *)) >> (#^go.related-genes gkframe) :: (#$A7120.alr2973 #$S6803.sll0593)Just for fun, let's align those:
>> (#^alignments (align (#^go.related-genes gkframe))) :: ((#$A7120.alr2973 "-------ATGACCTTA---TTGTTAGCAGGAGATATCGGCG...") (#$S6803.sll0593 "GGGGGCCATGGGCGTAAATTTTTTGGCAGGGGATATCGGCG..."))
Now, BioBike is an actual programming language, so we can use it to actually write programs. Let's write a simple one that does something slightly useful. One could, given a whole series of genes, figure out which ones were best aligned to one another. E.g., among ten genes, determine which pair are closest. One way to do this (although not the most efficient way) is to align every pair, and score the alignment, and then pick the pair that work best. Even though this isn't the best way to do that -- it would be very slow for a lot of genes! -- let's do it this way just to show off BioBike.
First we need to know how to score an alignment. We saw that along with the #^alignments slot in the ALIGN result frame, you get a #^consensus slot, and that it has '*' every place that the alignment is perfect. So, one way to do score the alignment is to figure out the percentage of the consensus that is stars.
Try this:
>> (setq c (#^consensus (align (list g1 g2)))) :: " *** ** * ... etc ..." ;[ Again the matches are way over to the right, scrolled off the screen ] >> (count #\* c) :: 522 ; This is the number of stars!! >> (length c) :: 1790 ; This is the total number of possible matches >> (* 100.0 (/ (count #\* c) (length c))) :: 29.16201 ; The ratio of perfect matches to possible, as a percentSimple as that! So, there are 522 stars in a consensus of 1790 total characters, or about 29%. Let's turn this into a function:
>> (defun score-alignment (genes) (let ((c (#^consensus (align genes)))) (* 100.0 (/ (count #\* c) (length c))))) :: SCORE-ALIGNMENTWe just created our own function, called SCORE-ALIGNMENT, which we can call just like any other function. Let's test it:
>> (score-alignment (list g1 g2)) :: 29.248554Ok. We'll use it for real in just a minute...
Now we need to be able to create all possible pairs of genes from the list of genes we are comparing.
Here's a way to create every pair from a list of items:
(defun every-pair (list) (cond ((null (cdr list)) nil) (t (append (mapcar (lambda (next) (list (car list) next)) (rest list)) (every-pair (cdr list))))))Put this into the long expression box and evaluate it.
(In fact, there's already a BioBike utility function that does this; it's called ALL-UNORDERED-PAIRS, and you might have found it by typing
(help "pair")but that's a topic for another essay!)
Let's try it out too:
>> (every-pair '(a s d f)) :: ((A S) (A D) (A F) (S D) (S F) (D F))Okay, that looks right. Now we're almost ready. Recall that GK-GENES is our list of all glycolysis-related kinase genes which we obtained at the very start of this tutorial.
>> gk-genes :: (#$S6803.sll1196 #$S6803.sll1275 #$S6803.slr0394 #$S6803.sll0593 #$S6803.sll0587 #$S6803.sll0745 #$A7120.alr2973 #$A7120.all4131 #$A7120.all7335) >> (length gk-genes) :: 9(Note: We don't want to be aligning hundreds or thousands of pair of genes, at least now it this tutorial! So if the number of genes you get is more than 9, do this:
>> (setq gk-genes (first-n 9 gk-genes)) :: <<<< shorter list of genes >>>>)
Now we're really ready! Let's put our new functions together, looping over every pair and aligning/scoring each pair (even with 9 genes this will take a minute or two):
>> (loop for pair in (every-pair gk-genes) collect (list pair (score-alignment pair))) :: (((#$S6803.sll1196 #$S6803.sll1275) 29.248554) ((#$S6803.sll1196 #$S6803.slr0394) 40.41096) ((#$S6803.sll1196 #$S6803.sll0593) 42.201836) ((#$S6803.sll1196 #$S6803.sll0587) 33.789627) ((#$S6803.sll1196 #$S6803.sll0745) 53.900707) ((#$S6803.sll1196 #$A7120.alr2973) 39.262062) ((#$S6803.sll1196 #$A7120.all4131) 38.71795) ((#$S6803.sll1196 #$A7120.all7335) 64.72832) ((#$S6803.sll1275 #$S6803.slr0394) 30.346819) ((#$S6803.sll1275 #$S6803.sll0593) 27.125505) ((#$S6803.sll1275 #$S6803.sll0587) 44.83555) ((#$S6803.sll1275 #$S6803.sll0745) 27.324587) ((#$S6803.sll1275 #$A7120.alr2973) 25.580046) ((#$S6803.sll1275 #$A7120.all4131) 30.17888) ((#$S6803.sll1275 #$A7120.all7335) 27.056778) ((#$S6803.slr0394 #$S6803.sll0593) 40.63812) ((#$S6803.slr0394 #$S6803.sll0587) 37.6259) ((#$S6803.slr0394 #$S6803.sll0745) 41.191273) ((#$S6803.slr0394 #$A7120.alr2973) 37.925167) ((#$S6803.slr0394 #$A7120.all4131) 70.01718) ((#$S6803.slr0394 #$A7120.all7335) 38.115097) ((#$S6803.sll0593 #$S6803.sll0587) 36.357094) ((#$S6803.sll0593 #$S6803.sll0745) 39.316986) ((#$S6803.sll0593 #$A7120.alr2973) 57.945736) ((#$S6803.sll0593 #$A7120.all4131) 39.678513) ((#$S6803.sll0593 #$A7120.all7335) 41.38889) ((#$S6803.sll0587 #$S6803.sll0745) 35.507248) ((#$S6803.sll0587 #$A7120.alr2973) 31.860971) ((#$S6803.sll0587 #$A7120.all4131) 36.52609) ((#$S6803.sll0587 #$A7120.all7335) 34.099068) ((#$S6803.sll0745 #$A7120.alr2973) 40.124557) ((#$S6803.sll0745 #$A7120.all4131) 41.54104) ((#$S6803.sll0745 #$A7120.all7335) 50.847458) ((#$A7120.alr2973 #$A7120.all4131) 36.417656) ((#$A7120.alr2973 #$A7120.all7335) 43.35206) ((#$A7120.all4131 #$A7120.all7335) 38.297874))Woohoo! Quick! Save it! (If we'd been thinking ahead, we'd have saved it when we created it by setq'ing or setf'ing a variable to the result of the expression that we started with. Oh well. No loss.)
>> (setq scores *)Okay, so now we need to find the best. That's pretty easy: just sort it and take the first one:
>> (setq sorted-scores (sort scores '> :key 'second)) :: (((#$S6803.slr0394 #$A7120.all4131) 70.01718) ((#$S6803.sll1196 #$A7120.all7335) 64.72832) ((#$S6803.sll0593 #$A7120.alr2973) 57.945736) ... etc ...Notice that they're now sorted! So the first one, i.e.: (FIRST SORTED-SCORES), is the best match. You can check, just for fun, that these are actually orthologs by clicking on them and reading the GO-IDs. In the case above, the two genes: #$S6803.slr0394, and #$A7120.all4131, whose overlap is 70% both turn out to be Phosphoglycerate Kinase!
Okay, let's put it all together, from the very beginning!
(defun best-related-gene-pair (genes) "Given a gene ontology category, like #$go.glycolysis, figure out the pair of genes among all those in the category that are most closely related, by alignment." (first (sort (loop for pair in (every-pair genes) collect (list pair (score-alignment pair))) '> :key 'second)))Go ahead and try it! It'll take a while....
>> (best-related-gene-pair gk-genes) ::Go ahead and click on the resulting best pair to see what they are. How well did it work?
Okay, well, that's a very gentle introduction to BioBike. There a LOT more that you can do with this powerful biocomputing environment. There are many more examples in the rest of the BioBike documentation.
(In fact, come to think of it, there is an infinitude of things you can do since it's a programming language! So what you can do it limited only by your imagination!)
Have fun!


|
rapidjson
A fast JSON parser/generator for C++ with both SAX/DOM style API
|
Represents a JSON value. Use Value for UTF8 encoding and default allocator. More...
#include <document.h>
Classes | |
| struct | Array |
| union | Data |
| struct | Member |
| Name-value pair in an object. More... | |
| union | Number |
| struct | Object |
| struct | String |
Public Types | |
| typedef Encoding | EncodingType |
| Encoding type from template parameter. | |
| typedef Allocator | AllocatorType |
| Allocator type from template parameter. | |
| typedef Encoding::Ch | Ch |
| Character type derived from Encoding. | |
| typedef Member * | MemberIterator |
| Member iterator for iterating in object. | |
| typedef const Member * | ConstMemberIterator |
| Constant member iterator for iterating in object. | |
| typedef GenericValue * | ValueIterator |
| Value iterator for iterating in array. | |
| typedef const GenericValue * | ConstValueIterator |
| Constant value iterator for iterating in array. | |
Public Member Functions | |
| template<typename Handler > | |
| GenericValue & | Accept (Handler &handler) |
| Generate events of this value to a Handler. | |
Assignment operators | |
| GenericValue & | operator= (GenericValue &rhs) |
| Assignment with move semantics. | |
| template<typename T > | |
| GenericValue & | operator= (T value) |
| Assignment with primitive types. | |
Type | |
| Type | GetType () const |
| bool | IsNull () const |
| bool | IsFalse () const |
| bool | IsTrue () const |
| bool | IsBool () const |
| bool | IsObject () const |
| bool | IsArray () const |
| bool | IsNumber () const |
| bool | IsInt () const |
| bool | IsUint () const |
| bool | IsInt64 () const |
| bool | IsUint64 () const |
| bool | IsDouble () const |
| bool | IsString () const |
Null | |
| GenericValue & | SetNull () |
Bool | |
| bool | GetBool () const |
| GenericValue & | SetBool (bool b) |
Object | |
| GenericValue & | SetObject () |
| Set this value as an empty object. | |
| GenericValue & | operator[] (const Ch *name) |
| Get the value associated with the object's name. | |
| const GenericValue & | operator[] (const Ch *name) const |
| ConstMemberIterator | MemberBegin () const |
| Member iterators. | |
| ConstMemberIterator | MemberEnd () const |
| MemberIterator | MemberBegin () |
| MemberIterator | MemberEnd () |
| bool | HasMember (const Ch *name) const |
| Check whether a member exists in the object. | |
| GenericValue & | AddMember (GenericValue &name, GenericValue &value, Allocator &allocator) |
| Add a member (name-value pair) to the object. | |
| GenericValue & | AddMember (const char *name, Allocator &nameAllocator, GenericValue &value, Allocator &allocator) |
| GenericValue & | AddMember (const char *name, GenericValue &value, Allocator &allocator) |
| template<typename T > | |
| GenericValue & | AddMember (const char *name, T value, Allocator &allocator) |
| bool | RemoveMember (const Ch *name) |
| Remove a member in object by its name. | |
Array | |
| GenericValue & | SetArray () |
| Set this value as an empty array. | |
| SizeType | Size () const |
| Get the number of elements in array. | |
| SizeType | Capacity () const |
| Get the capacity of array. | |
| bool | Empty () const |
| Check whether the array is empty. | |
| void | Clear () |
| Remove all elements in the array. | |
| GenericValue & | operator[] (SizeType index) |
| Get an element from array by index. | |
| const GenericValue & | operator[] (SizeType index) const |
| ValueIterator | Begin () |
| Element iterator. | |
| ValueIterator | End () |
| ConstValueIterator | Begin () const |
| ConstValueIterator | End () const |
| GenericValue & | Reserve (SizeType newCapacity, Allocator &allocator) |
| Request the array to have enough capacity to store elements. | |
| GenericValue & | PushBack (GenericValue &value, Allocator &allocator) |
| Append a value at the end of the array. | |
| template<typename T > | |
| GenericValue & | PushBack (T value, Allocator &allocator) |
| GenericValue & | PopBack () |
| Remove the last element in the array. | |
Number | |
| int | GetInt () const |
| unsigned | GetUint () const |
| int64_t | GetInt64 () const |
| int64_t | GetUint64 () const |
| double | GetDouble () const |
| GenericValue & | SetInt (int i) |
| GenericValue & | SetUint (unsigned u) |
| GenericValue & | SetInt64 (int64_t i64) |
| GenericValue & | SetUint64 (uint64_t u64) |
| GenericValue & | SetDouble (double d) |
String | |
| const Ch * | GetString () const |
| SizeType | GetStringLength () const |
| Get the length of string. | |
| GenericValue & | SetString (const Ch *s, SizeType length) |
| Set this value as a string without copying source string. | |
| GenericValue & | SetString (const Ch *s) |
| Set this value as a string without copying source string. | |
| GenericValue & | SetString (const Ch *s, SizeType length, Allocator &allocator) |
| Set this value as a string by copying from source string. | |
| GenericValue & | SetString (const Ch *s, Allocator &allocator) |
| Set this value as a string by copying from source string. | |
Friends | |
| class | GenericDocument |
Constructors and destructor. | |
| GenericValue () | |
| Default constructor creates a null value. | |
| GenericValue (Type type) | |
| Constructor with JSON value type. | |
| GenericValue (bool b) | |
| Constructor for boolean value. | |
| GenericValue (int i) | |
| Constructor for int value. | |
| GenericValue (unsigned u) | |
| Constructor for unsigned value. | |
| GenericValue (int64_t i64) | |
| Constructor for int64_t value. | |
| GenericValue (uint64_t u64) | |
| Constructor for uint64_t value. | |
| GenericValue (double d) | |
| Constructor for double value. | |
| GenericValue (const Ch *s, SizeType length) | |
| Constructor for constant string (i.e. do not make a copy of string) | |
| GenericValue (const Ch *s) | |
| Constructor for constant string (i.e. do not make a copy of string) | |
| GenericValue (const Ch *s, SizeType length, Allocator &allocator) | |
| Constructor for copy-string (i.e. do make a copy of string) | |
| GenericValue (const Ch *s, Allocator &allocator) | |
| Constructor for copy-string (i.e. do make a copy of string) | |
| ~GenericValue () | |
| Destructor. |
Represents a JSON value. Use Value for UTF8 encoding and default allocator.
A JSON value can be one of 7 types. This class is a variant type supporting these types.
Use the Value if UTF8 and default allocator
| rapidjson::GenericValue< Encoding, Allocator >::GenericValue | ( | Type | type | ) | [inline] |
Constructor with JSON value type.
This creates a Value of specified type with default content.
| type | Type of the value. |
| rapidjson::GenericValue< Encoding, Allocator >::~GenericValue | ( | ) | [inline] |
Destructor.
Need to destruct elements of array, members of object, or copy-string.
| GenericValue& rapidjson::GenericValue< Encoding, Allocator >::Accept | ( | Handler & | handler | ) | [inline] |
Generate events of this value to a Handler.
This function adopts the GoF visitor pattern. Typical usage is to output this JSON value as JSON text via Writer, which is a Handler. It can also be used to deep clone this value via GenericDocument, which is also a Handler.
| Handler | type of handler. |
| handler | An object implementing concept Handler. |
| GenericValue& rapidjson::GenericValue< Encoding, Allocator >::AddMember | ( | GenericValue< Encoding, Allocator > & | name, |
| GenericValue< Encoding, Allocator > & | value, | ||
| Allocator & | allocator | ||
| ) | [inline] |
Add a member (name-value pair) to the object.
| name | A string value as name of member. |
| value | Value of any type. |
| allocator | Allocator for reallocating memory. |
| void rapidjson::GenericValue< Encoding, Allocator >::Clear | ( | ) | [inline] |
Remove all elements in the array.
This function do not deallocate memory in the array, i.e. the capacity is unchanged.
| SizeType rapidjson::GenericValue< Encoding, Allocator >::GetStringLength | ( | ) | const [inline] |
Get the length of string.
Since rapidjson permits "\u0000" in the json string, strlen(v.GetString()) may not equal to v.GetStringLength().
| GenericValue& rapidjson::GenericValue< Encoding, Allocator >::operator= | ( | GenericValue< Encoding, Allocator > & | rhs | ) | [inline] |
Assignment with move semantics.
| rhs | Source of the assignment. It will become a null value after assignment. |
| GenericValue& rapidjson::GenericValue< Encoding, Allocator >::operator= | ( | T | value | ) | [inline] |
Assignment with primitive types.
| T | Either Type, int, unsigned, int64_t, uint64_t, const Ch* |
| value | The value to be assigned. |
| GenericValue& rapidjson::GenericValue< Encoding, Allocator >::operator[] | ( | SizeType | index | ) | [inline] |
Get an element from array by index.
| index | Zero-based index of element. |
Value a(kArrayType); a.PushBack(123); int x = a[0].GetInt(); // Error: operator[ is ambiguous, as 0 also mean a null pointer of const char* type. int y = a[SizeType(0)].GetInt(); // Cast to SizeType will work. int z = a[0u].GetInt(); // This works too.
| GenericValue& rapidjson::GenericValue< Encoding, Allocator >::PushBack | ( | GenericValue< Encoding, Allocator > & | value, |
| Allocator & | allocator | ||
| ) | [inline] |
Append a value at the end of the array.
| value | The value to be appended. |
| allocator | The allocator for allocating memory. It must be the same one use previously. |
| bool rapidjson::GenericValue< Encoding, Allocator >::RemoveMember | ( | const Ch * | name | ) | [inline] |
Remove a member in object by its name.
| name | Name of member to be removed. |
| GenericValue& rapidjson::GenericValue< Encoding, Allocator >::Reserve | ( | SizeType | newCapacity, |
| Allocator & | allocator | ||
| ) | [inline] |
Request the array to have enough capacity to store elements.
| newCapacity | The capacity that the array at least need to have. |
| allocator | The allocator for allocating memory. It must be the same one use previously. |
| GenericValue& rapidjson::GenericValue< Encoding, Allocator >::SetString | ( | const Ch * | s, |
| SizeType | length | ||
| ) | [inline] |
Set this value as a string without copying source string.
This version has better performance with supplied length, and also support string containing null character.
| s | source string pointer. |
| length | The length of source string, excluding the trailing null terminator. |
| GenericValue& rapidjson::GenericValue< Encoding, Allocator >::SetString | ( | const Ch * | s | ) | [inline] |
Set this value as a string without copying source string.
| s | source string pointer. |
| GenericValue& rapidjson::GenericValue< Encoding, Allocator >::SetString | ( | const Ch * | s, |
| SizeType | length, | ||
| Allocator & | allocator | ||
| ) | [inline] |
Set this value as a string by copying from source string.
This version has better performance with supplied length, and also support string containing null character.
| s | source string. |
| length | The length of source string, excluding the trailing null terminator. |
| allocator | Allocator for allocating copied buffer. Commonly use document.GetAllocator(). |
| GenericValue& rapidjson::GenericValue< Encoding, Allocator >::SetString | ( | const Ch * | s, |
| Allocator & | allocator | ||
| ) | [inline] |
Set this value as a string by copying from source string.
| s | source string. |
| allocator | Allocator for allocating copied buffer. Commonly use document.GetAllocator(). |


[§255-2 Representation on multistate commission.] The director of taxation, or the director's designee, shall represent the State on the Multistate Tax Commission. The attorney general, or the attorney general's designee, shall act as an alternate for the director of taxation. [L 1968, c 30, §3; gen ch 1993]


| internal class | TokenMap |
| public int | GetTokenId(const String<uchar>& tokenName) |
| public String<uchar> | GetTokenInfo(int tokenId) |
| public String<uchar> | GetTokenName(int tokenId) |
| public const int | AMP = 15 |
| public const int | AST = 10 |
| public const int | BAR = 8 |
| public const int | CARET = 9 |
| public const int | DEC = 4 |
| public const int | DOT = 17 |
| public const int | END = 0 |
| public const int | HEX = 3 |
| public const int | ID = 5 |
| public const int | LPAREN = 18 |
| public const int | MINUS = 7 |
| public const int | PERCENT = 12 |
| public const int | PLUS = 6 |
| public const int | PRINT = 20 |
| public const int | REG = 2 |
| public const int | RPAREN = 19 |
| public const int | SEG = 1 |
| public const int | SHIFT_LEFT = 13 |
| public const int | SHIFT_RIGHT = 14 |
| public const int | SLASH = 11 |
| public const int | TILDE = 16 |
| public const int | TRACE = 21 |


Life expectancy is highly correlated over time among countries and between males and females. These associations can be used to improve forecasts. Here we have implemented a method for forecasting female life expectancy based on analysis of the gap between female life expectancy in a country compared with the record level of female life expectancy in the world. Second, to forecast male life expectancy, the gap between male life expectancy and female life expectancy in a country is analysed. We named this method the Double-Gap model. For a detailed description of the method see Pascariu et al. (2017). <doi:10.1016/j.insmatheco.2017.09.011>.
| Version: | 1.0.0 |
| Depends: | R (≥ 3.1.2) |
| Imports: | forecast, MASS, crch, pbapply |
| Suggests: | knitr, rmarkdown, testthat, covr |
| Published: | 2018-07-20 |
| Author: | Marius D. Pascariu [aut, cre] |
| Maintainer: | Marius D. Pascariu <rpascariu at outlook.com> |
| BugReports: | https://github.com/mpascariu/MortalityGaps/issues |
| License: | GPL-3 |
| URL: | https://github.com/mpascariu/MortalityGaps |
| NeedsCompilation: | no |
| Materials: | README NEWS |
| CRAN checks: | MortalityGaps results |
| Reference manual: | MortalityGaps.pdf |
| Vignettes: |
Vignette — DoubleGap R package |
| Package source: | MortalityGaps_1.0.0.tar.gz |
| Windows binaries: | r-devel: MortalityGaps_1.0.0.zip, r-release: MortalityGaps_1.0.0.zip, r-oldrel: MortalityGaps_1.0.0.zip |
| OS X binaries: | r-release: MortalityGaps_1.0.0.tgz, r-oldrel: MortalityGaps_1.0.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=MortalityGaps to link to this page.


--- layout: default short_page: true page_name: find me permalink: /find-me/index.html ---
Alternatively, you can contact me directly at {{ site.email }}


--- layout: withmenu ---
Wondering when to book? This graph shows recent trends in the lowest price of a return trip from London to Boston departing Thursday 18th August:
Room block available at $239 per night plus tax (Deluxe room; upgrades available). Friday, August, 19 - Tuesday, August 23. Call the hotel directly at<PHONE_NUMBER> or toll free at<PHONE_NUMBER>, Mon-Fri 8am-7pm or Sat 9am-4pm and mention "LOUI & WEST wedding room block". or visit www.charleshotel.com, go to Reservations > Groups > and enter attendee code LOUIWESTWEDDING2011.
Room block available at $219 per night plus tax (Deluxe room; upgrades available). Saturday, August, 20 - Monday, August 22. Call the hotel directly at<PHONE_NUMBER> Mon-Fri 8am-6pm or email<EMAIL_ADDRESS>and mention the group name "Loui/West wedding".
Room block available at $129 per night plus tax (Standard room). Additional bedding is presently $25 per Roll-Away per night. Friday, August, 19 - Monday, August 22. Call the hotel directly at<PHONE_NUMBER> or toll free at 1-800-HOLIDAY, Mon-Fri 8am-7pm or Sat 9am-4pm and mention "Loui & West wedding room block".


Nuts basics¶
Flows¶
nuts-flow data pipelines are composed of nuts that
are chained together with the >>
operator. For instance, in the
following data flow, Range
generates number from 0 to 4, the Square
nut squares those numbers and the Collect
nut collects the results
in a list:
>>> from nutsflow import Range, Square, Collect
>>> Range(5) >> Square() >> Collect()
[0, 1, 4, 9, 16]
The data elements of a flow are typically processed element by element, avoiding loading large amounts of data into memory or processing data if not needed. For instance,
>>> from nutsflow import *
>>> Range(10000000) >> Square() >> Take(3) >> Collect()
[0, 1, 4]
works just fine and does not store 10 million integers in memory.
Sources and Sinks¶
Every data flow starts with a source, which can be any iterable such as iterators, generators, iterable nuts or plain Python data structures (string, lists, sets, dictionaries, …):
>>> [0, 1, 2, 3, 4] >> Square() >> Collect()
[0, 1, 4, 9, 16]
>>> "Macadamia" >> Take(4) >> Collect()
['M', 'a', 'c', 'a']
>>> range(5) >> Collect()
[0, 1, 3, 4, 4]
In addition to the usual Python data sources, nuts-flow has its own sources, e.g.
>>> Range(5) >> Collect() # Range() == range()
[0, 1, 3, 4, 4]
>>> Repeat(1) >> Take(3) >> Collect()
[1, 1, 1]
Apart from a source, every data flow needs a sink at the end that pulls the data. Without a sink the data flow does not process any data (most nuts are lazy). For example
>>> Range(5) >> Square()
<itertools.imap object at ...>
simply returns an iterator object but does neither create any ranged numbers nor computes the square. Sinks take iterables as input and return a result of any type or even nothing
>>> Range(5) >> Collect()
[0, 1, 2, 3, 4]
>>> Range(5) >> Sum()
10
>>> Range(5) >> Consume() # returns nothing
Here the sinks are Collect()
, Sum()
and Consume()
.
Functions and Processors¶
Between sources and sinks a data flow typically contains a sequence of
nut functions or nut processors. Nut functions read from an iterator
and for each processed element return a new element. Square
is such
a nut function.
Nut processors, on the other hand, can modulate the data flow and might return
more or less elements than read from the input. For instance, Pick(n)
is a processor that returns only every n-ths element from the input iterable
>>> from nutsflow import Range, Pick, Collect
>>> Range(10) >> Pick(3) >> Collect()
[0, 3, 6, 9]
Note that nut functions can be used as normal functions as well but must be called with additional brackets
>>> Square()(3)
9
Iterator depletion¶
It is important to remember that nuts usually return iterators
that will deplete when used multiple times. See the following example,
where Take(2)
always takes the first 2 elements from its input:
>>> from nutsflow import Range, Take, Collect
>>> numbers = Range(5)
>>> numbers >> Take(2) >> Collect()
[0, 1]
>>> numbers >> Take(2) >> Collect()
[2, 3]
>>> numbers >> Take(2) >> Collect()
[4]
>>> numbers >> Take(2) >> Collect()
[]
New nuts¶
nuts-flow can easily be extended with new nuts (for details see Custom nuts )
>>> Tripple = nut_function(lambda x: x * 3)
>>> Range(5) >> Tripple() >> Collect()
[0, 3, 6, 9, 12]
or combined with plain Python functions as any other iterator:
>>> def Squares(n): return Range(n) >> Square()
>>> Squares(3) >> Collect()
[0, 1, 4]
>>> sum(Range(5) >> Square())
30
When implementing new nuts, or Python functions/classes that behave like nuts, the name of the nut should start with an uppercase letter. This makes it easy to distiguish standard functions from nuts:
>>> from nutsflow import Range, Sum
>>> Range(5) >> Sum()
10
>>> sum(Range(5))
10
>>> range(5) >> Sum()
10
Line breaks¶
Sometimes data flows get longer than the 79 character limit that the Python style guide PEP 8 recommends. In such a case flows can be wrapped in brackets to allow for line breaks:
>>> (Range(10) >> Pick(2) >> Square() >> Square() >>
... Take(3) >> Collect())
[0, 16, 256]
Alternatively, a flow can be broken into shorter pieces:
>>> squared = Range(10) >> Pick(2) >> Square() >> Square()
>>> squared >> Take(3) >> Collect()
[0, 16, 256]
Summary¶
nuts-flows are composed of nuts that are connected to flows
via the >>
operator.
A data flow starts with a source, ends with a sink and
typically contains nut processors or nut functions inbetween:
source >> processor|function >> ... >> sink
nut sources return iterators or iterables when called. nut sinks take iterables as input and return results of any type. nut functions transform the elements of a flow but do not change the number (or order) of the elements, while nut processors can modify the flow in any way.


The 2016 Toyota Tacoma comes with standard rear-wheel drive or optional four-wheel drive. Most reviewers find that the Tacoma has good ride comfort, but others agree that, as with most trucks, the ride feels unsettled over imperfect pavement. Test drivers write that the brakes provide ample stopping power and the steering is well-weighted.
- "The ride is good on smooth pavement, acceptable on rough pavement, and downright punishing on potholed roads, with little difference noted in 2WD and 4WD models, and Access and Double Cabs." -- Automobile Magazine
- "Regardless of those drums, the truck's braking power felt acceptable on our drive." -- AutoWeek
- "Body roll is gradual and restrained, and there's an overall coordination that makes the trip to the trailhead enjoyable. Best perhaps is the steering, which offers up a steady sense of direction, with effort that builds up smoothly and returns the wheel to center accurately as we bend in and out of turns." -- Edmunds
- "Handling feels better, and the ride is comfortable and compliant. The brakes, still discs in front and drums in the rear, use an all-new braking system that has a confident and linear feel." -- Kelley Blue Book
- "On everyday roads the Tacoma rides like a typical truck. Thanks to its separate frame and solid axle rear end, the Tacoma tends to bounce over road surfaces, even ones that appear to be fairly smooth. Your average pickup truck buyer probably won't mind the Tacoma's ride, but someone switching from something like a car-based crossover might be in for a minor shock." -- Left Lane News


6-piece bakeware set includes a 9x5-inch loaf pan, 2 round 9-inch cake pans, a
12-cup
muffin pan, a 13x9-inch roast pan, and a 13x9-inch baking sheet
Made of heavy-weight carbon steel for thorough, even heating
Non-stick coating for effortless food release and easy cleaning


#foreach( $machine in $machines )
$machine
#end
#foreach( $app in $apps )
$app
#end
#foreach( $graph in $images )
#end
©2010
Exit Games®
All rights reserved.


This plugin relies on the TMDb provider and TMDb's "belongs to collection" information. Please make sure it is enabled!


2014 February 11 - IndexedDB Presentation
Nicholas Starke
<EMAIL_ADDRESS>@nstarke
https://github.com/nstarke
All data deleted
0
seconds running


NINETEEN
Copyright (c) 1999 Jan Kristian Haugland
Nineteen is played on a 3x3 hexagonal board.
- TURN - On each turn, each player must do one of the following actions:
- Remove one stone
- Remove two adjacent stones
- Remove three stones forming a triangle
- GOAL - Loses the player that removes the last stone
An example One possible opening move: removing 3 stones.
Some words from the author: The player who takes the last piece loses, he doesn't win. If it is a win to take the last piece, the first player has a simple winning strategy: Take the center piece and then mirror your opponent's moves.