| Package | Description |
|---|---|
| org.eclipse.microprofile.auth |
Metadata for JWT RBAC for Microprofile
|
| org.eclipse.microprofile.config |
Configuration for Java MicroProfile
|
| org.eclipse.microprofile.config.inject |
CDI Support for MicroProfile Config
|
| org.eclipse.microprofile.config.spi |
This package contains classes which are used to implement the configuration API, and to extend the standard
configuration functionality in a portable way.
|
| org.eclipse.microprofile.faulttolerance |
CDI Support for Microprofile Fault Tolerance
|
| org.eclipse.microprofile.faulttolerance.exceptions |
Exceptions for Microprofile Fault Tolerance
|
| org.eclipse.microprofile.health |
Microprofile Health
|
| org.eclipse.microprofile.health.spi |
Microprofile Service Health Checks
|
| org.eclipse.microprofile.jwt |
Interoperable JWT RBAC for Microprofile
|
| org.eclipse.microprofile.jwt.config | |
| org.eclipse.microprofile.maven.pdf | |
| org.eclipse.microprofile.metrics |
MicroProfile Metrics
|
| org.eclipse.microprofile.metrics.annotation |
This package contains the annotations used for MicroProfile Metrics.
|
| org.eclipse.microprofile.metrics.tck | |
| org.eclipse.microprofile.metrics.tck.cdi | |
| org.eclipse.microprofile.metrics.tck.cdi.stereotype | |
| org.eclipse.microprofile.metrics.tck.cdi.stereotype.stereotypes | |
| org.eclipse.microprofile.metrics.tck.inheritance | |
| org.eclipse.microprofile.metrics.tck.metrics | |
| org.eclipse.microprofile.metrics.tck.tags | |
| org.eclipse.microprofile.metrics.tck.util | |
| org.eclipse.microprofile.openapi |
A set of Java interfaces, annotations and programming models which allow Java developers to natively produce OpenAPI
v3 documents from their JAX-RS applications.
|
| org.eclipse.microprofile.openapi.annotations |
A set of annotations, many derived from Swagger Core library.
|
| org.eclipse.microprofile.openapi.annotations.callbacks |
A set of annotations to represent callback URL or an array of relevant callback URLs that can be invoked for a
particular HTTP operation as well as the HTTP operation that will be invoked with the callback.
|
| org.eclipse.microprofile.openapi.annotations.enums |
A set of parameters used by other annotations to represent their enumerable properties.
|
| org.eclipse.microprofile.openapi.annotations.extensions |
Annotations to represent additional data to extend existing OpenAPI specifications.
|
| org.eclipse.microprofile.openapi.annotations.headers |
An annotation to describe a single header object.
|
| org.eclipse.microprofile.openapi.annotations.info |
A set of annotations to represent metadata about the API, including license information and contact information of
the exposed API.
|
| org.eclipse.microprofile.openapi.annotations.links |
Annotations to represent a design-time link for a response and the corresponding parameter to be passed to the linked
operation.
|
| org.eclipse.microprofile.openapi.annotations.media |
A set of annotations to represent input and output data type, media type and relevant examples.
|
| org.eclipse.microprofile.openapi.annotations.parameters |
A set of annotations to describe and encapsulate operation parameters and operation's request body.
|
| org.eclipse.microprofile.openapi.annotations.responses |
Contains annotation to describe a single response from an API operation, and an annotation to encapsulate multiple
responses from an API operation.
|
| org.eclipse.microprofile.openapi.annotations.security |
A set of annotations to represent various security components of an OpenAPI app.
|
| org.eclipse.microprofile.openapi.annotations.servers |
Annotations to represent servers used for a single API operation or for all operations in an OpenAPI document, as
well as a way to represent variables for server URL template substitution.
|
| org.eclipse.microprofile.openapi.annotations.tags |
A set of annotations to represent a tag for an API endpoint and a container that encapsulates multiple such tags.
|
| org.eclipse.microprofile.openapi.models |
A set of interfaces for programmable models and their helper classes, many derived from Swagger Core library.
|
| org.eclipse.microprofile.openapi.models.callbacks |
An interface to represent callback URL.
|
| org.eclipse.microprofile.openapi.models.examples |
An interface to represent a programmable model of an example of a data type or a media type.
|
| org.eclipse.microprofile.openapi.models.headers |
An interface of a programmable model to represent a single header object.
|
| org.eclipse.microprofile.openapi.models.info |
A set of interfaces of programmable models to represent metadata about the API, including license information and
contact information of the exposed API.
|
| org.eclipse.microprofile.openapi.models.links |
An interface of a model to represent a design-time link for a response.
|
| org.eclipse.microprofile.openapi.models.media |
A set of interfaces for programmable models to represent input and output data types and media types.
|
| org.eclipse.microprofile.openapi.models.parameters |
A set of model interfaces to describe operation parameters and operation's request body.
|
| org.eclipse.microprofile.openapi.models.responses |
Model interfaces to describe a single response from an API operation, and an annotation to encapsulate multiple
responses from an API operation.
|
| org.eclipse.microprofile.openapi.models.security |
A set of model interfaces to represent various security components of an OpenAPI app.
|
| org.eclipse.microprofile.openapi.models.servers |
Model interfaces to represent servers used for a single API operation or for all operations in an OpenAPI document,
as well as a way to represent variables for server URL template substitution.
|
| org.eclipse.microprofile.openapi.models.tags |
Model interface to represent a tag of an API endpoint.
|
| org.eclipse.microprofile.openapi.spi |
Service provider interface which allows vendors to set their implementations of OASFactoryResolver.
|
| org.eclipse.microprofile.rest.client |
APIs for building a type-safe RESTful client leveraging existing JAX-RS APIs, for example:
|
| org.eclipse.microprofile.rest.client.annotation |
APIs for annotating MP Rest Client interfaces.
|
| org.eclipse.microprofile.rest.client.ext |
APIs for extending MP Rest Client functionality - such as new providers.
|
| org.eclipse.microprofile.rest.client.inject |
APIs to aid in CDI-based injection of MP Rest Client implementations.
|
| org.eclipse.microprofile.rest.client.spi |
SPIs for MP Rest Client implementations or system-level components that provide additional functionality for MP Rest
Clients.
|


Upgrading - Redis to redis-stack-server
This section covers the steps required to upgrade from running Skyline Redis to redis-stack-server. It requires the Redis server version to be >= 5 as the RDB data from Redis 5 is compatibile with Redis 6.2
This is a guide only, your Redis set up and configuration may be different, first read through all the steps and determine how they fit in with your set up, paths, ports, etc.
Although redis.io has yum/apt repos with a packaged version they provide redis-stack-server RC (release candidate) packages at times and in terms of Skyline Redis needs to be stable, using the download binaries for the OS is a more stable method and the method described here.
Assumptions made: - Your Redis is on port 6379 - YOU read the paths in the below guide and assess them relating to your set up
Things you need to determine beforehand:
- Your Redis password
- The path to your existing Redis dump.rdb (e.g. /var/lib/redis/6379/dump.rdb)
- Whether you just want to add module redistimeseries.so
to your Redis config
or whether you want to run the Redis 6.2 config.
The upgrade process. First we install redis-stack-server (CentOS and Ubuntu patterns below), then we stop Skyline services, stop Redis, copy the dump.rdb file to redis-stack-server and then start redis-stack-server and start the Skyline services again.
You will then need to update any of your own things that start/stop or control/monitor the redis-server process and update to use the redis-stack-server process.
First install redis-stack-server
For CentOS 8 Stream (Ubuntu is below)
# CentOS 8
REDIS_STACK_VERSION="redis-stack-server-6.2.6-v7"
mkdir /opt/redis-stack-server
wget -O "/opt/redis-stack-server/${REDIS_STACK_VERSION}.rhel8.x86_64.tar.gz" "https://packages.redis.io/redis-stack/${REDIS_STACK_VERSION}.rhel8.x86_64.tar.gz"
cd /opt/redis-stack-server
tar -zxvf "${REDIS_STACK_VERSION}.rhel8.x86_64.tar.gz"
# Deploy as the redis.io yum package deploys
mkdir -p /opt/redis-stack
chown nobody:nobody /opt/redis-stack
rsync -az "/opt/redis-stack-server/${REDIS_STACK_VERSION}/" /opt/redis-stack/
chown -R nobody:nobody /opt/redis-stack
mkdir -p /var/lib/redis-stack
chown -R nobody:nobody /var/lib/redis-stack
Ubuntu
# Ubuntu 20.04 and 22.04
source /etc/lsb-release
REDIS_STACK_VERSION="redis-stack-server-6.2.6-v7"
mkdir /opt/redis-stack-server
wget -O "/opt/redis-stack-server/${REDIS_STACK_VERSION}.${DISTRIB_CODENAME}.x86_64.tar.gz" "https://packages.redis.io/redis-stack/${REDIS_STACK_VERSION}.${DISTRIB_CODENAME}.x86_64.tar.gz"
cd /opt/redis-stack-server
tar -zxvf "${REDIS_STACK_VERSION}.${CODENAME}.x86_64.tar.gz"
mkdir -p /opt/redis-stack
chown nobody:nogroup /opt/redis-stack
rsync -az "/opt/redis-stack-server/${REDIS_STACK_VERSION}/" /opt/redis-stack/
chown -R nobody:nogroup /opt/redis-stack
mkdir -p /var/lib/redis-stack
chown -R nobody:nogroup /var/lib/redis-stack
On both CentOS and Ubuntu create the systemd service file
echo "[Unit]
Description=Redis stack server
Documentation=https://redis.io/
After=network.target
[Service]
Type=simple
User=nobody
ExecStart=/opt/redis-stack/bin/redis-server /etc/redis-stack.conf
WorkingDirectory=/var/lib/redis-stack
UMask=0077
[Install]
WantedBy=multi-user.target" > /etc/systemd/system/redis-stack-server.service
systemctl daemon-reload
Decide on the Redis config you want to use. If you want to use your own, then copy it to the redis-stack.conf and add
loadmodule /opt/redis-stack/lib/redistimeseries.so
:
# SET THIS TO YOUR_REDIS_CONFIG
#REDIS_CONF=/etc/redis.conf
#REDIS_CONF=/etc/redis/6379/redis.conf
REDIS_CONF=<YOUR_REDIS_CONFIG>
cp /etc/redis-stack.conf /etc/redis-stack.conf.${REDIS_STACK_VERSION}.bak
cat "$REDIS_CONF" \
| sed -e 's/# loadmodule \/path\/to\/other_module.so/# loadmodule \/path\/to\/other_module\.so\nloadmodule \/opt\/redis-stack\/lib\/redistimeseries\.so/1' \
> /etc/redis-stack.conf
# Whichs adds the following line
# loadmodule /opt/redis-stack/lib/redistimeseries.so
If you want to use the default Redis 6.2 config with the required changes then do the following
# SET THIS TO YOUR REDIS PASSWORD
REDIS_PASSWORD=<YOUR_REDIS_PASSWORD>
cp /etc/redis-stack.conf /etc/redis-stack.conf.${REDIS_STACK_VERSION}.bak
wget -O /opt/redis-stack-server/redis.6.2.github.conf https://raw.githubusercontent.com/redis/redis/6.2/redis.conf
cat /opt/redis-stack-server/redis.6.2.github.conf \
| sed -e 's/# unixsocketperm 700/# unixsocketperm 700\nunixsocket \/tmp\/redis\.sock\nunixsocketperm 777/1' \
| sed -e 's/# requirepass foobared/# requirepass foobared\nrequirepass '$REDIS_PASSWORD'/1' \
| sed -e 's/# loadmodule \/path\/to\/other_module.so/# loadmodule \/path\/to\/other_module\.so\nloadmodule \/opt\/redis-stack\/lib\/redistimeseries\.so/1' \
| sed -e 's/bind 127\.0\.0\.1 -::1/# bind 127\.0\.0\.1 -::1\nbind 127\.0\.0\.1/1' \
| sed -e 's/# supervised auto/# supervised auto\nsupervised systemd/1' \
| sed -e 's/dir \.\//# dir \.\/\ndir \/var\/lib\/redis-stack/1' \
| sed -e 's/# maxmemory-policy noeviction/# maxmemory-policy noeviction\nmaxmemory-policy noeviction/1' \
| sed -e 's/appendonly no/# appendonly no\nappendonly yes/1' \
| sed -e 's/# save 60 10000/# save 60 10000\n# Skyline reduce save I\/O\nsave 300 1\n save 60 200000\nsave 10 500000/1' \
> /opt/redis-stack-server/skyline.redis.6.2.conf
cat /opt/redis-stack-server/skyline.redis.6.2.conf > /etc/redis-stack.conf
redis-stack-server is now installed
Stop/disable any/all service controls like monit, etc that are controlling Skyline services.
# Stop/disable any/all service controls like monit, etc that are controlling
# Skyline services.

