apache_beam.runners.direct package¶
Submodules¶
apache_beam.runners.direct.bundle_factory module¶
A factory that creates UncommittedBundles.
-
class
apache_beam.runners.direct.bundle_factory.
BundleFactory
(stacked)[source]¶ Bases:
object
For internal use only; no backwards-compatibility guarantees.
BundleFactory creates output bundles to be used by transform evaluators.
Parameters: stacked – whether or not to stack the WindowedValues within the bundle in case consecutive ones share the same timestamp and windows. DirectRunnerOptions.direct_runner_use_stacked_bundle controls this option.
apache_beam.runners.direct.clock module¶
Clock implementations for real time processing and testing.
apache_beam.runners.direct.consumer_tracking_pipeline_visitor module¶
ConsumerTrackingPipelineVisitor, a PipelineVisitor object.
-
class
apache_beam.runners.direct.consumer_tracking_pipeline_visitor.
ConsumerTrackingPipelineVisitor
[source]¶ Bases:
apache_beam.pipeline.PipelineVisitor
For internal use only; no backwards-compatibility guarantees.
Visitor for extracting value-consumer relations from the graph.
Tracks the AppliedPTransforms that consume each PValue in the Pipeline. This is used to schedule consuming PTransforms to consume input after the upstream transform has produced and committed output.
apache_beam.runners.direct.direct_metrics module¶
DirectRunner implementation of MetricResults. It is in charge not only of responding to queries of current metrics, but also of keeping the common state consistent.
apache_beam.runners.direct.direct_runner module¶
DirectRunner, executing on the local machine.
The DirectRunner is a runner implementation that executes the entire graph of transformations belonging to a pipeline on the local machine.
-
class
apache_beam.runners.direct.direct_runner.
DirectRunner
[source]¶ Bases:
apache_beam.runners.runner.PipelineRunner
Executes a single pipeline on the local machine.
-
cache
¶
-
apache_beam.runners.direct.evaluation_context module¶
EvaluationContext tracks global state, triggers and watermarks.
-
class
apache_beam.runners.direct.evaluation_context.
EvaluationContext
(pipeline_options, bundle_factory, root_transforms, value_to_consumers, step_names, views)[source]¶ Bases:
object
Evaluation context with the global state information of the pipeline.
The evaluation context for a specific pipeline being executed by the DirectRunner. Contains state shared within the execution across all transforms.
EvaluationContext contains shared state for an execution of the DirectRunner that can be used while evaluating a PTransform. This consists of views into underlying state and watermark implementations, access to read and write side inputs, and constructing counter sets and execution contexts. This includes executing callbacks asynchronously when state changes to the appropriate point (e.g. when a side input is requested and known to be empty).
EvaluationContext also handles results by committing finalizing bundles based on the current global state and updating the global state appropriately. This includes updating the per-(step,key) state, updating global watermarks, and executing any callbacks that can be executed.
-
create_bundle
(output_pcollection)[source]¶ Create an uncommitted bundle for the specified PCollection.
-
create_empty_committed_bundle
(output_pcollection)[source]¶ Create empty bundle useful for triggering evaluation.
-
handle_result
(completed_bundle, completed_timers, result)[source]¶ Handle the provided result produced after evaluating the input bundle.
Handle the provided TransformResult, produced after evaluating the provided committed bundle (potentially None, if the result of a root PTransform).
The result is the output of running the transform contained in the TransformResult on the contents of the provided bundle.
Parameters: - completed_bundle – the bundle that was processed to produce the result.
- completed_timers – the timers that were delivered to produce the completed_bundle.
- result – the TransformResult of evaluating the input bundle
Returns: the committed bundles contained within the handled result.
-
has_cache
¶
-
apache_beam.runners.direct.executor module¶
An executor that schedules and executes applied ptransforms.
-
class
apache_beam.runners.direct.executor.
Executor
(*args, **kwargs)[source]¶ Bases:
object
For internal use only; no backwards-compatibility guarantees.
-
class
apache_beam.runners.direct.executor.
TransformExecutor
(transform_evaluator_registry, evaluation_context, input_bundle, applied_transform, completion_callback, transform_evaluation_state)[source]¶ Bases:
apache_beam.runners.direct.executor.CallableTask
For internal use only; no backwards-compatibility guarantees.
TransformExecutor will evaluate a bundle using an applied ptransform.
A CallableTask responsible for constructing a TransformEvaluator and evaluating it on some bundle of input, and registering the result using the completion callback.
apache_beam.runners.direct.helper_transforms module¶
-
class
apache_beam.runners.direct.helper_transforms.
FinishCombine
(combine_fn)[source]¶ Bases:
apache_beam.transforms.core.DoFn
Merges partially combined results.
-
class
apache_beam.runners.direct.helper_transforms.
LiftedCombinePerKey
(combine_fn, args, kwargs)[source]¶ Bases:
apache_beam.transforms.ptransform.PTransform
An implementation of CombinePerKey that does mapper-side pre-combining.
-
class
apache_beam.runners.direct.helper_transforms.
PartialGroupByKeyCombiningValues
(combine_fn)[source]¶ Bases:
apache_beam.transforms.core.DoFn
Aggregates values into a per-key-window cache.
As bundles are in-memory-sized, we don’t bother flushing until the very end.
apache_beam.runners.direct.transform_evaluator module¶
An evaluator of a specific application of a transform.
-
class
apache_beam.runners.direct.transform_evaluator.
TransformEvaluatorRegistry
(evaluation_context)[source]¶ Bases:
object
For internal use only; no backwards-compatibility guarantees.
Creates instances of TransformEvaluator for the application of a transform.
-
for_application
(applied_ptransform, input_committed_bundle, side_inputs, scoped_metrics_container)[source]¶ Returns a TransformEvaluator suitable for processing given inputs.
-
should_execute_serially
(applied_ptransform)[source]¶ Returns True if this applied_ptransform should run one bundle at a time.
Some TransformEvaluators use a global state object to keep track of their global execution state. For example evaluator for _GroupByKeyOnly uses this state as an in memory dictionary to buffer keys.
Serially executed evaluators will act as syncing point in the graph and execution will not move forward until they receive all of their inputs. Once they receive all of their input, they will release the combined output. Their output may consist of multiple bundles as they may divide their output into pieces before releasing.
Parameters: applied_ptransform – Transform to be used for execution. Returns: True if executor should execute applied_ptransform serially.
-
apache_beam.runners.direct.transform_result module¶
The result of evaluating an AppliedPTransform with a TransformEvaluator.
-
class
apache_beam.runners.direct.transform_result.
TransformResult
(applied_ptransform, uncommitted_output_bundles, state, timer_update, counters, watermark_hold, undeclared_tag_values=None)[source]¶ Bases:
object
For internal use only; no backwards-compatibility guarantees.
The result of evaluating an AppliedPTransform with a TransformEvaluator.
apache_beam.runners.direct.watermark_manager module¶
Manages watermarks of PCollections and AppliedPTransforms.
-
class
apache_beam.runners.direct.watermark_manager.
WatermarkManager
(clock, root_transforms, value_to_consumers)[source]¶ Bases:
object
For internal use only; no backwards-compatibility guarantees.
Tracks and updates watermarks for all AppliedPTransforms.
-
WATERMARK_NEG_INF
= Timestamp(-9223372036854.775808)¶
-
WATERMARK_POS_INF
= Timestamp(9223372036854.775807)¶
-
get_watermarks
(applied_ptransform)[source]¶ Gets the input and output watermarks for an AppliedPTransform.
If the applied_ptransform has not processed any elements, return a watermark with minimum value.
Parameters: applied_ptransform – AppliedPTransform to get the watermarks for. Returns: A snapshot (TransformWatermarks) of the input watermark and output watermark for the provided transform.
-
Module contents¶
Inprocess runner executes pipelines locally in a single process.
Anything in this package not imported here is an internal implementation detail with no backwards-compatibility guarantees.


