--- layout: default ---
A Data Processing System for Flexible Employment With Different Deployment Characteristics.
Nemo is a data processing system for flexible employment with different execution scenarios for various deployment characteristics on clusters. They include processing data on specific resource environments, like on transient resources, and running jobs with specific attributes, like skewed data. Nemo decouples the logical notion of data processing applications from runtime behaviors and express them on separate layers using Nemo Intermediate Representation (IR). Specifically, through a set of high-level graph pass interfaces, Nemo exposes runtime behaviors to be flexibly configured and modified at both compile-time and runtime, and the Nemo Runtime executes the Nemo IR with its modular and extensible design.
Nemo offers flexible adaptation to your desired execution environment. Examples of such execution environments include using transient resources, disaggregation of different computing resources, and handling skewed data.
Nemo is designed to be modular and extensible for even more variety of execution scenarios and deployment characteristics. Users with specific needs can plug in and out the required components and execute their jobs accordingly.
Nemo is able to run Apache Beam™ programs using our runtime, and Apache Spark™ programs in the near future. Moreover, by using Apache REEF™, Nemo enables data processing possible on different resource managers including Apache Hadoop™ YARN or Apache Mesos™.


[gecode-users] Activity-based search and nondeterministic behaviour
Andre Augusto Cire
andrecire at cmu.edu
Fri Feb 14 19:04:48 CET 2014
Hi Christian,
Thanks a lot for your answer. Just to clear out any confusion: this means
that, in the latest version (4.2.1), all search types (including AFC) are
deterministic as long as there are no non-deterministic propagators, right?
Cheers,
Andre
On Mon, Feb 10, 2014 at 3:23 PM, Christian Schulte <cschulte at kth.se> wrote:
> Dear Andre,
>
>
>
> Now it is not deterministic when non-detrministic propagators are around.
>
>
>
> Moreover, changing the recomputation distance will also (slightly) change
> the activity information recorded.
>
>
>
> Cheers
>
> Christian
>
>
>
> --
>
> Christian Schulte, www.ict.kth.se/~cschulte/
>
>
>
> *From:* users-bounces at gecode.org [mailto:users-bounces at gecode.org] *On
> Behalf Of *Andre Augusto Cire
> *Sent:* Monday, February 10, 2014 6:43 PM
> *To:* users at gecode.org
> *Subject:* [gecode-users] Activity-based search and nondeterministic
> behaviour
>
>
>
> Dear all,
>
>
>
> I wonder if you could kindly help me with a very quick question. From a
> previous forum post and the manual, we know that nonmonotonic propagators
> and AFC-based search may result in a nondeterministic behaviour (post here:
> https://www.mail-archive.com/users@gecode.org/msg00916.html).
>
>
>
> Just to confirm: is activity-based search deterministic?
>
>
>
> Thank you very much,
>
> Andre
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20140214/c352d36b/attachment.html>
More information about the users
mailing list


{% extends "base.html" %} {% block content %}
No results found matching your search criteria. Please refine your criteria and try again.


Fundamental classes used in client-side GWT code. The classes in this package represent concepts fundamental to GWT, such as module entry points, and interfacing with JavaScript.


You are here by a mistake. Never come here again. (This warning was brought to you by windows the whore)


Client side router for Progressive web apps
View sourceRead and write text into pngs, a proof of concept
Try nowA complete Full Stack solution built from scratch and deployed for use by students of AIGS, Bengaluru
View sampleServerless Group chatting solution designed around http relay API
Try nowHash-path based client side router for single page applications
Try nowChatbot solution with basic client side NLP designed for multiple applications
View sampleTwitter Bot build with NodeJS including features targeted for Digital Marketing
View sampleSend simple text messages from terminal over the same WiFi, built to explore core utils and bash
View source


Flowers
They are of various colours and hues. Even the same species of flowers exist in several forms and tinges. They look picturesque and are a thing of beauty. One is lost in the sight of flowers and thinks of that invincible Power which has created them.


**Info about style of music and/or musical influences**
**images of recording music**
**images from preformances**
**Info about style of music and/or musical influences**
**images of recording music**
**images from preformances**
***calendar for upcoming shows***


Toric plotter#
This module provides a helper class ToricPlotter
for producing plots
of objects related to toric geometry. Default plotting objects can be adjusted
using options()
and reset using reset_options()
.
AUTHORS:
Andrey Novoseltsev (2010-10-03): initial version, using some code bits by Volker Braun.
EXAMPLES:
In most cases, this module is used indirectly, e.g.
sage: fan = toric_varieties.dP6().fan() # needs palp sage.graphs
sage: fan.plot() # needs palp sage.graphs sage.plot
Graphics object consisting of 31 graphics primitives
You may change default plotting options as follows:
sage: toric_plotter.options("show_rays")
True
sage: toric_plotter.options(show_rays=False)
sage: toric_plotter.options("show_rays")
False
sage: fan.plot() # needs palp sage.graphs sage.plot
Graphics object consisting of 19 graphics primitives
sage: toric_plotter.reset_options()
sage: toric_plotter.options("show_rays")
True
sage: fan.plot() # needs palp sage.graphs sage.plot
Graphics object consisting of 31 graphics primitives
- class sage.geometry.toric_plotter.ToricPlotter(all_options, dimension, generators=None)#
Bases:
SageObject
Create a toric plotter.
INPUT:
all_options
– adictionary
, containing any of the options related to toric objects (seeoptions()
) and any other options that will be passed to lower level plotting functions;dimension
– an integer (1, 2, or 3), dimension of toric objects to be plotted;generators
– (optional) a list of ray generators, see examples for a detailed explanation of this argument.
OUTPUT:
a toric plotter.
EXAMPLES:
In most cases there is no need to create and use
ToricPlotter
directly. Instead, use plotting method of the object which you want to plot, e.g.sage: fan = toric_varieties.dP6().fan() # needs palp sage.graphs sage: fan.plot() # needs palp sage.graphs sage.plot Graphics object consisting of 31 graphics primitives sage: print(fan.plot()) # needs palp sage.graphs sage.plot Graphics object consisting of 31 graphics primitives
If you do want to create your own plotting function for some toric structure, the anticipated usage of toric plotters is the following:
collect all necessary options in a dictionary;
pass these options and
dimension
toToricPlotter
;call
include_points()
on ray generators and any other points that you want to be present on the plot (it will try to set appropriate cut-off bounds);call
adjust_options()
to choose “nice” default values for all options that were not set yet and ensure consistency of rectangular and spherical cut-off bounds;call
set_rays()
on ray generators to scale them to the cut-off bounds of the plot;call appropriate
plot_*
functions to actually construct the plot.
For example, the plot from the previous example can be obtained as follows:
sage: # needs palp sage.graphs sage.plot sage: from sage.geometry.toric_plotter import ToricPlotter sage: options = dict() # use default for everything sage: tp = ToricPlotter(options, fan.lattice().degree()) sage: tp.include_points(fan.rays()) sage: tp.adjust_options() sage: tp.set_rays(fan.rays()) sage: result = tp.plot_lattice() sage: result += tp.plot_rays() sage: result += tp.plot_generators() sage: result += tp.plot_walls(fan(2)) sage: result Graphics object consisting of 31 graphics primitives
In most situations it is only necessary to include generators of rays, in this case they can be passed to the constructor as an optional argument. In the example above, the toric plotter can be completely set up using
sage: tp = ToricPlotter(options, fan.lattice().degree(), fan.rays()) # needs palp sage.graphs sage.plot
All options are exposed as attributes of toric plotters and can be modified after constructions, however you will have to manually call
adjust_options()
andset_rays()
again if you decide to change the plotting mode and/or cut-off bounds. Otherwise plots maybe invalid.- adjust_options()#
Adjust plotting options.
This function determines appropriate default values for those options, that were not specified by the user, based on the other options. See
ToricPlotter
for a detailed example.OUTPUT:
none.
- include_points(points, force=False)#
Try to include
points
into the bounding box ofself
.INPUT:
points
– a list of points;force
– boolean (default:False
). by default, only bounds that were not set before will be chosen to includepoints
. Useforce=True
if you don’t mind increasing existing bounding box.
OUTPUT:
none.
EXAMPLES:
sage: from sage.geometry.toric_plotter import ToricPlotter sage: tp = ToricPlotter(dict(), 2) sage: print(tp.radius) None sage: tp.include_points([(3, 4)]) sage: print(tp.radius) 5.5... sage: tp.include_points([(5, 12)]) sage: print(tp.radius) 5.5... sage: tp.include_points([(5, 12)], force=True) sage: print(tp.radius) 13.5...
- plot_generators()#
Plot ray generators.
Ray generators must be specified during construction or using
set_rays()
before calling this method.OUTPUT:
a plot.
EXAMPLES:
sage: from sage.geometry.toric_plotter import ToricPlotter sage: tp = ToricPlotter(dict(), 2, [(3,4)]) sage: tp.plot_generators() # needs sage.plot Graphics object consisting of 1 graphics primitive
- plot_labels(labels, positions)#
Plot
labels
at specifiedpositions
.INPUT:
labels
– a string or a list of strings;positions
– a list of points.
OUTPUT:
a plot.
EXAMPLES:
sage: from sage.geometry.toric_plotter import ToricPlotter sage: tp = ToricPlotter(dict(), 2) sage: tp.plot_labels("u", [(1.5,0)]) # needs sage.plot Graphics object consisting of 1 graphics primitive
- plot_lattice()#
Plot the lattice (i.e. its points in the cut-off bounds of
self
).OUTPUT:
a plot.
EXAMPLES:
sage: from sage.geometry.toric_plotter import ToricPlotter sage: tp = ToricPlotter(dict(), 2) sage: tp.adjust_options() sage: tp.plot_lattice() # needs sage.plot Graphics object consisting of 1 graphics primitive
- plot_points(points)#
Plot given
points
.INPUT:
points
– a list of points.
OUTPUT:
a plot.
EXAMPLES:
sage: from sage.geometry.toric_plotter import ToricPlotter sage: tp = ToricPlotter(dict(), 2) sage: tp.adjust_options() sage: tp.plot_points([(1,0), (0,1)]) # needs sage.plot Graphics object consisting of 1 graphics primitive
- plot_ray_labels()#
Plot ray labels.
Usually ray labels are plotted together with rays, but in some cases it is desirable to output them separately.
Ray generators must be specified during construction or using
set_rays()
before calling this method.OUTPUT:
a plot.
EXAMPLES:
sage: from sage.geometry.toric_plotter import ToricPlotter sage: tp = ToricPlotter(dict(), 2, [(3,4)]) sage: tp.plot_ray_labels() # needs sage.plot Graphics object consisting of 1 graphics primitive
- plot_rays()#
Plot rays and their labels.
Ray generators must be specified during construction or using
set_rays()
before calling this method.OUTPUT:
a plot.
EXAMPLES:
sage: from sage.geometry.toric_plotter import ToricPlotter sage: tp = ToricPlotter(dict(), 2, [(3,4)]) sage: tp.plot_rays() # needs sage.plot Graphics object consisting of 2 graphics primitives
- plot_walls(walls)#
Plot
walls
, i.e. 2-d cones, and their labels.Ray generators must be specified during construction or using
set_rays()
before calling this method and these specified ray generators will be used in conjunction withambient_ray_indices()
ofwalls
.INPUT:
walls
– a list of 2-d cones.
OUTPUT:
a plot.
EXAMPLES:
sage: quadrant = Cone([(1,0), (0,1)]) sage: from sage.geometry.toric_plotter import ToricPlotter sage: tp = ToricPlotter(dict(), 2, quadrant.rays()) sage: tp.plot_walls([quadrant]) # needs sage.plot Graphics object consisting of 2 graphics primitives
Let’s also check that the truncating polyhedron is functioning correctly:
sage: tp = ToricPlotter({"mode": "box"}, 2, quadrant.rays()) sage: tp.plot_walls([quadrant]) # needs sage.plot Graphics object consisting of 2 graphics primitives
- set_rays(generators)#
Set up rays and their
generators
to be used by plotting functions.As an alternative to using this method, you can pass
generators
toToricPlotter
constructor.INPUT:
generators
- a list of primitive non-zero ray generators.
OUTPUT:
none.
EXAMPLES:
sage: from sage.geometry.toric_plotter import ToricPlotter sage: tp = ToricPlotter(dict(), 2) sage: tp.adjust_options() sage: tp.plot_rays() # needs sage.plot Traceback (most recent call last): ... AttributeError: 'ToricPlotter' object has no attribute 'rays' sage: tp.set_rays([(0,1)]) sage: tp.plot_rays() # needs sage.plot Graphics object consisting of 2 graphics primitives
- sage.geometry.toric_plotter.color_list(color, n)#
Normalize a list of
n
colors.INPUT:
color
– anything specifying aColor
, a list of such specifications, or the string “rainbow”;n
- an integer.
OUTPUT:
a list of
n
colors.
If
color
specified a single color, it is repeatedn
times. If it was a list ofn
colors, it is returned without changes. If it was “rainbow”, the rainbow ofn
colors is returned.EXAMPLES:
sage: # needs sage.plot sage: from sage.geometry.toric_plotter import color_list sage: color_list("grey", 1) [RGB color (0.5019607843137255, 0.5019607843137255, 0.5019607843137255)] sage: len(color_list("grey", 3)) 3 sage: L = color_list("rainbow", 3) sage: L [RGB color (1.0, 0.0, 0.0), RGB color (0.0, 1.0, 0.0), RGB color (0.0, 0.0, 1.0)] sage: color_list(L, 3) [RGB color (1.0, 0.0, 0.0), RGB color (0.0, 1.0, 0.0), RGB color (0.0, 0.0, 1.0)] sage: color_list(L, 4) Traceback (most recent call last): ... ValueError: expected 4 colors, got 3!
- sage.geometry.toric_plotter.label_list(label, n, math_mode, index_set=None)#
Normalize a list of
n
labels.INPUT:
label
–None
, a string, or a list of string;n
- an integer;math_mode
– boolean, ifTrue
, will produce LaTeX expressions for labels;index_set
– a list of integers (default:range(n)
) that will be used as subscripts for labels.
OUTPUT:
a list of
n
labels.
If
label
was a list ofn
entries, it is returned without changes. Iflabel
isNone
, a list ofn
None
’s is returned. Iflabel
is a string, a list of strings of the form$label_{i}$
is returned, where \(i\) ranges overindex_set
. (Ifmath_mode=False
, the form “label_i” is used instead.) Ifn=1
, there is no subscript added, unlessindex_set
was specified explicitly.EXAMPLES:
sage: from sage.geometry.toric_plotter import label_list sage: label_list("u", 3, False) ['u_0', 'u_1', 'u_2'] sage: label_list("u", 3, True) ['$u_{0}$', '$u_{1}$', '$u_{2}$'] sage: label_list("u", 1, True) ['$u$']
- sage.geometry.toric_plotter.options(option=None, **kwds)#
Get or set options for plots of toric geometry objects.
Note
This function provides access to global default options. Any of these options can be overridden by passing them directly to plotting functions. See also
reset_options()
.INPUT:
None;
OR:
option
– a string, name of the option whose value you wish to get;
OR:
keyword arguments specifying new values for one or more options.
OUTPUT:
if there was no input, the dictionary of current options for toric plots;
if
option
argument was given, the current value ofoption
;if other keyword arguments were given, none.
Name Conventions
To clearly distinguish parts of toric plots, in options and methods we use the following name conventions:
- Generator
A primitive integral vector generating a 1-dimensional cone, plotted as an arrow from the origin (or a line, if the head of the arrow is beyond cut-off bounds for the plot).
- Ray
A 1-dimensional cone, plotted as a line from the origin to the cut-off bounds for the plot.
- Wall
A 2-dimensional cone, plotted as a region between rays (in the above sense). Its exact shape depends on the plotting mode (see below).
- Chamber
A 3-dimensional cone, plotting is not implemented yet.
Plotting Modes
A plotting mode mostly determines the shape of the cut-off region (which is always relevant for toric plots except for trivial objects consisting of the origin only). The following options are available:
- Box
The cut-off region is a box with edges parallel to coordinate axes.
- Generators
The cut-off region is determined by primitive integral generators of rays. Note that this notion is well-defined only for rays and walls, in particular you should plot the lattice on your own (
plot_lattice()
will use box mode which is likely to be unsuitable). While this method may not be suitable for general fans, it is quite natural for fans ofCPR-Fano toric varieties. <sage.schemes.toric.fano_variety.CPRFanoToricVariety_field
- Round
The cut-off regions is a sphere centered at the origin.
Available Options
Default values for the following options can be set using this function:
mode
– “box”, “generators”, or “round”, see above for descriptions;show_lattice
– boolean, whether to show lattice points in the cut-off region or not;show_rays
– boolean, whether to show rays or not;show_generators
– boolean, whether to show rays or not;show_walls
– boolean, whether to show rays or not;generator_color
– a color for generators;label_color
– a color for labels;point_color
– a color for lattice points;ray_color
– a color for rays, a list of colors (one for each ray), or the string “rainbow”;wall_color
– a color for walls, a list of colors (one for each wall), or the string “rainbow”;wall_alpha
– a number between 0 and 1, the alpha-value for walls (determining their transparency);point_size
– an integer, the size of lattice points;ray_thickness
– an integer, the thickness of rays;generator_thickness
– an integer, the thickness of generators;font_size
– an integer, the size of font used for labels;ray_label
– a string or a list of strings used for ray labels; useNone
to hide labels;wall_label
– a string or a list of strings used for wall labels; useNone
to hide labels;radius
– a positive number, the radius of the cut-off region for “round” mode;xmin
,xmax
,ymin
,ymax
,zmin
,zmax
– numbers determining the cut-off region for “box” mode. Note that you cannot exclude the origin - if you try to do so, bounds will be automatically expanded to include it;lattice_filter
– a callable, taking as an argument a lattice point and returningTrue
if this point should be included on the plot (useful, e.g. for plotting sublattices);wall_zorder
,ray_zorder
,generator_zorder
,point_zorder
,label_zorder
– integers, z-orders for different classes of objects. By default all values are negative, so that you can add other graphic objects on top of a toric plot. You may need to adjust these parameters if you want to put a toric plot on top of something else or if you want to overlap several toric plots.
You can see the current default value of any options by typing, e.g.
sage: toric_plotter.options("show_rays") True
If the default value is
None
, it means that the actual default is determined later based on the known options. Note, that not all options can be determined in such a way, so you should not set options toNone
unless it was its original state. (You can always revert to this “original state” usingreset_options()
.)EXAMPLES:
The following line will make all subsequent toric plotting commands to draw “rainbows” from walls:
sage: toric_plotter.options(wall_color="rainbow")
If you prefer a less colorful output (e.g. if you need black-and-white illustrations for a paper), you can use something like this:
sage: toric_plotter.options(wall_color="grey")
- sage.geometry.toric_plotter.reset_options()#
Reset options for plots of toric geometry objects.
OUTPUT:
none.
EXAMPLES:
sage: toric_plotter.options("show_rays") True sage: toric_plotter.options(show_rays=False) sage: toric_plotter.options("show_rays") False
Now all toric plots will not show rays, unless explicitly requested. If you want to go back to “default defaults”, use this method:
sage: toric_plotter.reset_options() sage: toric_plotter.options("show_rays") True
- sage.geometry.toric_plotter.sector(ray1, ray2, **extra_options)#
Plot a sector between
ray1
andray2
centered at the origin.Note
This function was intended for plotting strictly convex cones, so it plots the smaller sector between
ray1
andray2
and, therefore, they cannot be opposite. If you do want to use this function for bigger regions, split them into several parts.Note
As of version 4.6 Sage does not have a graphic primitive for sectors in 3-dimensional space, so this function will actually approximate them using polygons (the number of vertices used depends on the angle between rays).
INPUT:
ray1
,ray2
– rays in 2- or 3-dimensional space of the same length;extra_options
– a dictionary of options that should be passed to lower level plotting functions.
OUTPUT:
a plot.
EXAMPLES:
sage: from sage.geometry.toric_plotter import sector sage: sector((1,0), (0,1)) # needs sage.symbolic Graphics object consisting of 1 graphics primitive sage: sector((3,2,1), (1,2,3)) # needs sage.plot Graphics3d Object


D.E.U.
Home
Women In Power
Around The World
Videos
Story
Click the green flag to see the story unfold.


PROPN
: proper noun
This document is a placeholder for the language-specific documentation
for PROPN
.
Treebank Statistics (UD_Coptic)
There are 40 PROPN
lemmas (4%), 40 PROPN
types (3%) and 109 PROPN
tokens (1%).
Out of 14 observed tags, the rank of PROPN
is: 3 in number of lemmas, 6 in number of types and 12 in number of tokens.
The 10 most frequent PROPN
lemmas: ⲓⲏⲥⲟⲩⲥ, ⲓⲱϩⲁⲛⲛⲏⲥ, ⲓⲁⲕⲱⲃⲟⲥ, ⲥⲓⲙⲱⲛ, ⲅⲁⲗⲓⲗⲁⲓⲁ, ⲥⲁⲧⲁⲛⲁⲥ, ϩⲓⲉⲣⲟⲥⲟⲗⲩⲙⲁ, ⲁⲛⲇⲣⲉⲁⲥ, ⲍⲉⲃⲉⲇⲁⲓⲟⲥ, ⲓⲟⲣⲇⲁⲛⲏⲥ
The 10 most frequent PROPN
types: ⲓⲏⲥⲟⲩⲥ, ⲓⲱϩⲁⲛⲛⲏⲥ, ⲓⲁⲕⲱⲃⲟⲥ, ⲥⲓⲙⲱⲛ, ⲅⲁⲗⲓⲗⲁⲓⲁ, ⲥⲁⲧⲁⲛⲁⲥ, ϩⲓⲉⲣⲟⲥⲟⲗⲩⲙⲁ, ⲁⲛⲇⲣⲉⲁⲥ, ⲍⲉⲃⲉⲇⲁⲓⲟⲥ, ⲓⲟⲣⲇⲁⲛⲏⲥ
The 10 most frequent ambiguous lemmas: ⲓⲏⲥⲟⲩⲥ (PROPN 27, NOUN 1), ⲓⲱϩⲁⲛⲛⲏⲥ (PROPN 8, NOUN 1), ⲕⲣⲟⲛⲟⲥ (PROPN 2, NOUN 1), ⲓⲟⲩⲇⲁⲓⲁ (NOUN 1, PROPN 1)
The 10 most frequent ambiguous types: ⲓⲏⲥⲟⲩⲥ (PROPN 27, NOUN 1), ⲓⲱϩⲁⲛⲛⲏⲥ (PROPN 8, NOUN 1), ⲕⲣⲟⲛⲟⲥ (PROPN 2, NOUN 1), ⲓⲟⲩⲇⲁⲓⲁ (NOUN 1, PROPN 1)
- ⲓⲏⲥⲟⲩⲥ
- ⲓⲱϩⲁⲛⲛⲏⲥ
- ⲕⲣⲟⲛⲟⲥ
- ⲓⲟⲩⲇⲁⲓⲁ
Morphology
The form / lemma ratio of PROPN
is 1.000000 (the average of all parts of speech is 1.152000).
The 1st highest number of forms (1) was observed with the lemma “ϣⲓⲏⲧ”: ϣⲓⲏⲧ.
The 2nd highest number of forms (1) was observed with the lemma “ϩⲓⲉⲣⲟⲥⲟⲗⲩⲙⲁ”: ϩⲓⲉⲣⲟⲥⲟⲗⲩⲙⲁ.
The 3rd highest number of forms (1) was observed with the lemma “ⲁⲃⲓⲁⲑⲁⲣ”: ⲁⲃⲓⲁⲑⲁⲣ.
PROPN
does not occur with any features.
Relations
PROPN
nodes are attached to their parents using 12 different relations: cop-dep/nmod (23; 21% instances), cop-dep/obl (23; 21% instances), cop-dep/dislocated (20; 18% instances), cop-dep/conj (12; 11% instances), cop-dep/nsubj (11; 10% instances), cop-dep/appos (6; 6% instances), cop-dep/flat (4; 4% instances), cop-dep/vocative (3; 3% instances), cop-dep/ccomp (2; 2% instances), cop-dep/obj (2; 2% instances), cop-dep/root (2; 2% instances), cop-dep/case (1; 1% instances)
Parents of PROPN
nodes belong to 7 different parts of speech: VERB (59; 54% instances), NOUN (31; 28% instances), PROPN (13; 12% instances), DET (2; 2% instances), ROOT (2; 2% instances), PRON (1; 1% instances), X (1; 1% instances)
30 (28%) PROPN
nodes are leaves.
38 (35%) PROPN
nodes have one child.
28 (26%) PROPN
nodes have two children.
13 (12%) PROPN
nodes have three or more children.
The highest child degree of a PROPN
node is 8.
Children of PROPN
nodes are attached using 13 different relations: cop-dep/case (59; 42% instances), cop-dep/det (23; 16% instances), cop-dep/appos (18; 13% instances), cop-dep/conj (16; 11% instances), cop-dep/cc (11; 8% instances), cop-dep/acl (3; 2% instances), cop-dep/nsubj (3; 2% instances), cop-dep/mark (2; 1% instances), cop-dep/punct (2; 1% instances), cop-dep/advcl (1; 1% instances), cop-dep/advmod (1; 1% instances), cop-dep/cop (1; 1% instances), cop-dep/nmod (1; 1% instances)
Children of PROPN
nodes belong to 10 different parts of speech: ADP (58; 41% instances), DET (26; 18% instances), NOUN (20; 14% instances), PROPN (13; 9% instances), PART (8; 6% instances), CCONJ (5; 4% instances), VERB (4; 3% instances), ADV (3; 2% instances), PRON (2; 1% instances), PUNCT (2; 1% instances)
PROPN in other languages: [am] [ar] [bg] [bxr] [ca] [ckb] [cop] [cs] [cu] [da] [de] [el] [en] [es] [et] [eu] [fa] [fi] [fo] [fr] [ga] [gl] [got] [grc] [he] [hi] [hr] [hu] [id] [it] [ja] [kk] [kmr] [ko] [la] [lv] [mr] [nl] [no] [pl] [pt] [ro] [ru] [sa] [sk] [sla] [sl] [so] [sr] [sv] [swl] [ta] [tr] [ug] [uk] [u] [urj] [ur] [vi] [yue] [zh]


Eddy J. Tang
Projects
Ashes To Ashes By Bouyant Buffalo
For one of my classes at the University of Alberta, we were to design and fully implement a game using Microsofts Project Spark Engine (no longer available). The game was developed in a span of four months with a team of 6 members, and recieved Game of The Year Award at Edmontons Game Discovery Exhibition. Unfortunately Project Spark is no longer available, and Microsoft has shut down all of their servers, but my team is currently looking into ways to retrieve a working copy to allow people to access and play our game. Please check back if you are interested.
Ashes To Ashes（remake prototype) By Bouyant Buffalo
Wanting to make another game together, most members from Bouyant Buffalo decided to get back together for a short game jam. With 3 days, we crafted a prototype of our game and its mechanics with YoYoGames GameMaker Studio. Although it is not a lot, it was a proof of concept that we were able to get the engine working since it was our first time working with it.
Prototype Level 1 Prototype Level 2SizeBook Application (Android)
For one of our classes at the University of Alberta, we were to build a simple application that would store sizes of people a user would want to input. The user would have functionality to do things such creating new entries, edit old entries, as well as view entries in full detail if they tap on the entry. The application was build for Android through Android Studios.
Link to my github repository for this project