SKYLINE_SERVICES="analyzer
analyzer_batch
mirage
crucible
boundary
ionosphere
luminosity
panorama
webapp
vista
snab
flux
horizon"
for i in $SKYLINE_SERVICES
do
systemctl stop "$i"
done
Stop/disable any/all service controls like monit, etc that are controlling Redis, for example.
# Stop/disable any/all service controls like monit, etc that are controlling
# Redis.
systemctl stop redis
systemctl disable redis
# ALSO REMOVE ANY CHECKS THAT WOULD RESTART THE REDIS SERVICE
Copy the dump.rdb file to redis-stack-server
# SET THE PATH TO YOUR dump.rdb file, e.g.
# RDB_FILE="/var/lib/redis/6379/dump.rdb"
RDB_FILE="<YOUR_RDB_FILE>"
cp "$RDB_FILE" /var/lib/redis-stack/
Start redis-stack-server
systemctl start redis-stack-server
systemctl enable redis-stack-server
# Test
/opt/redis-stack/bin/redis-cli -a $REDIS_PASSWORD INFO
Start your Skyline services.
for i in $SKYLINE_SERVICES
do
systemctl start "$i"
done
Ensure you update your builds/config_management to use and monitor the redis-stack-server service and remove the redis service and add also add the new changes and new config file.


The easiest and quickest way to get started with OpenCache is to use the Vagrant box located in the GitHub project. This is a virtual machine containing all of the tools needed to give OpenCache a spin.
Firstly, run:
git clone https://github.com/opencache-project/opencache-vagrant
This will duplicate the necessary code into a new directory. Next, install Vagrant if you haven't done so already. Finally, start the virtual machine using:
vagrant up
See the README for more details, including the contents of the virtual machine and how best to use it. A more detailed tutorial will be provided shortly; thank you for your patience in the meantime.


eputil
eputil OPTIONS EPRINT_REST_URL
eputil is a command line program for exploring the EPrints Extended API (provided by ep3apid) or EPrint’s own REST API. Records are returned in either JSON or EPrints XML. Lists of eprint ids are returned in JSON.
The extended API is expected to be present on the local machine at http://localhost:8484. eputil will convert the command line parameters into the appropriate URL encoding the command line as necessary and return the values from the Extended API end points.
The format of the command working with the EPrints extended API is
eputil REPO_ID END_POINT_NAME [PARAMETER ...]
You must
specify the repository id in the command. E.g.
eputil caltechauthors keys
eputil caltechauthors doi
eputil caltechauthors doi "10.5062/F4NP22DV"
eputil caltechauthors creator-name "Morrell" "Thomas"
eputil caltechauthors grant-number
eputil caltechauthors grant-number "kzcx3-sw-147"
eputil caltechauthors eprint 18339
eputil -json caltechauthors eprint 18339
See website for a full list of available end points.
https://caltechlibrary.github.io/eprinttools/docs/ep3apid.html
eputil parses XML content retrieved from EPrints 3.x. REST API. It
will render results in JSON or XML. With the -raw
option
you can get the unmodified EPrintXML from the REST API otherwise the XML
is parsed before final rendering as JSON or XML. It requires a basic
knowledge of the layout of EPrint 3.x’s REST API. It supports both
unauthenticated and basic authentication access to the API. The REST API
authentication mechanism appears indepent of the primary website
authentication setup of the installed EPrints (at least at Caltech
Library). See the examples to start exploring the API.
Fetch the raw unmarshaled EPrint XML via the EPrint REST API for id 123.
eputil -raw https://example.org/rest/eprint/123.xml
Fetch the EPrint XML marshaled as XML using the EPrints REST API for id 123.
eputil https://example.org/rest/eprint/123.xml
Fetch the EPrint XML marshaled as JSON using the EPrints REST API for id 123.
eputil -json https://example.org/rest/eprint/123.xml
Get a JSON array of eprint ids from the REST API
eputil -json https://example.org/rest/eprint/
Get the last modified date for id 123 from REST API
eputil -raw https://example.org/rest/eprint/123/lastmod.txt
If the EPrint REST API is protected by basic authentication you can pass the username and password via command line options. You will be prompted for the password value. or via the URL. In this example the username is “user” and password is “secret”. In this example you will be prompted to enter your secret.
eputil -username=user -password \
https://example.org/rest/eprint/123.xml
You can also pass the username and secret via the URL but this leaves you vunerable to the password being recorded in your command history or if another person has access to the process table. You SHOULD NOT use this approach on a shared machine!
eputil<EMAIL_ADDRESS>Getting IDs doesn’t typically require authentication but seeing specific records may depending on the roles and security setup implemented in the EPrint instance.
Supported Environment Variables
EPRINT_USER sets the default username used by eputil
EPRINT_PASSWORD sets the default password used by eputil
EPRINT_BASE_URL sets the default base URL to access the
EPrints REST API
eputil 1.2.4


Ploror688.github.io
Dear Twitpic Community - thank you for all the wonderful photos you have taken over the years. We have now placed Twitpic in an archived state. Ekşi sözlük - kutsal bilgi kaynağı - eksisozluk.com. SEND YOUR INFORMATION/URL/LINK to THE ULTIMATE SCIENCE FICTION WEB GUIDE. We will review your information and add it to this list if appropriate. Brandon G. Donnelly — Manager vs. maker. Maker Vs Manager Essay Paul Graham — MODERATORS. Source access vs dynamism - Google Groups.
The 2018 FIFA World Cup was the 21st FIFA World Cup, an international football tournament contested by the men's national teams of the member associations Free microsoft word Essays and Papers - 123helpme.com. Editor’s Note: Congressman Ron Paul explains why the monetary policies of the Federal Reserve are responsible for financial and economic crises spanning. Maker Vs Manager Essay Paul Graham , Why Are Maker. Texarkana Gazette Texarkana Breaking. Why Are Maker Schedules So Rare? Want to start a startup? Get funded by Y Combinator. July One reason programmers essay meetings essay Ron Paul: "The Next Crisis Will Be Even More Destructive".
Welcome to Reddit, Want to start a startup? Get funded by Y Combinator. July One reason programmers dislike meetings so much is that they re on a different Highfive simplifies business collaboration with a video conferencing platform designed to make meetings awesome. With Highfive there are no cables, dongles. Maker Vs Manager Essay Paul Graham - chiarina.org. Welcome to Reddit, Want to start a startup? Get funded by Y Combinator. MODERATORS. July Manager reason programmers dislike meetings Welcome to Reddit, Want to start a startup? Get funded by Y Combinator. Manager One reason programmers business plan writers for cheap meetings
Partners Task Force - Famous Same-Sex Couples. Essay maker vs manager - How to Compose a Top-Notch. Maker's Schedule, Manager's Schedule - Paul Graham. Maker Vs Manager Essay Paul Graham - chancyarms.com. Essay maker vs manager He became manager essay to essay paul graham s distinction between the maker s schedule, spiritual.
05May08 - In World War the devil 'has surpassed himself' - Dennis Wheatley Nazi drum with skull and bones symbol From Gateway to Hell, Hutchinson If you're a maker on a manager's schedule or a manager on a maker's schedule, you could be spinning your wheels. Find out the ideal way to schedule Try No Meeting Days at Work for More Heads Gmail is email that's intuitive, efficient, and useful. 15 GB of storage, less spam, and mobile access. Maker Vs Manager Essay Paul Graham - pacorg.com. Let me summarize Erik's argument essay as this: 1. Free software and open source are a poor way to adapt and grow software. 2. Dynamic mechanisms that don't. Communities — Voices and Insights - Washington Times. BibMe: Free Bibliography Citation Maker 2018 FIFA World Cup - Wikipedia. Maker vs. Manager: How Your Schedule Can Make or Break.
TV page of ULTIMATE SCIENCE FICTION WEB GUIDE. Funny Videos, Funny Clips Funny Pictures Break. There is a certain grace and balance to life having your home filled with superior sound and fully automated systems. We work to discover your priorities and design. When Your Elderly Relatives Figure Out The Internet And Start Sharing Their True Stupidity. I mentioned this in a comment today and was surprised how many people hadn t heard of it. In Paul Graham Find an open slot in your schedule, book them, and you re done. Most powerful people are on the manager s schedule. It s the schedule of command.
Reviews, essays, books and the arts: the leading international weekly for literary culture. As I write this, hundreds of people are converging on the streets of Washington, D.C., and in the halls of the U.S. Capitol with T-shirts saying "Believe Women.".  BibMe Free Bibliography Citation Maker - MLA, APA, Chicago, Harvard. Why Are Maker Schedules So Rare? Want to start a startup? Get funded by Y Combinator. July One essay programmers dislike meetings graham Manager vs. maker I am a big believer in making things. That could be writing a blog post, recording a podcast, coding an app, designing a building, making. Paul Graham s classic productivity essay, Maker.
After being taken down twice by Blogger within a single week, we got the message: It’s Time To Go. Gates of Vienna has moved to a new address:. July 2009 One reason programmers dislike meetings so much is that they're on a different type of schedule from other people. Meetings Maker Vs Manager Essay Paul Graham , Of Makers and Managers. U.S. vs Microsoft - Microsoft Case Part I: The government has been looking into Microsoft since 1990, when the Federal Trade Commission first started examining. The Texarkana Gazette is the premier source for local news and sports in Texarkana and the surrounding Arklatex areas.
Mystery Marks -- Silver Hallmarks and Makers' Marks.
Subscribe now and save, give a gift subscription or get help with an existing subscription. Archives and past articles from the Philadelphia Inquirer, Philadelphia Daily News, and Philly.com. Maker Vs Manager Essay Paul Graham - The Problem Maker vs manager essay paul graham. George W. Bush, John Kerry, test the spirit, Skull Bones.