SARS-CoV-2 has been the worst pandemic in over 100 years.We have put forth this resource which will provide radiology reports and detect Covid-19 virus through patient CT-scan reports.
Sentiment studies for various social media platforms along with current tracker of covid-19 across the world will also be displayed.
View ReportThe data collection for covid-19 detection is taken from Negin Medical located at Sari in Iran. This dataset is combined using three different data collections.The images are HRCT radiology scans which are in the format of 16-bit DICOM format and converted into TIFF format as grayscale images.The dataset used for sentiment study is taken from twitter.The data contains location, time and date of tweet along with the original tweet in the form of text.The rest of the study comprises of daily incremental data taken from data world website and is used for visualization. It consists of bubble structure for density of covid cases in that country and includes cases count and death count of the region that the user has selected on the map.
Our goal is to provide this evidence based analysis for people who do not have the resources or access to a radiologist immediately.We do not promote using this webpage as the sole source of diagnosis. A professional should be consulted for further analysis and medication.


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--net.sf.saxon.type.Type
This class contains static information about types and methods for constructing type codes. The class is never instantiated.
| Field Summary | |
static AtomicType |
ANY_ATOMIC_TYPE
|
static int |
ANY_SIMPLE_TYPE
|
static int |
ANY_URI
Item type representing the type xs:anyURI |
static AtomicType |
ANY_URI_TYPE
|
static int |
ATOMIC
Constant denoting any atomic type (the union of all primitive types and types derived from primitive types by restriction or by union) |
static short |
ATTRIBUTE
Item type representing an attribute node - attribute() |
static int |
BASE64_BINARY
Item type representing the type xs:base64Binary |
static AtomicType |
BASE64_BINARY_TYPE
|
static int |
BOOLEAN
Item type representing the type xs:boolean |
static AtomicType |
BOOLEAN_TYPE
|
static int |
BYTE
Item type representing the type xs:byte |
static short |
COMMENT
Item type representing a comment node |
static int |
DATE
Item type representing the type xs:date |
static int |
DATE_TIME
Item type representing the type xs:dateTime |
static AtomicType |
DATE_TIME_TYPE
|
static AtomicType |
DATE_TYPE
|
static int |
DAY_TIME_DURATION
Item type representing the type xdt:dayTimeDuration |
static AtomicType |
DAY_TIME_DURATION_TYPE
|
static int |
DECIMAL
Item type representing the type xs:decimal |
static AtomicType |
DECIMAL_TYPE
|
static short |
DOCUMENT
Item type representing a document node |
static int |
DOUBLE
Item type representing the type xs:double |
static AtomicType |
DOUBLE_TYPE
|
static int |
DURATION
Item type representing the type xs:duration |
static AtomicType |
DURATION_TYPE
|
static short |
ELEMENT
Type representing an element node - element() |
static short |
EMPTY
Item type that matches no items (corresponds to SequenceType empty()) |
static int |
ENTITY
Item type representing the type xs:ENTITY |
static int |
FLOAT
Item type representing the type xs:float |
static AtomicType |
FLOAT_TYPE
|
static int |
G_DAY
Item type representing the type xs:gDay |
static AtomicType |
G_DAY_TYPE
|
static int |
G_MONTH
Item type representing the type xs:gMonth |
static int |
G_MONTH_DAY
Item type representing the type xs:monthDay |
static AtomicType |
G_MONTH_DAY_TYPE
|
static AtomicType |
G_MONTH_TYPE
|
static int |
G_YEAR
Item type representing the type xs:gYear |
static int |
G_YEAR_MONTH
Item type representing the type xs:gYearMonth |
static AtomicType |
G_YEAR_MONTH_TYPE
|
static AtomicType |
G_YEAR_TYPE
|
static int |
HEX_BINARY
Item type representing the type xs:hexBinary |
static AtomicType |
HEX_BINARY_TYPE
|
static int |
ID
Item type representing the type xs:ID |
static AtomicType |
ID_TYPE
|
static int |
IDREF
Item type representing the type xs:IDREF |
static int |
IDREFS
Content type representing the complex type xs:IDREFS |
static int |
INT
Item type representing the type xs:int |
static int |
INTEGER
Item type representing the type xs:integer |
static AtomicType |
INTEGER_TYPE
|
static short |
ITEM
An item type that matches any item |
static ItemType |
ITEM_TYPE
|
static int |
LANGUAGE
Item type representing the type xs:language |
static int |
LONG
Item type representing the type xs:long |
static short |
MAX_NODE_TYPE
A type that matches nothing |
static int |
NAME
Item type representing the type xs:NAME |
static short |
NAMESPACE
Item type representing a namespace node |
static int |
NCNAME
Item type representing the type xs:NCNAME |
static int |
NEGATIVE_INTEGER
Item type representing the type xs:negativeInteger |
static int |
NMTOKEN
Item type representing the type xs:NMTOKEN |
static int |
NMTOKENS
Content type representing the complex type xs:NMTOKENS |
static short |
NODE
An item type that matches any node |
static ItemType |
NODE_TYPE
|
static int |
NON_NEGATIVE_INTEGER
Item type representing the type xs:nonNegativeInteger |
static int |
NON_POSITIVE_INTEGER
Item type representing the type xs:nonPositiveInteger |
static int |
NORMALIZED_STRING
Item type representing the type xs:normalizedString |
static int |
NOTATION
Item type representing the type xs:NOTATION |
static AtomicType |
NOTATION_TYPE
|
static int |
NUMBER
Constant denoting any numeric type (the union of float, double, and decimal) |
static AtomicType |
NUMBER_TYPE
|
static int |
OBJECT
Constant representing the type of an external object (for use by extension functions) |
static int |
POSITIVE_INTEGER
Item type representing the type xs:positiveInteger |
static short |
PROCESSING_INSTRUCTION
Item type representing a processing-instruction node |
static int |
QNAME
Item type representing the type xs:QName |
static AtomicType |
QNAME_TYPE
|
static int |
SHORT
Item type representing the type xs:short |
static int |
STRING
Constants representing primitive data types defined in Schema Part 2 |
static AtomicType |
STRING_TYPE
|
static short |
TEXT
Item type representing a text node - text() |
static int |
TIME
Item type representing the type xs:time |
static AtomicType |
TIME_TYPE
|
static int |
TOKEN
Item type representing the type xs:token |
static int |
UNSIGNED_BYTE
Item type representing the type xs:unsignedByte |
static int |
UNSIGNED_INT
Item type representing the type xs:unsignedInt |
static int |
UNSIGNED_LONG
Item type representing the type xs:unsignedLong |
static int |
UNSIGNED_SHORT
Item type representing the type xs:unsignedShort |
static int |
UNTYPED_ATOMIC
Item type representing the type xdt:untypedAtomic (the type of the content of a schema-less node) |
static AtomicType |
UNTYPED_ATOMIC_TYPE
|
static int |
YEAR_MONTH_DURATION
Item type representing the type xdt:yearMonthDuration |
static AtomicType |
YEAR_MONTH_DURATION_TYPE
|
| Constructor Summary | |
Type()
|
| Method Summary | |
static java.lang.String |
displayTypeName(Item item)
Output (for diagnostics) a representation of the type of an item. |
static ItemType |
getBuiltInItemType(java.lang.String namespace,
java.lang.String localName)
Get the SimpleType object for a built-in simple type code |
static ItemType |
getCommonSuperType(ItemType t1,
ItemType t2)
Get a type that is a common supertype of two given types |
static boolean |
isComparable(int t1,
int t2)
Determine whether two primitive atomic types are comparable |
static boolean |
isNodeType(ItemType type)
Test whether a given type is (some subtype of) node() |
static boolean |
isOrdered(int type)
Determine whether a primitive type is ordered. |
static boolean |
isPrimitiveType(int code)
Determine whether this type is a primitive type. |
static boolean |
isPromotable(ItemType sourceType,
ItemType targetType)
Determine whether type A is numerically promotable to type B, for example xs:integer is promotable to xs:double |
static boolean |
isSubType(ItemType subtype,
ItemType supertype)
Determine whether type A is type B or one of its subtypes, recursively |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
public static final short ELEMENT
public static final short ATTRIBUTE
public static final short TEXT
public static final short PROCESSING_INSTRUCTION
public static final short COMMENT
public static final short DOCUMENT
public static final short NAMESPACE
public static final short NODE
public static final ItemType NODE_TYPE
public static final short ITEM
public static final ItemType ITEM_TYPE
public static final short MAX_NODE_TYPE
public static final short EMPTY
public static final int ATOMIC
public static final int NUMBER
public static final int STRING
public static final int BOOLEAN
public static final int DECIMAL
public static final int FLOAT
public static final int DOUBLE
public static final int DURATION
public static final int DATE_TIME
public static final int TIME
public static final int DATE
public static final int G_YEAR_MONTH
public static final int G_YEAR
public static final int G_MONTH_DAY
public static final int G_DAY
public static final int G_MONTH
public static final int HEX_BINARY
public static final int BASE64_BINARY
public static final int ANY_URI
public static final int QNAME
public static final int NOTATION
public static final int UNTYPED_ATOMIC
public static final int ANY_SIMPLE_TYPE
public static final int OBJECT
public static final int INTEGER
public static final int NON_POSITIVE_INTEGER
public static final int NEGATIVE_INTEGER
public static final int LONG
public static final int INT
public static final int SHORT
public static final int BYTE
public static final int NON_NEGATIVE_INTEGER
public static final int POSITIVE_INTEGER
public static final int UNSIGNED_LONG
public static final int UNSIGNED_INT
public static final int UNSIGNED_SHORT
public static final int UNSIGNED_BYTE
public static final int NORMALIZED_STRING
public static final int TOKEN
public static final int LANGUAGE
public static final int NMTOKEN
public static final int NMTOKENS
public static final int NAME
public static final int NCNAME
public static final int ID
public static final int IDREF
public static final int IDREFS
public static final int ENTITY
public static final int YEAR_MONTH_DURATION
public static final int DAY_TIME_DURATION
public static final AtomicType UNTYPED_ATOMIC_TYPE
public static final AtomicType ANY_ATOMIC_TYPE
public static final AtomicType YEAR_MONTH_DURATION_TYPE
public static final AtomicType DAY_TIME_DURATION_TYPE
public static final AtomicType STRING_TYPE
public static final AtomicType BOOLEAN_TYPE
public static final AtomicType DECIMAL_TYPE
public static final AtomicType FLOAT_TYPE
public static final AtomicType DOUBLE_TYPE
public static final AtomicType DURATION_TYPE
public static final AtomicType DATE_TIME_TYPE
public static final AtomicType TIME_TYPE
public static final AtomicType DATE_TYPE
public static final AtomicType G_YEAR_MONTH_TYPE
public static final AtomicType G_YEAR_TYPE
public static final AtomicType G_MONTH_DAY_TYPE
public static final AtomicType G_DAY_TYPE
public static final AtomicType G_MONTH_TYPE
public static final AtomicType HEX_BINARY_TYPE
public static final AtomicType BASE64_BINARY_TYPE
public static final AtomicType ANY_URI_TYPE
public static final AtomicType QNAME_TYPE
public static final AtomicType NOTATION_TYPE
public static final AtomicType INTEGER_TYPE
public static final AtomicType ID_TYPE
public static final AtomicType NUMBER_TYPE
| Constructor Detail |
public Type()
| Method Detail |
public static boolean isNodeType(ItemType type)
type
- The type to be tested
public static final java.lang.String displayTypeName(Item item)
public static ItemType getBuiltInItemType(java.lang.String namespace, java.lang.String localName)
public static boolean isSubType(ItemType subtype, ItemType supertype)
subtype
- identifies the first typesupertype
- identifies the second type
public static boolean isPromotable(ItemType sourceType, ItemType targetType)
public static final ItemType getCommonSuperType(ItemType t1, ItemType t2)
t1
- the first item typet2
- the second item type
public static boolean isPrimitiveType(int code)
code
- the item type code to be tested
public static boolean isComparable(int t1, int t2)
t1
- the first type to compared.
This must be a primitive atomic type as defined by ItemType.getPrimitiveType()
t2
- the second type to compared.
This must be a primitive atomic type as defined by ItemType.getPrimitiveType()
public static boolean isOrdered(int type)
type
- the primitive item type being tested
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


{% extends "base.html" %} {% block content %}
Successfully Removed: {{ post.title }}
This post has been removed


kris.shaffermusic.com / @krisshaffer
see also: Push, Pull, Fork: GitHub for Academics (Hybrid Pedagogy)
view presentation at kris.shaffermusic.com/githubforacademics
fork presentation at github.com/kshaffer/githubforacademics
GitHub for Academics: Forking, editing, and hosting a website from Kris Shaffer on Vimeo.


