December 26 2018
Desktop updates:
- installed:
gpicview #picture viewer
evince #pdf viewer
lxappearance #gtk styling and iconpack
Notebook:
remounting with read write rights
- I booted into windows via the external SSD and searched for a file on my second internal disk
- than went back to linux and had no writing rights on this drive, the following command solved it:
sudo mount -o remount,rw '/media/hisfantor/data/'
- in which
/media/hisfantor/data/
is my mount point
rubiks cube
- he wrote a program to simmulate a rubiks cube with variable size
- the program can simulate and solve cubes up to 101x101x101 (your PC hardware is the limiting factor)
- video: https://www.youtube.com/watch?v=IM2czqavlWM
- code: https://github.com/Code-Bullet/RubiksCubeAI
- IDE: https://processing.org/download/
L
to rotate the cube with your mousespace
to start/stop scrambling/solving
git branches1
$ git checkout -b [name_of_your_new_branch]
$ git commit -am "msg"
$ git push origin [name_of_your_new_branch]
git prompt2
- download it here and put it in a file in your home directory
~/.git-prompt.sh
- then open your
~/.bashrc
and put in:
source ~/.git-prompt.sh
export PS1="\[\033[36m\]\u\[\033[m\]@\[\033[32m\] \[\033[33;1m\]\w\[\033[m\] (\$(git branch 2>/dev/nul l | grep '^*' | colrm 1 2)) \$ "
- the second line will change your command-line prompt to:
[user]@ [file path] ([git branch]) $
pulseaudio shortcuts3
- first I recognised that pavucontrol and pulseaudio are the same thing… I thought they were different because my soundkeys stopped working when I opend pavucontrol
- my old settings:
bindsym XF86AudioRaiseVolume exec --no-startup-id pactl set-sink-volume 0 +5% #increase sound volume4
bindsym XF86AudioLowerVolume exec --no-startup-id pactl set-sink-volume 0 -5% #decrease sound volume
bindsym XF86AudioMute exec --no-startup-id pactl set-sink-mute 0 toggle # mute sound
new settings:
bindsym XF86AudioRaiseVolume exec --no-startup-id amixer -D pulse sset Master 5%+ #increase sound volume
bindsym XF86AudioLowerVolume exec --no-startup-id amixer -D pulse sset Master 5%- #decrease sound volume
bindsym XF86AudioMute exec --no-startup-id amixer -D pulse set Master 1+ toggle # mute sound
alsamixer
- seems to work great (all in my
~/config/i3/config
)


|
|
def | __init__ |
| |
|
def | header |
| |
|
def | mutable_header |
| |
|
def | clear_header |
| |
|
def | has_header |
| |
|
def | key_size |
| |
|
def | key_list |
| |
|
def | key |
| |
|
def | mutable_key |
| |
|
def | add_key |
| |
|
def | clear_key |
| |
|
def | composite_index_size |
| |
|
def | composite_index_list |
| |
|
def | composite_index |
| |
|
def | mutable_composite_index |
| |
|
def | add_composite_index |
| |
|
def | clear_composite_index |
| |
|
def | force |
| |
|
def | set_force |
| |
|
def | clear_force |
| |
|
def | has_force |
| |
|
def | snapshot_size |
| |
|
def | snapshot_list |
| |
|
def | snapshot |
| |
|
def | mutable_snapshot |
| |
|
def | add_snapshot |
| |
|
def | clear_snapshot |
| |
|
def | MergeFrom |
| |
|
def | Equals |
| |
|
def | IsInitialized |
| |
|
def | ByteSize |
| |
|
def | ByteSizePartial |
| |
|
def | Clear |
| |
|
def | OutputUnchecked |
| |
|
def | OutputPartial |
| |
|
def | TryMerge |
| |
|
def | __str__ |
| |
|
|
| key_ |
| |
|
| composite_index_ |
| |
|
| snapshot_ |
| |
|
| lazy_init_lock_ |
| |
|
| has_header_ |
| |
|
| has_force_ |
| |
|
| force_ |
| |
|
|
int | has_header_ = 0 |
| |
|
| header_ = None |
| |
|
int | has_force_ = 0 |
| |
|
int | force_ = 0 |
| |
|
int | kheader = 10 |
| |
|
int | kkey = 1 |
| |
|
int | kcomposite_index = 2 |
| |
|
int | kforce = 3 |
| |
|
int | ksnapshot = 9 |
| |
The documentation for this class was generated from the following file:
- code/googleappengine-read-only/python/google/appengine/datastore/datastore_v3_pb.py


Virtual Functions for per PE ops. More...
#include <ross-types.h>
Data Fields | |
| pe_init_f | pre_lp_init |
| PE initialization routine, before LP init. More... | |
| pe_init_f | post_lp_init |
| PE initialization routine, after LP init. More... | |
| pe_gvt_f | gvt |
| PE per GVT routine. More... | |
| pe_final_f | final |
| PE finilization routine. More... | |
tw_petypeUser model implements virtual functions for per PE operations. Currently, ROSS provides hooks for PE init, finalization and per GVT operations.
Definition at line 59 of file ross-types.h.
| pe_final_f tw_petype::final |
Definition at line 63 of file ross-types.h.
Referenced by tw_scheduler_conservative(), tw_scheduler_optimistic(), tw_scheduler_optimistic_debug(), tw_scheduler_optimistic_realtime(), and tw_scheduler_sequential().
| pe_gvt_f tw_petype::gvt |
Definition at line 62 of file ross-types.h.
| pe_init_f tw_petype::post_lp_init |
Definition at line 61 of file ross-types.h.
Referenced by tw_sched_init().
| pe_init_f tw_petype::pre_lp_init |
Definition at line 60 of file ross-types.h.
Referenced by tw_sched_init().