You will find here a selection of useful resources about Stencila.
You will find here a selection of useful resources about Stencila.
If you mention Stencila in your publications, we would be very grateful to include the following in the references:
Stencila Development Core Team (2016). Stencila [Computer software]. Version 0.28. Available from http://stenci.la
If you would like to mention Stencila in your talk, please feel free to use the following slide:
odp
formatpptx
formatWe are expanding on the Stencila sticker range. If you would like some stickers to decorate your laptops, get in touch!
We have been presenting Stencila at various events. All these presentations are available for you to preview and download.
We will keep adding more so keep an eye on this list.


According to E. F. Schumacher, there are only two kinds of problems in the world:
- divergent problems
- convergent problems
Choosing a new car is a convergent problem. You only need one new car. There are lots of options, and the solution is to whittle down those options until you've found one that meets your needs. Once you're there, problem solved.
If you've never bough a car before, you'll need to research all the different options available. You might also want to consider alternative modes of transport - why do you even need a car? Could you make do with a bicycle or public transport? This is an example of divergent thinking
Notice how I need both types of thinking at the appropriate stage: First I generate options with divergent thinking, then I narrow them down with convergent thinking. If I apply the divergent mindset to the problem for too long, I would become overwhelmed by choices, and might never actually solve my problem. If I approached the problem with a convergent mindset from the beginning, I might miss out on considering valuable alternatives.
On final day of CukeUp NYC this year, Paul Rayner ran an excellent morning workshop that focussed on using BDD to explore and discover hidden requirements. In the afternoon, George Dinwiddie and I ran a session on distilling the essence of scenarios.
What struck me was how these two sessions perfectly encompassed these two modes of thought, and how both are neccesary to do BDD.
Exploration by Example
First, with your divergent mindset, you collaboratively explore the problem domain with concrete examples. You're trying to discover as much as you can about your assumptions and lack of knowledge: your ignorance. Being very concrete is vital at this stage: who the user is, what they're doing at the time, even how old they are, or whether they're in a hurry. These kinds of details can all help you to visualise the scenario, and that in turn helps you to see other scenarios.
At this stage, Liz's context and outcome questions can also help to discover new scenarios:
"Is there any other context which, when this event happens, will produce a different outcome?"
We can also find missing details in the existing scenarios:
"Given this context, when this event happens, is there another outcome that's important? Something we missed, perhaps?"
At this stage, I'll most likely be working with pieces of paper or a whiteboard, trying to keep the process very lightweight and let the ideas flow.
Converge on a specification
Once you have one or more very concrete examples, and you've decided you want to implement the behaviour they describe, you switch into the convergent mindset. Now your task is to find the most concise way to describe this behaviour without losing its essence. Why? Being concise is important for long-term value. A scenario with too much detail can be hard to change and brittle, but also confusing for the reader. Details that once helped you to imagine yourself in the user's shoes now become distracting clutter.
It's time to look for rules that underly the examples you've been discussing, and to find the best choice of words to describe your understanding of the problem domain.
It's also time to choose whether each example needs to remain documented in Gherkin, or whether it would be better moved down the pyramid to a unit test.
Both modes matter
I need both modes of thought to do BDD: divergent thinking to explore the problem and discover scenarios, then convergent thinking to turn those examples into an executable specification.


Call a Function that Returns a Promise
The code will attempt to download an image below and will log its status in the console.
Start Call
Start Call (Version with Error-Handling)


 This post augments the Databricks official documentation and spells out the steps that tripped me up.
Why is this so painful? Because you have to carefully check that you have the correct versions of each of the following programs:
which -a python3.7
in the terminal (more details for Mac here)The versions need to match your cluster set-up, and they also need to match each other. Read the requirements section very carefully.
You can check your cluster configurations on Databricks by clicking Clusters –> Accessible by me –> Name of the cluster (or + Create cluster).
Occasionally there is a message that you should set your cluster configurations to spark.databricks.service.server.enabled true
. Since I used a newer Databricks version, I don’t think it was necessary but it didn’t hurt. I set it in the cluster’s Advanced Options
.
Disclaimer: I did all this on a Mac and have no idea if any of this works on Windows.
About a year ago, I gave up partway through a workshop because I couldn’t understand why I had to download Java 8 when I had Java 11. Turns out, there is no escape from this obstacle if you want to use Spark from RStudio (at least with this Spark version).
To install, follow these instructions on StackOverflow or my tweaked version below.
/usr/libexec/java_home -V
in the terminal. If you have it already, skip to step 4. Note: the version number should read something like 1.8.*/usr/libexec/java_home -V
in the terminal again to check that the install workedJAVA_HOME
variable to your bash profile and your .Renviron file. To do so, either run the code below in the terminal OR (if you run into problems…)echo "export JAVA_HOME=$(/usr/libexec/java_home -v 1.8)" >> $HOME/.bash_profile
echo "JAVA_HOME='$(/usr/libexec/java_home -v 1.8)'" >> $HOME/.Renviron
To add manually:
open ~/.bash_profile
in the terminal) and add export JAVA_HOME=$(/usr/libexec/java_home -v 1.8)
on a new lineopen ~/.Renviron
) and add JAVA_HOME='/Library/Java/JavaVirtualMachines/adoptopenjdk-8.jdk/Contents/Home'
(replace the path with the output of /usr/libexec/java_home -v 1.8
if your path is different)pip uninstall pyspark
pip install -U databricks-connect==6.4.*
(make sure you get your Databricks version right!)You will need the following configuration properties:
databricks-connect configure
and follow the instructions, filling in the configuration properties as written abovedatabricks-connect get-spark-home
to get the appropriate path.echo "export SPARK_HOME='/usr/local/lib/python3.7/site-packages/pyspark'" >> $HOME/.bash_profile
echo "SPARK_HOME='/usr/local/lib/python3.7/site-packages/pyspark'" >> $HOME/.Renviron
(Use the manual method from above if you run into problems.)
databricks-connect test
to check that the connection worked – if it worked, you’ll eventually get the message, All tests passed.
. Try restarting your computer & running again if you have problems. This worked for me! Initially, I got the error message below, but it went away when I tried a week later (probably because I had restarted my computer):Testing scala command Could not find valid SPARK_HOME while searching [‘/Users/irenesteves’, ‘/usr/local/bin’]
There is RStudio set-up information in the Databricks documentation, but I found a bit of extra information in the RStudio documentation pages.
To start, you need to install sparklyr
:
# Install sparklyr if you don't already have it
# install.packages("sparklyr")
# Check to see if Spark has already been succesfully installed locally
sparklyr::spark_install_find()
# If not, install Spark locally
sparklyr::spark_install()
If you don’t have the JAVA_HOME
and SPARK_HOME
variables set in your .Renviron file yet, now is the time to do it (run the echo commands above or manually edit them using usethis::edit_r_environ()
). Once they’re set, you should be able to run the following anytime to get connected in R:
library(tidyverse)
library(sparklyr)
library(dbplyr)
sc <- spark_connect(method = "databricks")
You should be able to see all the Databricks tables in the Connections pane:
To see if you can actually work with the tables, test one out:
fi <- tbl(sc, "fireincidents")
# run `fi` to preview the "lazy" table
fi %>% count(`Ignition Cause`)
# you can use `collect()` to bring the data into R -- it can be heavy!
When you finish using your connection, simply disconnect with spark_disconnect(sc)
.
It’s a long and arduous process that requires lots of googling and stack-overflowing, but hopefully this post saved you a bit of time and pain.


Estás logueado :)
Email Email is required
Password Password is required
Name Name is required
Lastname Lastname is required


About...
Hello! I'm an extremely driven and creative Full Stack Developer who is currently open for career opportunities as a front-end or back-end web developer in the Greater Seattle Area.
I'm a recent graduate of Coding Dojo, a coding school located in Bellevue, WA that teaches 3 full stacks in 3 months. I'm capable of learning new technologies very quickly, and am always looking for opportunities to further expand my skills and grow as a developer.
Continue reading
La Mode
La mode is an Ecommerce website for designed to market various clothing products. Users are able to view the available garmetnts, select their desired quantity, and compile a shopping cart for making a final purchase.
Technologies:
Family Contacts
Family Contacts is a free application for managing, sharing, and visualizing your family relationships for both extended and immediate family. As an essential feature of the project, your log-in information determines who you can see and reveals how people are related to you.
Technologies:
fiveEleven
Five Eleven is a data visualization project built on the Python software stack. The application transforms the developer job-hunt into a more visual, user friendly experience. Based on location, technology popularity, and other vast data sets, users may easily visualize the varying sizes and concentrations of the junior developer job market accross the nation.
Technologies:


Hello! I am a Los Angeles based coder and designer. I specialize in full stack web development and UI/UX
design for mobile and online. I am particularly passionate about learning more about the tech field and
building my skills as a coder. I work well in teams and strive to bring each team member's strengths to
the forefront of any project. I am comfortable working in a fast-paced agile methodology environment
and I learn quickly.
I enjoy working on teams of creatives and engineers. I thrive in an environment where I can collaborate
with those who share and can foster my aptitude for solving both the artistic and technical challenges
of producing pioneering products and services for this generation and those to come.
With adaptive coding and design abilities, I am able to produce inspired work in the desired aesthetic
of any given campaign. I am currently looking for a full time position to start after I graduate in
June and am willing to relocate given the opportunity.I am passsionate about solving problems. My
journey started with working on creating thoughtfully designed experiences.Then after being introduced
to coding, I became completely obsessed with figuring out how programing works. I am now focusing on
solving problems through creating meaningful and joyful experiences with design and coding principles.


--- layout: post title: ExpositionMagazine.com date: 2010-11-01 13:58:19.000000000 +05:30 categories: [] tags: [] status: draft type: post published: false meta: _edit_last: '1' author: login: cvlewis email<EMAIL_ADDRESS>display_name: Carl V. Lewis first_name: Carl V. last_name: Lewis excerpt: !ruby/object:Hpricot::Doc options: {} ---
I oversee the design and online content of Oxford University's student-run research magazine, Exposition.


In an effort to learn the ways of the HTML we must first write some nonsense
This nonsense doesn't need to make sense, it just has to exist.
Its main purpose is displaying all the possibilities posible.
Well...
by all, I mean quite a bit of the basics. There's so much you can do that this one page can't handle it.
Let's see here:
First come, first serve!
Get our stuff now!