Connect to ART HISTORY in the Course Register.
ART HISTORY
ARTH-100 ARTS@PENN: BLDG PHILADEL 1 CU FRESHMAN SEMINAR 301 SEM TR 3-4:30PM COLL 311A BROWNLEE D MAX: 15 SPIEGEL-WILKS SEMINAR 1 CU FRESHMAN SEMINAR 402 SEM TR 10:30-12NOON TBA LEVY A CONTACT DEPT or INSTRUCTOR FOR CLASSRM INFO CROSS LISTED: ENGL-016 MAX W/CROSS LIST: 15 ARTH-102 RENAISSANCE-CONTEMPORARY 1 CU REGISTRATION REQUIRED FOR LEC, REC CROSS CULTURAL ANALYSIS ARTS & LETTERS SECTOR 401 LEC TR 12-1:30PM COLL 200 SHAW/KIM CROSS LISTED: VLST-232 MAX W/CROSS LIST: 160 RECITATION 0 CU 402 REC T 9:30-10:30AM JAFF 104 KIM P CROSS LISTED: VLST-232 MAX W/CROSS LIST: 20 403 REC T 10:30-11:30AM JAFF 113 KIM P CROSS LISTED: VLST-232 MAX W/CROSS LIST: 20 404 REC R 2-3PM JAFF 104 FILIPOWSKA R CROSS LISTED: VLST-232 MAX W/CROSS LIST: 20 405 REC R 3-4PM JAFF 104 WISE R CROSS LISTED: VLST-232 MAX W/CROSS LIST: 20 406 REC F 11-12NOON BENN 406 FILIPOWSKA R CROSS LISTED: VLST-232 MAX W/CROSS LIST: 20 407 REC F 12-1PM JAFF B17 CHILES A CROSS LISTED: VLST-232 MAX W/CROSS LIST: 20 408 REC T 10:30-11:30AM JAFF 104 WISE R CROSS LISTED: VLST-232 MAX W/CROSS LIST: 20 409 REC F 1-2PM JAFF B17 CHILES A CROSS LISTED: VLST-232 MAX W/CROSS LIST: 20 ARTH-103 ART & CIV IN EAST ASIA 1 CU REGISTRATION REQUIRED FOR LEC, REC ARTS & LETTERS SECTOR CROSS CULTURAL ANALYSIS 401 LEC MW 12-1PM BENN 401 DAVIS J CROSS LISTED: EALC-013 VLST-233 MAX W/CROSS LIST: 60 RECITATION 0 CU 402 REC F 10-11AM BENN 25 STAFF CROSS LISTED: EALC-013 VLST-233 MAX W/CROSS LIST: 16 403 REC F 11-12NOON BENN 25 STAFF CROSS LISTED: EALC-013 VLST-233 MAX W/CROSS LIST: 16 404 REC F 12-1PM BENN 25 STAFF CROSS LISTED: EALC-013 VLST-233 MAX W/CROSS LIST: 16 ARTH-107 INTRO TO FILM THEORY 1 CU 401 LEC TR 10:30-12NOON BENN 401 PINAR E CROSS LISTED: CINE-103 ENGL-095 MAX W/CROSS LIST: 60 ARTH-109 WORLD FILM HIST '45-PRES 1 CU ARTS & LETTERS SECTOR 401 LEC MW 2-3:30PM BENN 401 CONSOLATI C CROSS LISTED: CINE-102 ENGL-092 MAX W/CROSS LIST: 75 ARTH-221 GREEK VASE PAINTING 1 CU 401 LEC TR 1:30-3PM JAFF B17 BROWNLEE A OBJECTS-BASED LEARNING COURSE CROSS LISTED: AAMW-621 ARTH-621 MAX W/CROSS LIST: 30 ARTH-233 EAST MED ARCHITECTURE 1 CU 401 LEC TR 9-10:30AM JAFF B17 OUSTERHOUT R CROSS LISTED: AAMW-633 ARTH-633 MAX W/CROSS LIST: 30 ARTH-275 REVOLUTION TO REALISM 1 CU 401 LEC MW 1-2PM ARCH 208 GREWE C CROSS LISTED: ARTH-675 MAX W/CROSS LIST: 30 RECITATION 0 CU 402 REC W 4-5PM BENN 24 STAFF CROSS LISTED: ARTH-675 MAX W/CROSS LIST: 15 403 REC W 5-6PM BENN 24 STAFF CROSS LISTED: ARTH-675 MAX W/CROSS LIST: 15 ARTH-281 MODERN ARCH:1900-PRESENT 1 CU REGISTRATION REQUIRED FOR LEC, REC 401 LEC MWF 11-12NOON JAFF B17 BROWNLEE D CROSS LISTED: ARTH-681 MAX W/CROSS LIST: 30 RECITATION 0 CU 402 REC M 2-3PM JAFF B17 BARTON J CROSS LISTED: ARTH-681 MAX W/CROSS LIST: 10 403 REC W 12-1PM JAFF 104 BARTON J CROSS LISTED: ARTH-681 MAX W/CROSS LIST: 10 404 REC F 12-1PM BENN 16 BARTON J CROSS LISTED: ARTH-681 MAX W/CROSS LIST: 10 ARTH-289 FILM FESTIVALS 1 CU 401 SEM TR 1:30-3PM BENN 401 MAZAJ M CROSS LISTED: CINE-202 ENGL-292 MAX W/CROSS LIST: 25 ARTH-292 DOCUMENT(ARY), DATABASE 1 CU 401 SEM MW 2-3:30PM BENN 24 MUKHERJEE R CROSS LISTED: CINE-278 ENGL-278 MAX W/CROSS LIST: 25 ARTH-293 BLACKNESS ACROSS MEDIA 1 CU 403 SEM MW 3:30-5PM BENN 407 BRAR D CROSS LISTED: AFRC-296 CINE-295 COML-295 ENGL-295 MAX W/CROSS LIST: 25 ARTH-294 ART NOW 1 CU REGISTRATION REQUIRED FOR LEC, REC 401 LEC MW 10-11AM STIT B26 SILVERMAN K CROSS LISTED: ARTH-694 GSWS-294 VLST-236 MAX W/CROSS LIST: 100 RECITATION 0 CU 402 REC R 11-12NOON JAFF 104 FIRUNTS M CROSS LISTED: GSWS-294 VLST-236 MAX W/CROSS LIST: 20 403 REC R 12-1PM JAFF 113 DRESKIN J CROSS LISTED: GSWS-294 VLST-236 MAX W/CROSS LIST: 21 405 REC F 12-1PM JAFF 104 DRESKIN J CROSS LISTED: GSWS-294 VLST-236 MAX W/CROSS LIST: 20 406 REC W 2-3PM JAFF B17 FIRUNTS M CROSS LISTED: GSWS-294 VLST-236 MAX W/CROSS LIST: 16 ARTH-388 SPIEG-WILKS SEM IN C ART 1 CU 301 SEM W 2-5PM TBA SHAW G PERMISSION NEEDED FROM INSTRUCTOR CONTACT DEPT or INSTRUCTOR FOR CLASSRM INFO MAX: 15 ARTH-389 TRANSNATIONAL CINEMA 1 CU BENJAMIN FRANKLIN SEMINARS 401 SEM TR 10:30-12NOON BENN 201 MAZAJ M CROSS LISTED: CINE-392 ENGL-392 SECTION MAX: 5 MAX W/CROSS LIST: 20 ARTH-397 SNR PROJ, ARCHITECT HIST 1 CU 000 IND TBA STAFF PERMISSION NEEDED FROM DEPARTMENT ARTH-398 SENIOR THESIS 1 CU 000 IND TBA STAFF PERMISSION NEEDED FROM DEPARTMENT ARTH-399 INDEPENDENT STUDY 1 CU PERMISSION NEEDED FROM DEPARTMENT 000 IND TBA STAFF ARTH-427 ROMAN SCULPTURE 1 CU 401 LEC TR 10:30-12NOON JAFF B17 KUTTNER A CROSS LISTED: AAMW-427 CLST-427 MAX W/CROSS LIST: 30 ARTH-435 MDVL ISLAMIC ART & ARCH 1 CU 401 LEC TR 12-1:30PM JAFF B17 HOLOD R CROSS LISTED: AAMW-435 COML-415 NELC-489 MAX W/CROSS LIST: 25 ARTH-501 MAGIC IN THE MUSEUM 1 CU 401 SEM TR 10:30-12NOON TBA OUSTERHOUT OBJECTS-BASED LEARNING COURSE PERMISSION NEEDED FROM INSTRUCTOR CONTACT DEPT or INSTRUCTOR FOR CLASSRM INFO CROSS LISTED: AAMW-509 NELC-501 MAX W/CROSS LIST: 12 ARTH-520 BRONZE AGE CULTS 1 CU 401 SEM R 3-6PM BENN 140 LUPACK S CROSS LISTED: AAMW-520 MAX W/CROSS LIST: 15 ARTH-525 THE LATE ANTIQUE IMAGE 1 CU 401 SEM M 2-5PM JAFF 113 KUTTNER A CROSS LISTED: AAMW-525 CLST-521 MAX W/CROSS LIST: 15 ARTH-550 TERRESTRIAL IMAGINATION 1 CU 301 SEM R 1:30-4:30PM JAFF 113 KIM D MAX: 15 ARTH-585 IMAGE AND PLACE IN PHILA 1 CU 301 SEM R 5:30-8:30PM JAFF 104 MILROY E MAX: 20 ARTH-621 GREEK VASE PAINTING 1 CU 401 LEC TR 1:30-3PM JAFF B17 BROWNLEE A OBJECTS-BASED LEARNING COURSE CROSS LISTED: AAMW-621 ARTH-221 MAX W/CROSS LIST: 30 ARTH-633 EAST MED ARCHITECTURE 1 CU 401 LEC TR 9-10:30AM JAFF B17 OUSTERHOUT R CROSS LISTED: AAMW-633 ARTH-233 MAX W/CROSS LIST: 30 ARTH-675 REVOLUTION TO REALISM 1 CU 401 LEC MW 1-2PM ARCH 208 GREWE C CROSS LISTED: ARTH-275 MAX W/CROSS LIST: 30 RECITATION 0 CU 402 REC W 4-5PM BENN 24 STAFF CROSS LISTED: ARTH-275 MAX W/CROSS LIST: 15 403 REC W 5-6PM BENN 24 STAFF CROSS LISTED: ARTH-275 MAX W/CROSS LIST: 15 ARTH-681 MODERN ARCH:1900-PRESENT 1 CU REGISTRATION REQUIRED FOR LEC, REC 401 LEC MWF 11-12NOON JAFF B17 BROWNLEE D CROSS LISTED: ARTH-281 MAX W/CROSS LIST: 30 RECITATION 0 CU 402 REC M 2-3PM JAFF B17 BARTON J CROSS LISTED: ARTH-281 MAX W/CROSS LIST: 10 403 REC W 12-1PM JAFF 104 BARTON J CROSS LISTED: ARTH-281 MAX W/CROSS LIST: 10 404 REC F 12-1PM BENN 16 BARTON J CROSS LISTED: ARTH-281 MAX W/CROSS LIST: 10 ARTH-694 ART NOW 1 CU 401 LEC MW 10-11AM STIT B26 SILVERMAN K CROSS LISTED: ARTH-294 GSWS-294 VLST-236 MAX W/CROSS LIST: 100 ARTH-714 CURSEM:REP PLCE IN PRNTS 1 CU 301 SEM W 2-4PM JAFF 113 DAVIS J MAX: 15 ARTH-723 THE NEO-SUMERIAN PERIOD 1 CU 401 SEM T 3-6PM JAFF 113 PITTMAN/RISTVET OBJECTS-BASED LEARNING COURSE CROSS LISTED: AAMW-723 ANTH-723 NELC-740 MAX W/CROSS LIST: 15 ARTH-738 APRCHS TO ARCHL/ISLM PER 1 CU 401 SEM W 3-5PM JAFF 104 HOLOD R CROSS LISTED: AAMW-738 NELC-731 MAX W/CROSS LIST: 10 ARTH-740 ALTARPIECE/ALTAR IMAGE 1 CU 301 SEM R 5-7PM JAFF 113 MERBACK M MAX: 15 ARTH-775 MONET / IMPRESSIONISM 1 CU 301 SEM W 5-7PM JAFF 113 DOMBROWSKI A MAX: 15 ARTH-783 MODERNISMS ACRS BORDERS 1 CU 401 SEM W 2-5PM VANP 627 PLATT/POGGI UNDERGRADUATES NEED PERMISSION CROSS LISTED: COML-683 ENGL-573 SLAV-683 SECTION MAX: 9 MAX W/CROSS LIST: 30 ARTH-794 PICTORIAL PHOTOGRAPHY 1 CU 401 SEM T 1:30-4:30PM JAFF 104 SILVERMAN K PERMISSION NEEDED FROM INSTRUCTOR CROSS LISTED: COML-787 ENGL-790 MAX W/CROSS LIST: 14 ARTH-990 MASTERS THESIS 1 CU 035 MST TBA DOMBROWSKI A ARTH-995 DISSERTATION 1 CU SEE DEPT. FOR SECTION NUMBERS PERMISSION NEEDED FROM DEPARTMENT 000 DIS TBA STAFF ARTH-999 INDEPENDENT STUDY 1 CU SEE DEPT. FOR SECTION NUMBERS PERMISSION NEEDED FROM DEPARTMENT 000 IND TBA STAFF
Return to Course & Room Roster
Comments to:
Office of the University Registrar
University of Pennsylvania
Room 221 Franklin Building
3451 Walnut Street
Philadelphia, PA 19104-6291
Phone:<PHONE_NUMBER> Fax:<PHONE_NUMBER>
<EMAIL_ADDRESS>Updated: Sat Jan 17 08:30:02 2015


245 houses sold
245 houses sold
245 houses sold
Tiled say decay spoil now walls meant house. My mr interest thoughts screened of outweigh removing.
Tiled say decay spoil now walls meant house. My mr interest thoughts screened of outweigh removing.
Tiled say decay spoil now walls meant house. My mr interest thoughts screened of outweigh removing.
Tiled say decay spoil now walls meant house. My mr interest thoughts screened of outweigh removing.
Tiled say decay spoil now walls meant house. My mr interest thoughts screened of outweigh removing.
Tiled say decay spoil now walls meant house. My mr interest thoughts screened of outweigh removing.
Tiled say decay spoil now walls meant house. My mr interest thoughts screened of outweigh removing. Tiled say decay spoil now walls meant house. My mr interest thoughts screened of outweigh removing.


Just me, myself and I, exploring the universe of uknownment. I have a heart of love and a interest of programming and game.  I want to share my world with you.


FORCES OF NATURE Review by Chase McCown
Material may not be copied or used without the written consent of the author.
CAST: Ben Affleck (Ben), Sandra Bullock (Sarah), Maura Tierney (Bridget). Rated PG-13 for language and one instance of drug use.
Ben Holmes has a wedding in Savannah to get to...his own. Getting from New York to Georgia has never been so difficult. To start things off, his flight is cancelled when a bird flies into the planes's propeller. Then, as plot development would have it, there are absolutely no rental cars available. Naturally, he hitches a ride with a complete stranger named Vic, and ends up in jail as a result. He gets on the wrong train, has no money for a bus, etc, etc. He begins to wonder if he is supposed to be married, given the disasters that have occured in such a short time. Are forces of nature really trying to show him that marriage is not his destiny? Do destiny and luck even exist? And why does it seem that every married couple is really unhappy?
During this voyage, Ben is accompanied by fellow sojourner Sarah Lewis, who just so happens to be heading towards Savannah to visit her family. The two meet when they are coincidentally next to each other in the airport.  How do such opposites attract? Could it be forces of nature?
On his way to the wedding, Ben feels that certain signs are telling him not to marry his longtime girlfriend Bridget. While Bridget waits for Ben back home, she is tempted by an ex-boyfriend and frustrated by her constantly-feuding parents. Will Ben and Bridget get married? Will Bridget stay with her ex-boyfriend? Will Ben and Sarah fall in love?
While I will not give away the ending, I will say that this movie is very entertaining and quick moving. I am usually not a fan of Sandra Bullock's work, but this movie certainly does redeem her. And I am also impressed with the usually serious Ben Affleck in a much more light-hearted role.
I would recommend this movie not just as a date movie. There is a certain Trains, Planes, and Automobiles feel to the flick, which provides constant comic relief. Romance usually takes a back seat to plot development and amusing situations in Forces of Nature, which makes the movie more appealing.
Before your theatre is struck down by lightning or blown away in a tornado, run and see Forces of Nature. As Sarah said, "We guarantee you a really good show."
My rating (scale of 1-10, 1=awful, 10=flawless): Forces of Nature receives an 8
------ Chase McCown ------ Please visit my new movie-related website: http://members.aol.com/moviefan79/home.html It is under construction now, but let me know what you think!
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