Gecode::Int::ConstIntView Class Reference
[Integer views]
Constant integer view. More...
#include <view.hpp>
Protected Attributes | |
| int | x |
Related Functions | |
(Note that these are not member functions.) | |
| template<class Char , class Traits > | |
| std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const ConstIntView &x) |
| Print integer constant integer view. | |
Constructors and initialization | |
|
| |
| ConstIntView (void) | |
| Default constructor. | |
| ConstIntView (int n) | |
| Initialize with integer value n. | |
Value access | |
|
| |
| int | min (void) const |
| Return minimum of domain. | |
| int | max (void) const |
| Return maximum of domain. | |
| int | med (void) const |
| Return median of domain (greatest element not greater than the median). | |
| int | val (void) const |
| Return assigned value (only if assigned). | |
| unsigned int | size (void) const |
| Return size (cardinality) of domain. | |
| unsigned int | width (void) const |
| Return width of domain (distance between maximum and minimum). | |
| unsigned int | regret_min (void) const |
| Return regret of domain minimum (distance to next larger value). | |
| unsigned int | regret_max (void) const |
| Return regret of domain maximum (distance to next smaller value). | |
Domain tests | |
|
| |
| bool | range (void) const |
| Test whether domain is a range. | |
| bool | in (int n) const |
| Test whether n is contained in domain. | |
| bool | in (long long int n) const |
| Test whether n is contained in domain. | |
Domain update by value | |
|
| |
| ModEvent | lq (Space &home, int n) |
| Restrict domain values to be less or equal than n. | |
| ModEvent | lq (Space &home, long long int n) |
| Restrict domain values to be less or equal than n. | |
| ModEvent | le (Space &home, int n) |
| Restrict domain values to be less than n. | |
| ModEvent | le (Space &home, long long int n) |
| Restrict domain values to be less than n. | |
| ModEvent | gq (Space &home, int n) |
| Restrict domain values to be greater or equal than n. | |
| ModEvent | gq (Space &home, long long int n) |
| Restrict domain values to be greater or equal than n. | |
| ModEvent | gr (Space &home, int n) |
| Restrict domain values to be greater than n. | |
| ModEvent | gr (Space &home, long long int n) |
| Restrict domain values to be greater than n. | |
| ModEvent | nq (Space &home, int n) |
| Restrict domain values to be different from n. | |
| ModEvent | nq (Space &home, long long int n) |
| Restrict domain values to be different from n. | |
| ModEvent | eq (Space &home, int n) |
| Restrict domain values to be equal to n. | |
| ModEvent | eq (Space &home, long long int n) |
| Restrict domain values to be equal to n. | |
Domain update by iterator | |
Views can be both updated by range and value iterators. Value iterators do not need to be strict in that the same value is allowed to occur more than once in the iterated sequence. The argument depends must be true, if the iterator passed as argument depends on the view on which the operation is invoked. In this case, the view is only updated after the iterator has been consumed. Otherwise, the domain might be updated concurrently while following the iterator. | |
| template<class I > | |
| ModEvent | narrow_r (Space &home, I &i, bool depends=true) |
| Replace domain by ranges described by i. | |
| template<class I > | |
| ModEvent | inter_r (Space &home, I &i, bool depends=true) |
| Intersect domain with ranges described by i. | |
| template<class I > | |
| ModEvent | minus_r (Space &home, I &i, bool depends=true) |
| Remove from domain the ranges described by i. | |
| template<class I > | |
| ModEvent | narrow_v (Space &home, I &i, bool depends=true) |
| Replace domain by values described by i. | |
| template<class I > | |
| ModEvent | inter_v (Space &home, I &i, bool depends=true) |
| Intersect domain with values described by i. | |
| template<class I > | |
| ModEvent | minus_v (Space &home, I &i, bool depends=true) |
| Remove from domain the values described by i. | |
Delta information for advisors | |
|
| |
| int | min (const Delta &d) const |
| Return minimum value just pruned. | |
| int | max (const Delta &d) const |
| Return maximum value just pruned. | |
| unsigned int | width (const Delta &d) const |
| Return width of values just pruned. | |
| bool | any (const Delta &d) const |
| Test whether arbitrary values got pruned. | |
Cloning | |
|
| |
| void | update (Space &home, ConstIntView &y) |
| Update this view to be a clone of view y. | |
Ordering | |
|
| |
| bool | operator< (const ConstIntView &y) const |
| Whether this view comes before view y (arbitray order). | |
View comparison | |
|
| |
| bool | operator== (const ConstIntView &x, const ConstIntView &y) |
| Test whether views x and y are the same. | |
| bool | operator!= (const ConstIntView &x, const ConstIntView &y) |
| Test whether views x and y are not the same. |
Detailed Description
Constant integer view.
A constant integer view for an integer provides operations such that behaves as a view assigned to .
Definition at line 851 of file view.hpp.
Constructor & Destructor Documentation
| Gecode::Int::ConstIntView::ConstIntView | ( | void | ) | [inline] |
Default constructor.
Definition at line 41 of file constint.hpp.
| Gecode::Int::ConstIntView::ConstIntView | ( | int | n | ) | [inline] |
Initialize with integer value n.
Definition at line 43 of file constint.hpp.
Member Function Documentation
| int Gecode::Int::ConstIntView::min | ( | void | ) | const [inline] |
Return minimum of domain.
Definition at line 50 of file constint.hpp.
| int Gecode::Int::ConstIntView::max | ( | void | ) | const [inline] |
Return maximum of domain.
Definition at line 54 of file constint.hpp.
| int Gecode::Int::ConstIntView::med | ( | void | ) | const [inline] |
Return median of domain (greatest element not greater than the median).
Definition at line 58 of file constint.hpp.
| int Gecode::Int::ConstIntView::val | ( | void | ) | const [inline] |
Return assigned value (only if assigned).
Definition at line 62 of file constint.hpp.
| unsigned int Gecode::Int::ConstIntView::size | ( | void | ) | const [inline] |
Return size (cardinality) of domain.
Definition at line 67 of file constint.hpp.
| unsigned int Gecode::Int::ConstIntView::width | ( | void | ) | const [inline] |
Return width of domain (distance between maximum and minimum).
Definition at line 71 of file constint.hpp.
| unsigned int Gecode::Int::ConstIntView::regret_min | ( | void | ) | const [inline] |
Return regret of domain minimum (distance to next larger value).
Definition at line 75 of file constint.hpp.
| unsigned int Gecode::Int::ConstIntView::regret_max | ( | void | ) | const [inline] |
Return regret of domain maximum (distance to next smaller value).
Definition at line 79 of file constint.hpp.
| bool Gecode::Int::ConstIntView::range | ( | void | ) | const [inline] |
Test whether domain is a range.
Definition at line 89 of file constint.hpp.
| bool Gecode::Int::ConstIntView::in | ( | int | n | ) | const [inline] |
Test whether n is contained in domain.
Definition at line 93 of file constint.hpp.
| bool Gecode::Int::ConstIntView::in | ( | long long int | n | ) | const [inline] |
Test whether n is contained in domain.
Definition at line 97 of file constint.hpp.
Restrict domain values to be less or equal than n.
Definition at line 107 of file constint.hpp.
Restrict domain values to be less or equal than n.
Definition at line 111 of file constint.hpp.
Restrict domain values to be less than n.
Definition at line 116 of file constint.hpp.
Restrict domain values to be less than n.
Definition at line 120 of file constint.hpp.
Restrict domain values to be greater or equal than n.
Definition at line 125 of file constint.hpp.
Restrict domain values to be greater or equal than n.
Definition at line 129 of file constint.hpp.
Restrict domain values to be greater than n.
Definition at line 134 of file constint.hpp.
Restrict domain values to be greater than n.
Definition at line 138 of file constint.hpp.
Restrict domain values to be different from n.
Definition at line 143 of file constint.hpp.
Restrict domain values to be different from n.
Definition at line 147 of file constint.hpp.
Restrict domain values to be equal to n.
Definition at line 152 of file constint.hpp.
Restrict domain values to be equal to n.
Definition at line 156 of file constint.hpp.
| ModEvent Gecode::Int::ConstIntView::narrow_r | ( | Space & | home, | |
| I & | i, | |||
| bool | depends = true | |||
| ) | [inline] |
Replace domain by ranges described by i.
Definition at line 168 of file constint.hpp.
| ModEvent Gecode::Int::ConstIntView::inter_r | ( | Space & | home, | |
| I & | i, | |||
| bool | depends = true | |||
| ) | [inline] |
Intersect domain with ranges described by i.
Definition at line 173 of file constint.hpp.
| ModEvent Gecode::Int::ConstIntView::minus_r | ( | Space & | home, | |
| I & | i, | |||
| bool | depends = true | |||
| ) | [inline] |
Remove from domain the ranges described by i.
Definition at line 180 of file constint.hpp.
| ModEvent Gecode::Int::ConstIntView::narrow_v | ( | Space & | home, | |
| I & | i, | |||
| bool | depends = true | |||
| ) | [inline] |
Replace domain by values described by i.
Definition at line 187 of file constint.hpp.
| ModEvent Gecode::Int::ConstIntView::inter_v | ( | Space & | home, | |
| I & | i, | |||
| bool | depends = true | |||
| ) | [inline] |
Intersect domain with values described by i.
Definition at line 192 of file constint.hpp.
| ModEvent Gecode::Int::ConstIntView::minus_v | ( | Space & | home, | |
| I & | i, | |||
| bool | depends = true | |||
| ) | [inline] |
Remove from domain the values described by i.
Definition at line 199 of file constint.hpp.
| int Gecode::Int::ConstIntView::min | ( | const Delta & | d | ) | const [inline] |
Return minimum value just pruned.
Definition at line 211 of file constint.hpp.
| int Gecode::Int::ConstIntView::max | ( | const Delta & | d | ) | const [inline] |
Return maximum value just pruned.
Definition at line 215 of file constint.hpp.
| unsigned int Gecode::Int::ConstIntView::width | ( | const Delta & | d | ) | const [inline] |
Return width of values just pruned.
Definition at line 219 of file constint.hpp.
| bool Gecode::Int::ConstIntView::any | ( | const Delta & | d | ) | const [inline] |
Test whether arbitrary values got pruned.
Definition at line 223 of file constint.hpp.
| void Gecode::Int::ConstIntView::update | ( | Space & | home, | |
| ConstIntView & | y | |||
| ) | [inline] |
Update this view to be a clone of view y.
Definition at line 234 of file constint.hpp.
| bool Gecode::Int::ConstIntView::operator< | ( | const ConstIntView & | y | ) | const [inline] |
Whether this view comes before view y (arbitray order).
Definition at line 245 of file constint.hpp.
Friends And Related Function Documentation
| std::basic_ostream< Char, Traits > & operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
| const ConstIntView & | x | |||
| ) | [related] |
| bool operator== | ( | const ConstIntView & | x, | |
| const ConstIntView & | y | |||
| ) | [related] |
Test whether views x and y are the same.
Definition at line 323 of file constint.hpp.
| bool operator!= | ( | const ConstIntView & | x, | |
| const ConstIntView & | y | |||
| ) | [related] |
Test whether views x and y are not the same.
Definition at line 327 of file constint.hpp.
Member Data Documentation
int Gecode::Int::ConstIntView::x [protected] |
The documentation for this class was generated from the following files:
- gecode/int/view.hpp
- gecode/int/view/constint.hpp