Handri Neeva water to reach Chittoor in four days
by Special CorrespondentWater from the Handri Neeva Sujala Sravanthi (HNSS) project through the Punganur branch canal is all set to enter Chittoor district in four days.
Water was formally released by legislators Peddireddy Dwarakanath Reddy (Thamballapalle), Nawaz Basha (Madanapalle) and Siddha Reddy (Kadiri) from Cherlopalle reservoir in Kadiri constituency of Anantapur district on Friday, which will enter Thamballapalle constituency in Chittoor district soon.
The legislators offered prayers to the water by calling it ‘Gangamma’. Recalling former Chief Minister Y.S. Rajasekhara Reddy’s painstaking efforts in developing the canal, the legislators called it a ‘fortunate coincidence’ the release of water during the regime of his son Y.S. Jagan Mohan Reddy.
Superintending Engineers Surender Reddy (Irrigation) and Venkatramana (HNSS) participated.
eom


Send:
USAGE:
goto|lon|lat|zoom|tilt --- goto|-79|39|12|0
click|lon|lat --- click|-79|39
show|id2|id2| ... |idN
--- show|
hide|id2|id2| ... |idN
--- hide|
RESULTS:


--- layout: default ---
A cross-language development platform for in-memory data
Join Mailing List Install ({{site.data.versions['current'].number}} Release - {{site.data.versions['current'].date}})
Apache Arrow is a cross-language development platform for in-memory data. It specifies a standardized language-independent columnar memory format for flat and hierarchical data, organized for efficient analytic operations on modern hardware. It also provides computational libraries and zero-copy streaming messaging and interprocess communication. Languages currently supported include C, C++, Java, JavaScript, Python, and Ruby.
Apache Arrow™ enables execution engines to take advantage of the latest SIMD (Single input multiple data) operations included in modern processors, for native vectorized optimization of analytical data processing. Columnar layout is optimized for data locality for better performance on modern hardware like CPUs and GPUs.
The Arrow memory format supports zero-copy reads for lightning-fast data access without serialization overhead.
Arrow acts as a new high-performance interface between various systems. It is also focused on supporting a wide variety of industry-standard programming languages. Java, C, C++, Python, Ruby, and JavaScript implementations are in progress and more languages are welcome.
Apache Arrow is backed by key developers of 13 major open source projects, including Calcite, Cassandra, Drill, Hadoop, HBase, Ibis, Impala, Kudu, Pandas, Parquet, Phoenix, Spark, and Storm making it the de-facto standard for columnar in-memory analytics.
Learn more about projects that are Powered By Apache Arrow


--- layout: minimal title: "About" permalink: /about/index.html description: "Sercan Gedik" ---
Currently living in Istanbul, Turkey. Baking mobile games with love for living.


Salary Calculator
Add Employee
Submit
Employees
First Name
Last Name
ID
Title
Annual Salary
Total Monthly:


Making the PSP run .Net binaries
So, for a while I have wanted to get in to PSP programming. I've had a PSP since forever (2010?) and I always loved the form factor. I would dearly love a PSVita, but I can't really justify getting one without doing at least one PSP project.
I decided to start looking at PSP development again. I've probably started 2 or 3 times over the last 10 or so years, but this time I finally went past a simple "hello, world!" or moving a simple block around the screen using the controls. Yes, I did those first too this time, but I also used that as an exercise to perfect my workflow. I now have a set-up on both PC (using a pre built SDK) and Mac (using an SDK I built myself from source) and have VSCode, USB HostFS, and PPSSPP running on both for quickly running code.
The main issue with PSP homebrew these days is the lack of any really great documentation online. We have a lot of fragments, and the first week or so consisted of me searching out those fragments to see what I could find. I found enough to get going and so started on the next phase - porting DNA.
Dot Net Anywhere
DNA is a project by Chris Bacon. It is somewhat abandoned, but still runs most modern DotNet Assemblies with some caveats. It was used to bootstrap Blazor, and is really pretty good at running basic code, albeit through an interpreter. My PSP port is based on my repo, where I pulled together a lot of the Blazor changes and a few other improvements made in other branches not merged in the main repo, but on the whole it is Chris's original code base.
Bootstrapping
Making the code run on PSP was more about removing the parts that didn't fit with the way in which the PSP functions, rather than anything else. The PSP can't use dynamic libraries, so all the P/Invoke code needed to be removed. There isn't really a console, so I also removed all the console based code. After doing all this, the code almost compiled.
GLOBS
The main part of the code that still failed to work was the code relating to the disk/filesystem access. The DNA code uses the Unix/Linux style GLOB API to access that type of data, and the PSP SDK seems to be missing that chunk of code, despite having the headers. I hunted around for a solution. I managed to find a project called Bennu Game Development and a post regarding their PSP port. This used an implementation of GLOB called "diet-glob", and this worked nicely as a drop in replacement for the PSP. After that the code compiled!
Making something happen
So, having a runtime was not very useful on its own. So I created a new chunk of code specific to the PSP, in a namespace called "PSP", and wired that in to the interpreter. I then wrote a simple app with the following code:
using Psp;
namespace testSimple
{
class Program
{
static void Main(string[] args)
{
var x = 10;
Debug.ScreenPrintf($"x is {x}\n");
var y = 20;
Debug.ScreenPrintf($"y is {y}\n");
}
}
}
And ran it on the PPSSPP emulator. After a couple of tweaks, I was greeted with the following image:
Wow! It worked... So next was to install on a real PSP:
And.... the same app on a PSP:
Conclusion
Well, it works. I am in the process of fleshing the code out more before releasing it. But I have now got a lot more working. Watch this space for more updates.


We start with what municipalities know -- scaffolding -- but designs, builds and outfits it for the performance of everyday life.
Scaffolded Space broadens "the shoulders" of our schools & civic structures with day-lit, super-sized awnings.
why?
- All-season playgrounds and playdate venues
- Cloud kitchens and commissaries


To break execution right about when a C++ exception is about to be thrown, insert a breakpoint at function __cxa_throw (if your compiler is GCC version 3 or higher) or __throw, if your compiler is GNU CC 2.95
Starting with version 1.3.30 of the engine, you can go to the Edit --> Options --> menu, select the Language tab, then check "Break on exceptions".