This object provides convenience methods to create an iterable representation of a source file.
A class for character encoding/decoding preferences.
The class Source
implements an iterable representation
of source data.
Pickler combinators.
The object Position
provides convenience methods to encode
line and column number in one single integer.
This object provides convenience methods to create an iterable representation of a source file.
no summary matey


LCD¶
API for work with lcd_hd44780¶
-
LCD_HD44780_H
¶ libsk GL-SK on-board LCD abstraction layer
The display is WH1602B (based on HD44780 controller)
-
type
sk_delay_func_t
¶ Pointer to delay(uint32_t var) function defined as type
-
sk_err
_sk_lcd_cmd
(struct sk_lcd *lcd, int rs, int rw, uint8_t *cmddata)¶ Issue low-level LCD command @rs: value on RS pin @rw: write (true) or read (false). Corresponds to value on RW pin @cmddata: value to set on data pins
-
sk_err
sk_lcd_cmd_clear
(struct sk_lcd *lcd)¶ Clear Display command @lcd: LCD object (
sk_lcd
)Clears entire display and sets DDRAM address 0 in address counter.
-
sk_err
sk_lcd_cmd_rethome
(struct sk_lcd *lcd)¶ Return Home command @lcd: LCD object (
sk_lcd
)Sets DDRAM address 0 in address counter. Also returns display from being shifted to original position. DDRAM contents remain unchanged.
-
sk_err
sk_lcd_cmd_emodeset
(struct sk_lcd *lcd, int isdirright, int isshift)¶ Entry Mode Set command @lcd: LCD object (
sk_lcd
) @isdirright: true for left-to-right direction (cursor increment),false for right-to-left direction (cursor decrement)
@isshift: whether to shift display contents according to direction set
Sets cursor move direction and specifies display shift. These operations are performed during data write and read
-
sk_err
sk_lcd_cmd_onoffctl
(struct sk_lcd *lcd, int display, int cursor, int blink)¶ Display ON/OFF Control command @lcd: LCD object (
sk_lcd
) @display: turn display on (true) or off (false) @cursor: turn cursor dispaly on (true) or off (false) @blink: turn cursor blinking on (true) or off (false)Sets entire display (D) on/off, cursor on/off (C), and blinking of cursor position character (B)
-
sk_err
sk_lcd_cmd_shift
(struct sk_lcd *lcd, int isshift, int isdirright)¶ Cursor or Display Shift command @lcd: LCD object (
sk_lcd
) @isshift: Display shift (true) or Cursor move (false) @isdirright: Shift/Move to the right (true) or to the left (false)Moves cursor and shifts display without changing DDRAM contents
-
sk_err
sk_lcd_cmd_setaddr
(struct sk_lcd *lcd, uint8_t addr, int iscgram)¶ Set DDRAM Address and Set CGRAM Address commands @lcd:LCD object (
sk_lcd
) @addr: address to set @iscgram: false to set provided address in DDRAM, true – in CGRAMSets DDRAM/CGRAM address. DDRAM/CGRAM data is sent and received after this setting DDRAM address has 7 bits, CGRAM address is 6 bit wide
-
void
sk_lcd_write_byte
(struct sk_lcd *lcd, uint8_t byte)¶ Write data to CG or DDRAM @lcd: LCD object (
sk_lcd
) @byte: data byte to send
-
void
sk_lcd_putchar
(struct sk_lcd *lcd, const char ch)¶ Put character at current position on LCD @lcd: LCD object (
sk_lcd
) @ch: char to be mapped using charmap_func and sent to LCD
-
sk_err
sk_lcd_set_backlight
(struct sk_lcd *lcd, uint8_t level)¶ Set backlight level (0..255) @lcd: LCD object (
sk_lcd
) @level: Backlight levelNote: Only two levels (ON/OFF state) are used when no backlight control callback function was provided by the user. In this case, 0 means OFF and != 0 means ON.
-
sk_err
sk_lcd_init
(struct sk_lcd *lcd)¶ Performs initalization of LCD using pre-set configuration from LCD object structure @lcd: LCD object (
sk_lcd
)
-
uint8_t
sk_lcd_charmap_none
(const char c)¶ Don’t map. Use direct symbol values (1:1)
-
uint8_t
sk_lcd_charmap_rus_cp1251
(const char c)¶ CP1251 (aka Windows-1251) char map
- This requires to compile with
-finput-charset=UTF-8 as our sources are encoded in UTF-8 -fexec-charset=cp1251 as we expect each char to be encoded in CP1251 when executing
-
void
lcd_delay_us
(struct sk_lcd *lcd, int us)¶ Private: Provides abstaction over two delay functions passed when constructing sk_lcd object
Detect if optimal delay function is applicable and use it when possible with fallback to unoptimal variants


{% include "leftSide.html" %}
Store
The Capitalist T-Shirt
The Capitalist Print
Framed Prints
Booty Shorts


The Kaggle Rossman Competition¶
This was a kaggle competition to forecast sales at a pharmacy chain/dept store in Europe. It was run back in 2015.
In [58]:
# import libraries
import numpy as np
import scipy.stats
import scipy.special
import matplotlib
import matplotlib.pyplot as plt
import matplotlib.mlab as mlab
from matplotlib import cm
import pandas as pd
%matplotlib inline
Time to learn¶
We first import our data
In [149]:
# load data
train = pd.read_csv('train.csv')
test = pd.read_csv('test.csv')
In [150]:
# get target
ytrain = train['Sales/Target'].copy().values
xtrain = train.drop('Sales/Target', axis=1)
ytest = test['Sales/Target'].copy().values
xtest = test.drop('Sales/Target', axis=1)
In [151]:
# transform df to array
xtrain = xtrain.to_numpy()
xtest = xtest.to_numpy()
In [159]:
from sklearn.metrics import mean_squared_error
from sklearn.ensemble import GradientBoostingRegressor
from sklearn.model_selection import ParameterGrid
In [157]:
# set hyper parameters
param_grid = {'learning_rate': [0.1, 0.01],
'max_depth': [1,2, 3],
'max_features': [0.2, 0.6]
}
In [160]:
# fit and evaluate Gradient Boost Regressor
ds=[]
for p in ParameterGrid(param_grid):
print(p)
gb = GradientBoostingRegressor(n_estimators=200)
gb.set_params(**p)
gb.fit(Xtrain, ytrain)
ypred = gb.predict(Xvalid)
ypredtrain = gb.predict(Xtrain)
d = p.copy()
d['n_estimators']=200
d['mse'] = mean_squared_error(ypred, yvalid)
d['msetr'] = mean_squared_error(ypredtrain, ytrain)
print("MSE", d['mse'], d['msetr'])
ds.append(d)
ds
Out[160]:
In [161]:
# display models
dsdf = pd.DataFrame.from_records(ds)
dsdf.sort_values('mse')
Out[161]:
Homework¶
Lets do the GBM on dask.


A word of caution
- Take benchmarks with caution: real life applications are more complicated than benchmarks
- Great effort dedicated to allow interpreted languages to go fast as compiled ones ($\Rightarrow$ two-language problem)
- Language enthusiasts
may advocate biased benchmarks
- Always compare the benfits: fast execution vs. fast development
- ...but still:


{% extends "_post.html" %} {%hyde title: "Return of The Carpet" created: 2007-04-26 23:42:24 %} {% block article %} {%article%}
Red Carpet, that is. Yes, that Red Carpet. I’ve taken some time lately to give some love to our old friends rcd and rug (the original rug, not the rewritten one). First I got everything building on a modern distro (openSUSE 10.2). This took more effort than I thought it would, but eventually things worked well. After that, I set out to make rcd more usable with yum services. Here is a list of the main changes:
With the above changes, rcd is once again a joy to use. I would like to get the GUI working again, but there is some kind of threading problem preventing it from running. I would also like to add ftp support, but that is not a top priority.
I know there are probably SUSE users reading this asking “Ok, sounds fine, but is it fast?”. While it may not be the fastest thing out there, I think you will be surprised at the results (I was). Here are a few simple benchmarks from normal usage scenarios:
First, lets look at the number of services I currently have added:
% rug sl
- | Service URI | Name
—+———————————————————————————+——————
1 | http://go-mono.com/download-stable/suse-102-i586?r… | mono
2 | http://software.opensuse.org/download/FATE/openSUS… | fate
3 | http://ftp.suse.com/pub/suse/update/10.2/?name=upd… | updates
4 | http://download.opensuse.org/distribution/10.2/rep… | suse-nonoss
5 | http://download.opensuse.org/distribution/10.2/rep… | suse-oss
6 | http://packman.inode.at/suse/10.2?remote_only=1;na… | packman
7 | http://software.opensuse.org/download/home:/cybero… | cyborg
8 | http://software.opensuse.org/download/X11:/XGL/ope… | xgl
9 | http://software.opensuse.org/download/Beagle/openS… | beagle
10 | http://software.opensuse.org/download/games:/actio… | games
11 | http://software.opensuse.org/download/Virtualizati… | virt
12 | http://software.opensuse.org/download/home:/kraxel… | kvm
Cold filesystem cache, daemon is sleeping:
% time rug ping > /dev/null
rug ping 0.17s user 0.02s system 1% cpu 13.735 total
Warm filesystem cache, daemon is sleeping:
<blockquote
% time rug ping >/dev/null
rug ping > /dev/null 0.14s user 0.02s system 3% cpu 4.465 total
Packages for recent SUSE distros are available in the build service. It has had a hard time keeping up recently, though, so you may run into a problem or two with rug. Sources can be found in gnome svn in the yummy branch of the various modules (rcd, rug, libredcarpet).


Post-processing the classification results fro chunk learning,
by keeping the consistency of start and end tokens of the same label,
using the length information of chunk from the training data,
selecting the chunk with the maximal probability from the overlapped
chunks.
Post-processing the results for the classification problem
for the one vs all others method: select the label with the
maximal probability which is bigger than the pre-defined threshold,
for one instance.
Name of the sub-directory under the working directory, which is used for
storing all files produced by the ML Api, such as those for NLP featuers,
feature vectors and learned model.
PAUM learning and obtain a Percptron model in primal form, read training data from a file,
and save the model into another files, and another parameter
for the number of training documents.


This simple Rack endpoint that serves as the default ‘failure’ mechanism for OmniAuth. If a strategy fails for any reason this endpoint will be invoked. The default behavior is to redirect to `/auth/failure` except in the case of a development `RACK_ENV`, in which case an exception will be raised.
# File lib/omniauth/failure_endpoint.rb, line 11 def self.call(env) new(env).call end
# File lib/omniauth/failure_endpoint.rb, line 15 def initialize(env) @env = env end
# File lib/omniauth/failure_endpoint.rb, line 19 def call raise_out! if ENV['RACK_ENV'].to_s == 'development' redirect_to_failure end
# File lib/omniauth/failure_endpoint.rb, line 39 def origin_query_param return "" unless env['omniauth.origin'] "&origin=#{Rack::Utils.escape(env['omniauth.origin'])}" end
# File lib/omniauth/failure_endpoint.rb, line 24 def raise_out! raise env['omniauth.error'] || OmniAuth::Error.new(env['omniauth.error.type']) end
# File lib/omniauth/failure_endpoint.rb, line 28 def redirect_to_failure message_key = env['omniauth.error.type'] new_path = "#{env['SCRIPT_NAME']}#{OmniAuth.config.path_prefix}/failure?message=#{message_key}#{origin_query_param}#{strategy_name_query_param}" Rack::Response.new(["302 Moved"], 302, 'Location' => new_path).finish end
# File lib/omniauth/failure_endpoint.rb, line 34 def strategy_name_query_param return "" unless env['omniauth.error.strategy'] "&strategy=#{env['omniauth.error.strategy'].name}" end


Thanks for participating in {{event.event | uppercase}}. Have a great time! All the very Best!
Date: {{event.date}}
Fee: {{event.fee}}
Venue: {{event.venue}}
(Please carry this receipt to the venue)
Volunteer Signature
{{Date.now() | date:'dd.MM.yyyy HH:mm:ss'}}