JavaScript is disabled on your browser.
Skip navigation links
Overview
Package
Class
Tree
Deprecated
Index
Help
Prev Letter
Next Letter
Frames
No Frames
All Classes
A
B
C
D
E
F
G
I
M
N
O
R
S
T
U
V
W
D
DATABASE_NAME
- Static variable in class business.data.
MedicationReaderDbHelper
DATABASE_VERSION
- Static variable in class business.data.
MedicationReaderDbHelper
DayRemindReceiver
- Class in
business
BroadcastReceiver for Daily alarm
DayRemindReceiver()
- Constructor for class business.
DayRemindReceiver
DaysMedicationListAdapter
- Class in
business.adapters
Adapter that handles showing medications for each day
DaysMedicationListAdapter(Context, ArrayList<Medication>)
- Constructor for class business.adapters.
DaysMedicationListAdapter
Constructor for DaysMedicationListAdapter
DaysMedicationListAdapter.ViewHolder
- Class in
business.adapters
ViewHolder for DaysMedicationListAdapter
delete(Medication)
- Method in class business.
MedicationStorage
Deletes medication from database
deleteLog(Medication)
- Method in class business.
MedicationStorage
Deletes Logs
A
B
C
D
E
F
G
I
M
N
O
R
S
T
U
V
W
Skip navigation links
Overview
Package
Class
Tree
Deprecated
Index
Help
Prev Letter
Next Letter
Frames
No Frames
All Classes