This is no longer necessary. SC will address this based on the prior report.
closed
by None at 2022-03-02 13:25:05.closed
by Christina Chortaria at 2022-03-02 16:48:47.head_ref_force_pushed
by Christina Chortaria at 2022-03-02 14:28:23.renamed
by Christina Chortaria at 2022-03-02 16:08:05.referenced
by Christina Chortaria at 2022-03-02 16:48:47.merged
by Christina Chortaria at 2022-03-02 16:48:47.closed
by Christina Chortaria at 2022-03-02 16:48:48.head_ref_deleted
by Christina Chortaria at 2022-03-02 16:48:48.head_ref_force_pushed
by None at 2022-03-02 19:47:06.resolved by https://github.com/pulibrary/bibdata/pull/1734
closed
by Christina Chortaria at 2022-03-02 21:18:10.closed
by Christina Chortaria at 2022-03-02 21:27:49.referenced
by Christina Chortaria at 2022-03-02 21:30:26.merged
by Christina Chortaria at 2022-03-02 21:30:26.closed
by Christina Chortaria at 2022-03-02 21:30:26.head_ref_deleted
by Christina Chortaria at 2022-03-02 21:30:27.closed
by None at 2022-03-02 20:28:13.head_ref_force_pushed
by None at 2022-03-02 20:28:13.reopened
by None at 2022-03-02 21:26:16.head_ref_force_pushed
by None at 2022-03-02 21:27:29.ready_for_review
by None at 2022-03-02 21:27:37.renamed
by None at 2022-03-02 21:28:06.referenced
by Christina Chortaria at 2022-03-02 21:40:15.merged
by Christina Chortaria at 2022-03-02 21:40:16.closed
by Christina Chortaria at 2022-03-02 21:40:16.head_ref_deleted
by Christina Chortaria at 2022-03-02 21:40:16.Looks like nokogiri is up-to-date now, so this is no longer needed.
closed
by None at 2022-03-02 21:41:24.head_ref_deleted
by None at 2022-03-02 21:41:25.assigned
by Bess Sadler at 2022-03-02 17:02:37.referenced
by Bess Sadler at 2022-03-02 17:03:08.merged
by Bess Sadler at 2022-03-02 17:03:08.closed
by Bess Sadler at 2022-03-02 17:03:09.head_ref_deleted
by Bess Sadler at 2022-03-02 17:03:09.assigned
by Bess Sadler at 2022-03-02 17:02:44.referenced
by Bess Sadler at 2022-03-02 17:03:33.merged
by Bess Sadler at 2022-03-02 17:03:33.closed
by Bess Sadler at 2022-03-02 17:03:33.head_ref_deleted
by Bess Sadler at 2022-03-02 17:03:34.assigned
by None at 2022-03-02 15:07:29.referenced
by None at 2022-03-02 15:42:01.renamed
by Shaun Ellis at 2022-03-02 15:11:16.labeled
by None at 2022-03-02 16:01:05.labeled
by None at 2022-03-02 16:01:43.labeled
by None at 2022-03-02 16:02:12.labeled
by None at 2022-03-02 16:02:52.referenced
by None at 2022-03-02 15:42:01.labeled
by None at 2022-03-02 16:03:09.labeled
by None at 2022-03-02 16:03:10.labeled
by None at 2022-03-01 23:24:03.labeled
by None at 2022-03-01 23:24:03.closed
by None at 2022-03-02 14:55:37.labeled
by None at 2022-03-02 22:31:19.labeled
by None at 2022-03-02 22:31:19.Confirmed this seems to work in staging.
ready_for_review
by Trey Pendragon at 2022-03-01 23:52:24.review_requested
by Trey Pendragon at 2022-03-03 00:07:12.assigned
by Bess Sadler at 2022-03-02 13:29:46.referenced
by Bess Sadler at 2022-03-02 13:31:49.merged
by Bess Sadler at 2022-03-02 13:31:49.closed
by Bess Sadler at 2022-03-02 13:31:50.head_ref_deleted
by Bess Sadler at 2022-03-02 13:31:50.assigned
by Bess Sadler at 2022-03-02 13:29:55.referenced
by Bess Sadler at 2022-03-02 13:32:30.merged
by Bess Sadler at 2022-03-02 13:32:30.closed
by Bess Sadler at 2022-03-02 13:32:30.head_ref_deleted
by Bess Sadler at 2022-03-02 13:32:31.referenced
by Christina Chortaria at 2022-03-02 13:49:28.merged
by Christina Chortaria at 2022-03-02 13:49:28.closed
by Christina Chortaria at 2022-03-02 13:49:28.head_ref_deleted
by Christina Chortaria at 2022-03-02 13:49:29.referenced
by Hector Correa at 2022-03-02 14:44:27.merged
by Hector Correa at 2022-03-02 14:44:27.closed
by Hector Correa at 2022-03-02 14:44:27.head_ref_deleted
by Hector Correa at 2022-03-02 14:44:28.Login credentials in LastPass
closed
by Bess Sadler at 2022-03-02 15:16:23.Thank you, @sandbergja and @christinach !! Ok. ill write out what to look at. I am using the original Coin:6521 as my control:
mentioned
by Jane Sandberg at 2022-03-02 15:00:11.subscribed
by Jane Sandberg at 2022-03-02 15:00:11.mentioned
by Christina Chortaria at 2022-03-02 15:05:18.subscribed
by Christina Chortaria at 2022-03-02 15:05:18.it should look both fake_id and the new temp key. Just thought about it. I will update. the indexed records are a mix right now and unitl we swap the index with the temp locations indexed.
I deployed in qa. https://catalog-qa.princeton.edu/catalog?utf8=%E2%9C%93&search_field=all_fields&q=
catalog-qa has records from the previous index. for example https://catalog-qa.princeton.edu/catalog/99125410371706421 has holding_id indexed in permanent but the availability response has the new temp key.
turning to a draft and deploy to production temporarily
head_ref_force_pushed
by Christina Chortaria at 2022-03-02 15:56:26.deployed
by None at 2022-03-02 16:04:55.convert_to_draft
by Christina Chortaria at 2022-03-02 16:15:35.deployed
by None at 2022-03-02 16:16:36.ready_for_review
by Christina Chortaria at 2022-03-02 16:26:15.referenced
by None at 2022-03-02 16:32:12.merged
by None at 2022-03-02 16:32:12.closed
by None at 2022-03-02 16:32:12.head_ref_deleted
by None at 2022-03-02 16:32:13.referenced
by None at 2022-03-02 16:32:21.renamed
by Jane Sandberg at 2022-03-02 16:59:46.deployed
by None at 2022-03-02 18:30:09.We should merge and deploy after we swap the index with temp locations.
head_ref_force_pushed
by Christina Chortaria at 2022-03-02 14:21:40.ready_for_review
by Christina Chortaria at 2022-03-02 14:41:00.convert_to_draft
by Christina Chortaria at 2022-03-02 14:41:37.deployed
by None at 2022-03-02 14:42:13.head_ref_force_pushed
by Christina Chortaria at 2022-03-02 18:30:06.deployed
by None at 2022-03-02 18:43:52.head_ref_force_pushed
by Christina Chortaria at 2022-03-02 18:51:53.head_ref_force_pushed
by Christina Chortaria at 2022-03-02 19:01:59.head_ref_force_pushed
by Christina Chortaria at 2022-03-02 19:46:56.head_ref_force_pushed
by Christina Chortaria at 2022-03-02 20:19:43.head_ref_force_pushed
by Christina Chortaria at 2022-03-02 20:25:35.head_ref_force_pushed
by Christina Chortaria at 2022-03-02 20:32:28.ready_for_review
by Christina Chortaria at 2022-03-02 20:33:54.renamed
by Christina Chortaria at 2022-03-02 20:35:07.renamed
by Christina Chortaria at 2022-03-02 21:47:01.labeled
by None at 2022-03-02 22:31:35.labeled
by None at 2022-03-02 22:31:35.assigned
by Bess Sadler at 2022-03-02 14:26:25.assigned
by Hector Correa at 2022-03-02 15:51:19.closed
by Bess Sadler at 2022-03-02 16:32:05.referenced
by Bess Sadler at 2022-03-02 16:32:05.merged
by Bess Sadler at 2022-03-02 16:32:05.closed
by Bess Sadler at 2022-03-02 16:32:05.head_ref_deleted
by Bess Sadler at 2022-03-02 16:32:06.referenced
by Hector Correa at 2022-03-02 16:37:55.merged
by Hector Correa at 2022-03-02 16:37:56.closed
by Hector Correa at 2022-03-02 16:37:56.head_ref_deleted
by Hector Correa at 2022-03-02 16:37:56.This was already done.
deploy@pdc-discovery-prod1:~$ crontab -l
# Begin Whenever generated tasks for: pdc_discovery at: 2022-03-02 16:46:25 +0000
20 0 * * * /bin/bash -l -c 'cd /opt/pdc_discovery/releases/20220302164516 && RAILS_ENV=production bundle exec rake index:research_data --silent'
# End Whenever generated tasks for: pdc_discovery at: 2022-03-02 16:46:25 +0000
deploy@pdc-discovery-prod1:~$ /bin/bash -l -c 'cd /opt/pdc_discovery/releases/20220302164516 && RAILS_ENV=production bundle exec rake index:research_data --silent'
Harvesting and indexing research data collections
assigned
by Bess Sadler at 2022-03-02 17:40:26.closed
by Bess Sadler at 2022-03-02 17:45:55.assigned
by Bess Sadler at 2022-03-02 17:48:48.referenced
by Trey Pendragon at 2022-03-01 23:33:28.merged
by Trey Pendragon at 2022-03-01 23:33:28.closed
by Trey Pendragon at 2022-03-01 23:33:28.head_ref_deleted
by Trey Pendragon at 2022-03-01 23:33:28.convert_to_draft
by Bess Sadler at 2022-03-02 14:03:43.head_ref_force_pushed
by Bess Sadler at 2022-03-02 14:12:14.ready_for_review
by Bess Sadler at 2022-03-02 14:14:38.referenced
by Hector Correa at 2022-03-02 14:55:54.merged
by Hector Correa at 2022-03-02 14:55:54.closed
by Hector Correa at 2022-03-02 14:55:54.head_ref_deleted
by Hector Correa at 2022-03-02 14:55:55.closed
by None at 2022-03-02 15:31:37.referenced
by None at 2022-03-02 15:31:37.merged
by None at 2022-03-02 15:31:37.closed
by None at 2022-03-02 15:31:38.head_ref_deleted
by None at 2022-03-02 15:31:38.referenced
by None at 2022-03-02 14:33:01.referenced
by None at 2022-03-02 14:34:32.closed
by None at 2022-03-02 15:33:43.referenced
by None at 2022-03-02 15:33:44.review_requested
by None at 2022-03-02 14:35:38.referenced
by None at 2022-03-02 15:33:43.merged
by None at 2022-03-02 15:33:43.closed
by None at 2022-03-02 15:33:43.head_ref_deleted
by None at 2022-03-02 15:33:44.review_requested
by None at 2022-03-02 16:13:55.review_requested
by None at 2022-03-02 16:14:04.referenced
by Alicia Cozine at 2022-03-02 17:02:37.merged
by Alicia Cozine at 2022-03-02 17:02:37.closed
by Alicia Cozine at 2022-03-02 17:02:37.head_ref_deleted
by Alicia Cozine at 2022-03-02 17:02:38.review_requested
by Francis Kayiwa at 2022-03-03 00:04:20.labeled
by None at 2022-03-02 22:31:33.labeled
by None at 2022-03-02 22:31:33.deployed
by None at 2022-03-02 22:06:34.referenced
by Eliot Jordan at 2022-03-02 22:13:37.merged
by Eliot Jordan at 2022-03-02 22:13:37.closed
by Eliot Jordan at 2022-03-02 22:13:38.head_ref_deleted
by Eliot Jordan at 2022-03-02 22:13:38.referenced
by Eliot Jordan at 2022-03-02 22:14:17.merged
by Eliot Jordan at 2022-03-02 22:14:17.closed
by Eliot Jordan at 2022-03-02 22:14:17.head_ref_deleted
by Eliot Jordan at 2022-03-02 22:14:18.@dependabot rebase
Superseded by #1058.
mentioned
by Dependabot at 2022-03-02 22:14:36.closed
by None at 2022-03-02 22:15:11.head_ref_deleted
by None at 2022-03-02 22:15:12.@dependabot rebase
mentioned
by Dependabot at 2022-03-02 22:17:02.review_dismissed
by None at 2022-03-02 22:17:43.head_ref_force_pushed
by None at 2022-03-02 22:17:43.referenced
by Eliot Jordan at 2022-03-02 22:24:36.merged
by Eliot Jordan at 2022-03-02 22:24:37.closed
by Eliot Jordan at 2022-03-02 22:24:37.head_ref_deleted
by Eliot Jordan at 2022-03-02 22:24:37.@dependabot rebase
labeled
by None at 2022-03-01 23:28:58.labeled
by None at 2022-03-01 23:28:58.mentioned
by Dependabot at 2022-03-02 22:24:53.head_ref_force_pushed
by None at 2022-03-02 22:25:32.referenced
by Eliot Jordan at 2022-03-02 22:34:55.merged
by Eliot Jordan at 2022-03-02 22:34:55.closed
by Eliot Jordan at 2022-03-02 22:34:55.head_ref_deleted
by Eliot Jordan at 2022-03-02 22:34:55.@dependabot rebase
labeled
by None at 2022-03-02 22:15:10.labeled
by None at 2022-03-02 22:15:10.mentioned
by Dependabot at 2022-03-02 22:35:19.head_ref_force_pushed
by None at 2022-03-02 22:35:48.referenced
by Eliot Jordan at 2022-03-02 22:45:32.merged
by Eliot Jordan at 2022-03-02 22:45:32.closed
by Eliot Jordan at 2022-03-02 22:45:33.head_ref_deleted
by Eliot Jordan at 2022-03-02 22:45:33.@dependabot rebase
labeled
by None at 2022-03-02 22:31:06.labeled
by None at 2022-03-02 22:31:06.mentioned
by Dependabot at 2022-03-02 22:45:49.head_ref_force_pushed
by None at 2022-03-02 22:46:24.referenced
by Eliot Jordan at 2022-03-02 22:57:12.merged
by Eliot Jordan at 2022-03-02 22:57:12.closed
by Eliot Jordan at 2022-03-02 22:57:12.head_ref_deleted
by Eliot Jordan at 2022-03-02 22:57:12.labeled
by None at 2022-03-02 15:59:21.https://catalog-staging.princeton.edu/catalog/99116991823506421 @kevinreiss can we close this issue?
mentioned
by Kevin Reiss at 2022-03-02 21:19:51.subscribed
by Kevin Reiss at 2022-03-02 21:19:51.closed
by Christina Chortaria at 2022-03-02 21:31:30.Closing, since this was a data issue.
closed
by Jane Sandberg at 2022-03-02 21:43:23.Using https://vpn.princeton.edu/https/pdc-discovery-staging.princeton.edu/
provided me with access over the VPN, while https://pdc-discovery-staging.princeton.edu/
was access-restricted. Hence, one should be able to access the API using https://vpn.princeton.edu/https/aspace-staging.princeton.edu/staff/api/
I have briefly confirmed that I am receiving a Palo Alto IP address for requests, so an additional range may need to be added for the ArchivesSpace staging server hosted by Lyrasis.