(HTML (HEAD )HEAD (BODY (TABLE "\n (COL )COL "\n (COL Astyle text-align: right )COL "\n (TBODY (TR "\n (TD "This )TD "\n (TD "That )TD "\n )TR "\n )TBODY )TABLE )BODY )HTML


29 March 2006
The Ministry of Health in Egypt has confirmed the country’s second fatal case of human infection with the H5N1 avian influenza virus.
The death occurred in a 30-year-old woman from the Qaliubiya governorate near Cairo. She developed symptoms on 12 March following the home slaughter of chickens. She was hospitalized on 16 March and died on 27 March.
The country’s first case, previously reported, occurred in a 30-year-old woman, also from Qaliubiya, who died on 17 March.
Tests conducted by the Cairo-based US Naval Medical Research Unit 3 (NAMRU-3) have confirmed an additional three cases.
A 32-year-old man, who worked on a farm where poultry were recently culled, developed symptoms on 16 March and was hospitalized the same day. He has since recovered.
A 17-year-old boy, whose father runs a poultry farm in the Gharbiya governorate in the Nile Delta, developed symptoms on 18 March and was hospitalized the following day. He has since recovered.
The fifth case is an 18-year-old girl from the Kafr El-Sheikh governorate.  She was hospitalized on 25 March.
At present, the Ministry of Health has confirmed all five cases based on results from the NAMRU-3 laboratory. Samples from these cases have been sent to a WHO collaborating laboratory in the United Kingdom for diagnostic verification. WHO will adjust the figures in its cumulative number of cases following the results of this external verification. Test results are expected later this week.
Health authorities have screened more than 350 people who were contacts of these patients or had a recent history of exposure to diseased birds. All test results have been negative for H5N1 infection.
Egypt has a large population of poultry, many of which are kept on roof terraces in close proximity to humans. H5N1 outbreaks in poultry have now been reported in 19 of the country’s 26 governorates. Since the first outbreak was confirmed on 17 February, more than 25 million birds have died or been destroyed.


Before Change
inv_transfo_1 = self.group.inverse(self.point_1)
// Compose transformation by its inverse on the right
// Expect the group identity
result = self.group.compose(self.point_1, inv_transfo_1)
expected = self.group.identity
self.assertTrue(np.allclose(result, expected))
// Compose transformation by its inverse on the left
After Change
self.assertTrue(np.allclose(result, expected))
def test_compose_and_inverse(self):
point = self.elements["point_1"]
inv_point = self.group.inverse(point)
// Compose transformation by its inverse on the right
// Expect the group identity
result = self.group.compose(point, inv_point)


Apply soy sauce to the chicken breast.Leave to marinate for at least 8 hours.
Place the marinated chicken for 35-40 minutes in the oven. Add water in a pot and wait for it to start boiling.
After the water boils, pour the noodles into the pan and let it sit there for 5 minutes.
Drain the noodles and place them into a frying pan alongside the chicken and pour some more soy sauce. Mix.
Enjoy!


THE LAST OF THE MOHICANS A film review by Mark R. Leeper Copyright 1992 Mark R. Leeper
Capsule review: Michael Mann's LAST OF THE MOHICANS is finally available and while James Fenimore Cooper might cavil, this is still a film that teaches a lot about a little-dramatized chapter of history. In some ways it is more intriguing in concept than the source novel. Technical credits are good across the board including remarkable stylistic restraint coming from Mann. Rating: high +2 (-4 to +4).
I would say that I am fairly interested in history in general and in military history in particular. But not so much the War of the Roses. That war just does not strike my imagination. Why not? I think I cannot picture the time. I cannot picture how the war was fought or how people lived. Mostly, I cannot remember off-hand seeing a good historical film set in the War of the Roses. So it is all just history. This morning the same was true of the French and Indian War. I have even recently read James Fenimore Cooper's LAST OF THE MOHICANS, but I just could not picture exactly what the weapons looked like or the style of fighting. But right now I have strong visual images of the French and Indian War. I can picture the cannons and how they were aimed. I am amazed at how remarkably quiet skirmishes in the forests were. Most of my impressions of the French and Indian War I got today. So THE LAST OF THE MOHICANS could be a terrible adaptation of the Cooper novel--and in some senses it really is--and I would still highly recommend the film. And I do.
Cooper's novel makes strange reading today. It has the action and adventure of a Republic serial told in the style of prose fit for an Oxford economic treatise. You want to read fast to find out what happens next, but if you do not struggle you will miss what does happen. Mark Twain wrote a famous essay on how unreadable Cooper is. And there is many times too much plot in the novel to tell the story accurately in a film. Michael Mann (who also directed) and Christopher Crowe wrote a screenplay too close to say it was only inspired by the novel, but not close enough to call an adaptation.
The year is 1757 in what is now upper New York state. The British and the French are fighting for the continent and each is making alliances with local Indians tribes. The British send a small party, led by Major Duncan Heyward (played by Steven Waddington) to take Cora and Alice Munro (played by Madeleine Stowe and Jodhi May) to the fort commanded by their father. As a guide, they send the Mohawk Magua (played by Wes Studi). But Magua is not a Mohawk; he is a hostile Huron who is acting as a French agent. He leads the party into an ambush only to have his plot dashed when the Major, Cora, and Alice are rescued by Hawkeye, Chingachgook, and Uncas (played by Daniel Day-Lewis, Russell Means, and Eric Schweig, respectively). In spite of himself, Hawkeye is attracted to Cora. So is the Major and so starts a conflict totally absent from the novel. A lot of the rest of this film is about people rushing someplace or other through dangerous territory, but under the protection of the valiant Hawkeye and his adoptive father and brother, Chingachgook and Uncas. The action is good; the love triangle is not.
One of my complaints about the often-shown trailer is that we do not see the title character. In fact, in the film the action pulls away from Chingachgook and we do not see much of the character. It is a combination of a casting coup and an endorsement of the script to have Russell Means in the role. This is Means's first film, but it is far from the first time that Means has been before the American public. Means has been a creative activist for Indian rights who has had a consistent policy of attacking symbols rather than people in demonstrations. In 1970 he captured the Mayflower II on Thanksgiving. The following year he occupied Mount Rushmore. In 1973 he occupied the site of the Wounded Knee massacre of Indians by United States soldiers. He is the co-founder of the American Indian Movement (AIM). Means castigated recent films such as DANCES WITH WOLVES, which he found full of cliches and which had all the Indians speaking the feminine language that only women spoke. He has nicknamed THUNDERHEART "South Dakota Burning" for making good guys out of the FBI. To have Means consent to appear in the film and to endorse the script is quite impressive.
When I think of films that Michael Mann has directed I think of flashy but not very intelligent style. I think of THE KEEP and MANHUNTER. (I have never seen an episode of his popular television series MIAMI VICE.) Perhaps his fans will be disappointed but there are no strange camera angles and no unnatural use of color. Many of his scenes come off surprisingly undramatic but also very credible. In one scene there is an ambush of a party of British trooping through a clearing. It could have been played for great dramatic impact. Instead it appears as a sudden commotion that could well have just been confusing for some of the victims, at least at first. The scene is very believable and realistic, if less dramatic than it could be. And that shows a real improvement in Mann's style. This film is amazingly better than anything else I remember seeing from Mann. While these are not the most beautiful landscapes in the world, cinematographer Dante Spinotti plays the natural beauty for as much as is possible. Trevor Jones and Randy Edelman have composed a remarkably good score.
For those familiar with the novel, there are a large number of variations, some very obviously improvements. Cooper had Hawkeye totally loyal to unquestionably good British. In this version, the British appear as bad or worse than the French. They are ready to betray the colonists for their own ends. Hawkeye, very reasonably, does not trust the British in the film and will have more reason not to like them in the course of the story. Heyward and Hawkeye are good friends in the book. But the film has Heyward attracted to Cora instead of to Alice and Hawkeye also loves Cora. In the book you have to read between the lines to see a relationship between Hawkeye and Cora. Certainly Cooper never had the close personal conversations between Hawkeye and Cora. They never talk in the book about how they feel about anything, much less about each other. Also, Magua is very much a one-dimensional character to Cooper and is much more interesting in the film.
So in spite of the fact that Michael Mann's film does not work well as an adaptation of the novel, it is a very good film to watch and from which to learn a little history. It lacks some of the dramatic and historic sweep of this summer's FAR AND AWAY, but it may be the better historical film. I would rate THE LAST OF THE MOHICANS a high +2 on the -4 to +4 scale.
Mark R. Leeper att!mtgzy!leeper<EMAIL_ADDRESS>.
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 plugin creates single-click/run launch 'apps', executables or scripts that bundle all a program's code, libraries and resources into an easily-distributable single directory.
In order to run a Java application, the JVM must be loaded with the correct configuration, namely, the main class, the classpath libraries, any system properties and VM arguments.
The platforms supported by this plugin (Mac OS X, Windows and Linux) offer different mechanisms for achieving this. This plugin integrates these mechanisms, to allow launchers to be generated for all three platforms given some common configuration and some platform-specific configuration.
The plugin also supports the use of JNI code built using the Maven NAR Plugin.
The plugin can create .app structures, and script launchers (like Linux).
For .app structures: A directory structure is created, given the name <Application>.app, with 'application stub', code, libraries, configuration and icon in the correct place. Apple provide a tool to assist with this, but it's not easily invokable from Maven. There are other plugins that can achieve the same ends. See OSX App Bundle for one such plugin.
For script launchers, a directory structure is created with 'bin' and 'lib' directories, containing the launcher script, and dependent libraries, respectively.
On Mac OS X, a popular addition to Java projects is the Quaqua look and feel library. See the Quaqua home page for details. Using this requires the addition of native libraries. The Maven dependency plugin can be used to extract these libraries from your local Maven repository into the correct location in your .app launcher structure.
See Mac OSX Examples to see how to achieve this.
The older Apple Java 1.6 system provided an 'application stub' which must be present in your .app structure. This is invoked when you launch your program from its icon. This only worked in 1.6, and for later versions of Oracle Java, an alternative 'universal' application stub (developed by Tobias Fischer) is provided. This plugin contains both the Apple stub, and the Universal one, switchable via plugin configuration.
The JVM must be loaded by some process. It is possible to do this from a .cmd file, but running the .cmd file leaves an unsightly command prompt window on screen. The Janel open source launcher can alleviate this. The original Janel home page has been discontinued by its author, Timothy Kil, but it has been continued and enhanced by Michael Knigge. See Janel Github project for details of Janel. This plugin contains the Janel console and windows .EXE files, and will copy the relevant one into your launcher structure. For the enhanced Janel, a 32- and 64-bit version is provided.
This plugin can generate launcher structures for each platform under the project's build (target) directory.
The Maven assembly plugin can then be used to package the resulting launchers into archives suitable for shipment. Assembly descriptors are provided in this plugin for simple archive creation:
It's likely that you will need to perform further processing on your launcher archives: On Windows, the launcher is typically built into an installer; On Mac OS X, the launcher is typically shipped on a disk image (.dmg); On Linux, the launcher is typically packaged into a .deb or .rpm archive. This plugin does not perform any of these functions (yet).
For more information about the goals that are available in the plugin, see the goals page.
The project's home page is at: DevZendo.org Cross Platform Launcher Plugin.


Shrewsbury Town in double fitness boost ahead of Bradford FA Cup replay
by Lewis CoxMax O’Leary and Ollie Norburn have recovered from setbacks to give Shrewsbury boss Sam Ricketts a boost ahead of tomorrow’s FA Cup replay at Bradford.
On-loan goalkeeper O’Leary has missed three games with an ankle injury picked up in the League One defeat at Wycombe.
Midfielder Norburn missed the opportunity to make his Grenada debut with a viral infection.
Boss Ricketts confirmed both are back in contention for the Valley Parade tie after the sides drew 1-1 at Montgomery Waters Meadow last time out.
He said: “Max is in contention. He’s not really had a full training session yet. We need to assess him.
“He’s not done everything to be 100 per cent clear to be back in but he’s certainly better than he was last week.
“Ollie had a viral infection which prevented him from making his debut but he should be in contention.”
Defensive duo Aaron Pierre and Omar Beckles, who had permission to return early from Grenada duty, experienced a difficult journey back from the Caribbean that included delays and stop-overs.
Pierre and Beckles returned to training today.


Sign Up to Drive
Name
Description of Your Car
Phone Number
I agree to be a safe driver and abide by all road laws in my state.
I agree to have my background checked.
Cancel


Creating a better version of ourselves every day. Every dayfor us is an opportunity to become better as a company and as people. We learn constantly, improving our professional and personal skills, advance business processes, and never stop.
True Miro team member behaves like this:
• Invests time into learningand development
• Shares knowledge and experience
• Is not afraid of mistakes, understands that they are partof the learning process
• Continuously improves everything: product, team processes, oneself. Not just researches but executes


"""
Conditional Distribution Similarity Statistic
Used to infer causal directions
Author : José A.R. Fonollosa
Ref : Fonollosa, José AR, "Conditional distribution variability measures for causality detection", 2016.
.. MIT License
..
.. Copyright (c) 2018 Diviyan Kalainathan
..
.. Permission is hereby granted, free of charge, to any person obtaining a copy
.. of this software and associated documentation files (the "Software"), to deal
.. in the Software without restriction, including without limitation the rights
.. to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
.. copies of the Software, and to permit persons to whom the Software is
.. furnished to do so, subject to the following conditions:
..
.. The above copyright notice and this permission notice shall be included in all
.. copies or substantial portions of the Software.
..
.. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
.. IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
.. FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
.. AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
.. LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
.. OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
.. SOFTWARE.
"""
import numpy as np
from collections import Counter
from .model import PairwiseModel
import pandas as pd
BINARY = "Binary"
CATEGORICAL = "Categorical"
NUMERICAL = "Numerical"
def count_unique(x):
try:
if type(x) == np.ndarray:
return len(np.unique(x))
else:
return len(set(x))
except TypeError as e:
print(x)
raise e
def numerical(tp):
assert type(tp) is str
return tp == NUMERICAL
def len_discretized_values(x, tx, ffactor, maxdev):
return len(discretized_values(x, tx, ffactor, maxdev))
def discretized_values(x, tx, ffactor, maxdev):
if numerical(tx) and count_unique(x) > (2 * ffactor * maxdev + 1):
vmax = ffactor * maxdev
vmin = -ffactor * maxdev
return range(vmin, vmax + 1)
else:
return sorted(list(set(x)))
def discretized_sequence(x, tx, ffactor, maxdev, norm=True):
if not norm or (numerical(tx) and count_unique(x) > len_discretized_values(x, tx, ffactor, maxdev)):
if norm:
x = (x - np.mean(x)) / np.std(x)
xf = x[abs(x) < maxdev]
x = (x - np.mean(xf)) / np.std(xf)
x = np.round(x * ffactor)
vmax = ffactor * maxdev
vmin = -ffactor * maxdev
x[x > vmax] = vmax
x[x < vmin] = vmin
return x
def discretized_sequences(x, y, ffactor=3, maxdev=3):
return discretized_sequence(x, "Numerical", ffactor, maxdev), discretized_sequence(y, "Numerical", ffactor,
maxdev)
[docs]class CDS(PairwiseModel):
"""
Conditional Distribution Similarity Statistic
Measuring the std. of the rescaled values of y (resp. x) after binning in the x (resp. y) direction.
The lower the std. the more likely the pair to be x->y (resp. y->x).
.. note::
Ref : Fonollosa, José AR, "Conditional distribution variability measures for causality detection", 2016.
"""
def __init__(self, ffactor=2, maxdev=3, minc=12):
super(CDS, self).__init__()
self.ffactor = ffactor
self.maxdev = maxdev
self.minc = minc
[docs] def predict_proba(self, a, b, **kwargs):
""" Infer causal relationships between 2 variables using the CDS statistic
Args:
a (numpy.ndarray): Variable 1
b (numpy.ndarray): Variable 2
Returns:
float: Causation score (Value : 1 if a->b and -1 if b->a)
"""
return self.cds_score(b, a) - self.cds_score(a, b)
[docs] def cds_score(self, x_te, y_te):
""" Computes the cds statistic from variable 1 to variable 2
Args:
x_te (numpy.ndarray): Variable 1
y_te (numpy.ndarray): Variable 2
Returns:
float: CDS fit score
"""
if type(x_te) == np.ndarray:
x_te, y_te = pd.Series(x_te.reshape(-1)), pd.Series(y_te.reshape(-1))
xd, yd = discretized_sequences(x_te, y_te, self.ffactor, self.maxdev)
cx = Counter(xd)
cy = Counter(yd)
yrange = sorted(cy.keys())
ny = len(yrange)
py = np.array([cy[i] for i in yrange], dtype=float)
py = py / py.sum()
pyx = []
for a in cx:
if cx[a] > self.minc:
yx = y_te[xd == a]
# if not numerical(ty):
# cyx = Counter(yx)
# pyxa = np.array([cyx[i] for i in yrange], dtype=float)
# pyxa.sort()
if count_unique(y_te) > len_discretized_values(y_te, "Numerical", self.ffactor, self.maxdev):
yx = (yx - np.mean(yx)) / np.std(y_te)
yx = discretized_sequence(yx, "Numerical", self.ffactor, self.maxdev, norm=False)
cyx = Counter(yx.astype(int))
pyxa = np.array([cyx[i] for i in discretized_values(y_te, "Numerical", self.ffactor, self.maxdev)],
dtype=float)
else:
cyx = Counter(yx)
pyxa = [cyx[i] for i in yrange]
pyxax = np.array([0] * (ny - 1) + pyxa + [0] * (ny - 1), dtype=float)
xcorr = [sum(py * pyxax[i:i + ny]) for i in range(2 * ny - 1)]
imax = xcorr.index(max(xcorr))
pyxa = np.array([0] * (2 * ny - 2 - imax) + pyxa + [0] * imax, dtype=float)
assert pyxa.sum() == cx[a]
pyxa = pyxa / pyxa.sum()
pyx.append(pyxa)
if len(pyx) == 0:
return 0
pyx = np.array(pyx)
pyx = pyx - pyx.mean(axis=0)
return np.std(pyx)


login form
{% if form.errors %}
Your username and password didn't match. Please try again.
{% endif %}
{% csrf_token %}
{{ form.username.label_tag }}
{{ form.username }}
{{ form.password.label_tag }}
{{ form.password }}
Login with FaceBook


| 1 |
Must�Support the XML "Family" of
Standards
As part of the evolving family of XML standards, XSLT 2.0 MUST
support the W3C XML architecture by integrating well with other
standards in the family.
|
| �������� |
1.1 |
Must�Maintain Backwards Compatibility with
XSLT 1.1
Any stylesheet whose behavior is fully defined in XSLT 1.1 and
which generates no errors will produce the same result tree under XSLT
2.0
|
| �������� |
1.2 |
Must�Match Elements with Null Values
A stylesheet SHOULD be able to match elements and attributes whose
value is explicitly null .
Ed. Note: Just matching
@xsi:null="true" would find elements with this
attribute even if the element actually had content like:
<foo xsi:null="true">SomeValue</foo>
or used the xsi:null when the element did not allow its content to
be nullable, both of which are invalid.
|
| �������� |
1.3 |
Should�Allow Included Documents to
"Encapsulate" Local Stylesheets
XSLT 2.0 SHOULD define a mechanism to allow the templates in a
stylesheet associated with a secondary source document, to be
imported and used to format the included fragment, taking precedence
over any applicable templates in the current stylesheet.
| Use Case |
When a MATHML document is included in the
current source document, that MATHML fragment could already
contain its own <?xml-stylesheet?> indicating
appropriate templates to properly style the Math.
|
|
| �������� |
1.4 |
Could�Support Accessing Infoset Items for
XML Declaration
A stylesheet COULD be able to access information like the version
and encoding from the XML declaration of a document.
| Use Case |
A stylesheet should be able to set the output
encoding to use the same encoding as the input document.
|
|
| �������� |
1.5 |
Could�Provide QName Aware String
Functions
Users manipulating documents (e.g. stylesheets, schemas) that have
QName-valued element or attribute content need functions that take a
string containing a QName as their argument, convert it to an expanded
name using either the namespace declarations in scope at that point in
the stylesheet, or the namespace declarations in scope for a specific
source node, and return properties of the expanded name such as its
namespace URI and local name.
|
| �������� |
1.6 |
Could�Enable Constructing a Namespace with
Computed Name
Provide an <xsl:namespace> analog to
<xsl:element> for constructing a namespace node
with a computed prefix and URI.
|
| �������� |
1.7 |
Could�Simplify Resolving Prefix Conflicts
in QName-Valued Attributes
XSLT 2.0 COULD simplify the renaming of conflicting namespace
prefixes in result tree fragments, particularly for attributes
declared in a schema as being QNames. Once the processor knows an
attribute value is a QName, an XSLT processor should be able to rename
prefixes and generate namespace declarations to preserve the semantics
of that attribute value, just as it does for attribute names.
|
| �������� |
1.8 |
Could�Support XHTML Output Method
Complementing the existing output methods for html ,
xml , and text , an xhtml output method could
be provided to simplify transformations which target XHTML output.
|
| 2 |
Must�Improve Ease of Use
XSLT 2.0 MUST address frequently requested enhancements to make
using XPath even more straightfoward for handling common use
cases.
|
| �������� |
2.1 |
Must�Allow Matching on Default Namespace
Without Explicit Prefix
Many users stumble trying to match an element with a default
namespace. They expect to be able to do something like:
<xsl:stylesheet version="1.0"
�������� xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
�������� xmlns="urn:myuri">
��
��<xsl:template match="foo">
thinking that leaving off the prefix from the foo
element name, that it will match <foo> elements in
the default namespace with the URI of urn:myuri . Instead,
they are required to assign a non-null prefix name to their namespace
URI and then match on "someprefix:foo " instead, which has
proven to be far from obvious. XSLT 2.0 SHOULD provide an explicit way
to handle this scenario to avoid further user confusion.
|
| �������� |
2.2 |
Must�Add Date Formatting Functions
One of the more frequent requests from XSLT 1.0 users is the
ability to format date information with similar control to XSLT's
format-number() . XML Schema introduces several kinds of
date and time datatypes which will further increase the demand for
date formatting during transformations. Functionality similar to that
provided by java.text.SimpleDateFormat.
A date analog of XSLT's named xsl:decimal-format may be
required to handle locale-specific date formatting issues.
| Use Case |
Given an XML element like: <Period
start="2000-05-07" end="2000-05-13"/>
Format it as: Invoice: 7 May 2000 - 13 May
2000
Given the same element above, format it according to
the current locale as:
Fattura: 7 Maggio 2000 - 13 Maggio 2000
|
|
| �������� |
2.3 |
Must�Simplify Accessing Id's and Key's in
Other Documents
Currently it is cumbersome to lookup nodes by id() or
key() in documents other than the source document. Users
must first use an xsl:for-each instruction, selecting the
desired document() to make it the current node, then
relative XPath expressions within the scope of the
xsl:for-each can refer to id() or
key() as desired.
|
| �������� |
2.4 |
Should�Provide Function to Absolutize
Relative URIs
There SHOULD be a way in XSLT 2.0 to create an absolute URI. The
functionality should allow passing a node-set and return a string
value representing the absolute URI resolved with respect to the base
URI of the current node.
|
| �������� |
2.5 |
Should�Include Unparsed Text from an
External Resource
Frequently stylesheets must import text from external resources.
Today users have to resort to extension functions to accomplish this
because XSLT 1.0 only provides the document() function
which, while useful, can only read external resources that are
well-formed XML documents.
| Use Case |
Given an XML document like:

��<para>The code for the example looks like
this:</para>
��<example>
����<external-file href="ParseXML.java"/>
��</example>

Format the section and include the source of the sample
code from the external file in the output.
|
|
| �������� |
2.6 |
Should�Allow Authoring Extension Functions
in XSLT
As part of the XSLT 1.1 work done on extension functions, a
proposal to author XSLT extension functions in XSLT itself was
deferred for reconsideration in XSLT 2.0. This would allow the
functions in an extension namespace to be implemented in "pure" XSLT,
without resulting to external programming languages.
|
| �������� |
2.7 |
Should�Output Character Entity References
Instead of Numeric Character Entities
Users have frequently requested the ability to have the output of
their transformation use (named) character references instead of the
numeric character entity. The ability to control this preference as
the level of the whole document is sufficient. For example, rather
than seeing   in the output, the user could
request to see the equivalent instead.
|
| �������� |
2.8 |
Should�Construct Entity Reference by
Name
Analogous to the ability to create elements and attributes, users
have expressed a desire to construct named entity references.
Ed. Note: Does this require a change to the data
model?
|
| �������� |
2.9 |
Should�Support for Unicode String
Normalization
For reliable string comparison of Unicode strings, users need the
ability to apply Unicode normalization before comparing the
strings.
|
| �������� |
2.10 |
Should�Standardize Extension Element
Language Bindings
XSLT 1.1 undertook the standarization of language bindings for XSLT
extension functions. For XSLT 2.0, analogous bindings SHOULD be
provided for extension elements.
|
| �������� |
2.11 |
Could�Improve Efficiency of
Transformations on Large Documents
Many useful transformations take place on large documents
consisting of thousands of repeating "sub-documents". Today
transformations over these documents are impractical due to the need
to have the entire source tree in memory. Enabling "progressive"
transformations, where the processor is able to produce progressively
more output as more input is received, is tantamount to avoiding the
need for XSLT processors to have random access to the entire source
document. This might be accomplished by:
- Identifying a core subset of XPath that does not require random
access to the source tree, or
- Consider a "transform all subtrees" mode where the stylesheet
says, "Apply the transformation implied by this stylesheet to each
node that matches
XXX , considered as the root of a
separate tree, and copy all the results of these
mini-transformations as separate subtrees on to the final result
tree."
| Use Case |
Transforming an XML document representing the
daily closing prices of NASDAQ stocks for 1999 like the
example below (over 1.3 millon
<ClosingQuote> sub-elements) to produce a
comma-separated list of Ticker, Date, and Closing Price.
<YearOfNasdaqCloses Year="1999"
TotalSecurities="5207">
��<ClosingQuote Ticker="AAABB">
����<Date>01/01/1999</Date>
����<Price>6.25</Price>
����<Percent>0.5</Percent>
��</ClosingQuote>
��
��<ClosingQuote Ticker="ZVXI">
����<Date>12/31/1999</Date>
����<Price>16.10</Price>
����<Percent>-1.05</Percent>
��</ClosingQuote>
</YearOfNasdaqCloses>
|
|
| �������� |
2.12 |
Could�Support for Reverse IDREF
attributes
Given a particular value of an ID , produce a list of
all elements that have an IDREF or IDREFS
attribute which refers to this ID.
Ed. Note: This functionality can be accomplished using the
current <xsl:key> and key()
mechanism.
|
| �������� |
2.13 |
Could�Support for Case-Insensitive
Comparisons
XSLT 2.0 could expand its comparison functionality to include
support for case-insensitive string comparison.
|
| �������� |
2.14 |
Could�Support Lexigraphic String
Comparisons
We don't let users compare strings like $x >
'a' .
Ed. Note: i18n issues.
|
| �������� |
2.15 |
Could�Allow Comparing Nodes Based on
Document Order
Support the ability to test whether one node comes before another
in document order.
Ed. Note: Need a Use Case for this.
|
| �������� |
2.16 |
Could�Improve Support for Unparsed
Entities
In XSLT 1.0 there is an asymmetry in support for unparsed entities.
They can be handled on input but not on output. In particular, there
is no way to do an identity transformation that preserves them. At a
minimum we need the ability to retrieve the Public ID of an unparsed
entity.
|
| �������� |
2.17 |
Could�Allow Processing a Node with the
"Next Best Matching" Template
In the construction of large stylesheets for complex documents, it
is often necessary to construct templates that implement special
behavior for a particular instance of an element, and then apply the
normal styling for that element. Currently this is not possible
because <xsl:apply-templates/> specifies that for
any given node only a single template will be selected and
instantiated.
Currently the processor determines a list of matching templates and
then discards all but the one with the highest priority. In order to
support this requirement, the processor would retain the list of
matching templates sorted in priority order. A new instruction, for
example <xsl:next-match/> , in a template would
simply trigger the next template in the list of matching templates.
This "next best match" recursion naturally bottoms out at the builtin
template which can be seen as the lowest priority matching template
for every match pattern.
| Use Case |
Consider a large, complex stylesheet for a
particular document type. In order to support a new
application, the schema designer for that document type adds a
new global attribute, that is an attribute allowed on every
element in the schema. For example, consider the addition of a
global attribute named diff for marking changes
made between one version of a document and another. You must
now augment your stylesheet to support this new behavior.
One would like to add a single new template, or a small
number of templates, that would implement the new
functionality for the entire doctype. Something like this:
<xsl:template match="*[@diff='new']">
��

����
��

</xsl:template>
<xsl:template match="para">
��

����<xsl:apply-templates/>
��

</xsl:template>
When passed a document that contains
...
 , it would produce:

...

|
|
| �������� |
2.18 |
Could�Make Coercions Symmetric By Allowing
Scalar to Nodeset Conversion
Presently, no datatype can be coerced or cast to a node-set. By
allowing a string value to convert to a node-set, some user "gotchas"
could be avoided due.
|
| 3 |
Must�Support XML Schema
XML Schema:
Structures and XML
Schema: Datatypes enable users to define and use both simple and
structured types and associate them to elements and attributes in a
schema. XSLT 2.0 MUST provide support for the common operations
needed for matching and construction of transformed documents based on
a source document containing these typed elements and attributes.
|
| �������� |
3.1 |
Must�Simplify Constructing and Copying
Typed Content
It MUST be possible to construct XML Schema-typed elements and
attributes. In addition, when copying an element or an attribute to
the result, it should be possible to preserve the type during the
process.
Ed. Note: Use Case needs work.
| Use Case |
-
<href
xsi:type="urireference">foo.xml</href>
-
<href xsl:type="urireference"><xsl:value-of
select="$foo"/></href>
-
<href><xsl:typed-value-of
select="$foo"/></href>
|
|
| �������� |
3.2 |
Must�Support Sorting Nodes Based on XML
Schema Type
XSLT 1.0 supports sorting based on string -valued and
number -valued expressions. XML Schema: Datatypes
introduces new scalar types (for example, date ) with
well-known sort orders. It MUST be possible to sort based on these
extended set of scalar data types. Since XML Schema: Datatypes
does not define an ordering for complex types, this sorting support
should only be considered for simple types.
Ed. Note: Should be consistent with whatever we define for
the matrix of conversion and comparisons.
|
| �������� |
3.3 |
Could�Support Scientific Notation in
Number Formatting
Several users have requested the ability to have the existing
format-number() function extended to format numbers using
Scientific Notation.
|
| �������� |
3.4 |
Could�Provide Ability to Detect Whether
"Rich" Schema Information is Available
A stylesheet that requires XML Schema type-related functionality
COULD be able to test whether a "rich" Post-Schema-Validated Infoset
is available from the XML Schema processor, so that the stylesheet can
provide fallback behavior or choose to exit with <xsl:message
abort="yes"/> .
|
| 4 |
Must�Simplify Grouping
Grouping is complicated in XSLT 1.0. It MUST be possible for users
to group nodes in a document based on
- common string-values
- common names
- common values for any other expression
In addition XSLT must allow grouping based on sequential position,
e.g. selecting groups of adjacent
 elements.
Ideally it should also make it easier to do fixed-size grouping as
well, e.g. groups of three adjacent nodes, for laying out data in
multiple columns. For each group of nodes identified, it must be
possible to instantiate a template for the group. Grouping must be
"nestable" to multiple levels so that groups of distinct nodes can be
identified, then from among the distinct groups selected, further
sub-grouping of distinct node in the current group can be done.
Often users express this requirement in different words, asking for
a way to easily select the distinct values of an XPath expression
relative to a nodeset. For example, many users using keys have
requested a function like distinct-keys(' keyname
') to return a node-set containing, for each value of the
named key that is present in the current document, the first node in
document order that has that key value. Others have suggested adding a
select-distinct=" XpathExpression "
to places where XSLT currently allows a select
attribute.
| Use Case |
Group by common values, groups unsorted, with
group totals
Given XML document:
<cities>
��<city name="milan"��country="italy"��
pop="5"/>
��<city
name="paris"��country="france"��pop="7"/>
��<city name="munich" country="germany"
pop="4"/>
��<city name="lyon"��
country="france"��pop="2"/>
��<city name="venice" country="italy"��
pop="1"/>
</cities>
Produce a 3-column table listing each distinct country
in the first column, an alphabetical list of the city
names for each country in the 2nd column, and the sum of
the population for the cities in each country in the third
column:

��

����Country
����City List
����Population
��

��

����italy
����milan, venice
����6
��

��

����france
����lyon, paris
����9
��
��
��

����germany
����munich
����4
��
��

Group by common values, sorting the groups, with
group totals
Given same XML document as in use case 1 above, produce
a 3-column table listing each distinct country in the
first column (sorted in alphabetical order), an
alphabetical list of the city names for each country in
the 2nd column, and the sum of the population for the
cities in each country in the third column:

��

����Country
����City List
����Population
��

��

����france
����lyon, paris
����9
��
��
��

����germany
����munich
����4
��
��
��

����italy
����milan, venice
����6
��

Group by common values, sorting the groups by a
group total
Given same XML document as in use case 1 above, produce
a 3-column table listing each distinct country in the
first column (sorted in order of decreasing total
population), a list of the city names for each country in
the 2nd column (sorted in order of decreasing population),
and the sum of the population for the cities in each
country in the third column:

��

����Country
����City List
����Population
��

��

����france
����paris, lyon
����9
��
��
��

����italy
����milan, venice
����6
��

��

����germany
����munich
����4
��

Group by result of an expression (e.g. initial
letter, with a count for each group)
Given the input XML document above, produce the table
below which groups by the initial letter of the city name,
sorts these first-letters alphabetically, then produces a
list of cities whose names begin with that letter. The
heading contains a count of entries:

L (1)

lyon

M
(2)

milan

munich

P (1)

paris

V (1)

venice

Group by patterns of elements in a
sequence
Given the input:

��
heading1

��
para1

��
para2

��
heading2

��
para3

��
para4

��
para5

Produce the following output:
<chapter>
��

����<para>para1</para>
����<para>para2</para>
��

��

����<para>para3</para>
����<para>para4</para>
����<para>para5</para>
��

</chapter>
Produce Hierarchical Nested Output from Flat
Structure
Given a source document like:
<doc>
��<group1>
����<tag>value</tag>
��</group1>
��<group2>
����<tag>value</tag>
��</group2>
��<group2>
����<tag>value</tag>
��</group2>
��<group3>
����<tag>value</tag>
��</group3>
</doc>
produce the output:
<doc>
��<group1>
����<tag>value</tag>
����<group2>
������<tag>value</tag>
����</group2>
����<group2>
������<tag>value</tag>
������<group3>
��������<tag>value</tag>
������</group3>
����</group2>
��</group1>
</doc>
Formatting HTML Term Definition Lists (Case
1)
Given a source document like:

��
��
One
��
��
One Def

��
Two
��
��
Two Def

��
Three
��

produce the output:

��
One - One
Def

��
Two - Two
Def

��
Three - (No
definition provided)

Formatting HTML Term Definition Lists (Case
2)
A slightly more compliated version of the HTML term
definition list involved multiple terms with a single
definition or multiple definitions for a single term.
Given the source

��
One

��
Two

��
One and Two Def

produce the output

��
One, Two - One and
Two Def

For the other varation, given the source:

��
One

��
One Def

��
Another One Def

produce the output:

��

����One
����

������
One Def

������
Another One Def

����

��

Transform Inline <para> Elements to Block
<para> Elements
Transform from a DTD that allows para elements to have
nested block-level elements to a DTD that requires para
elements to have only inline elements, e.g. transform:

Do not:

talk,

eat, or

use your mobile telephone

while you are in the cinema.

into:

Do not:

talk,

eat, or

use your mobile telephone

while you are in the cinema.

Arrange into Fixed-Sized Groups
(Across/Down)
Given the input from use case number 1 above, produce a
two-column list of all city names, sorted alphabetically,
in "Across/Down" format. The result should correctly
format the "left over" cells when the number of items is
not a multiple of the number of items in the group.

��
��
lyon	milan

��
munich	paris

��
venice

Arrange into Fixed-Sized Groups
(Down/Across)
Given the input from use case number 1 above, produce a
two-column list of all city names, sorted alphabetically,
in "Down/Across" format. The result should correctly
format the "left over" cells when the number of items is
not a multiple of the number of items in the group.

��
��
lyon	paris

��
milan	venice

��
munich

Multi-level Grouping
Given the XML list of software bugs assigned to
developers on different teams...
<bugs>
��<bug dev="ace" team="ui">
����<desc>Border shows white when it should be
grey</desc>
��</bug>
��<bug dev="tom" team="core">
����<desc>Incorrectly handling nulls on
entry</desc>
��</bug>
��<bug dev="gary" team="ui">
����<desc>Preferences dialog has two Cancel
buttons</desc>
��</bug>
��<bug dev="ace" team="ui">
����<desc>Drag and drop cursor never changes
back</desc>
��</bug>
��<bug dev="tim" team="core">
����<desc>Infinite loop in validation
code</desc>
��</bug>
��<bug dev="gary" team="ui">
����<desc>Resizing dialog doesn't resize text
box</desc>
��</bug>
��<bug dev="ace" team="ui">
����<desc>German text is truncated</desc>
��</bug>
��<bug dev="tim" team="core">
����<desc>Data inserted twice</desc>
��</bug>
</bugs>
produce an HTML page that includes:
- The total number of open bugs in the title
- A column for each team of developers, with a
per-team bug count. The teams should be ordered left
to right by descreasing number of open bugs assigned
to the team.
- A vertical list (separated by
 tags) of
developers on each team, with their bug count.
Developers should be listed top down in order of
descreasing individual bug count.
The result is a nested, grouped output giving
development managers a bird's-eye view of which teams and
which developers are in the most "bug trouble":

��
����
Bug Summary (8)

����

������

������ ui (5)
���� ��core (3)
������

������

���� ��
���� ����ace (3)

���� ����gary (2)
���� ��
���� ��
���� ����tim (2)

���� ����tom (1)
���� ��
������

����

��

List all the different element names in a document,
and for each one list all the attributes used, and for
each attribute list the distinct values used in the
document. For example, given the document:
<foo baz="Q">
��<bar baz="3" bop="T"/>
��<foo baz="1">
����<bar bop="S" bip="4" baz="5"/>
��</foo>
</foo>
Produce the result:
<inventory>
��<element name="bar">
����<attribute name="baz">
������<value>3</value>
������<value>5</value>
����</attribute>
����<attribute name="bip">
������<value>4</value>
����</attribute>
����<attribute name="bop">
������<value>S</value>
������<value>T</value>
����</attribute>
��</element>
��<element name="foo">
����<attribute name="baz">
������<value>1</value>
������<value>Q</value>
����</attribute>
��</element>
</inventory>
|
|


FlightSurety
Contract functions
Authorize caller
Check contract balance
Airline Registration
Airline address
Register
Use owner or registered airline account
Airline funding
Fund
Use registered airline account to fund airline
Insurance
Airline
Flight
Insurance amount (0.1-1 ether)
Buy insurance
(Required: airline, flight, amount)
Check credited money
(Required: airline, flight)
Withdraw insurance money
(Required: airline, flight)
Flight status
Airline
Flight
Submit to Oracles


{% extends "layout.html" %} {% block body %} {% if user.is_authenticated %}
To fully explore the site, register here
If you have already registered, please Login
{% endif %}
This site is built with Django and React.
It is the developer's playground for experimentation.
You are welcome to access
the source code


|
|
def | MIME_TYPE_Name |
| |
|
def | __init__ |
| |
|
def | mime_type |
| |
|
def | set_mime_type |
| |
|
def | clear_mime_type |
| |
|
def | has_mime_type |
| |
|
def | quality |
| |
|
def | set_quality |
| |
|
def | clear_quality |
| |
|
def | has_quality |
| |
|
def | MergeFrom |
| |
|
def | Equals |
| |
|
def | IsInitialized |
| |
|
def | ByteSize |
| |
|
def | ByteSizePartial |
| |
|
def | Clear |
| |
|
def | OutputUnchecked |
| |
|
def | OutputPartial |
| |
|
def | TryMerge |
| |
|
def | __str__ |
| |
|
|
| has_mime_type_ |
| |
|
| mime_type_ |
| |
|
| has_quality_ |
| |
|
| quality_ |
| |
|
|
int | PNG = 0 |
| |
|
int | JPEG = 1 |
| |
|
int | WEBP = 2 |
| |
|
tuple | MIME_TYPE_Name = classmethod(MIME_TYPE_Name) |
| |
|
int | has_mime_type_ = 0 |
| |
|
int | mime_type_ = 0 |
| |
|
int | has_quality_ = 0 |
| |
|
int | quality_ = 0 |
| |
|
int | kmime_type = 1 |
| |
|
int | kquality = 2 |
| |
The documentation for this class was generated from the following file:
- code/googleappengine-read-only/python/google/appengine/api/images/images_service_pb.py


|
General
Sample Code |
Tip Server
This is the script that is currently driving The BeOS Tip Server. Also included are 40 random tip files in the data folder so you can generate a mini-version of the site. Structurally, it isn't much different from the other scripts -- an index page with sub-pages. However, this index page groups links by category, rather than just running them down. It also creates a "special" group of links at the top of the page for recent entries -- these are flagged by a "New" attribute that carries a yes or no value. Toggle that attribute to "n" from Tracker, and it won't show up in the recent list next time the site is generated. This is also the only script that uses queries to gather data, rather than straight directory crawls. Queries allow for much more interesting results, but have some gotchas. You must, for instance, take care to filter out any TrackerBase files that are in the Trash. You also have to make sure to specify the project name in the "project" attribute so your queries don't accidentally turn up TrackerBase files from other projects. You'll notice that the top of the script has a long list of if/then statements relating to banner ads. If the AdKey attribute equals X, then the associated graphic and URL are... . AdGraphic and AdURL were initially attributes of their own, but Tracker has no mechanism for linking one attribute to another, as you might do in a commercial database. Linking them this way simplifies administration and prevents foul-ups. As with the news site, URLs and e-mail addresses are only created on tip pages when those attributes are not blank.
|


The canvas needs to be cleared before importing a new molecule.
Click on a bond to see or change its bond order
Current bond order:
Change to:
Click on an atom to change its element
Current element:
Change to:
Click on an atom to change its position (angle of bonding)
NOTE: It can be only bonded to 1 other atom.
Current position:
Click on the atom you want to erase.
NOTE: It can be only bonded to 1 other atom.
Atom to be erased:
Click on 1 atom as a fixed vertex, or a bond as a fixed side to build the ring!
Or...


Yesterday's item A Series Of Unfortunate Cows had a homework assignment attached. This is just one initiative in the development of a new Interactive Hooting Yard Project. Reader Mark Williams had the good grace to send his homework in, and I reprint it below to give the rest of you some idea of the standards we are looking for.
Note to Mark : Your handwriting is lopsided. In future, please ensure that the express turbomotorcycle courier arrives at Haemoglobin Towers before midnight.
Here is Mark's homework:
1. A cow is not wise, thus on that premise cows will inadvertently engender unfortunate situations as proved by the four classic unfortunate situations that you have written about. So, ultimately I would require the best possible quality of life, that is, the least amount of suffering. Therefore I would not want to get myself into unfortunate situations. The inevitable swift painless death of a cow standing on some railway tracks is my choice. This is dependent on the scruples of the helm man…hmmmm…crikey, there is a possibility of an unfortunate painful death resulting from a partial maiming caused by the driver braking and thus not fully killing the cow due to the reduced speed. I am confused now.
2. I would not laugh, instead, I would bury my head in the ground. However, due to the unfortunate nature of a cow I would, no doubt, stick my head in a field full of Caper Spurge otherwise known as stinking hellebore. The Dumville family used this foul smelling plant to rid moles from the English countryside. Fascists.
3.
4. On the assumption that an eldritch soul-transfer had taken place then it is likely that this soul would have the same intention as me in the answer to question one. Thus, I would mow the cow down with my train at the highest speed possible.
I hope this is not too late.
* NOTE : Mark appears to think that cows are tiny. They are not. One wonders if he has got a grip of the subject at all.


| I l@ve RuBoard |
Basics, import. This one is simpler than you may think. When you're done, your file and interaction should look close to the following code; remember that Python can read a whole file into a string or lines list, and the len built-in returns the length of strings and lists:
% cat mymod.py def countLines(name): file = open(name, 'r') return len(file.readlines()) def countChars(name): return len(open(name, 'r').read()) def test(name): # or pass file object return countLines(name), countChars(name) # or return a dictionary % python >>> import mymod >>> mymod.test('mymod.py') (10, 291)
On Unix, you can verify your output with a wc command. Incidentally, to do the "ambitious" part (passing in a file object, so you only open the file once), you'll probably need to use the seek method of the built-in file object. We didn't cover it in the text, but it works just like C's fseek call (and calls it behind the scenes); seek resets the current position in the file to an offset passed in. To rewind to the start of a file without closing and reopening, call file.seek (0 ); the file read methods all pick up at the current position in the file, so you need to rewind to reread. Here's what this tweak would look like:
% cat mymod2.py def countLines(file): file.seek(0) # rewind to start of file return len(file.readlines()) def countChars(file): file.seek(0) # ditto (rewind if needed) return len(file.read()) def test(name): file = open(name, 'r') # pass file object return countLines(file), countChars(file) # only open file once >>> import mymod2 >>> mymod2.test("mymod2.py") (11, 392)
from/from*. Here's the from* bit; replace * with countChars to do the rest:
% python >>> from mymod import * >>> countChars("mymod.py") 291
__main__. If you code it properly, it works in either mode (program run or module import):
% cat mymod.py def countLines(name): file = open(name, 'r') return len(file.readlines()) def countChars(name): return len(open(name, 'r').read()) def test(name): # or pass file object return countLines(name), countChars(name) # or return a dictionary if __name__ == '__main__': print test('mymod.py') % python mymod.py (13, 346)
Nested imports. Our solution for this appears below:
% cat myclient.py from mymod import countLines from mymod import countChars print countLines('mymod.py'), countChars('mymod.py') % python myclient.py 13 346
As for the rest of this one: mymod 's functions are accessible (that is, importable) from the top level of myclient, since from assigns just to names in the importer (it's as if mymod 's defs appeared in myclient). If myclient used import, you'd need to use a path to get to the functions in mymod from myclient (for instance, myclient.mymod.countLines). In fact, you can define collector modules that import all the names from other modules, so they're available in a single convenience module. Using the following code, you wind up with three different copies of name somename: mod1.somename, collector.somename, and _ _main__.somename; all three share the same integer object initially.
% cat mod1.py somename = 42 % cat collector.py from mod1 import * # collect lots of names here from mod2 import * # from assigns to my names from mod3 import * >>> from collector import somename
Reload. This exercise just asks you to experiment with changing the changer.py example in the book, so there's not much for us to show here. If you had some fun with it, give yourself extra points.
Circular imports. The short story is that importing recur2 first works, because the recursive import then happens at the import in recur1, not at a from in recur2. The long story goes like this: importing recur2 first works, because the recursive import from recur1 to recur2 fetches recur2 as a whole, instead of getting specific names. recur2 is incomplete when imported from recur1, but because it uses import instead of from, you're safe: Python finds and returns the already created recur2 module object and continues to run the rest of recur1 without a glitch. When the recur2 import resumes, the second from finds name Y in recur1 (it's been run completely), so no error is reported. Running a file as a script is not the same as importing it as a module; these cases are the same as running the first import or from in the script interactively. For instance, running recur1 as a script is the same as importing recur2 interactively, since recur2 is the first module imported in recur1. (E-I-E-I-O!)
| I l@ve RuBoard |


Verify that the sizeof() function is used to determine sizes of objects and types instead of hardcoding memory sizes of objects.
Different platforms may represent the same data structures differently in memory. Using hardcoded values for object memory sizes may result in errors when performing memory management operations.
Identify all code where it is necessary to calculate sizes of objects in memory. Verify that the sizeof() function is used to determine sizes of objects in memory.
Use sizeof() to measure sizes of objects in memory.


xmt = torch.mean(target, 1, keepdim=True) - target
xct = torch.matmul(torch.transpose(xmt, 0, 1), xmt)
// frobenius norm between source and target
loss = (xc - xct).pow(2).sum().sqrt()
loss = loss/(4*d*d)
return loss
xct = xmt.t() @ xmt
// frobenius norm between source and target
loss = torch.mean(torch.mul((xc - xct), (xc - xct)))
loss = loss/(4*d*d)
return loss