| 1 | /* =========================================================== | |
| 2 | * JFreeChart : a free chart library for the Java(tm) platform | |
| 3 | * =========================================================== | |
| 4 | * | |
| 5 | * (C) Copyright 2000-2008, by Object Refinery Limited and Contributors. | |
| 6 | * | |
| 7 | * Project Info: http://www.jfree.org/jfreechart/index.html | |
| 8 | * | |
| 9 | * This library is free software; you can redistribute it and/or modify it | |
| 10 | * under the terms of the GNU Lesser General Public License as published by | |
| 11 | * the Free Software Foundation; either version 2.1 of the License, or | |
| 12 | * (at your option) any later version. | |
| 13 | * | |
| 14 | * This library is distributed in the hope that it will be useful, but | |
| 15 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY | |
| 16 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public | |
| 17 | * License for more details. | |
| 18 | * | |
| 19 | * You should have received a copy of the GNU Lesser General Public | |
| 20 | * License along with this library; if not, write to the Free Software | |
| 21 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, | |
| 22 | * USA. | |
| 23 | * | |
| 24 | * [Java is a trademark or registered trademark of Sun Microsystems, Inc. | |
| 25 | * in the United States and other countries.] | |
| 26 | * | |
| 27 | * ------------------------- | |
| 28 | * LegendRenderingOrder.java | |
| 29 | * ------------------------- | |
| 30 | * (C) Copyright 2004-2008, by Object Refinery Limited and Contributors. | |
| 31 | * | |
| 32 | * Original Author: Angel; | |
| 33 | * Contributor(s): -; | |
| 34 | * | |
| 35 | * Changes | |
| 36 | * ------- | |
| 37 | * 26-Mar-2004 : Version 1 (DG); | |
| 38 | * | |
| 39 | */ | |
| 40 | ||
| 41 | package org.jfree.chart; | |
| 42 | ||
| 43 | import java.io.ObjectStreamException; | |
| 44 | import java.io.Serializable; | |
| 45 | ||
| 46 | /** | |
| 47 | * Represents the order for rendering legend items. | |
| 48 | */ | |
| 49 | public final class LegendRenderingOrder implements Serializable { | |
| 50 | ||
| 51 | /** For serialization. */ | |
| 52 | private static final long serialVersionUID = -3832486612685808616L; | |
| 53 | ||
| 54 | /** In order. */ | |
| 55 | public static final LegendRenderingOrder STANDARD | |
| 56 | = new LegendRenderingOrder("LegendRenderingOrder.STANDARD"); | |
| 57 | ||
| 58 | /** In reverse order. */ | |
| 59 | public static final LegendRenderingOrder REVERSE | |
| 60 | = new LegendRenderingOrder("LegendRenderingOrder.REVERSE"); | |
| 61 | ||
| 62 | /** The name. */ | |
| 63 | private String name; | |
| 64 | ||
| 65 | /** | |
| 66 | * Private constructor. | |
| 67 | * | |
| 68 | * @param name the name. | |
| 69 | */ | |
| 70 | private LegendRenderingOrder(String name) { | |
| 71 | this.name = name; | |
| 72 | } | |
| 73 | ||
| 74 | /** | |
| 75 | * Returns a string representing the object. | |
| 76 | * | |
| 77 | * @return The string. | |
| 78 | */ | |
| 79 | public String toString() { | |
| 80 |
1
1. toString : mutated return of Object value for org/jfree/chart/LegendRenderingOrder::toString to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return this.name; |
| 81 | } | |
| 82 | ||
| 83 | /** | |
| 84 | * Returns true if this object is equal to the specified | |
| 85 | * object, and false otherwise. | |
| 86 | * | |
| 87 | * @param obj the other object. | |
| 88 | * | |
| 89 | * @return A boolean. | |
| 90 | */ | |
| 91 | public boolean equals(Object obj) { | |
| 92 |
1
1. equals : negated conditional → NO_COVERAGE |
if (this == obj) { |
| 93 |
1
1. equals : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE |
return true; |
| 94 | } | |
| 95 |
1
1. equals : negated conditional → NO_COVERAGE |
if (!(obj instanceof LegendRenderingOrder)) { |
| 96 |
1
1. equals : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE |
return false; |
| 97 | } | |
| 98 | LegendRenderingOrder order = (LegendRenderingOrder) obj; | |
| 99 |
1
1. equals : negated conditional → NO_COVERAGE |
if (!this.name.equals(order.toString())) { |
| 100 |
1
1. equals : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE |
return false; |
| 101 | } | |
| 102 |
1
1. equals : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE |
return true; |
| 103 | } | |
| 104 | ||
| 105 | /** | |
| 106 | * Ensures that serialization returns the unique instances. | |
| 107 | * | |
| 108 | * @return The object. | |
| 109 | * | |
| 110 | * @throws ObjectStreamException if there is a problem. | |
| 111 | */ | |
| 112 | private Object readResolve() throws ObjectStreamException { | |
| 113 |
1
1. readResolve : negated conditional → NO_COVERAGE |
if (this.equals(LegendRenderingOrder.STANDARD)) { |
| 114 |
1
1. readResolve : mutated return of Object value for org/jfree/chart/LegendRenderingOrder::readResolve to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return LegendRenderingOrder.STANDARD; |
| 115 | } | |
| 116 |
1
1. readResolve : negated conditional → NO_COVERAGE |
else if (this.equals(LegendRenderingOrder.REVERSE)) { |
| 117 |
1
1. readResolve : mutated return of Object value for org/jfree/chart/LegendRenderingOrder::readResolve to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return LegendRenderingOrder.REVERSE; |
| 118 | } | |
| 119 |
1
1. readResolve : mutated return of Object value for org/jfree/chart/LegendRenderingOrder::readResolve to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return null; |
| 120 | } | |
| 121 | ||
| 122 | } | |
Mutations | ||
| 80 |
1.1 |
|
| 92 |
1.1 |
|
| 93 |
1.1 |
|
| 95 |
1.1 |
|
| 96 |
1.1 |
|
| 99 |
1.1 |
|
| 100 |
1.1 |
|
| 102 |
1.1 |
|
| 113 |
1.1 |
|
| 114 |
1.1 |
|
| 116 |
1.1 |
|
| 117 |
1.1 |
|
| 119 |
1.1 |


{{ extend "admin/instructors.html"}} {{ block tabcontent }}
The following questions have been flagged for review. Please delete those that are clearly inappropriate or just experimental. Questions with minor typos can be edited and saved. Please do not change the unique identifier
{{count=0}} {{for q in questioninfo:}}Base Course: {{= q['base_course']}}
Difficulty Level {{= q['difficulty']}}
Chapter: {{= q['chapter']}}