{% extends 'layout.html' %} {% block pageTitle %} Do you live in England, Wales or Northern Ireland? {% endblock %} {% block content %}
This is because you do not live in England, Wales or Northern Ireland.
You can get help from Best Start Foods (opens in a new tab) instead.


Please use the list below to search for communities to add to your "Areas of Responsibility" list. If the community you are looking for is not on the list below, please report it to your Local Government or First Nations Authority. Filtering or searching will remove any selections you have made in the community list.
Number of communities selected: {{ selectedCommunitiesList.length }}


|
Galaxy clustering dependence on the [OII] emission line luminosity in the local Universe |
|
We study the galaxy clustering dependence on the [OII] emission line luminosity in the SDSS DR7 Main galaxy sample at mean redshift z ∼ 0.1. We select volume- limited samples of galaxies with different [OII] luminosity thresholds and measure their projected, monopole and quadrupole two-point correlation functions. We model these observations using the 1h−1Gpc MultiDark Planck cosmological simulation and generate light-cones with the SUrvey GenerAtoR algorithm. To interpret our results, we adopt a modified (Sub)Halo Abundance Matching scheme, accounting for the stellar mass incompleteness of the emission line galaxies. The satellite fraction constitutes an extra parameter in this model and allows to optimize the clustering fit on both small and intermediate scales (i.e. rp ≲30h−1Mpc), with no need of any velocity bias correction. We find that, in the local Universe, the [OII] luminosity correlates with all the clustering statistics explored and with the galaxy bias. This latter quantity correlates more strongly with the SDSS r-band magnitude than [OII] luminosity. In conclusion, we propose a straightforward method to produce reliable clustering models, entirely built on the simulation products, which provides robust predictions of the typical ELG host halo masses and satellite fraction values. |
| Please click here to access the mocks and the catalogs |
| If you use these catalogs or mocks, please cite Favole, Rodriguez-Torres et al. 2016. |
last update, nov. 2016, by G. Favole and J. Comparat


Fomo OS (256bit) critical error
Error: METAMASK_NOT_PRESENT
An error has occurred. To continue:
Please unlock your metamask, or you will be unable to interact with Fomo OS correctly.
Bypass ETH Network (90% chance of success)


{% extends "layout_multi_sections.html" %} {% block page_title %} Ambassadors {% endblock %} {% block css_register %} {% endblock %} {% block main_nav %} {% include "includes/leedsgirlscan/main_nav.html" %} {% endblock %} {% block sectionOneTop %}
Cycling covers lots of different types of biking. From road cycling, mountain biking, BMXing to track cycling.
The different types require varying skills and different types of bike. All forms of cycling offer a great way to keep fit and transport you from A to B.
If you are nervous about getting back on your bike there are lots of cycling groups around Leeds including the Breeze program who are trying to get more women into cycling. Breeze organise a number of fun Leeds based bike rides for women. You can cycle at a speed that suits you and make some new friends at the same time.

Get InvolvedThey say you never forget how to ride a bike. Cycling is really easy to get back into and can be done by all ages and abilities. If you enjoy the open road and fresh air then cycling could be the sport for you. Cycling is a great way to spend time with family or friends. You can meet new people by joining your nearest cycling club.
If you have never cycled before you can take advantage of free adult cycling lessons every Saturday at Fearnville Leisure Centre available for anyone who lives or works in West Yorkshire. You don’t need to bring your own bike, just drop in and have a go.
The cost varies depending on what type of cycling you want to do. A good all-round bike will cost around £150 but this price can vary greatly.
There are bike storage facilities around Leeds including the Leeds Cycle Point at the train station which offers secure safe storage, ideal if you want to commute by bike into the city. There are a number of helpful bike shops in Leeds who can help you find the right bike and also help you fix up an existing bike such as The Pedallers’ Arms.
When cycling having the right safety equipment is paramount.
We want you to help us persuade more women and girls to get active, whatever their age, size, background or ability.
A Leeds Girls Can Ambassador: Goes through an appropriate recruitment process and signs up to Leeds City Council and Sport England’s policies and procedures. The main aim of an Ambassador is to get more women and girls in Leeds physically active. Ambassadors are required to attend monthly meetings which are vital for receiving guidance and insight around This Girl Can, this helps support their role. An Ambassador is not paid for their time, they are not required to lead a group and the roles can vary.
For further information on becoming an ambassador or any of our other roles contact Dani Penney
Apply nowDo you have an event, club or sport you would like to see here? Please get in touch.


Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages, and more recently with desktop publishing software like Aldus PageMaker including versions of Lorem Ipsum.
Tradesman1 ( 0 ) - i will do this job in 5 days, you will supply painting - 350 TL
Tradesman1 ( 3 ) 350 TL
solaress ( 8 ) - i have done a lot of jobs like that, if you want to give me your jobs its up to you if you dont want to give me the jobs i will not be sorry. i am telling you a story here but quoting test must be limited - 350 TL
Tradesman1 ( 0 ) - what if verified member usernames shown in different color ? - 350 TL
Myspecialist ( 23 ) - i will do this job in 5 days, you will supply painting - 350 TL


Resilient Distributed Datasets
Resilient Distributed Datasets(RDDs) are “a distributed memory abstraction that lets programmers perform in-memory
computations on large clusters”3, used in Spark (Zaharia et al, 2012). RDDs partition the
data across several nodes and are immutable which allows data to be accessed by multiple threads at once, safely, as the
data is not changed.
RDD Operations
RDDs can only be formed from data that is already on the disk, or by transforming other RDDs. In Spark,
transformation operations are performed lazily: the new dataset, formed by transforming an existing one, is only
computed when it is required to. Only action operations can force RDDs to be computed in order to obtain some result.
To illustrate this, let us look at the following example from the
Spark Programming Guide which
calculates the total length of a text file using the map and reduce operations:
JavaRDD lines = sc.textFile("data.txt");
JavaRDD lineLengths = lines.map(s -> s.length());
int totalLength = lineLengths.reduce((a, b) -> a + b);
Line 1 first creates an RDD named lines. Line 2 uses the transformation operation map which changes the value of
each line in lines to its length. Finally, the action operation reduce
sums all the lengths in lineLengths in
order to give the total length. Since the evaluation of transformations in Spark is lazy, the new RDD lineLengths
is not actually evaluated until it is forced to, by the action operation reduce, at the very end.
Some further transformation operations include the following: filter which transforms an RDD by retaining elements
for which some condition is true; flatMap which maps a given function to every element of the RDD and then "flattens"
them by separating out the partitions from the RDD and making them separate elements and groupBy, which combines
elements based on a certain property to form a new RDD.
Some further action operations include the following: collect, which returns all the elements of an RDD as a list
to the driver; max, which just returns the maximum element of an RDD to the driver and count, which returns the number
of elements. For more examples, refer to this databricks guide.
Fault Tolerance in Spark
Fault tolerance is the ability of the system to continue functioning even when some of the nodes have failed
4
(Tanenbaum, van Steen, 2002). Fault tolerance is achieved by finding means of recovering lost data in the event
of a failure due to some fault.
RDDs have “resilient” in the name because they are fault tolerant. RDDs become fault tolerant by storing
their lineage, allowing recovery of lost data: the “lineage” describes the way in which the dataset was derived
from other RDDs. Therefore, lost nodes can be rebuilt using data from the disk by tracing the dependencies on
other RDDs3. For example, the lineage of lineLengths
for the code example above is merely lines --> lineLengths.
Lineages can be represented in the form of a Directed Acyclic
Graph (see next section).
Immutability makes the tracing of lineage simpler as you are not able to change an RDD while tracking a lineage
to rebuild a node. Nodes with large lineages can take a long time to reproduce as following the chain of dependencies
can be costly: to fix this, Spark has an API to allow users to “checkpoint” certain pieces of data. Checkpointing
in a fault-tolerant distributed system is the saving of data to stable storage at regular intervals to enable the
recovery of lost data in the event of a failure5 (Coulouris, Dollimore &
Kindberg, 2005): this reduces the size of the path of lineages that must be traced in order to recover the failed node.


This page is for configuring authentication-related options for your
SSH server. Some of the less obvious options are :
- Allow authentication by password
- If this is set to No, users will need to have their .ssh directory
setup with a public key before being able to login. If set to Yes, the
user will be allowed to enter a password for authentication if validation
cannot be done using a public key.
- Allow RSA authentication?
- If this is set to No, users will always need to enter their password
even if their public key has been set up.
- Check permissions on key files?
- If set to Yes, the SSH server will check each user's .ssh
directory and any parent directories to make sure they are not group
writable, and the .ssh/identity file to make sure it is not
readable by anyone else. If set to No, no checking of file permissions
will be done.


thumbs-up
Username
Password
Sign In
Don't have an account?
Sign Up
Username
Password
Confirm Password
Sign Up
Already have an account?
Sign In
List Page
Rabbits
Animal 2
Animal 3
Animal 4
Animal 5
Animal 6
Animal 7
Animal 8
Animal 9
Animal 10
User Profile
Logout
Animal Page
Back
Animal Profile


--- layout: page title: Home tagline: '' ---
{{ post.content | strip_html | truncatewords:20 }}
Read more...


Coronavirus Disease 2019 (COVID-19) Cases in MA
As of March 26, 2020
CATEGORY |
NUMBER OF CONFIRMED CASES |
|---|---|
County |
|
Barnstable |
67 |
Berkshire |
73 |
Bristol |
90 |
Dukes and Nantucket |
3 |
Essex |
247 |
Franklin |
16 |
Hampden |
55 |
Hampshire |
17 |
Middlesex |
538 |
Norfolk |
292 |
Plymouth |
138 |
Suffolk |
448 |
Worcester |
166 |
Unknown |
267 |
Sex |
|
Female |
1218 |
Male |
1197 |
Unknown |
2 |
| Age Group | |
≤19 years of age |
53 |
20-29 years of age |
425 |
30-39 years of age |
433 |
40-49 years of age |
386 |
50-59 years of age |
437 |
60-69 years of age |
329 |
≥ 70 years of age |
352 |
Unknown |
2 |
Exposure |
|
Biogen conference attendees and household contacts |
99 |
Local transmission |
163 |
Travel related |
93 |
Under investigation |
2062 |
Deaths |
|
Attributed to COVID-19 |
25 |
Hospitalization |
|
Patient was hospitalized |
219 |
Patient was not hospitalized |
366 |
Under Investigation |
1832 |
These data are cumulative and current as of March 26, 2020 at 12:30PM.
| Laboratory | Total Patients Positive | Total Patients Tested |
|---|---|---|
| MA State Public Health Laboratory | 551 | 5313 |
| ARUP | 17 | 181 |
| Beth Israel Deaconess Medical Center | 208 | 1607 |
| BioReference Laboratories | 3 | 9 |
| Boston Medical Center | 24 | 91 |
| BROAD Institute CRSP* | * | * |
| Centers for Disease Control and Prevention | 1 | 11 |
| Children’s Hospital Boston | 5 | 66 |
| LabCorp | 140 | 2028 |
| Mayo Clinic Labs | 28 | 207 |
| Partners Healthcare | 118 | 1239 |
| Quest Laboratories | 1138 | 11409 |
| Tufts Medical Center | 121 | 648 |
| Viracor | 46 | 740 |
| Other | 17 | 72 |
| Total Patients Tested** | 2417 | 23621 |
Data are cumulative and current as of March 26, 2020 at 12:30PM.
* Broad Institute CRSP electronic data reporting under validation.
** Other commercial and clinical laboratories continue to come on line. As laboratory testing results are processed and the source verified, they will be integrated into this daily report.


Tuh'u
Tuh'u (Akkadian for possibly “beetroot”) is an ancient Mesopotamian spring festival dish, a lamb stew of sorts, extracted by historians at
Yale Babylonian Collection from tablets from Babylonia, ca. 1740 BC.
- ⏲ Prep time: 30 min
- 🍳 Cook time: 60-90 min
- 🍽 Servings: 3
Ingredients
- 450 g of lamb leg meat, diced
- 4 tbsp of sesame oil, olive oil, or rendered fat
- 350 mL of prepared water
- 350 mL of sour-tasting beer (e.g. Weißbier)
- 1 large onion, chopped
- 2 cups of arugula, chopped
- ¾ cup of cilantro, chopped
- 2 tsp of cumin seeds, crushed or powdered
- 2 large beetroots, chopped
- 1 leek, minced or diced
- 3-9 cloves of garlic, minced or diced
- 1 Persian shallot (Akkadian: samidu; uncertain translation)
- 1 Egyptian leek (Akkadian: suhutinnu; uncertain translation)
- Coriander seeds for garnish
Directions
- Add oil/fat to a large pot (preferably iron) and set over high heat. Sear lamb for several minutes in the oil/fat until lightly browned.
- Add onions and cook for 5 minutes
- Add beetroots and let cook for 5 minutes.
- Add salt, water, beer, arugula, cilantro, shallot, and cumin. Bring to a boil.
- Mix garlic with leek and Egyptian leek, and add the mixture to the pot.
- Lower heat to medium and let simmer for 60 minutes, or until the beetroot and meat are cooked to your liking.
- Once the tuh'u has finished cooking, serve in a bowl. Sprinkle with coriander seeds. Garnish with chopped cilantro and chopped Egyptian leek.
Contribution
Recipe tags:
lamb
stew