Apache Pony Mail (Incubating) is a web-based mail archive browser built to scale to millions of archived messages with hundreds of requests per second. It allows you to browse, search, and interact with mailing lists including creating replies to mailing list threads.
Apache Pony Mail uses OAuth2 (Google, GitHub, Facebook etc) for authentication to allow viewing private lists, and uses ElasticSearch for storage and searching. Licensed under the Apache License 2.0 and undergoing Incubation at the Apache Software Foundation (ASF).
See https://lists.apache.org.org for a live demo; Pony Mail is currently running on the full mail archives of all Apache projects.
Pony Mail works in both public, private and mixed-mode, allowing you to have one unified place for all your communication, both public and private.
Pony Mail has been built for and tested with the mail archives of the Apache Software Foundation, which span more than 15 million emails sent across more than 20 years. To put things into perspective, importing all this on a modern machine (2xSSD with 64GB RAM) took around 12 hours and resulted in a performance at around 100 archive search requests per second per ES node, depending on mailing list size and available bandwidth.
This is a list of what we would love to get done:
Apache Pony Mail (Incubating) is an effort undergoing incubation at The Apache Software Foundation (ASF), sponsored by the Apache Incubator. Incubation is required of all newly accepted projects until a further review indicates that the infrastructure, communications, and decision making process have stabilized in a manner consistent with other successful ASF projects. While incubation status is not necessarily a reflection of the completeness or stability of the code, it does indicate that the project has yet to be fully endorsed by the ASF.