source file: /Library/Frameworks/Python.framework/Versions/2.7/lib/python2.7/site-packages/s3transfer/tasks.py
file stats: 138 lines, 31 executed: 22.5% covered
1. # Copyright 2016 Amazon.com, Inc. or its affiliates. All Rights Reserved. 2. # 3. # Licensed under the Apache License, Version 2.0 (the "License"). You 4. # may not use this file except in compliance with the License. A copy of 5. # the License is located at 6. # 7. # http://aws.amazon.com/apache2.0/ 8. # 9. # or in the "license" file accompanying this file. This file is 10. # distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF 11. # ANY KIND, either express or implied. See the License for the specific 12. # language governing permissions and limitations under the License. 13. import copy 14. import logging 15. 16. from s3transfer.utils import get_callbacks 17. 18. 19. logger = logging.getLogger(__name__) 20. 21. 22. class Task(object): 23. """A task associated to a TransferFuture request 24. 25. This is a base class for other classes to subclass from. All subclassed 26. classes must implement the main() method. 27. """ 28. def __init__(self, transfer_coordinator, main_kwargs=None, 29. pending_main_kwargs=None, done_callbacks=None, 30. is_final=False): 31. """ 32. :type transfer_coordinator: s3transfer.futures.TransferCoordinator 33. :param transfer_coordinator: The context associated to the 34. TransferFuture for which this Task is associated with. 35. 36. :type main_kwargs: dict 37. :param main_kwargs: The keyword args that can be immediately supplied 38. to the _main() method of the task 39. 40. :type pending_main_kwargs: dict 41. :param pending_main_kwargs: The keyword args that are depended upon 42. by the result from a dependent future(s). The result returned by 43. the future(s) will be used as the value for the keyword argument 44. when _main() is called. The values for each key can be: 45. * a single future - Once completed, its value will be the 46. result of that single future 47. * a list of futures - Once all of the futures complete, the 48. value used will be a list of each completed future result 49. value in order of when they were originally supplied. 50. 51. :type done_callbacks: list of callbacks 52. :param done_callbacks: A list of callbacks to call once the task is 53. done completing. Each callback will be called with no arguments 54. and will be called no matter if the task succeeds or an exception 55. is raised. 56. 57. :type is_final: boolean 58. :param is_final: True, to indicate that this task is the final task 59. for the TransferFuture request. By setting this value to True, it 60. will set the result of the entire TransferFuture to the result 61. returned by this task's main() method. 62. """ 63. self._transfer_coordinator = transfer_coordinator 64. 65. self._main_kwargs = main_kwargs 66. if self._main_kwargs is None: 67. self._main_kwargs = {} 68. 69. self._pending_main_kwargs = pending_main_kwargs 70. if pending_main_kwargs is None: 71. self._pending_main_kwargs = {} 72. 73. self._done_callbacks = done_callbacks 74. if self._done_callbacks is None: 75. self._done_callbacks = [] 76. 77. self._is_final = is_final 78. 79. def __repr__(self): 80. # These are the general main_kwarg parameters that we want to 81. # display in the repr. 82. params_to_display = [ 83. 'bucket', 'key', 'part_number', 'final_filename', 84. 'transfer_future', 'offset', 'extra_args' 85. ] 86. main_kwargs_to_display = self._get_kwargs_with_params_to_include( 87. self._main_kwargs, params_to_display) 88. return '%s(transfer_id=%s, %s)' % ( 89. self.__class__.__name__, self._transfer_coordinator.transfer_id, 90. main_kwargs_to_display) 91. 92. @property 93. def transfer_id(self): 94. """The id for the transfer request that the task belongs to""" 95. return self._transfer_coordinator.transfer_id 96. 97. def _get_kwargs_with_params_to_include(self, kwargs, include): 98. filtered_kwargs = {} 99. for param in include: 100. if param in kwargs: 101. filtered_kwargs[param] = kwargs[param] 102. return filtered_kwargs 103. 104. def _get_kwargs_with_params_to_exclude(self, kwargs, exclude): 105. filtered_kwargs = {} 106. for param, value in kwargs.items(): 107. if param in exclude: 108. continue 109. filtered_kwargs[param] = value 110. return filtered_kwargs 111. 112. def __call__(self): 113. """The callable to use when submitting a Task to an executor""" 114. try: 115. # Wait for all of futures this task depends on. 116. self._wait_on_dependent_futures() 117. # Gather up all of the main keyword arguments for main(). 118. # This includes the immediately provided main_kwargs and 119. # the values for pending_main_kwargs that source from the return 120. # values from the task's depenent futures. 121. kwargs = self._get_all_main_kwargs() 122. # If the task is not done (really only if some other related 123. # task to the TransferFuture had failed) then execute the task's 124. # main() method. 125. if not self._transfer_coordinator.done(): 126. return self._execute_main(kwargs) 127. except Exception as e: 128. self._log_and_set_exception(e) 129. finally: 130. # Run any done callbacks associated to the task no matter what. 131. for done_callback in self._done_callbacks: 132. done_callback() 133. 134. if self._is_final: 135. # If this is the final task announce that it is done if results 136. # are waiting on its completion. 137. self._transfer_coordinator.announce_done() 138. 139. def _execute_main(self, kwargs): 140. # Do not display keyword args that should not be printed, especially 141. # if they are going to make the logs hard to follow. 142. params_to_exclude = ['data'] 143. kwargs_to_display = self._get_kwargs_with_params_to_exclude( 144. kwargs, params_to_exclude) 145. # Log what is about to be executed. 146. logger.debug( 147. "Executing task %s with kwargs %s" % (self, kwargs_to_display) 148. ) 149. 150. return_value = self._main(**kwargs) 151. # If the task is the final task, then set the TransferFuture's 152. # value to the return value from main(). 153. if self._is_final: 154. self._transfer_coordinator.set_result(return_value) 155. return return_value 156. 157. def _log_and_set_exception(self, exception): 158. # If an exception is ever thrown than set the exception for the 159. # entire TransferFuture. 160. logger.debug("Exception raised.", exc_info=True) 161. self._transfer_coordinator.set_exception(exception) 162. 163. def _main(self, **kwargs): 164. """The method that will be ran in the executor 165. 166. This method must be implemented by subclasses from Task. main() can 167. be implemented with any arguments decided upon by the subclass. 168. """ 169. raise NotImplementedError('_main() must be implemented') 170. 171. def _wait_on_dependent_futures(self): 172. # Gather all of the futures into that main() depends on. 173. futures_to_wait_on = [] 174. for _, future in self._pending_main_kwargs.items(): 175. # If the pending main keyword arg is a list then extend the list. 176. if isinstance(future, list): 177. futures_to_wait_on.extend(future) 178. # If the pending main keword arg is a future append it to the list. 179. else: 180. futures_to_wait_on.append(future) 181. # Now wait for all of the futures to complete. 182. self._wait_until_all_complete(futures_to_wait_on) 183. 184. def _wait_until_all_complete(self, futures): 185. # This is a basic implementation of the concurrent.futures.wait() 186. # 187. # concurrent.futures.wait() is not used instead because of this 188. # reported issue: https://bugs.python.org/issue20319. 189. # The issue would occassionally cause multipart uploads to hang 190. # when wait() was called. With this approach, it avoids the 191. # concurrency bug by removing any association with concurrent.futures 192. # implementation of waiters. 193. logger.debug( 194. '%s about to wait for the following futures %s', self, futures) 195. for future in futures: 196. try: 197. logger.debug('%s about to wait for %s', self, future) 198. future.result() 199. except Exception: 200. # result() can also produce exceptions. We want to ignore 201. # these to be deffered to error handling down the road. 202. pass 203. logger.debug('%s done waiting for dependent futures', self) 204. 205. def _get_all_main_kwargs(self): 206. # Copy over all of the kwargs that we know is available. 207. kwargs = copy.copy(self._main_kwargs) 208. 209. # Iterate through the kwargs whose values are pending on the result 210. # of a future. 211. for key, pending_value in self._pending_main_kwargs.items(): 212. # If the value is a list of futures, iterate though the list 213. # appending on the result from each future. 214. if isinstance(pending_value, list): 215. result = [] 216. for future in pending_value: 217. result.append(future.result()) 218. # Otherwise if the pending_value is a future, just wait for it. 219. else: 220. result = pending_value.result() 221. # Add the retrieved value to the kwargs to be sent to the 222. # main() call. 223. kwargs[key] = result 224. return kwargs 225. 226. 227. class SubmissionTask(Task): 228. """A base class for any submission task 229. 230. Submission tasks are the top-level task used to submit a series of tasks 231. to execute a particular transfer. 232. """ 233. def _main(self, transfer_future, **kwargs): 234. """ 235. :type transfer_future: s3transfer.futures.TransferFuture 236. :param transfer_future: The transfer future associated with the 237. transfer request that tasks are being submitted for 238. 239. :param kwargs: Any additional kwargs that you may want to pass 240. to the _submit() method 241. """ 242. try: 243. self._transfer_coordinator.set_status_to_queued() 244. 245. # Before submitting any tasks, run all of the on_queued callbacks 246. on_queued_callbacks = get_callbacks(transfer_future, 'queued') 247. for on_queued_callback in on_queued_callbacks: 248. on_queued_callback() 249. 250. # Once callbacks have been ran set the status to running. 251. self._transfer_coordinator.set_status_to_running() 252. 253. # Call the submit method to start submitting tasks to execute the 254. # transfer. 255. self._submit(transfer_future=transfer_future, **kwargs) 256. except BaseException as e: 257. # If there was an exception raised during the submission of task 258. # there is a chance that the final task that signals if a transfer 259. # is done and too run the cleanup may never have been submitted in 260. # the first place so we need to account accordingly. 261. # 262. # Note that BaseException is caught, instead of Exception, because 263. # for some implmentations of executors, specifically the serial 264. # implementation, the SubmissionTask is directly exposed to 265. # KeyboardInterupts and so needs to cleanup and signal done 266. # for those as well. 267. 268. # Set the exception, that caused the process to fail. 269. self._log_and_set_exception(e) 270. 271. # Wait for all possibly associated futures that may have spawned 272. # from this submission task have finished before we anounce the 273. # transfer done. 274. self._wait_for_all_submitted_futures_to_complete() 275. 276. # Announce the transfer as done, which will run any cleanups 277. # and done callbacks as well. 278. self._transfer_coordinator.announce_done() 279. 280. def _submit(self, transfer_future, **kwargs): 281. """The submition method to be implemented 282. 283. :type transfer_future: s3transfer.futures.TransferFuture 284. :param transfer_future: The transfer future associated with the 285. transfer request that tasks are being submitted for 286. 287. :param kwargs: Any additional keyword arguments you want to be passed 288. in 289. """ 290. raise NotImplementedError('_submit() must be implemented') 291. 292. def _wait_for_all_submitted_futures_to_complete(self): 293. # We want to wait for all futures that were submitted to 294. # complete as we do not want the cleanup callbacks or done callbacks 295. # to be called to early. The main problem is any task that was 296. # submitted may have submitted even more during its process and so 297. # we need to account accordingly. 298. 299. # First get all of the futures that were submitted up to this point. 300. submitted_futures = self._transfer_coordinator.associated_futures 301. while submitted_futures: 302. # Wait for those futures to complete. 303. self._wait_until_all_complete(submitted_futures) 304. # However, more futures may have been submitted as we waited so 305. # we need to check again for any more associated futures. 306. possibly_more_submitted_futures = \ 307. self._transfer_coordinator.associated_futures 308. # If the current list of submitted futures is equal to the 309. # the list of associated futures for when after the wait completes, 310. # we can ensure no more futures were submitted in waiting on 311. # the current list of futures to complete ultimately meaning all 312. # futures that may have spawned from the original submission task 313. # have completed. 314. if submitted_futures == possibly_more_submitted_futures: 315. break 316. submitted_futures = possibly_more_submitted_futures 317. 318. 319. class CreateMultipartUploadTask(Task): 320. """Task to initiate a multipart upload""" 321. def _main(self, client, bucket, key, extra_args): 322. """ 323. :param client: The client to use when calling CreateMultipartUpload 324. :param bucket: The name of the bucket to upload to 325. :param key: The name of the key to upload to 326. :param extra_args: A dictionary of any extra arguments that may be 327. used in the intialization. 328. 329. :returns: The upload id of the multipart upload 330. """ 331. # Create the multipart upload. 332. response = client.create_multipart_upload( 333. Bucket=bucket, Key=key, **extra_args) 334. upload_id = response['UploadId'] 335. 336. # Add a cleanup if the multipart upload fails at any point. 337. self._transfer_coordinator.add_failure_cleanup( 338. client.abort_multipart_upload, Bucket=bucket, Key=key, 339. UploadId=upload_id 340. ) 341. return upload_id 342. 343. 344. class CompleteMultipartUploadTask(Task): 345. """Task to complete a multipart upload""" 346. def _main(self, client, bucket, key, upload_id, parts, extra_args): 347. """ 348. :param client: The client to use when calling CompleteMultipartUpload 349. :param bucket: The name of the bucket to upload to 350. :param key: The name of the key to upload to 351. :param upload_id: The id of the upload 352. :param parts: A list of parts to use to complete the multipart upload:: 353. 354. [{'Etag': etag_value, 'PartNumber': part_number}, ...] 355. 356. Each element in the list consists of a return value from 357. ``UploadPartTask.main()``. 358. :param extra_args: A dictionary of any extra arguments that may be 359. used in completing the multipart transfer. 360. """ 361. client.complete_multipart_upload( 362. Bucket=bucket, Key=key, UploadId=upload_id, 363. MultipartUpload={'Parts': parts}, 364. **extra_args)