Bindings
Two Way Bindings
One Way Bindings
Stuffs
{{ctrl.xxx.msg}}
Randomize
Hello World From Component
{{msg}}


|
MoveToCode
|
ThemeEngine to control initialized GameObject's scale based on associated Interactable grab state and related state changes More...
Public Member Functions | |
| InteractableGrabScaleTheme () | |
| override ThemeDefinition | GetDefaultThemeDefinition () |
| Generates the default theme definition configuration for the current theme implementation More... | |
| override void | Init (GameObject host, ThemeDefinition settings) |
| Initialize current Theme Engine with given configuration and target the provided GameObject More... | |
| override ThemePropertyValue | GetProperty (ThemeStateProperty property) |
| Get the current property value for the provided state property More... | |
| override void | OnUpdate (int state, bool force=false) |
| Update ThemeEngine for given state based on Theme logic.Check, sets, and possibly eases values based on given state More... | |
| override void | SetValue (ThemeStateProperty property, int index, float percentage) |
| Instruct theme to set value for current property with given index state and at given lerp percentage More... | |
| Public Member Functions inherited from Microsoft.MixedReality.Toolkit.UI.InteractableThemeBase | |
| virtual void | Reset () |
| Resets properties on Host GameObject to their original values when Init() was called for this theme engine. More... | |
Protected Member Functions | |
| override void | SetValue (ThemeStateProperty property, ThemePropertyValue value) |
| Instruct theme to set value for current property with ThemePropertyValue value provided More... | |
| Protected Member Functions inherited from Microsoft.MixedReality.Toolkit.UI.InteractableThemeBase | |
| float | LerpFloat (float s, float e, float t) |
| int | LerpInt (int s, int e, float t) |
| ThemeProperty | GetThemeProperty (int index) |
Protected Attributes | |
| Vector3 | originalLocalScale = Vector3.zero |
| float | timer = 0 |
| bool | hasGrab |
| float | grabPercentage |
| bool | grabTransition |
| Interactable | targetInteractable |
| ThemePropertyValue | startScaleValue = new ThemePropertyValue() |
| Protected Attributes inherited from Microsoft.MixedReality.Toolkit.UI.InteractableThemeBase | |
| Dictionary< ThemeStateProperty, ThemePropertyValue > | originalStateValues = new Dictionary<ThemeStateProperty, ThemePropertyValue>() |
Additional Inherited Members | |
| Static Public Member Functions inherited from Microsoft.MixedReality.Toolkit.UI.InteractableThemeBase | |
| static InteractableThemeBase | CreateTheme (Type themeType) |
| Helper method to instantiate a Theme Engine of provided type. More... | |
| static InteractableThemeBase | CreateAndInitTheme (ThemeDefinition definition, GameObject host=null) |
| Helper method to create and initialize a Theme Engine for given configuration and targeted GameObject More... | |
| Properties inherited from Microsoft.MixedReality.Toolkit.UI.InteractableThemeBase | |
| Type[] | Types = Array.Empty<Type>() [get, protected set] |
| Types of component this Theme Engine will target on the initialized GameObject or related GameObjects More... | |
| string | Name = "Base Theme" [get, protected set] |
| Name of Theme Engine More... | |
| List< ThemeStateProperty > | StateProperties = new List<ThemeStateProperty>() [get, set] |
| List of Properties with values per state More... | |
| List< ThemeProperty > | Properties = new List<ThemeProperty>() [get, set] |
| List of global Theme Engine properties More... | |
| GameObject | Host [get, set] |
| GameObject initialized with this ThemeEngine and being targeted based on state changes More... | |
| Easing | Ease = new Easing() [get, set] |
| Defines how to ease between values during state changes More... | |
| bool | Loaded = false [get, protected set] |
| True if Theme Engine has been initialized, false otherwise More... | |
| virtual bool | IsEasingSupported [get] |
| Indicates whether the current Theme engine implementation supports easing between state values More... | |
| virtual bool | AreShadersSupported [get] |
| Indicates whether the current Theme engine implementation supports shader targeting on state properties More... | |
ThemeEngine to control initialized GameObject's scale based on associated Interactable grab state and related state changes
| Microsoft.MixedReality.Toolkit.UI.InteractableGrabScaleTheme.InteractableGrabScaleTheme | ( | ) |
|
virtual |
Generates the default theme definition configuration for the current theme implementation
Implements Microsoft.MixedReality.Toolkit.UI.InteractableThemeBase.
|
virtual |
Get the current property value for the provided state property
Implements Microsoft.MixedReality.Toolkit.UI.InteractableThemeBase.
|
virtual |
Initialize current Theme Engine with given configuration and target the provided GameObject
Reimplemented from Microsoft.MixedReality.Toolkit.UI.InteractableThemeBase.
|
virtual |
Update ThemeEngine for given state based on Theme logic.Check, sets, and possibly eases values based on given state
Reimplemented from Microsoft.MixedReality.Toolkit.UI.InteractableThemeBase.
|
virtual |
Instruct theme to set value for current property with given index state and at given lerp percentage
Implements Microsoft.MixedReality.Toolkit.UI.InteractableThemeBase.
|
protectedvirtual |
Instruct theme to set value for current property with ThemePropertyValue value provided
Implements Microsoft.MixedReality.Toolkit.UI.InteractableThemeBase.
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |


Packers fans completely take over Dignity Health Sports Park vs Chargers
by TSD StaffThe Chargers “hosted” the Packers at Dignity Health Sports Park on Sunday, but you’d never know it was actually a home game, given how many road fans showed up for the contest.
It’s become an embarrassing ongoing theme for the Chargers, as San Diego’s residents sure aren’t making the trip up to Los Angeles for games. Not only that, the majority of football fans in LA root for the Rams.
As such, their little soccer stadium is often taken over by road fans, but what we saw on Sunday really takes the cake. At least 80 percent — if not more — of fans were wearing Packers green, as you can see below.
The Packers got the benefit of an extra “home” game, it seemed, although they did have to travel for it.