List of Snippets
No
Title
Author
Code
Language
1
JavaScript example
Doe
alert('test');
javascript
JavaScript Code:
javascript code
Other language


|
Minority Report
by Judge J. Howard Sundermann
I went to Minority Report
with great anticipation. The film combines one of the greatest
directors of all time, Stephen Spielberg (Indiana Jones, Close
Encounters, Schindler's List, Private Ryan), with superstar
Tom Cruise. It is a science fiction film, which is one of my
favorite genres, and the film was uniformly given excellent reviews
all over the country. In his review, Roger Ebert said Minority
Report "reminds us why we go to movies in the first
place." But I thought it was just OK, maybe a six on a scale
of ten. I would recommend it, it is certainly better than Spielberg's
A.I., but I found it to be well below my expectations.
The set-up is good. About fifty years into the future, a way
has been found to predict murders ahead of time and the department
of pre-crime, headed by Cruise, finds and arrests the potential
murderer before the killing takes place. How the pre-crime department
knows about the murders in advance is an inherent fault in the
film. People called pre-cogs are somehow picking up the thoughts
of would-be murderers and these thoughts are fed into computers.
The pre-cogs seem to be lying in an indoor swimming pool twenty-four
hours a day with wires attached to their heads. The names that
identify a potential murder come rolling down a shute with the
name written on something like a pool ball. The pre-cogs are
100% accurate.
Good
science fiction can make us look at the world in a new way, and
this story accomplishes that by bringing up some interesting
legal issues. Obviously, people are being arrested for crimes
that they have not yet committed but, according to the film,
are certain to commit.  In the film, The District
of Columbia has been murder-free for six years and the program
is very popular. I suspect that a program like this, which has
accuracy near 100%, would be approved easily today. This question
is particularly relevant considering the current terrorist problem.
Also the pre-cogs are effectively slaves, devoting their lives
to predicting murders. In the film, the audience is never told
if the process is voluntary on their part or whether the pre-cogs
are taken by the State when they are found to have the needed
abilities. Would we be willing to take away the lives of a few
to save thousands? There is also the possibility that the accusation
of a crime could lead to a murder attempt that would otherwise
not have taken place.
Cruise himself has his name
given as a potential murderer and looks for the victim, whom
he would not have known but for the prediction. Spielberg had
the imagination and the funding to ask scientists and engineers
to predict some future devices that are employed in the film.
Many devices are voice-activated as on Star Trek. The
way cars move around is interesting, and when one goes into a
store, a computer conducts a retinal scan and you are addressed
personally and directed to what you might be interested in. Also,
small robotic spiders search a building for Cruise by performing
a retinal scan of everyone there.
But to me, the failure is in the story itself. Cruise, after
being accused of a potential murder, becomes a man on the run,
a la Hitchcock. The chase scenes were disappointing and rather
pedestrian. A character from the justice department is for some
reason opposed to Cruise and the pre-crime program, so he is
seemingly introduced just so there can be a bad guy. But the
real bad guy turns out to be the director of the pre-crime department,
played by Max von Sydow, who is afraid that when the program
goes national he will lose control. My take on the film as a
reviewer is another minority report.
Posted July 19, 2002
|


Issue 90
Welcome to another issue of Haskell Weekly!  This is a weekly summary of what’s going on in its community.
Want to see something featured in Haskell Weekly? Open an issue or pull request on GitHub.
Featured
-
Dynamic test suites in Haskell using Hspec and Tasty
In this video I’ll demonstrate how to create a dynamic test suite based on examples in an external CSV file. The tests can be run individually using Tasty patterns. It is easy to add new examples to the CSV, and the Haskell test code doesn’t even need recompilation.
-
Packcheck: Universal build and CI for Haskell packages
Packcheck is a minimal yet complete “hello world” Haskell package with model Travis and AppVeyor config files that can be used unmodified in any Haskell package. The CI configs can be modified declaratively to adapt to any kind of build scenario you can imagine.
-
Rio: A standard library for Haskell
The goal of the Rio library is to make it easier to adopt Haskell for writing production software. It is intended as a cross between: a collection of well designed, trusted libraries; a useful Prelude replacement; and a set of best practices for writing production quality Haskell code.
-
Reducing GHC’s noise: Hiding source and object paths
GHC 8.2 includes a new
-fhide-source-paths
command-line flag that can be used to reduce line noise. -
Functional programming languages and the pursuit of laziness with Dr. Simon Peyton Jones
When we look at a skyscraper or a suspension bridge, a simple search engine box on a screen looks tiny by comparison. But Dr. Simon Peyton Jones would like to remind us that computer programs, with hundreds of millions of lines of code, are actually among the largest structures human beings have ever built.
-
Drinkery: The boozy streaming library
In the ecosystem of Haskell, a number of stream processing libraries has been made. The very purpose is to process a sequence of values with effects, in a composable manner. Still, I was not satisfied with the sets of features of the existing packages. Accordingly, I decided to make a new one. It’s called Drinkery.
-
Today, I’m going to talk about how to interact with AWS EC2 using the
amazonka
andamazonka-ec2
packages. EC2, like Lambda, is a more involved service than some of the others. -
Talk: Building Android apps with Haskell
At the Haskell.SG January meetup I presented building Android apps with Haskell yesterday. As we have recordings set up for a while now, you can follow it below.
-
Minor improvement to
yesod-forms
: A Stack Builders open source updateOpen source is the cornerstone of our consulting work, and we consider it one of our responsibilities to contribute back to the community that we depend on. We are proud to share some of the open source contributions that we developed recently.
-
Flux is an ongoing project to visualize Haskell programs as data-flow diagrams. Its main goal is to improve program understanding and support functional programmers in various development activities.
Jobs
-
Zalando seeking Backend Engineer in Berlin
We are building applications and services that connect fashion merchants with Zalando customers. We solve hard architectural and algorithmic problems. We set ambitious availability, throughput, latency and reliability goals. We value the quality of our designs and the cleanliness of our code.
In brief
- Applicative functors and data validation: Part 2
- Be cautious of upper/lower case letters about function in Haskell
- Haskell Implementors’ Workshop 2017
- LambdaConf 2018: Call for proposals
- Need to be faster? Be lazy!
- Upcoming Yesod breaking changes
- Versioning of libraries bundled with GHC pre-releases
- Why is
Option
a better monoid forMaybe
?
Package of the week
This week’s package of the week is Taskell, a command-line Kanban board/task manager.
Call for participation
- brittany: end of line comment moves to next guard
- hadolint: Warn on bad COPY last argument
- Idris-dev: Library names in package files may not contain hyphens
- stack: Using environment variables in
stack.yaml
Events
- January 18: Utah Haskell: Assembler walkthrough by Ryan Moore
- January 20: Seattle area Haskell users’ group: General discussion
- January 22: Frankfurt Haskell user group: Shake it so you don’t have to make it
- January 23: DelhiNCR Haskell and functional programming languages group: FPNCR January 2018 meetup
- January 24: Functional Tricity: Welcome 2018
- January 25: Melbourne Haskell users group: Meetup


While working through freeCodeCamp's on-line course JavaScript Algorithms And Data Structures Certification I decided to keep the scripts I wrote in the Basic Algorithm Scripting section in case I ever wanted to review/reference them in the future.
Currently the output of only two of the sixteen scripts are written to the console. To see the output of each of the scripts you will need to;
Clone this repo (from the GitHub link button below)
Edit this page and uncomment each individual script
Edit and uncomment each of the tests for each script. (One at a time or all together)
Ensure the console is open in Dev Tools to see the output of console.log()
That can be tedious. Instead, I decided to put my HTML, CSS and JS skills to the test by making interactive pages to show each of the test cases and allow you to input those test cases or input your own, valid, test case and see the results without having to open the console in Dev Tools.


Sabrina (1954)
Grade: 57
Audrey Hepburn was the daughter of a Dutch baroness, and had youth, beauty, charm and an exquisite accent. Since she could play the vulnerable innocent as well, she was perfectly suited for Cinderella-type roles.
Hepburn had a star-making role in 1953's "Roman Holiday", in which she played a princess who pretended to be a commoner. In her next film, "Sabrina", she plays a chauffeur's daughter who blossomes into a lady. The theme of changing her social class would be used once again in her most successful film, "My Fair Lady".
While Hepburn was well-cast for "Sabrina", she was given two unlikely love interests. William Holden, at 36, was only a little too old for his role, as was the case for an earlier film also directed by Billy Wilder, "Sunset Boulevard". But Humphrey Bogart was 55, a full thirty years older than Hepburn. Also, "Sabrina" was something of a comedy, and Holden and Bogart were not known as comedic actors.
Nonetheless, "Sabrina" was a great critical and commercial success, cementing the reputations of Wilder, Hepburn, and Bogart. The film was nominated for six Academy Awards, including Best Actress (Hepburn), Best Director (Wilder), Best Screenplay (Wilder, Samuel Taylor, and Ernest Lehman), and Best B & W Cinematography (Charles Lang Jr).
Bogart and Holden play brothers who have vastly different personalities. Linus (Bogart) has never married and lives for work, controlling the business empire that was founded by his father, Oliver (Walter Hampden). David (Holden) is a playboy who cares nothing for work and has gone through several marriages.
Sabrina (Hepburn) is the daughter of a chauffeur (John Williams) employed by the wealthy family. Sabrina pines for David, who initially shows no interest in her. Sabrina is exiled to France, where she adopts the dress and manner of a lady. Meanwhile, David has become engaged to the daughter of an industrial magnate. Linus is depending upon the marriage, as it is a precondition of a favorable business merger.
Sabrina returns home, and catches David's eye. To prevent the merger from falling through, Linus begins courting Sabrina, trying to win her from David.
Many comic touches don't quite work. David sits on champagne glasses. Linus puches David, sending him rolling across a table (and somehow coming up smiling). It isn't explained why Sabrina would fall for Linus, unless money truly can buy love. Holden is transfixed by Sabrina, but then is happy to pawn her off on Linus.  The problems with the characters are mitigated, however, by the graceful performances of Hepburn and Bogart.
"Sabrina" was remade in 1995, with Harrison Ford taking Bogart's role.
<EMAIL_ADDRESS>http://members.tripod.com/~Brian_Koller/movies.html http://www.epinions.com/user-briankoller
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


Let's Play Connect Four
Player One
Player Two
Welcome!
Please fill out the following and hit the
Let's play!
button at the bottom
Player One (red)
Player Two (black)
Let's play!


Winter Is Compiling
Home
TaddyPole
About Us
Contact
Contact Us
Contact email:
contact@winteriscompiling.uk


The numpy-financial Python package is a collection of elementary financial functions. These functions were copied to this package from version 1.17 of NumPy.
The financial functions in NumPy are deprecated and eventually will be removed from NumPy; see NEP-32 for more information. This package is the replacement for the deprecated NumPy financial functions.
The package is available on PyPI, and may be installed
with pip
:
$ pip install numpy-financialThe package requires NumPy version 1.15 or later.
numpy_financial
The importable name of the package is numpy_financial
.
The recommended alias is npf
. For example,
>>> import numpy_financial as npf >>> npf.irr([-250000, 100000, 150000, 200000, 250000, 300000]) 0.5672303344358536
numpy
to numpy_financial
Code that imports the function names like this
from numpy import npv, irrrequires only that the import be changed to
from numpy_financial import npv, irr
For code that uses the numpy
namespace like this
import numpy as np x = np.array([-250000, 100000, 150000, 200000, 250000, 300000]) r = np.irr(x)the import statement for the numpy-financial package must be added, and the calls of the financial functions must be changed to use the
npf
namespace:
import numpy as np import numpy_financial as npf x = np.array([-250000, 100000, 150000, 200000, 250000, 300000]) r = npf.irr(x)


{{ 'optionsJqlWorkspacesRefreshInterval' | i18n }}
Hey! It looks like your list is empty. Click the button below to add a new workspace.


Book A Service
Alexandra Walker, NCE, CRC, LPC Intern
Home
About Company Name
Book a Service
Resources
FAQ


compound:vo
: verb-object compound
The compound:vo
relation is used for verb-object compounds where the combination is semantically one unit but syntactically separate. These are known as 離合詞 lei4hap6ci4 “separable words” in Chinese linguistics.
These compounds run the range of:
- (i) light verb constructions where the noun carries more semantic weight than the verb
- e.g., 打␣電話 / daa2-din6waa2 hit-telephone “make a phone call”
- (equivalents of these in other languages may be labeled with
compound:lvc
)
- (ii) neither the verb or noun can be considered the semantic head (i.e., an exocentric compound)
- e.g., 讀␣書 / duk6-syu1 read-book “study”
- (iii) situations where the verb carries the semantic weight over a relatively empty noun or the noun is semantically redundant
- e.g., 瞓␣覺 / fan3-gaau3 sleep(verb)-sleep(noun) “sleep”
- in the example, the noun 覺 no longer has a modern lexical usage independently and the verb 睡 can be used on its own to convey the same meaning
All of the above cases have the same syntactic distribution, where the object behaves like a direct object of the verb. Verb-object compounds never take another object as direct object, and the object can be separated from the verb as in regular non-compound situations.


MLSListings Knowledge Base
Search or choose a topic below to get started.
Search Listings
Listing Management
Compliance
Board and Association
Paragon CA Edition
Billing and My Account
If you can't find what you're looking for here, go ahead and head over to our
Contact Us
form.
Top 10 Knowledge Base Articles
1. How do I search
listings
using the Listing Managment tool?
2. Where can I check
Billing
history?
3. How do I reset my username/password?
4. You can scale your productivity, get in touch with our training team
Professional Development Services
, to up your training game.
5. How do I search
listings
using the Listing Managment tool?
6. Where can I check
Billing
history?
7. How do I reset my username/password?
8. You can scale your productivity, get in touch with our training team
Professional Development Services
, to up your training game.
9. How do I reset my username/password?
10. You can scale your productivity, get in touch with our training team
Professional Development Services
, to up your training game.
Helpful Links
Join Now
Customer Support
Billing Page
Please do work through the knowledge base before raising a case. if you problem still can't be solved feel free to call our support line or fill out our online Contact Us form.


Create is the premier generator command. It copies files, creates directories, renders templates, and more.
- class_collisions
- complex_template
- directory
- file
- identical?
- migration_template
- readme
- route_resources
- template
| SYNONYM_LOOKUP_URI | = | "http://wordnet.princeton.edu/perl/webwn?s=%s" |
Check whether the given class names are already taken by Ruby or Rails. In the future, expand to check other namespaces such as the rest of the user‘s app.
[ show source ]
# File vendor/rails/railties/lib/rails_generator/commands.rb, line 173 173: def class_collisions(*class_names) 174: path = class_names.shift 175: class_names.flatten.each do |class_name| 176: # Convert to string to allow symbol arguments. 177: class_name = class_name.to_s 178: 179: # Skip empty strings. 180: next if class_name.strip.empty? 181: 182: # Split the class from its module nesting. 183: nesting = class_name.split('::') 184: name = nesting.pop 185: 186: # Hack to limit const_defined? to non-inherited on 1.9. 187: extra = [] 188: extra << false unless Object.method(:const_defined?).arity == 1 189: 190: # Extract the last Module in the nesting. 191: last = nesting.inject(Object) { |last, nest| 192: break unless last.const_defined?(nest, *extra) 193: last.const_get(nest) 194: } 195: 196: # If the last Module exists, check whether the given 197: # class exists and raise a collision if so. 198: if last and last.const_defined?(name.camelize, *extra) 199: raise_class_collision(class_name) 200: end 201: end 202: end
[ show source ]
# File vendor/rails/railties/lib/rails_generator/commands.rb, line 310 310: def complex_template(relative_source, relative_destination, template_options = {}) 311: options = template_options.dup 312: options[:assigns] ||= {} 313: options[:assigns]['template_for_inclusion'] = render_template_part(template_options) 314: template(relative_source, relative_destination, options) 315: end
[ show source ]
# File vendor/rails/railties/lib/rails_generator/commands.rb, line 319 319: def directory(relative_path) 320: path = destination_path(relative_path) 321: if File.exist?(path) 322: logger.exists relative_path 323: else 324: logger.create relative_path 325: unless options[:pretend] 326: FileUtils.mkdir_p(path) 327: # git doesn't require adding the paths, adding the files later will 328: # automatically do a path add. 329: 330: # Subversion doesn't do path adds, so we need to add 331: # each directory individually. 332: # So stack up the directory tree and add the paths to 333: # subversion in order without recursion. 334: if options[:svn] 335: stack = [relative_path] 336: until File.dirname(stack.last) == stack.last # dirname('.') == '.' 337: stack.push File.dirname(stack.last) 338: end 339: stack.reverse_each do |rel_path| 340: svn_path = destination_path(rel_path) 341: system("svn add -N #{svn_path}") unless File.directory?(File.join(svn_path, '.svn')) 342: end 343: end 344: end 345: end 346: end
Copy a file from source to destination with collision checking.
The file_options hash accepts :chmod and :shebang and :collision options. :chmod sets the permissions of the destination file:
file 'config/empty.log', 'log/test.log', :chmod => 0664
:shebang sets the #!/usr/bin/ruby line for scripts
file 'bin/generate.rb', 'script/generate', :chmod => 0755, :shebang => '/usr/bin/env ruby'
:collision sets the collision option only for the destination file:
file 'settings/server.yml', 'config/server.yml', :collision => :skip
Collisions are handled by checking whether the destination file exists and either skipping the file, forcing overwrite, or asking the user what to do.
[ show source ]
# File vendor/rails/railties/lib/rails_generator/commands.rb, line 217 217: def file(relative_source, relative_destination, file_options = {}, &block) 218: # Determine full paths for source and destination files. 219: source = source_path(relative_source) 220: destination = destination_path(relative_destination) 221: destination_exists = File.exist?(destination) 222: 223: # If source and destination are identical then we're done. 224: if destination_exists and identical?(source, destination, &block) 225: return logger.identical(relative_destination) 226: end 227: 228: # Check for and resolve file collisions. 229: if destination_exists 230: 231: # Make a choice whether to overwrite the file. :force and 232: # :skip already have their mind made up, but give :ask a shot. 233: choice = case (file_options[:collision] || options[:collision]).to_sym #|| :ask 234: when :ask then force_file_collision?(relative_destination, source, destination, file_options, &block) 235: when :force then :force 236: when :skip then :skip 237: else raise "Invalid collision option: #{options[:collision].inspect}" 238: end 239: 240: # Take action based on our choice. Bail out if we chose to 241: # skip the file; otherwise, log our transgression and continue. 242: case choice 243: when :force then logger.force(relative_destination) 244: when :skip then return(logger.skip(relative_destination)) 245: else raise "Invalid collision choice: #{choice}.inspect" 246: end 247: 248: # File doesn't exist so log its unbesmirched creation. 249: else 250: logger.create relative_destination 251: end 252: 253: # If we're pretending, back off now. 254: return if options[:pretend] 255: 256: # Write destination file with optional shebang. Yield for content 257: # if block given so templaters may render the source file. If a 258: # shebang is requested, replace the existing shebang or insert a 259: # new one. 260: File.open(destination, 'wb') do |dest| 261: dest.write render_file(source, file_options, &block) 262: end 263: 264: # Optionally change permissions. 265: if file_options[:chmod] 266: FileUtils.chmod(file_options[:chmod], destination) 267: end 268: 269: # Optionally add file to subversion or git 270: system("svn add #{destination}") if options[:svn] 271: system("git add -v #{relative_destination}") if options[:git] 272: end
Checks if the source and the destination file are identical. If passed a block then the source file is a template that needs to first be evaluated before being compared to the destination.
[ show source ]
# File vendor/rails/railties/lib/rails_generator/commands.rb, line 277 277: def identical?(source, destination, &block) 278: return false if File.directory? destination 279: source = block_given? ? File.open(source) {|sf| yield(sf)} : IO.read(source) 280: destination = IO.read(destination) 281: source == destination 282: end
When creating a migration, it knows to find the first available file in db/migrate and use the migration.rb template.
[ show source ]
# File vendor/rails/railties/lib/rails_generator/commands.rb, line 357 357: def migration_template(relative_source, relative_destination, template_options = {}) 358: migration_directory relative_destination 359: migration_file_name = template_options[:migration_file_name] || file_name 360: raise "Another migration is already named #{migration_file_name}: #{existing_migrations(migration_file_name).first}" if migration_exists?(migration_file_name) 361: template(relative_source, "#{relative_destination}/#{next_migration_string}_#{migration_file_name}.rb", template_options) 362: end
Display a README.
[ show source ]
# File vendor/rails/railties/lib/rails_generator/commands.rb, line 349 349: def readme(*relative_sources) 350: relative_sources.flatten.each do |relative_source| 351: logger.readme relative_source 352: puts File.read(source_path(relative_source)) unless options[:pretend] 353: end 354: end
[ show source ]
# File vendor/rails/railties/lib/rails_generator/commands.rb, line 364 364: def route_resources(*resources) 365: resource_list = resources.map { |r| r.to_sym.inspect }.join(', ') 366: sentinel = 'ActionController::Routing::Routes.draw do |map|' 367: 368: logger.route "map.resources #{resource_list}" 369: unless options[:pretend] 370: gsub_file 'config/routes.rb', /(#{Regexp.escape(sentinel)})/mi do |match| 371: "#{match}\n map.resources #{resource_list}\n" 372: end 373: end 374: end
Generate a file for a Rails application using an ERuby template. Looks up and evaluates a template by name and writes the result.
The ERB template uses explicit trim mode to best control the proliferation of whitespace in generated code. <%- trims leading whitespace; -%> trims trailing whitespace including one newline.
A hash of template options may be passed as the last argument. The options accepted by the file are accepted as well as :assigns, a hash of variable bindings. Example:
template 'foo', 'bar', :assigns => { :action => 'view' }
Template is implemented in terms of file. It calls file with a block which takes a file handle and returns its rendered contents.
[ show source ]
# File vendor/rails/railties/lib/rails_generator/commands.rb, line 298 298: def template(relative_source, relative_destination, template_options = {}) 299: file(relative_source, relative_destination, template_options) do |file| 300: # Evaluate any assignments in a temporary, throwaway binding. 301: vars = template_options[:assigns] || {} 302: b = template_options[:binding] || binding 303: vars.each { |k,v| eval "#{k} = vars[:#{k}] || vars['#{k}']", b } 304: 305: # Render the source file with the temporary binding. 306: ERB.new(file.read, nil, '-').result(b) 307: end 308: end


|
Test Case
|
PROV-0010 |
|
Title
|
Android UI is not automatically provisioned |
|
Objective
|
This test case is intended to verify the following implied or specified requirements:
- The bluetooth connection shall be manually provisioned via Java code in the Android App and/or Android OS.
To improve security, this code requires hand configuration. That is, it requires code modifications requiring the user to compile in some configuration information and hand configure other parts of the configuration. This test focuses on the user interface. |
|
Setup
|
- If the Android device is paired with the controller, instruct it to forget the pairing.
|
|
Actions
|
- Inspect the UI code and verify that sets the service ID to the same service ID that is set in the controller code and verify that the UI code looks for the node name given to the controller.
- On the controller, enable bluetooth discovery and start the agent.
- sudo bluetoothctl \bullet
- discoverable on \bullet
- agent on \bullet
- pairable on \bullet
- On the Android device, turn bluetooth on and pair with the controller node. \bullet
- Turn off discovery, pairing, and agent on the controller. \bullet
- Exit bluetoothctl with <control> d \bullet\step
- Start the app on the Android device.
- Press the open close button and confirm that no communication error occurs
|
|
Expected
|
Provisioning is hardcoded in the UI and bluetooth pairing must be done using Android configuration routines. |
|
Results
|
PASSED |
|
Cleanup
|
|
|
Requirements
|
GDO-PROV-010 |


public interface SockJSServer
SockJS enables browsers to communicate with the server using a simple WebSocket-like api for sending and receiving messages. Under the bonnet SockJS chooses to use one of several protocols depending on browser capabilities and what appears to be working across the network.
Available protocols include:
This means, it should just work irrespective of what browser is being used, and whether there are nasty things like proxies and load balancers between the client and the server.
For more detailed information on SockJS, see their website.
On the server side, you interact using instances of SockJSSocket
- this allows you to send data to the
client or receive data via the ReadSupport.dataHandler(org.vertx.java.core.Handler<M>)
.
You can register multiple applications with the same SockJSServer, each using different path prefixes, each application will have its own handler, and configuration.
Instances of this class are not thread-safe.
| Modifier and Type | Method and Description |
|---|---|
SockJSServer |
bridge(JsonObject sjsConfig,
JsonArray inboundPermitted,
JsonArray outboundPermitted)
Install an app which bridges the SockJS server to the event bus
|
SockJSServer |
bridge(JsonObject sjsConfig,
JsonArray inboundPermitted,
JsonArray outboundPermitted,
JsonObject bridgeConfig)
Install an app which bridges the SockJS server to the event bus
|
SockJSServer |
bridge(JsonObject sjsConfig,
JsonArray inboundPermitted,
JsonArray outboundPermitted,
long authTimeout)
Install an app which bridges the SockJS server to the event bus
|
SockJSServer |
bridge(JsonObject sjsConfig,
JsonArray inboundPermitted,
JsonArray outboundPermitted,
long authTimeout,
java.lang.String authAddress)
Install an app which bridges the SockJS server to the event bus
|
void |
close()
Close the server
|
SockJSServer |
installApp(JsonObject config,
Handler<SockJSSocket> sockHandler)
Install an application
|
SockJSServer |
setHook(EventBusBridgeHook hook)
Set a EventBusBridgeHook on the SockJS server
|
SockJSServer installApp(JsonObject config, Handler<SockJSSocket> sockHandler)
config
- The application configurationsockHandler
- A handler that will be called when new SockJS sockets are createdSockJSServer bridge(JsonObject sjsConfig, JsonArray inboundPermitted, JsonArray outboundPermitted)
sjsConfig
- The config for the appinboundPermitted
- A list of JSON objects which define permitted matches for inbound (client->server) trafficoutboundPermitted
- A list of JSON objects which define permitted matches for outbound (server->client)
trafficSockJSServer bridge(JsonObject sjsConfig, JsonArray inboundPermitted, JsonArray outboundPermitted, long authTimeout)
sjsConfig
- The config for the appinboundPermitted
- A list of JSON objects which define permitted matches for inbound (client->server) trafficoutboundPermitted
- A list of JSON objects which define permitted matches for outbound (server->client)
trafficauthTimeout
- Default time an authorisation will be cached for in the bridge (defaults to 5 minutes)SockJSServer bridge(JsonObject sjsConfig, JsonArray inboundPermitted, JsonArray outboundPermitted, long authTimeout, java.lang.String authAddress)
sjsConfig
- The config for the appinboundPermitted
- A list of JSON objects which define permitted matches for inbound (client->server) trafficoutboundPermitted
- A list of JSON objects which define permitted matches for outbound (server->client)
trafficauthTimeout
- Default time an authorisation will be cached for in the bridge (defaults to 5 minutes)authAddress
- Address of auth manager. Defaults to 'vertx.basicauthmanager.authorise'SockJSServer bridge(JsonObject sjsConfig, JsonArray inboundPermitted, JsonArray outboundPermitted, JsonObject bridgeConfig)
sjsConfig
- The config for the appinboundPermitted
- A list of JSON objects which define permitted matches for inbound (client->server) trafficoutboundPermitted
- A list of JSON objects which define permitted matches for outbound (server->client)
trafficbridgeConfig
- JSON object holding config for the EventBusBridgeSockJSServer setHook(EventBusBridgeHook hook)
hook
- The hookvoid close()