Survey Questions
About You
Name (Required)
Link to Photo Image (Required)
Question 1
I prefer indoor to outdoor activities.
1 (Strongly Disagree)
2
3
4
5 (Strongly Agree)
Question 2
I'd rather read a book than take a walk.
1 (Strongly Disagree)
2
3
4
5 (Strongly Agree)
Question 3
I am generally an easygoing person.
1 (Strongly Disagree)
2
3
4
5 (Strongly Agree)
Question 4
I live in the moment instead of worrying about the future.
1 (Strongly Disagree)
2
3
4
5 (Strongly Agree)
Question 5
I keep up with current events.
1 (Strongly Disagree)
2
3
4
5 (Strongly Agree)
Question 6
I prefer to do activities with one friend instead of with a large group.
1 (Strongly Disagree)
2
3
4
5 (Strongly Agree)
Question 7
I enjoy learning new things.
1 (Strongly Disagree)
2
3
4
5 (Strongly Agree)
Question 8
I love to cook.
1 (Strongly Disagree)
2
3
4
5 (Strongly Agree)
Question 9
I find things to do with my time and am seldom bored.
1 (Strongly Disagree)
2
3
4
5 (Strongly Agree)
Question 10
I keep up with the latest movies and television shows.
1 (Strongly Disagree)
2
3
4
5 (Strongly Agree)
Submit
API Friends List
|
GitHub Repo
Close: ×
Best Match