Copyright 2006 by The BioBike Team (contact<EMAIL_ADDRESS>One can get a finer bead on the question by looking at the results of
microarray expression experiments for those genes, asking which genes
demonstrate a significant light response---for example, those whose
level of production is doubled in light stress experiments).
Unfortunately, microarrays for the procholorococci have been developed
only recently, and such experimental work does not exist. There are,
however, a number of studies on a related freshwater cyanobacterium,
Synechocystis sp. 6803 (s6803). Indeed, much research specific to
light acclimation has been conducted by Hihara et al. on one strain of
this bacterium, and we have used data from that experiment previously
in these tutorials.
Going one step further, one may focus specifically on those genes that
are annotated as photosynthesis-related (e.g., by the Gene Ontology).
In sum, we can formulate the question as follows:
What we're going to do is to go through all the genes in pmed4 one by
one. For each, we'll ask if it's a photosynthetically-related gene. If
so, we'll find its orthologs in all the other cyanobacteria, and then
ask whether there is no ortholog in p9313 but there is
one in s6803. If that's the case, we'll examine the s6803 ortholog's
hihara ratio for begin greater than 2.0, and if it is, we'll call this
gene a hit and collect it!
Here's the same thing simply reformatted:
Second, we added a clause that wasn't in the spec: (#^protein
pm4gene). This is needed because some genes don't create proteins, and
we'd like to filter them out.
Then, in the AND, we use three helping functions that haven't been
defined yet: biolite::ORTHOLOGS-OF, org-in-orths-list?, and
hiraraup2x. Their functions should be fairly obvious from their names,
respectively: "find all the orthologs of a gene in all the other
organisms", "find the gene in the orths list (returned from
ORTHOLOGS-OF) that comes from a given organism", and: "is the
expression level of this gene in the hihara data greater than or equal
to 2.0?" Assuming that we have all those functions, all we need to do
is to AND them all together to satisfy the condition.
No now all we need to do is to write all those helping functions!
Next we need the function: org-in-orths-list, which, as above, finds
the specific ortholog for a given organism. This turns out to be
easy. If you click on any of the gene frames above, you'll see that it
has an #^ORGANISM slot, which contains the organism frame! So here's
alls we have to do:
Let's test that function. Noticed that each organism has a convenient
abbreviation in BioBike, so instead of writing out
#$prochlorococcus_marinus_med4 we can just type "pmed4", etc:
Let's create a table to relate the name gene to its mean regulatory ratio:
A quick examination of the table should demonstrate that we actually
have the desired data in hand at this point:
Okay, so now we can write a little function to test, for a given gene,
whether it is upregulated > 2x:
Let's test it:
It turns out that there is also a "natural language" functional
description for each gene in its #^annotation slot:
Let's try it:
How about the photo-related test?! Presumably only a handful of genes
have "photo" or "light" in their annotation, and that test is really
fast! Let's reorganize promed-specific-light-sensitive-gene? to try
that test first, and only if that passes will be bother to do the
orthologs. Here it is:
1. Generalize the function PROQUERY so that it will find genes of this
sort that have a user-specified hihara threshold. That is, I want to
be able to say:
2. Generalize your new proquery (that takes a threshold) so that it
will find genes that have a description other than being light or
photo-related. That is, I want to be able to say:
3. Modify the code as needed to be able to use a Gene Ontology concept
instead of a match string. That is, I want to be able to say:
Copyright 2005-2006 by The BioBike Team (contact<EMAIL_ADDRESS>Introduction
In this tutorial we'll put together a lot of what we have learned so
far to conduct some fairly complex systems analyses of
cyanobacteria. The question that motivates these analyses is due to
Jeff Elhai: Cyanobacteria are bacteria that can perform
photosynthesis. One of these strains of bacteria, Prochlorococcus
sp. Med4 (PMed4), is adapted to high light and lives in the upper part
of the ocean; another, P9313, is adapted to low light and lives in
deeper waters. We are interested in which gene products (generally
proteins) are involved in this adaptation. One way to address this is
to ask which genes in ProMed4 have no ortholog in Pro9313.that is,
which functions are found among the genes of one but not the other
organism. (Orthologous genes have common ancestry and generally a
common function.) This is not a certain solution because there could
be several functions represented in one but not the other organism.
What photosynthesis-related genes in PMed4 have no ortholog in P9313
but do have an ortholog in S6803 and which there exhibit a
light stress response -- e.g., greater than 2x up-regulation ratio in
the light stress microarray experiments of Hihara et al?
This, then, is our goal. Let's envision how it's going to work.
Go through all the genes in pmed4 one by one.
For each, we'll ask if it's a photosynthetically-related gene.
If so, we'll find its orthologs in all the other cyanobacteria,
and then ask whether there is no ortholog in p9313,
but there is one in s6803.
If that's the case, we'll examine the s6803 ortholog's
hihara ratio for begin greater than 2.0,
and if it is, we'll call this gene a hit and collect it!
Notice that the if clauses are all sort of packed together, so the
model is really this:
Go through all the genes in pmed4 one by one.
For each,
ask a bunch of complex questions....
and if they come out right, call it a hit and collect it!
Okay, and here's that written out in Lisp, and made into a function
that uses another function, called
PROMED-SPECIFIC-LIGHT-SENSITIVE-GENE? (which we have yet to write!) to
ask the questions::
>> (defun proquery ()
>> (loop for pm4gene in (#^genes pmed4)
>> when (promed-specific-light-sensitive-gene? pm4gene)
>> collect pm4gene)))
Now, all we need to do is to write
PROMED-SPECIFIC-LIGHT-SENSITIVE-GENE? Let's examine the question a
little more closely (very slightly reformatted from above):
Is it a photosynthetically-related gene?
If so, we'll find its orthologs in all the other cyanobacteria,
and then ask:
Is there is no ortholog in p9313?
AND
Is there one in s6803?
AND
Is the s6803 ortholog's hihara ratio for greater than 2.0?
Here's some code to do that, written in the form of the function we
need, and using yet a bunch of helping functions that will be explained below:
>> (defun promed-specific-light-sensitive-gene? (pm4gene)
>> (let* ((orths (biolite::ORTHOLOGS-OF pm4gene)))
>> (and (#^protein pm4gene)
>> (photosynthesis-related? pm4gene)
>> (not (org-in-orths-list p9313 orths))
>> (org-in-orths-list s6803 orths)
>> (hiraraup2x? (org-in-orths-list s6803 orths)))))
This bears some explanation! First off, we put the orthologs list into
a local variable: ORTHS, because we need it in three different places,
so that we don't have to recompute it every time we need
it. (Presumably it's sort of difficult to compute it over and over.)
Getting the orthologs
We don't have to write BIOLITE::ORTHOLOGS-OF, that one already exists
as as a BioBike built-in. Watch:
>> (biolite::orthologs-of #$PMED4.PMM0007)
::
(#$S7942.sef1764 #$P9313.PMT0007 #$S6803.sll1348 #$Npun.NpR5132
#$A7120.alr4943 #$Tery.Te?2278 #$PRO1375.Pro0007 #$S8102.SynW0007
#$Gvi.gll1464 #$TeBP1.tlr0587 #$PMED4.PMM0007 #$Cwat.Cw?6447
#$A29413.Av?4112)
Notice that this function accepts the frame representing a gene, and
returns a list of frames representing the orthologs of this gene in
all the loaded organisms. Very useful!
>> (defun org-in-orths-list (org orths)
>> (first
>> (loop for orth in orths
>> when (eq org (#^organism orth))
>> collect orth)))
Notice that we're only returning the FIRST of several possible
hits. We hope that there will usually be just one, and if there
isn't... well, for simplicity here, we'll just take the first one.
>> (biolite::orthologs-of #$PMED4.PMM0007)
>> (org-in-orths-list s6803 (biolite::orthologs-of #$PMED4.PMM0007))
:: #$S6803.sll1348
Great! So we've done nearly all the work. Now all we need to do is to
figure out if a gene is photosynthesis related, and if it's hihara
ratio is >2x. Let's do the Hihara part first:
Getting the data
Let's start by getting the microarray data into a form that we can use
it. We're eventually going to need to ask, for a given synechocystis
gene, how highly up-regulated it is. To do this we recall how we
copied and loaded the data from the file call "hihara.tbl", and used
simple-load-table to get it into BioBike.
>> (defvar *gene->regratio* (simple-hash-table))
A simple function will load the data into that table:
>> (defun ensure-data ()
>> (unless (not (zerop (hash-table-count *gene->regratio*)))
>> (format t "Reading hihara data...~%")
>> (loop for (gene . data) in (cdr (simple-read-table "hihara.tbl"))
>> do (setf (gethash gene *gene->regratio*)
>> (mean data)))
>> (format t "Table now has ~a entries.~%"
>> (hash-table-count *gene->regratio*))
>> ))
We can loaded the data by calling:
>> (ensure-data)
::
Reading hihara data...
Table now has 3079 entries.
The UNLESS clause keeps us from loaded the data again if it's already
been loaded (although this would be minor in this case since there's
not that much data in this table.
>> (showhash *gene->regratio*)
;; Hash table #
Note that each entry contains the mean of the expression levels in the
table for that gene.
>> (defun hiraraup2x? (gene)
>> (let ((exp (gethash (string-downcase (#^fname gene))
>> *gene->regratio*)))
>> (and exp (> exp 2.0))
Note that we grab the #^fname of the gene frame (and downcase it for
good measure) because the table has the names of the genes, not the
genes themselves. (We could have used the genes themselves as the
table keys by converting these on input -- six of one, half a dozen of
the other).
;;; The numbers for s6803.ssr2595 are: 4.30, 2.22, 1.37, 0.92 (mean > 2)
>> (hiraraup2x? #$s6803.ssr2595)
:: T
;;; The numbers for s6803.ssr2912 are: 0.97, 0.82, 0.94, 0.84 (mean < 2)
>> (hiraraup2x? #$s6803.ssr2912)
:: NIL
Excellent; Almost home! Finally, figure out if the gene is
photosynthsis related:
Figuring out gene function
Normally, to figure out gene function we would look to some sort of
biological knowledge base, such as the Gene Ontology. For example,
let's get the gene function information for this gene: #$s6803.slr1113:
>> (#^go-id #$s6803.slr1113)
:: (#$GO.Atp-BindingCassette[Abc]TransporterActivity
#$GO.AtpBinding #$GO.Membrane #$GO.Transport)
Unfortunately, the Gene Ontology doesn't have a very useful set of
annotations for photosynthetic functions, so we're going to have to
use something a little less obvious.
>> (#^annotation #$s6803.slr1113)
:: "ATP-binding protein of ABC transporter"
We can do a little string matching on that to guess if the gene we're
looking at is photosynthetic or not:
>> (defun photosynthesis-related? (gene)
>> (let ((anno (#^ANNOTATION gene)))
>> (and anno ; If there actually IS an annotation...
>> (or (search "photo" anno :test #'char-equal)
>> (search "light" anno :test #'char-equal)))))
So, this looks for "photo" or "light" in the annotation (if there is
an annotation to begin with).
>> (#^annotation #$s6803.slr1113)
:: "ATP-binding protein of ABC transporter"
>> (photosynthesis-related? #$s6803.slr1113)
:: NIL
>> (#^annotation #$PMED4.PMM0253)
:: "photosystem II reaction center PsbI protein Signal predicted..."
>> (photosynthesis-related? #$PMED4.PMM0253)
:: 0
(That 0 is the position that the SEARCH found whichever word it was
looking for in the annotation -- anything except a NIL in lisp is the
same as T (True), so as long as we didn't get NIL, we're okay!)
Putting it all together
Okay, we should be ready to roll! But before we do, we're going to
make one more little change. Recall way above that we write our main function:
>> (defun promed-specific-light-sensitive-gene? (pm4gene)
>> (let* ((orths (biolite::ORTHOLOGS-OF pm4gene)))
>> (and (#^protein pm4gene)
>> (photosynthesis-related? pm4gene)
>> (not (org-in-orths-list p9313 orths))
>> (org-in-orths-list s6803 orths)
>> (hiraraup2x? (org-in-orths-list s6803 orths)))))
Although this is pretty simple, it has one problem, which is that it's
going to be quite slow. Let's think about how it's being used:
>> (defun proquery ()
>> (loop for pm4gene in (#^genes pmed4)
>> when (promed-specific-light-sensitive-gene? pm4gene)
>> collect pm4gene)))
So, for every gene in promed4 we're going to find its ortholog, and
then do a bunch of tests. Recall way above that the reason for writing
the LET of orths was that finding the orthologs is the slowest part of
this operation. Is there any way to avoid doing it on every gene? Is
there something that we can find that is more restrictive (is only
true for a handful of genes), and easier to test that we can try
first to keep us from having to do the orthology of every
damned gene?!
>> (defun promed-specific-light-sensitive-gene? (pm4gene)
>> (if (photosynthesis-related? pm4gene)
>> (let* ((orths (biolite::ORTHOLOGS-OF pm4gene))
>> (s6803gene (org-in-orths-list s6803 orths))
>> )
>> (and (#^Proteins pm4gene)
>> (not (org-in-orths-list p9313 orths))
>> s6803gene
>> (hiraraup2x? s6803gene)))))
(While we were performing surgery on that function, we also used
another local var: s6803gene to avoid having to do the
org-in-orths-list for the s6803 gene twice, even though that's not a
big deal -- just searches down a short list, so doing it twice
wouldn't be that big a deal.)
Let's try it!
Okay, we'll we should be good to go! All we need to do is to call our
main function::
>> (proquery)
;;; This should take a few seconds...
:: (#$PMED4.PMM0817)
Voila! We can check that this gene meets ourc criteria:
;;; It should be photosynthesis or light related:
>> (#^annotation #$PMED4.PMM0817)
:: "possible high light inducible protein has EXXNGXXAMXG motif 215:209-219"
;;; It should have an ortholog in s6803, but NOT in p9313:
>> (biolite::ORTHOLOGS-OF #$PMED4.PMM0817)
:: (#$S6803.ssr2595 #$S8102.SynW0817 #$PMED4.PMM0817)
;;; And, finally, its hihara ratio of the s6803 ortholog should be > 2
;;; (recall that we have to use the name string here):
>> (gethash "s6803.ssr2595" *gene->regratio*)
:: 2.2025
Tada!
Exercises
(proquery 2.0)
to get the same answer as above, or:
(proquery 1.5)
which should get me more answers.
(proquery 1.5 "photosynthesis")
or:
(proquery 1.23 "transporter")
(For purposes of this exercise don't worry about the fact that in the
example we did, we looked for two phrases: "light" or "photo"; Just
looking for one is adequate.)
(proquery 1.23 #$go.glucokinaseactivity)
Note that this isn't quite as simple as it might seem because in
reality, just like the microarray data only existing for
Synechocystis, the GO annotations are really only reliable for that
organism as well, so you need to do the test for membership of the GO
frame in the #^go-id slot of the s6803 ortholog gene, not on the pmed4
gene.


The PWG meetings will be held on December 6-8, 2011, hosted by Dell at their facilities in Austin, TX:
Building 3 (Parmer South 3)
701 E. Parmer Lane
Austin, TX 78753
The meetings will be held all three days in the Dell Technical Briefing Center (TBC) in the Parmer South campus. (The Parmer South campus, NOT the Round Rock campus.) The Parmer South campus is about 20 miles north of the airport, about 12 miles north of the center of town. Parmer Lane crosses interstate I-35. It is also designated as Rt. 734 on some road signs.
The TBC itself is in the link between the S.2 (PS2) and S.3 (PS3) buildings, shown on the detail map. There is visitor parking directly in front of the link between the two buildings. For those of you with GPS, the lobby of the building is at 30 deg 24 min 02.9 sec N Latitude, 097 deg 39 min 49.6 sec W Longitude. Internet access will be available at the meeting.
There is no meeting fee for this meeting.
Please respond to the PWG December 2011 face-to-face meeting survey whether you are planning to attend the meeting in person, by phone, or not at all. This will help us plan for network services and to make badges for the attendees.
Call-in toll-free number (US/Canada): +1<PHONE_NUMBER>
Call-in toll number (US/Canada): +1<PHONE_NUMBER>
Call-in toll number (US/Canada): +1<PHONE_NUMBER>
Attendee access code: (by request only)
Note:All times are local to the venue.
Discussions at PWG face-to-face meetings are covered by the PWG Policy on Intellectual Property and Confidentiality - basically everything we discuss is non-confidential and can be included in an open standard.
| Date | Times | Description |
|---|---|---|
| December 6 (Live Meeting) |
9:00 AM to 11:00 AM | CWMP BOF (Slides · Whitepaper) |
| 11:00 AM to 12:00 PM | Plenary (Slides) | |
| 12:00 PM to 1:15 PM | Lunch | |
| 1:15 PM to 5:00 PM | IPP Everywhere (Slides · IPP Job and Printer Extensions - Set 3 (JPS3) · printer-input-tray · printer-output-tray · PWG Raster Format) | |
| December 7 (Live Meeting) |
9:00 AM to 12:00 PM | Cloud Imaging (Slides · Print Job Ticket and Associated Capabilities · Cloud Mapping) |
| 12:00 PM to 1:15 PM | Lunch | |
| 1:15 PM to 5:00 PM | Semantic Model (Slides · FaxIn Service · System Control Service) | |
| December 8 (Live Meeting) |
9:00 AM to 12:00 PM | WIMS (Slides) |
| 12:00 PM to 1:15 PM | Lunch | |
| 1:15 PM to 4:00 PM | IDS (Slides · IDS Attributes · IDS Attribute List · NAP SOH · HCD TNC Binding · Security Schema) |
There are many hotels in the area:
| Hotel | Address | City |
|---|---|---|
| Baymont Inn & Suites Austin/round Rock | 150 Parker Drive | Austin |
| Courtyard Austin Round Rock | 2700 Hoppe Trail | Round Rock |
| Embassy Suites Hotel Austin-Arboretum | 9505 Stonelake Blvd | Austin |
| Fairfield Inn & Suites Austin Northwest | 11201 N. Mopac Expressway | Austin |
| Hampton Inn & Suites Austin-Downtown, TX | 200 San Jacinto Boulevard | Austin |
| Hampton Inn Austin - Round Rock | 110 Dell Way | Round Rock |
| Hilton Austin | 500 East 4th Street | Austin |
| Hilton Garden Inn Austin/Round Rock | 2310 North IH-35 | Round Rock |
| Homewood Suites Austin - Northwest | 3908 W. Braker Lane | Austin |
| InterContinental Hotel Stephen F. Austin | 701 Congress Ave | Austin |
| Marriott Austin North | 2600 La Frontera Blvd | Round Rock |
| Radisson Hotel & Suites Austin | 111 E Cesarchavezstreet | Austin |
| Residence Inn Austin Northeast | 12401 North Lamar Boulevard | Austin |
| Residence Inn Austin Round Rock | 2505 S I H-35 | Round Rock |
| SpringHill Suites Austin- North | 12520 North IH-35 | Austin |
| Staybridge Suites Austin-Round Rock | 520 IH 35 S | Round Rock |
| TownePlace Suites Austin Northwest | 10024 North Capital of TX Highway North | Austin |
| Four Seasons Hotel Austin | 98 San Jacinto Blvd. | Austin |


The date and time cut-off to join a group passed at
{{gfp.dt_group_selection_stops|date:"d F Y"}} at
{{gfp.dt_group_selection_stops|date:"H:i:s"}}.
{% if is_enrolled_already %}
At, or before, this cut-off time you are recorded as being part of this group:
{{groups_joined.0.name}} {{groups_joined.0.description}}
{% else %}
At that date and time of the cut-off you had not joined any group yet.
{% endif %}
TODO: show multiple-enrollments in a table
{% endblock %} {# content#}
{% block footer %}{% endblock %}


Over 4 years of experience offers a wide range of solutions in web development. Previously lead role with excellent motivational skills to sustain growth on the front-end team at Tebuy. Proven ability to leverage full-stack expertise to build interactive and user-centered website designs to scale. I am very passionate about learning new technology. I enjoy overcoming challenges and working closely with others.
In my past nearly four years of work experience, the speed at which I program has improved by a large degree. In addition, I have gained a certain degree of understanding in database systems such as MYSQL. During this period I have written a online exam system, order processing systems, digital content developer system and reporting system, while utilizing UML to complete many technical and developmental documents. Designed and implemented APIs to support the ecommerce system
1. Implemented SEO in a LEMP environment, attracted users to websites and drove growth, resulting in half-year traffic increases of 31.09%.
2. Created custom React components and working with redux to delivery high performed features.
3. Implemented Multi-Currency and payment system using Braintree.
4. Experienced in deploying applications on AWS and sending email from SES and SNS.
1. Developed features and maintained existing applications base on osCommerce using PHP, JavaScript, HTML5, CSS3, jQuery, MySQL.
2. Troubleshooter issues affecting environments as requested.
3. Optimized order, search and report efficiency.
4. 3rd-party API integrations with Paypal.
1. Lead role on the front-end team, guiding and mentoring developers of the next generation of PC e-commerce application.
2. Developed RESTful API using node.js.
3. Designed, developed and maintained scalable stable web solutions that meet business needs.
1. Collaborated with art directors, product and engineering team members remotely to define and develop new features.
2. Developed and maintained the front-end functionality of RWD websites.
3. Built lucky draw feature of front-end on-time delivery for a festival.
1. the number of users has increased 10%
2. analyse systems requirements
3. implement, configure and test feasible solutions.
1. Built Online exam system, achieving a cost reduction of $200,000 per year.
2. Created and maintained Gamification of Learning system that has grown to accommodate over 200 schools.
3. Database planning & SQL performance tuning.
1. Provided individual tutoring to students and help them prepare for project in bootcamp.


All Facts of removing are registered at backend at any way.
By the way, to simplify working with kitchen order notes check out our POS Advanced Order Notes module
Contact us by email or fill out request form


Katie Chen
Web Designer
Here's what I do:
I make things.
These are my skills:
I am learning code.
HTML
CSS
UX/UI
Contact Me:
Email me at
katieaichen@gmail.com


--- layout: default title: "About" permalink: "team/interns" ---
Teach LA’s internship program gives interns the opportunity to take on more responsibility within the club. Interns are grouped into cohorts according to their intern title (e.g., dev team project lead interns are grouped into a cohort). In these cohorts, interns are able to collaborate with other interns, and current Teach LA officers!
Teach LA’s internship program takes place throughout the winter quarter, and each intern is assigned a project to work on with the guidance of a current officer, either in a group or individually. At the end of the quarter, interns are given the opportunity to present their projects to the entire Teach LA board, as well as write a reflection post about their experience working on their project.
To find out more about how you can join us as a general member, check out our join us page!
Teach LA intern applications are accepted through the general ACM internship program application, where applicants can indicate which committees and positions they’re interested in.
For more information on how we chose our interns, check out the blog post Teach LA’s Intern Search ExperienceTeach LA interns are given the opportunity to meet other ACM interns and officers through the ACM Family System. The Teach LA internship program is also run through the general ACM internship program, and interns get a chance to attend ACM all hand meetings which gives them the opportunity to meet other ACM officers and interns, as well as hear more about what ACM board and other ACM committess are up to!
Thank you for expressing interest in joining our team! Unfortunately, intern applications are currently closed for the 2020-2021 school year. Please check again in the fall for 2021-2022 intern applications. We'll be linking the applications here once they're open!


Not at all
Several days
More than half the days
Nearly every day
Not being able to stop or control worrying
0
1
2
3
Worrying too much about different things
0
1
2
3
Trouble relaxing
0
1
2
3
Being so restless that it is hard to sit still
0
1
2
3
Becoming easily annoyed or irritable
0
1
2
3
Feeling afraid as if something awful might happen
0
1
2
3
Thoughts that you would be better off dead or of hurting yourself in some way
0
1
2
3


--- layout: page type: page author: Jun Lu authorlink: http://www.junlulocky.com title: About us ---
If you’re writing an article for this blog, please follow these guidelines.


{% extends 'templates/nhs_transaction_layout.html' %} {% import 'includes/form_macros.html' as form_macros %} {% block afterHeader %} {% include "includes/service-headers/book-an-appointment.html" %} {% endblock %} {% block content %} Filter Clinics X Reset filters Apply filters Waiting Time Anim pariatur cliche reprehenderit, enim eiusmod high life accusamus terry richardson ad squid. 3 wolf moon officia aute, non cupidatat skateboard dolor brunch. Food truck quinoa nesciunt laborum eiusmod. Brunch 3 wolf moon tempor, sunt aliqua put a bird on it squid single-origin coffee nulla assumenda shoreditch et. Nihil anim keffiyeh helvetica, craft beer labore wes anderson cred nesciunt sapiente ea proident. Ad vegan excepteur butcher vice lomo. Leggings occaecat craft beer farm-to-table, raw denim aesthetic synth nesciunt you probably haven't heard of them accusamus labore sustainable VHS. Clinic Day Anim pariatur cliche reprehenderit, enim eiusmod high life accusamus terry richardson ad squid. 3 wolf moon officia aute, non cupidatat skateboard dolor brunch. Food truck quinoa nesciunt laborum eiusmod. Brunch 3 wolf moon tempor, sunt aliqua put a bird on it squid single-origin coffee nulla assumenda shoreditch et. Nihil anim keffiyeh helvetica, craft beer labore wes anderson cred nesciunt sapiente ea proident. Ad vegan excepteur butcher vice lomo. Leggings occaecat craft beer farm-to-table, raw denim aesthetic synth nesciunt you probably haven't heard of them accusamus labore sustainable VHS. Collapsible Group Item #3 Anim pariatur cliche reprehenderit, enim eiusmod high life accusamus terry richardson ad squid. 3 wolf moon officia aute, non cupidatat skateboard dolor brunch. Food truck quinoa nesciunt laborum eiusmod. Brunch 3 wolf moon tempor, sunt aliqua put a bird on it squid single-origin coffee nulla assumenda shoreditch et. Nihil anim keffiyeh helvetica, craft beer labore wes anderson cred nesciunt sapiente ea proident. Ad vegan excepteur butcher vice lomo. Leggings occaecat craft beer farm-to-table, raw denim aesthetic synth nesciunt you probably haven't heard of them accusamus labore sustainable VHS. Select your Clinic You have been referred for Knee Pain and have 3 clinics to choose from below. Filter Sort Map LGI Knee Clinic Leeds General Infirmary, Leeds, LS1 3EX Next Appointment 10 Days 5 Miles from LS2 4GH CQC Rating Requires Improvement {% endblock %}
Reset filters
Apply filters
You have been referred for Knee Pain and have 3 clinics to choose from below.
Filter
Sort
Map
Leeds General Infirmary, Leeds, LS1 3EX
Next Appointment
5 Miles from LS2 4GH
CQC Rating


Comment below or directly on GitHub in the corresponding issue by clicking on the link of "x Comments".


REGEX_TEST(text, search, caseInsensitive) → bool
Check whether the pattern search is contained in the string text, using regular expression matching.
The regular expression may consist of literal characters and the following characters and sequences:
.
– the dot matches any single character except line terminators.
To include line terminators, use [\s\S]
instead to simulate .
with DOTALL flag.
\d
– matches a single digit, equivalent to [0-9]
\s
– matches a single whitespace character\S
– matches a single non-whitespace character\t
– matches a tab character\r
– matches a carriage return\n
– matches a line-feed character[xyz]
– set of characters. Matches any of the enclosed characters
(here: x, y or z)
[^xyz]
– negated set of characters. Matches any other character than the
enclosed ones (i.e. anything but x, y or z in this case)
[x-z]
– range of characters. Matches any of the characters in the
specified range, e.g. [0-9A-F]
to match any character in
0123456789ABCDEF[^x-z]
– negated range of characters. Matches any other character than the
ones specified in the range
(xyz)
– defines and matches a pattern group(x|y)
– matches either x or y^
– matches the beginning of the string (e.g. ^xyz
)$
– matches the end of the string (e.g. xyz$
)Note that the characters .
, *
, ?
, [
, ]
,
(
, )
, {
, }
, ^
,
and $
have a special meaning in regular expressions and may need to be
escaped using a backslash, which requires escaping itself (\\
). A literal
backslash needs to be escaped using another escaped backslash, i.e. \\\\
.
In arangosh, the amount of backslashes needs to be doubled.
Characters and sequences may optionally be repeated using the following quantifiers:
x*
– matches zero or more occurrences of xx+
– matches one or more occurrences of xx?
– matches one or zero occurrences of xx{y}
– matches exactly y occurrences of xx{y,z}
– matches between y and z occurrences of xx{y,}
– matches at least y occurences of xNote that xyz+
matches xyzzz, but if you want to match xyzxyz instead,
you need to define a pattern group by wrapping the subexpression in parentheses
and place the quantifier right behind it: (xyz)+
.
If the regular expression in search is invalid, a warning will be raised and the function will return null.
REGEX_TEST("the quick brown fox", "the.*fox") // true
REGEX_TEST("the quick brown fox", "^(a|the)\s+(quick|slow).*f.x$") // true
REGEX_TEST("the\nquick\nbrown\nfox", "^the(\n[a-w]+)+\nfox$") // true


Show
Run
+
-
Reset
{"br":3} #1 How do I love thee? Let me count the ways. #2 I love thee to the depth and breadth and height My soul can reach, when feeling out of sight For the ends of being and ideal grace. #1 I love thee to the level of every day's Most quiet need, by sun and candlelight. #2 I love thee freely, as men strive for right; I love thee purely, as they turn from Praise. #1 I love with a passion put to use In my old griefs, and with my childhood's faith. #2 I love thee with a love I seemed to lose With my lost saints, I love thee with the breath, Smiles, tears, of all my life! and, if God choose, I shall but love thee better after death.
Some text to display??


--- layout: page title: "About" description: "" header-img: "img/about-bg.jpg" ---
I am a data scientist and electrical engineer from Sydney, Australia. I work in the financial services industry and I'm studying for a Master of Data Science and Innovation from the University of Technology, Sydney.
All opinions and projects on this site are my own.
Copyright for all photography on this site belongs to flickr user tanakawho, images used in accordance with the terms available on her flickr page.