|
Burp
|
Go to the source code of this file.
Functions | |
| int | wait_robot (robot *rob, unsigned int delay) |
| bool | poke (robot *rob, int addr, int value) |
| int | peek (robot *rob, int addr) |
| int | go_to (int num) |
| int | randoms (int num) |
| int | cardinal (arena *arena) |
| int | self (robot *rob) |
| int | state (arena *arena, int num) |
| int | speed (robot *rob) |
| double | gpsx (arena *arena, int num) |
| double | gpsy (arena *arena, int num) |
| void | engine (robot *rob, double angle, double speed) |
| bool | shoot (robot *rob, arena *arena, double angle, double explo_dist) |
| double | angle (double x1, double y1, double x2, double y2) |
| double | targetx (double x1, double angle, double length) |
| double | targety (double y1, double angle, double length) |
| double | distance (double x1, double y1, double x2, double y2) |
| double angle | ( | double | x1, |
| double | y1, | ||
| double | x2, | ||
| double | y2 | ||
| ) |
Calculate the angle corresponding to the line from [x1,y2] to [x2,y2]. If [x1,y1] == [x2,y2] it'll for now return an angle of 90°c.
| int cardinal | ( | arena * | arena | ) |
return the number of active robot in the arena [arena].
| double distance | ( | double | x1, |
| double | y1, | ||
| double | x2, | ||
| double | y2 | ||
| ) |
Return the distance between [x1,y1] and [x2,y2].
| void engine | ( | robot * | rob, |
| double | angle, | ||
| double | speed | ||
| ) |
Start a robot [rob]'s engine and set his angle to [angle] and speed to [speed].
| int go_to | ( | int | num | ) |
return num.
| double gpsx | ( | arena * | arena, |
| int | num | ||
| ) |
return the x coordinate of the robot contained the id [num] in the arena [arena]. Return -1 if no robot has the id [num].
| double gpsy | ( | arena * | arena, |
| int | num | ||
| ) |
return the y coordinate of the robot contained the id [num] in the arena [arena]. Return -1 if no robot has the id [num].
| int peek | ( | robot * | rob, |
| int | addr | ||
| ) |
return the value stocked at the indice i of the robot [rob]'s memory. if an indice is invalid, it'll return -1.
| bool poke | ( | robot * | rob, |
| int | addr, | ||
| int | value | ||
| ) |
Set the integer [value] to the indice [addr] in the robot [rob]'s memory. if the indice given is invalid (i.e, not contained between 0 and robot_memory) the operation will fail and it'll return false. if the operation succeed, it'll return true.
| int randoms | ( | int | num | ) |
Return a random number between 0 and [num].
| int self | ( | robot * | rob | ) |
return the id of the robot [rob].
Shoot a missile from rob and add it to arena while assigning the angle [angle] and the explosion_distant [explo_dist] to the missile. If the robot has already NB_ROBOT_MISSILES active in the arena, the operation will fail and return false. If the operation succeed, it'll return true.
| int speed | ( | robot * | rob | ) |
return the speed of the robot [rob].
| int state | ( | arena * | arena, |
| int | num | ||
| ) |
return the number of health_points of the robot contained the id [num] in the arena [arena]. Return -1 if no robot has the id [num].
| double targetx | ( | double | x1, |
| double | angle, | ||
| double | length | ||
| ) |
Return the next coordinate X considering a x [x1] looking at [angle] which move at the speed [length].
| double targety | ( | double | y1, |
| double | angle, | ||
| double | length | ||
| ) |
Return the next coordinate Y considering a y [y1] looking at [angle] which move at the speed [length].
| int wait_robot | ( | robot * | rob, |
| unsigned int | delay | ||
| ) |
set the robot [rob] is waiting time to [delay] and return its value.


1. No Profanity in the descriptions.
2. No racial slurs with in the descriptions or comments of reviews.
3. Be respectful when giving your opinion.
Viloation of these rules can lead to removal of membership status and a permanent ban.
MoviesStartNew MovieLogin


Fancy Row
Informations
Author: Angelo Galleja
License: FPDF
Description
This script extends the Row() function from the script Table with MultiCells. It provides
borders, alignments, font styles and maxlines (to use this last feature, you'll need the script
MultiCell with maxline).


triplet <int> <int> <int> spectrum_request baryon save_corr_fnal <char[]> r_offset <int[4]> |
and continues with a specification of the correlators
number_of_correlators <int> [correlator_line] [correlator_line] ... [correlator_line] |
The correlator line has the format
correlator <char[] = label> <char[] = momlabel> <1|-1|i|-i> [*/] <float = norm> <sink> |
The only sink choices are "nucleon" and "delta".
Currently the code does not support a momentum insertion at the sink.
| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
| Jump to: | A B C D E F G H I J K L M N O P Q R S T U V W |
|---|
| Jump to: | A B C D E F G H I J K L M N O P Q R S T U V W |
|---|
| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
| Jump to: | *
B C E F I M N O P S T V W |
|---|
| Jump to: | *
B C E F I M N O P S T V W |
|---|
| [Top] | [Contents] | [Index] | [ ? ] |
| [Top] | [Contents] | [Index] | [ ? ] |
This document was generated by Carleton DeTar on November 22, 2015 using texi2html 1.82.
The buttons in the navigation panels have the following meaning:
| Button | Name | Go to | From 1.2.3 go to |
|---|---|---|---|
| [ < ] | Back | Previous section in reading order | 1.2.2 |
| [ > ] | Forward | Next section in reading order | 1.2.4 |
| [ << ] | FastBack | Beginning of this chapter or previous chapter | 1 |
| [ Up ] | Up | Up section | 1.2 |
| [ >> ] | FastForward | Next chapter | 2 |
| [Top] | Top | Cover (top) of document | |
| [Contents] | Contents | Table of contents | |
| [Index] | Index | Index | |
| [ ? ] | About | About (help) |
where the Example assumes that the current position is at Subsubsection One-Two-Three of a document of the following structure:
This document was generated by Carleton DeTar on November 22, 2015 using texi2html 1.82.


Home
About
Main
Head
JUST type something in right box------------>
and click
SUBMIT Button
it doesn't work anyway
First Name
Last Name
Male
Female
Other
Teacher
Student


This Web App is used to generate pools for usage in the Mtg Format known as Everything Sealed.
Everything Sealed is a Format in which you are given a selected commander, a copy of Prismatic Piper, and 140 other cards. You then are tasked with building a Commander Legal Deck from the generated card pool.


{% include "dashboard/shared_links.html" %}
Login
{% include "dashboard/navigation_bar.html" %}
Login
{% csrf_token %} {# A more "HTML" way of creating the login form#}
Login
Not registered?
Join here.


Can't Help Singing (1944)
Grade: 44
Deanna Durbin is one of Hollywood's forgotten stars from the 1940s. She was energetic and wholesome, and had a very impressive singing voice, suitable for the opera. She was a perfect role model for young teenage girls. But when her career was at a peak, she turned her back on stardom to live in seclusion in France.
"Can't Help Singing" was her only technicolor film, and of course it was a musical. Good production values and costumes keep it watchable. The plot is minimal however, and the story wanders aimlessly along, resulting in a pleasant but forgettable movie.
"Can't Help Singing" apparently takes place during the 1850s. Durbin plays the daughter of a U.S. Senator. She loves a military officer, but her father despises him, and sends his regiment to California. Durbin impetously runs away to find him. Along the way, she picks up companions: a pair of thieves (Akim Tamiroff and Leonid Kinskey) and a card shark (Robert Paige). She 'hates' Paige at first, but soon predictably falls for him and must choose between Paige and her soldier boy.
Tamiroff, a noted Hollywood supporting actor who had just won a Golden Globe for "For Whom the Bell Tolls", is wasted here. Tamiroff and Kinskey are obligated to provide comic relief as blundering thieves who mistakingly believe something valuable is in Durbin's trunk. They are given terrible lines and direction by Frank Ryan, who was responsible for both.
The songs were composed by Jerome Kern. They pass the hummability test, but otherwise aren't particularly good. The title song is reprised enough times that, after viewing the picture, you may find the tune reprised in your own head for the next few days.
<EMAIL_ADDRESS>http://members.tripod.com/~Brian_Koller/movies.html
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


--- layout: post status: publish published: true title: Afternoon author: Leask author_login: leask author_email<EMAIL_ADDRESS>author_url: https://leaskh.com wordpress_id: 277 wordpress_url: http://leaskh.wordpress.com/2008/03/20/afternoon date: '2008-03-20 15:02:44 +0800' date_gmt: '2008-03-20 15:02:44 +0800' categories: tags: [] comments: [] ---


> Loading data...
> Data Loaded. Compiling...
> Compilation Time : 0.040001869201660156
Train on 3765 samples, validate on 199 samples
Epoch 1/1
3765/3765 [==============================] - 11s - loss: 0.0038 - val_loss: 0.0014
Training duration (s) : 20.324627161026


Josué Martínez Moreno
Research School of Earth Science, ANU, Australia.
<EMAIL_ADDRESS>http://faraday.fciencias.unam.mx/josue/
(+61) 426104364
Education
- Research School of Earth Sciencies at Australian National University, 2017 – Ph.D. Earth Sciences.
- Sciences School at National Autonomous University of Mexico, 2012 – 2017
Project: The impact of the components of the kinetic energy remains unknown, because of that we propose to separate the eddy kinetic energy (EKE) in three major compo- nents: EKEeddy, EKEjet and EKEbackground. With this separation we will be able to understand the percussion of each component in the global climate and the possible feedback in the climate change.
Advisor: Professor. Andrew Hogg.
B.Sc. Earth Sciences, Aquatic Sciences major.
B.Sc. Thesis: “Pollution scenarios in the Gulf of Mexico by the river plume of the Coatza- coalcos river”. To understand the passive particle dispersion of the river plume of the Coatzacoalcos River it was implemented the numerical model MIT General Circulation Model.
Advisor: Prof. Angel Ruiz-Angulo
Teaching Experience
- Demonstrator of Physics of Fluid Flows (Undergraduate) - 2018
- Python – 2017.
- Teacher Assistance of Geophysical Fluid Dynamics (Undergraduate) – 2016.
- LATEX and Python – 2016.
Research Experience
-
Internships
- REU – Water Resources Management Research Group, University of Califor- nia Davis, California, USA, July –August 2015 Proyect: California Hydrologic Classification Advisor: PhD. Samuel Sandoval Solis
- Research Internship (Youth toward Research Program), May – July 2011 Advisor:M.Sc. Zoila Castillo Rodrguez. Activities: Identified and analyzed gastropods and fish by physiological charac- teristics. Measurement of relation of fish weight and the environmental condition and availability of nutrients let them grow.
-
Workshops
- “Introduction to the dynamics of semienclosed bodies of water” – 2016 Taught by Prof. Arnoldo Valle-Levinsonm, Prof. Alejandro Souza, Prof. Carlos Augusto Frana Schettini, Ph.D. Ismael Mario Tapia, Prof. Cecilia Enriquez and Ph.D. Meghan Williams at the Academic Unit, Puerto Morelos of the Institute of Marine Sciences and Limnology, UNAM.
- “Submerged cave ecology with emphasis on remipede crustaceans and Mex- ican cenotes” – 2016 Taught by Prof. Jill Yager, at the Institute of Marine Sciences and Limnology, UNAM
-
Research cruises
- R/V Investigator, 16th October 2018 - 16th November 2018 Cheef Scientist: Center of Excelence
- B/O Justo Sierra, 1st August 2014 – 3rd August 2014 Cheef Scientist: Prof. Elva Escobar Briones from Instituto de Ciencias del Mar y Limnologa, UNAM Activities: Assistant of siesmic profilinf, PDF and CTD profiling, and sediment samples collect. Responsible of water sampling.
-
Research Assistance
- Research Volunteer, Institute of Marine Sciences and Limnology, August – April 2013 Advisor: Prof. Elva Escobar Briones. Activities: Analyze sediment composition and meiobenthos.
- Research Assistance, Institute of Environmental Engineering, June – August 2011 Advisor: M.Sc. Leticia Garca Montes de Oca. Project: Physicochemical processes of mass transfer for the treatment of water and soil Activities: Measurements in HPLC, and I worked in the materials development (ceramic).
Conferences
-
Ocean Sciences - 2018 – Portland, USA (
February, 2018)
-
Ocean Eddies and Their Repercussions in Climate Change
J. Martínez, A. Hogg, A. Morrison and A. Kiss.
-
-
AMOS - ICSHMO 2018 – Sydney, Australia (
February, 2018)
-
Ocean Eddies and Their Repercussions in Climate Change
J. Martínez, A. Hogg, A. Morrison and A. Kiss.
-
-
Technology and Its Integration in Mathematics Education (TIME 2016) – Mexico City (July, 2016)
-
Design and use online platforms to learn mathematics and the use of them in simulations of problems in applied sciences
J. Martínez, R. Méndez.
-
Publications
- MÉNDEZ-FRAGOSO R., VILLAVICENCIO-TORRES M., MARTÍNEZ-MORENO J., 2017: Design and use online platforms to learn mathematics and the use of them in simula- tions of problems in applied sciences, IJTME, 24 Issue 2, 89-94.
Invited Talks
- Tour with Science – 2015
- XV High School Symposium of Sciences – 2011
“One work day in cruise UNAM’s R/V Justo Sierra I” at General Direction of Populariza- tion of Science.
“Coral bleaching, effects, causes and consequences”.
Languages
- First Language: Spanish
- Second Language: English
- Third Language: French (Intermediate)
Programing Languages
Python, Julia, Matlab, R, HTML, CSS, PHP, JavaScript, LaTeX and Fortran (Basic), C++ (Basic)Awards
- Graduation with Honours of the B.Sc. Earth Sciences
- Second place on the Scientific Poster Contest of Short Internships on Biology Area dur- ing the XVI Scientific Exhibition of Short Internships through the Youth toward Research Program.