{% extends "../../layout.html" %} {% block sectionClasses %}plugins hasBreadCrumb plugins-spincast-openapi-bottomup{% endblock %} {% block meta_title %}Plugins - Spincast OpenAPI bottom up{% endblock %} {% block meta_description %}Spincast OpenAPI bottom up plugin - OpenAPI / Swagger specifications file generation from the applicatin code{% endblock %} {% block scripts %} {% endblock %} {% block body %}
This plugin allows you to generate
OpenAPI / Swagger specifications
(currently 3.0 compatible) for your Spincast REST API, as JSON
or YAML
.
It automatically uses information from your routes and provides tools for you to complete/tweak the specifications to expose as the documentation for your API.
OpenAPI is one of the most popular ways of documenting a
REST API
. It is a specification
around which many tools and libraries have been created. The
most known of those tools are probably the Swagger Editor and
the Swagger UI.
The OpenAPI ecosystem may be a little bit confusing at first because there are a lot of different ways of using the specification. Some libraries will provide a way of generating application code (controllers, validators, etc.) given an existing specifications file... This is called the "top-down" approach (or "API first" approach). Others libraries will do the opposite: they will generate the specifications file from your application code... This is called the "bottom-up" approach (or "code first" approach) and is the one used by this plugin.
Whatever approach you use, the most important part of an OpenAPI implementation
is to be able to provide the specifications to the consumers of your API, as JSON
or as YAML
.
You could send those specifications by email to developers in charge of developing a client using your API
(for example as a "specs.yaml
" file), but most of the time you expose
the specifications as an HTTP endpoint
so they can be easily accessed!
Some frameworks try to develop an OpenAPI implementation using a custom parser and custom code to generate the final specifications. This is not a trivial task since the OpenAPI specification contains many details! It can be easy to forget something or to generate something invalid. Also, keeping up-to-date with new versions of the specification may be challenging...
This is why we decided to develop this plugin in a way that code from the official reference implementation can be reused as much as possible. By doing so, we make sure we use battle tested and well-maintained code. We also make sure it is super easy to upgrade to a new version of the specification in the future.
The problem with the official Java implementation is that it is made
specifically for JAX-RS
based applications and Spincast is not!
Spincast is indeed more flexible: it allows you to define your routes as you want (inline if required),
without any annotations. Also, routes can be dynamically added to the Router, they don't
necessarily have to be defined in controllers using special annotations.
So, how can we reuse the official code?
This plugin automagically generate JAX-RS classes from the Spincast code. It does this using Byte Buddy. With those generated dummy classes, it is possible to reuse the code from the officialswagger-jaxrs2
library,
without any change.
In other words, the job of this plugin is only to generate pseudo JAX-RS
classes... Everything else
is done by the official library: the parsing and the specifications generation.
To help you specify the information to include in the resulting specifications, this plugin
also provides a way to reuse another official part of OpenAPI/Swagger: the
Swagger annotations.
As you'll see in the Documenting the routes section, the most important annotation
you can use is @Operation.
If you don't provide any explicit information about your routes, using annotations or using plain YAML, the plugin will still be able to generate basic specifications. You manually add the extra pieces of information required for the final specifications to be completed.
First of all, the specifications resulting from collecting the various pieces of information about your API
are accessible as an
OpenAPI Java object. You access this
object via the SpincastOpenApiManager#getOpenApi()
method.
It is this object that will be converted to generate the final specifications as JSON
or as YAML
!
You generate the specifications:
JSON
, using the getOpenApiAsJson() method
YAML
, using the getOpenApiAsYaml() method
As you can see, the SpincastOpenApiManager component is at the very core of this plugin. You can inject it anywhere you need to interact with it.
When your application is properly documented (we'll learn how to do this in the next section), it is often
desirable to serve the resulting specifications as an HTTP endpoint
so they can be accessed
easily.
You create such endpoint as any other one. If your specifications won't change at runtime, using a Dynamic Resource is the way to go! Let's see how you can do this:
{% verbatim %}
@Inject protected SpincastOpenApiManager spincastOpenApiManager; // As JSON router.file("/specifications.json") .pathRelative("/generated/specifications.json") .handle((context) -> { context.response().sendJson(spincastOpenApiManager.getOpenApiAsJson()); }); // As YAML router.file("/specifications.yaml") .pathRelative("/generated/specifications.yaml") .handle((context) -> { context.response().sendCharacters(spincastOpenApiManager.getOpenApiAsYaml(), "text/yaml"); });
If you don't add any explicit information, the generated specifications will still be available but will be basic. They will contain information about your routes: their HTTP methods, their paths, their consumes content-types and their path parameters.
To add more information, you can use the .specs(...) method available when you define the routes. You pass to this method the extra information using the official annotations. Read the official documentation to learn more about those annotations.
Here's a step-by-step guide on how to add the annotation(s)... You first start by using the .specs(...)
method:
{% verbatim %}
router.POST("/books/${bookId:<AN+>}") .specs(...) .handle(booksController::get);
In that method, you create an anonymous class based on the SpecsObject
interface. This
acts as a container for the annotations so they can later be retrieved by Spincast:
{% verbatim %}
router.POST("/books/${bookId:<AN+>}") .specs(new SpecsObject() {}) .handle(booksController::get);
You annotate this anonymous class with @Specs: {% verbatim %}
router.POST("/books/${bookId:<AN+>}") .specs(@Specs(...) new SpecsObject() {}) .handle(booksController::get);
And you can finally add a @Operation,
@Consumes,
and/or @Produces
annotations inside @Specs
:
{% verbatim %}
router.POST("/books/${bookId:<AN+>}") .specs(new @Specs(consumes = @Consumes({"application/xml"}), produces = @Produces({"application/json"}), value = @Operation(summary = "My summary", description = "My description" )) SpecsObject() {}) .handle(booksController::get);
This may seem a little bit complicated at first but this is what allows the reuse of the official, well supported, Swagger reference implementation code!
Here's another example: {% verbatim %}
router.POST("/users") .specs(new @Specs(@Operation( parameters = { @Parameter(name = "full", in = ParameterIn.QUERY, schema = @Schema(description = "Return all informations?")), })) SpecsObject() {}) .handle(booksController::get);
Explanation :
full
" querystring parameter.
If you prefer that to annotations, you can also document a route using plain YAML: {% verbatim %}
router.POST("/books/${bookId:<AN+>}") .specs("post:\n" + " operationId: getBook\n" + " responses:\n" + " default:\n" + " description: default response\n" + " content:\n" + " application/json: {}\n") .handle(booksController::get);
The YAML specifications you provide must start by the HTTP methods (you can provide more than one!). And you must follow the syntax required by the OpenAPI specification.
Note that the indentation in your YAML content IS important and an exception will be thrown if it is invalid.
You may want to prevent some of your routes to be added to the final specifications. To do so, you can call specsIgnore() on those routes: {% verbatim %}
router.POST("/books/${bookId:<AN+>}") .specsIgnore() .handle(booksController::get);
If you need to ignore routes that have been added by a third-party plugin, you can do so by using their id (if they have one), or their HTTP method and path otherwise: {% verbatim %}
@Inject protected SpincastOpenApiManager spincastOpenApiManager; // Ignoring a route by its id: spincastOpenApiManager.ignoreRoutesByIds("someRouteId"); // Ignoring a route by its HTTP method and path: spincastOpenApiManager.ignoreRouteUsingHttpMethodAndPath(HttpMethod.POST, "/some-path");
Using setOpenApiBase(...)
on the SpincastOpenApiManager
component, you can provide any OpenAPI information you want to be part of
the generated specifications. You do this by creating a custom
OpenAPI object:
{% verbatim %}
OpenAPI openApiBase = new OpenAPI(); Info info = new Info().title("The name of your REST API") .description("A description of your API...") .termsOfService("https://example.com/tos"); openApiBase.info(info); getSpincastOpenApiManager().setOpenApiBase(openApiBase);
Note that you can use that base OpenAPI object to fully define the specifications
of your API, without using any information from the routes themselves!
You do so by disabling the automatic specifications via the plugin configurations,
and then specify everything (paths
included) using this base OpenAPI object.
If your specifications may change at runtime (for example if a new route may be added at some point), there are some things to know:
SpincastOpenApiManager
instance (the cache, the
ignored routes, the base OpenAPI object, etc.), you can call
resetAll().
To tweak the configurations used by this plugin, you need to bind a custom implementation of the SpincastOpenApiBottomUpPluginConfig interface. You can also extend the default SpincastOpenApiBottomUpPluginConfigDefault implementation as a base class.
The available configurations are:
boolean isDisableAutoSpecs()
If this method returns true
no automatic specifications are going to
be created. You are then responsible to add all the information about your API using
the base OpenAPI object.
The default is to return false
.
String[] getDefaultConsumesContentTypes()
The default content-types
that are going to be used as the
@Consumes
information of a route if not explicitly defined otherwise.
The default is application/json
.
Note that specifying a @Consumes
annotation inside .specs(...)
will overwrite that default, but also using
.accept(...)
on the route definition!
String[] getDefaultProducesContentTypes()
The default content-types
that are going to be used as the
@Produces
information of a route if not explicitly defined otherwise.
The default is application/json
.
1. Add this Maven artifact to your project:
<dependency> <groupId>org.spincast</groupId> <artifactId>spincast-plugins-openapi-bottomup</artifactId> <version>{{spincast.spincastCurrrentVersion}}</version> </dependency>
2. Add an instance of the SpincastOpenApiBottomUpPlugin plugin to your Spincast Bootstrapper: {% verbatim %}
Spincast.configure() .plugin(new SpincastOpenApiBottomUpPlugin()) // ...


Hello,
Anyone with experience installing the Emoncms on a Azure cloud?
I have had problems on define which data storage technology select (Queue, Files, Blob, Tables) for the FEEDs and how to implement the changes to make the software work on it. Seems that changes are required on the code. Anyone help?
How the Emoncms.org works? Virtual machines only or any kind of scalable solution for data storage?
Please, advice.
Thanks, Fernando
Re: Installing Emoncms on a Microsoft Azure - Trouble with creating/accessing feed files
Hi Fernado,
How are you trying to accept the feed? Are you building a Linux, Ubunutu, VM and then installing Emoncms? Or are you trying to use a PaaS solution and grab the raw feed or MQTT feed?
In terms of storage technology you probably want a blob resource in your storage account if you are intending to create a virtual disk in this resource to mount in the Linux machine
For reference Hive MQTT have information for IaaS solution using Ubuntu on Azure - http://www.hivemq.com/blog/hivemq-on-windows-azure-mqtt-microsoft-cloud
Re: Installing Emoncms on a Microsoft Azure - Trouble with creating/accessing feed files
Hello Paul,
Thanks for your reply.
I am trying to install on a PaaS solution. I created a WebApp + MySQL account and another Storage account.
Published/installed Emoncms on the WebApp + MySQL account and access it (create users, log in, send input data using REST - basically everything that is related to MySQL).
But when I try to create a FEED over an input I receive a reply saying that was not possible to create the FEED. The FEED data on the MySQL is created, but the file on the blob not.
As far as I was able to debug, it is a problem while creating a FEED file .dat (something related to the function fopen("file", c+)).
Seems that the software is not able to create the file (Blob).
Any guess?
PS: The MQTT reference you provide was good. Thanks.


Fenced-Frame GPay button demo:
Fenced Frame is unsupported. To support this demo, please follow the instructions below.
Html source code:
<fencedframe src="https://maxlg-big-query-project.ue.r.appspot.com/fencedframe.html"></fencedframe>
Note that the card number can show up when the top level site is allowlisted in
this file.
Instructions:
- Ensure CL has been merged, or patch it to your local Chrome build.
- Enable chrome://flags/#enable-fenced-frames with "Enable multiple page architecture"
- Enable chrome://flags/#enable-fenced-frames-unpartitioned-cookie-access
- Enable chrome://flags/#partitioned-cookies
- Visit Chrome settings, block 3rd party cookie.
Expectations:
- When 3rd party cookie is blocked, the real GPay button no longer shows the card info, but the prototype GPay button is still able to show the card info.
References:


ndb_users
has been designed to operate in Google App Engine environment. Therefore, it requires the following:
webapp2
library to be included in app.yaml
(or other module configuration file, see libaries
section of the sample project's app.yaml
).Copy ndb_users
folder into your project.
In your project's app.yaml
, add the following URL handlers in the handlers
section:
handlers:
- url: /_login/assets
static_dir: ndb_users/assets
- url: /_login(.*)
script: ndb_users.login.app
secure: always
- url: /_ah/bounce
script: ndb_users.mail.app
login: admin
In your project's app.yaml
, add webapp2
under libraries
, if not already present:
libraries:
- name: webapp2
version: latest
In your project's app.yaml
, add mail_bounce
under inbound_services
:
inbound_services:
- mail_bounce
For example of importing and usage see main.py
in the included sample project.
Inside a webapp2
request handler, it's easy to get a User
object for the currently logged in user, if any.
The following code will return a User
object or None
:
user = users.get_current_user()
It's then easy to determine if there is indeed a logged in user:
if not user:
# No user logged in
self.abort(401) # or other response
To specify an automatic redirect, provide a relative URI string as the redirect_uri
keyword argument for any of the following functions.
login_url = users.create_login_url(redirect_uri=webapp2.uri_for('protected'))
login_url = users.create_login_url()
logout_url = users.create_logout_url()
password_reset_url = users.create_password_forgot_url()
password_change_url = users.create_password_change_url()
To use self.abort(401)
to return a login page, use users.error_handler_unauthorized
as your 401 error handler:
app.error_handlers[401] = users.error_handler_unauthorized
Note: This will return a HTTP/1.1 401 Unauthorized
HTTP header and display a login page.
Warning: Should not be used unless the handler is secure-only in your app.yaml
configuration file (as this will post using the current protocol, see users.create_login_url()
).
Users, as representated by the Users
class, are the primary object. A subclass of ndb.Model
, adding or updating a User
's property and calling put()
will update the user object in the datastore.
You may add additional properties to the User
class by editing it within the /ndb_users/users.py
file.
email
ndb.StringProperty(required=true)
The user's email address.
It is recomended to never modify the email
property! User
entities with dupliate email
properties in the datstore will cause unknown behavior. Additionally, the key
property (see ndb.Key
and Keys note below) is based off the hex sha256 hash of the user's lowercase email address.
Note: email
is always stored, returned, and hashed in lowercase.
passwordHash
The user's password hashed with passwordSalt
.
passwordSalt
The user's password salt.
The length may be changed in the global NDB_USERS_SALT_LENGTH
in config.py
.
The user's salt will be updated everytime the user's password is changed. See Users.update_password()
.
verified
Boolean indicating whether this user's email address has been verified.
created
The datetime
this user was created.
updated
The datetime
this user was last updated.
Does not take into account creation of account activation tokens or password recovery tokens.
bounceCount
The number of email bounce notification received for this user.
lastBounce
The datetime
this user had a bounced email message. Will be None
if no bounce has occurred.
The User
's key (ndb.Key
) is comprised of a User
object and the hex sha256 hash of the user's lowercase email address.
The code to create a User's key is shown below where user_id
is the hex sha256 hash of the user's lowercase email address.
key = ndb.Key(users.User, user_id)
User sessions, as representated by the UserSession
class, store a user's cookie value (user_session_id
cookie) and connect it to a User
entity by key.
...
ndb_users
utilitizes a single cookie: user_session_id
, which identifies a user's session.
...


iReporter
Home
Sign In
iReporter Sign Up Page
First Name:
Last Name:
Username:
Email:
Phone Number:
Password:
Confirm Password:
Already have an account?
Click here!


{% extends "articles/base.html" %} {% load humanize %} {% block content %}
Sorry. An application error has occurred. You may wish to contact my creator.


{% extends 'base.html' %} {% load bootstrap3 %} {% block content %}
Submitter {{ event_proposal.user }} will receive an email when the EventProposal is approved or rejected. It is possible to include an extra message in the form below explaining why the proposal was accepted or rejected. If the field is left blank a standard email is sent.
{% if not form.instance.can_be_approved %}NOTE: Not all SpeakerProposals associated with this EventProposal have been approved. EventProposal can not be approved! It can still be rejected though.


Optimal Bayesian experimental design using the approximate coordinate exchange (ACE) algorithm.
| Version: | 1.5.2 |
| Depends: | R (≥ 3.0.2), lhs |
| Imports: | Rcpp (≥ 0.12.2), compare, randtoolbox, parallel |
| LinkingTo: | Rcpp, RcppArmadillo (≥ 0.6.400.2.2) |
| Suggests: | R.rsp |
| Published: | 2018-11-21 |
| Author: | Antony M. Overstall, David C. Woods & Maria Adamou |
| Maintainer: | Antony M. Overstall <A.M.Overstall at soton.ac.uk> |
| License: | GPL-2 |
| NeedsCompilation: | yes |
| In views: | ExperimentalDesign |
| CRAN checks: | acebayes results |
| Reference manual: | acebayes.pdf |
| Vignettes: |
acebayes |
| Package source: | acebayes_1.5.2.tar.gz |
| Windows binaries: | r-devel: acebayes_1.5.2.zip, r-release: acebayes_1.5.2.zip, r-oldrel: acebayes_1.5.2.zip |
| OS X binaries: | r-release: acebayes_1.5.2.tgz, r-oldrel: acebayes_1.5.2.tgz |
| Old sources: | acebayes archive |
Please use the canonical form https://CRAN.R-project.org/package=acebayes to link to this page.


Suhana is too talented, hope Aryan becomes an actor too: Ananya Panday
Pati Patni Aur Woh star Ananya Panday has grown up with Shah Rukh Khan's kids Suhana and Aryan Khan and is the first one among them to have made her screen debut.
by PTIActor Ananya Panday says, superstar Shah Rukh Khan’s children, Suhana and Aryan, are immensely talented and is sure the duo are meant for bigger things in life.
The 21-year-old actor, who made her debut earlier this year with the sequel of Student of the Year, has grown up with Suhana and Aryan and is the first one among them to have made her screen debut.
“Suhana and I were in the same school and we have done a lot of acting related things together. We used to be in all the school plays and Suhana used to be the main lead… She’s a brilliant actor, Ananya said in a group interview.
“We both went to New York Film Academy ages ago and did a film course together. Now she’s there and acting. Suhana is too talented, not just acting but she’s a great singer and dancer. There are a lot of big things meant for Suhana.”
Ananya said Aryan is more inclined towards direction but after he lent his voice to the Hindi version of The Lion King, she hopes he acts someday.
“Aryan is more inclined towards direction, which I think he’s great at. He’s very creative, he’s a very good writer, very witty and smart. He did Simba’s voiceover so well! So selfishly I’d like to say I hope he becomes an actor one day.”
Ananya will be next see in Pati Patni Aur Woh, co-starring Kartik Aaryan and Bhumi Pednekar. The film will release on December 6.


Sign up today to join a team of volunteers mobilizing millions of people to protect Net Neutrality
The Federal Communications Commission (FCC) is set on killing net neutrality rules that keep the Internet free from censorship, throttling, and extra fees. But if we show Congress a massive groundswell of support for the open Internet, *they* can stop the FCC, and prevent the passage of ISP-backed legislation that ends net neutrality forever.
We are a bold network of volunteers combining people power with technology to coordinate Internet users from across the nation to pressure Congress locally.
By signing up, you’ll get connected to hundreds of other volunteers and organizers and receive the training and support needed to help organize net neutrality advocates to visit their local congressional offices and recruit others in their community to join them!
The Internet has given more of us a voice than ever before. Now is the time to step up and save it.
Sign up now to get started.


| [ Team LiB ] |
4.1 Lexical StructureThe lexical structure of a programming language is the set of basic rules that govern how you write programs in that language. It is the lowest-level syntax of the language and specifies such things as what variable names look like and what characters are used for comments. Each Python source file, like any other text file, is a sequence of characters. You can also usefully see it as a sequence of lines, tokens, or statements. These different syntactic views complement and reinforce each other. Python is very particular about program layout, especially with regard to lines and indentation, so you'll want to pay attention to this information if you are coming to Python from another language. 4.1.1 Lines and IndentationA Python program is composed of a sequence of logical lines, each made up of one or more physical lines. Each physical line may end with a comment. A pound sign (#) that is not inside a string literal begins a comment. All characters after the # and up to the physical line end are part of the comment, and the Python interpreter ignores them. A line containing only whitespace, possibly with a comment, is called a blank line, and is ignored by the interpreter. In an interactive interpreter session, you must enter an empty physical line (without any whitespace or comment) to terminate a multiline statement. In Python, the end of a physical line marks the end of most statements. Unlike in other languages, Python statements are not normally terminated with a delimiter, such as a semicolon (;). When a statement is too long to fit on a single physical line, you can join two adjacent physical lines into a logical line by ensuring that the first physical line has no comment and ends with a backslash (\). Python also joins adjacent physical lines into one logical line if an open parenthesis ((), bracket ([), or brace ({) has not yet been closed. Triple-quoted string literals can also span physical lines. Physical lines after the first one in a logical line are known as continuation lines. The indentation issues covered next do not apply to continuation lines, but only to the first physical line of each logical line. Python uses indentation to express the block structure of a program. Unlike other languages, Python does not use braces or begin/end delimiters around blocks of statements: indentation is the only way to indicate such blocks. Each logical line in a Python program is indented by the whitespace on its left. A block is a contiguous sequence of logical lines, all indented by the same amount; the block is ended by a logical line with less indentation. All statements in a block must have the same indentation, as must all clauses in a compound statement. Standard Python style is to use four spaces per indentation level. The first statement in a source file must have no indentation (i.e., it must not begin with any whitespace). Additionally, statements typed at the interactive interpreter prompt >>> (covered in Chapter 3) must have no indentation. A tab is logically replaced by up to 8 spaces, so that the next character after the tab falls into logical column 9, 17, 25, etc. Don't mix spaces and tabs for indentation, since different tools (e.g., editors, email systems, printers) treat tabs differently. The -t and -tt options to the Python interpreter (covered in Chapter 3) ensure against inconsistent tab and space usage in Python source code. You can configure any good editor to expand tabs to spaces so that all Python source code you write contains only spaces, not tabs. You then know that all tools, including Python itself, are going to be consistent in handling the crucial matter of indentation in your source files. 4.1.2 TokensPython breaks each logical line into a sequence of elementary lexical components, called tokens. Each token corresponds to a substring of the logical line. The normal token types are identifiers, keywords, operators, delimiters, and literals, as covered in the following sections. Whitespace may be freely used between tokens to separate them. Some whitespace separation is needed between logically adjacent identifiers or keywords; otherwise, they would be parsed as a single, longer identifier. For example, printx is a single identifier—to write the keyword print followed by identifier x, you need to insert some whitespace (e.g., print x). <IP_ADDRESS> IdentifiersAn identifier is a name used to identify a variable, function, class, module, or other object. An identifier starts with a letter (A to Z or a to z) or underscore (_) followed by zero or more letters, underscores, and digits (0 to 9). Case is significant in Python: lowercase and uppercase letters are distinct. Punctuation characters such as @, $, and % are not allowed in identifiers. Normal Python style is to start class names with an uppercase letter and other identifiers with a lowercase letter. Starting an identifier with a single leading underscore indicates by convention that the identifier is meant to be private. Starting an identifier with two leading underscores indicates a strongly private identifier; if the identifier also ends with two trailing underscores, the identifier is a language-defined special name. The identifier _ (a single underscore) is special in interactive interpreter sessions: the interpreter binds _ to the result of the last expression statement evaluated interactively, if any. <IP_ADDRESS> KeywordsPython has 28 keywords (29 in Python 2.3 and later), which are identifiers that Python reserves for special syntactic uses. Keywords are composed of lowercase letters only. You cannot use keywords as regular identifiers. Some keywords begin simple statements or clauses of compound statements, while other keywords are used as operators. All the keywords are covered in detail in this book, either later in this chapter or in Chapter 5, Chapter 6, or Chapter 7. The keywords in Python are:
<IP_ADDRESS> OperatorsPython uses non-alphanumeric characters and character combinations as operators. Python recognizes the following operators, which are covered in detail later in this chapter:
<IP_ADDRESS> DelimitersPython uses the following symbols and symbol combinations as delimiters in expressions, lists, dictionaries, various aspects of statements, and strings, among other purposes:
The period (.) can also appear in floating-point and imaginary literals. A sequence of three periods (...) has a special meaning in slices. The last two rows of the table list the augmented assignment operators, which serve lexically as delimiters but also perform an operation. I'll discuss the syntax for the various delimiters when I introduce the objects or statements with which they are used. The following characters have special meanings as part of other tokens:
The characters @, $, and ?, all control characters except whitespace, and all characters with ISO codes above 126 (i.e., non-ASCII characters, such as accented letters), can never be part of the text of a Python program except in comments or string literals. <IP_ADDRESS> LiteralsA literal is a data value that appears directly in a program. The following are all literals in Python: 42 # Integer literal 3.14 # Floating-point literal 1.0J # Imaginary literal 'hello' # String literal "world" # Another string literal """Good night""" # Triple-quoted string literal Using literals and delimiters, you can create data values of other types: [ 42, 3.14, 'hello' ] # List ( 100, 200, 300 ) # Tuple { 'x':42, 'y':3.14 } # Dictionary The syntax for literals and other data values is covered in detail later in this chapter, when we discuss the various data types supported by Python. 4.1.3 StatementsYou can consider a Python source file as a sequence of simple and compound statements. Unlike other languages, Python has no declarations or other top-level syntax elements. <IP_ADDRESS> Simple statementsA simple statement is one that contains no other statements. A simple statement lies entirely within a logical line. As in other languages, you may place more than one simple statement on a single logical line, with a semicolon (;) as the separator. However, one statement per line is the usual Python style, as it makes programs more readable. Any expression can stand on its own as a simple statement; we'll discuss expressions in detail later in this chapter. The interactive interpreter shows the result of an expression statement entered at the prompt (>>>), and also binds the result to a variable named _. Apart from interactive sessions, expression statements are useful only to call functions (and other callables) that have side effects (e.g., that perform output or change global variables). An assignment is a simple statement that assigns a value to a variable, as we'll discuss later in this chapter. Unlike in some other languages, an assignment in Python is a statement, and therefore can never be part of an expression. <IP_ADDRESS> Compound statementsA compound statement contains other statements and controls their execution. A compound statement has one or more clauses, aligned at the same indentation. Each clause has a header that starts with a keyword and ends with a colon (:), followed by a body, which is a sequence of one or more statements. When the body contains multiple statements, also known as a block, these statements should be placed on separate logical lines after the header line and indented rightward from the header line. The block terminates when the indentation returns to that of the clause header (or further left from there). Alternatively, the body can be a single simple statement, following the : on the same logical line as the header. The body may also be several simple statements on the same line with semicolons between them, but as I've already indicated, this is not good Python style. |
| [ Team LiB ] |


Dude
Want to go dinner?
Puff...
I'm still doing the Góngora comment...
Better other day
What comment about Góngora?
The comment sent Marialu
It's for tomorrow
Hand it to me!
Thank you!
Who wants to play Minecraft?
Come on, I didn't play it for four months
Ehh, the launcher crash...
Sure that is the base code
I told it to Mojang
It's a joke
Moai attack!
XD
Heart for this awesome design!
David joined the group
Heeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeellooooooooooooooooooooooooooooooo David
What is that
David left the group
Lol?
I'm boring...
Who wants to do some logarithms?


{include file="public/head"/} {block name="style"}{/block}
log in
|
registered
Upload
Certification
Home page
center
drop out
{$user['nickname']}
{$user['signature']}
Has been concerned
attention
{if condition="UID neq $user['uid'] "}
Private letter
{/if}
{$user['hits']}
Popularity
{$user['fans']}
Fans
{$user['songs']}
song
{$user['albums']}
Album
{:hook('pageBody',array('widget'=>'Baidushare'))}
Home
share it
Album
Fans
{block name="content"} {/block}
{block name="footer"}{include file="public/footer"/}{/block}
{:config('web_site_stat')} {block name="hidden"}{/block}
{if condition="UID neq $user['uid'] "}
×
Send a private message to@{$user['nickname']}
Message content:
submit
{/if} {block name="player"}{/block} {block name="script"}{/block}


Experience
Sith Empire Headquarters, Dromund Kaas
Supreme Commander of Imperial Forces, Emperor’s Enforcer
As the right-hand man to Emperor Sidious, hunted down jedi survivors and enforced the will of the empire;
Oversaw construction of the first generation Death Star;
First ever Imperial Supreme Commander;
Wally’s Parts / Toyarian Watto junk shop, Mos Espa, Tatooine
Enslaved Volunteer
General help and front-desk retail operations at the junk shop, second hand droid parts, mechanical / droid repair services;
Designed and piloted custom-built Podracer, ran track-side operations for the podracing team;
When I left you, I was but the student; now I am the master.
Back


◆ FadeIn()
| void MenuPotion.FadeIn |
( |
Color |
color, |
|
|
int |
time |
|
) |
| |
Fades the screen to a specified colour over time
- Parameters
-
| color | Colour to fade to |
| time | Time it takes to fade |
◆ FadeOut()
| IEnumerator MenuPotion.FadeOut |
( |
int |
time | ) |
|
Clears the colour of faded screen over time
- Parameters
-
| time | Time it takes to fade out |
- Returns
◆ LoadScene()
| IEnumerator MenuPotion.LoadScene |
( |
| ) |
|
Loads scene asyncronously
- Returns
◆ OnPotionActivate()
| virtual void MenuPotion.OnPotionActivate |
( |
| ) |
|
|
virtual |
◆ OnPotionMove()
| virtual void MenuPotion.OnPotionMove |
( |
| ) |
|
|
virtual |
When potion is moved, do this
The documentation for this class was generated from the following file:
- H:/Documents/GitHub/Necromancer-Game/Necromancer Game/Assets/Scripts/MenuPotion.cs


This environment is part of the MPE environments. Please read that page first for general information.
| Observations | Actions | Agents | Manual Control | Action Shape | Action Values | Observation Shape | Observation Values | Num States |
|---|---|---|---|---|---|---|---|---|
| Vector | Discrete | 2 | No | (3),(5) | Discrete(3),(5) | (3),(11) | (-inf,inf) | ? |
pettingzoo.mpe import simple_speaker_listener_v0
agents=[speaker_0, listener_0]
AEC diagram
This environment is similar to simple_reference, except that one agent is the ‘speaker’ (gray) and can speak but cannot move, while the other agent is the listener (cannot speak, but must navigate to correct landmark).
Speaker observation space: [goal_id]
Listener observation space: [self_vel, all_landmark_rel_positions, communication]
Speaker action space: [say_0, say_1, say_2, say_3, say_4, say_5, say_6, say_7, say_8, say_9]
Listener action space: [no_action, move_left, move_right, move_down, move_up]
simple_speaker_listener.env(seed=None, max_frames=100)
seed: seed for random values. Set to None to use machine random source. Set to fixed value for deterministic behavior
max_frames: number of frames (a step for each agent) until game terminates


eMortgages: As a webbank, CFS offers the best rate regular mortgage, jumbo mortgages refinance mortgage and home equity to qualified individuals on their residences. Fill in our application, credit report, and permission for inspection, and you are on your way!
* Down home loans payment low than FHA loan
* No prepayment home loans penalties for home loans and mortgages
* Better interest rates for home equity loans and refinance mortgage
| Product | Mortgage Interest rate (%) | APR |
| 30-Year Fixed Mortgage Rate | 4.625% | 4.684% |
| 20-Year Fixed Mortgage Rate | 4.375% | 4.485% |
| 7/1 ARM | 4.369% | 4.680% |
| Product | Mortgage Interest rate (%) | APR |
| 30-Year Fixed Refinance Mortgage Rate | 4.750% | 4.788% |
| 20-Year Fixed Refinance Mortgage Rate | 4.490% | 4.541% |
| 7/1 ARM | 4.375% | 4.680% |
| Mortgage amount | Mortgage Interest rate (%) | Mortgage period (years) |
| $100,000 | 3.95% | 30 |
| Total cost of mortgage | $170,213 |


1: Obfuscate Mimikatz:
Compile the binary yourself. Use different names. Replace common strings (kiwi/author/etc)
2: If LSA protection is turned on, use !+
!+ #this will register a driver and start it so that LSASS will allow it to be invoked
!processprotect /process:lsass.exe /remove


[gecode-users] -samples and -iterations
Yong LIN
elinyong at gmail.com
Thu Mar 15 04:44:07 CET 2012
Hi All,
I have a question about the two runtime options: -samples and -iterations.
I see that the program will be executed -samples times, but what is the
exact meaning of iterations?
Thanks!
regards,
Lin
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20120315/c7af4a24/attachment.htm>
More information about the users
mailing list


JD(S) fields CA for Mahalakshmi Layout bypoll
by Shruthi H M SastryThe JD(S) has announced a chartered accountant holding a doctoral degree, as its candidate from Mahalakshmi Layout Assembly constituency in Bengaluru.
On Sunday, the party announced the candidature of Girish K Nashi for the constituency. Girish will be contesting against JD(S) rebel K Gopalaiah who is now in the fray on BJP ticket. While Girish has joined JD(S) only recently, he has actively engaged himself in social work, according to R Prakash, president, Bengaluru Mahanagara JD(S).
While earlier, the party had announced the candidature of K P Bachegowda from Chikkaballapur, there is uncertainty in this regard, sources in JD(S) said. Bachegowda has requested the party not to make him the candidate while allowing him to be part of the election campaigning. The party is trying to convince him to stay on, while putting the candidature of K Radhakrishna, as standby for the constituency. A decision would be taken in this regard on Monday, sources added.
The party has now announced candidates for 11 constituencies while supporting Sharath Bachegowda, an independent from Hoskote. It is yet to announce names for three other constituencies - Kagwad, Athani, and Gokak.


| Interface | Description |
|---|---|
| ClockEvent | |
| ExpressTransport |
ExpressTransport wire the networking function from default akka
networking to customized implementation
Express . |
| TaskContext |
This provides context information for a task.
|
| TaskInterface |
Streaming Task interface
|
| TaskMessageSerializer<T> |


|
My Project
|
A helper class for caching the active context blob to minimize database lookups. More...
#include <globalcontext.hh>
Public Member Functions | |
| ContextCache (ContextDatabase *db) | |
| Construct given a context database. More... | |
| ContextDatabase * | getDatabase (void) const |
| Retrieve the encapsulated database object. | |
| void | allowSet (bool val) |
| Toggle whether setContext() calls are ignored. | |
| void | getContext (const Address &addr, uintm *buf) const |
| Retrieve the context blob for the given address. More... | |
| void | setContext (const Address &addr, int4 num, uintm mask, uintm value) |
| Change the value of a context variable at the given address with no bound. More... | |
| void | setContext (const Address &addr1, const Address &addr2, int4 num, uintm mask, uintm value) |
| Change the value of a context variable across an explicit address range. More... | |
A helper class for caching the active context blob to minimize database lookups.
This merely caches the last retrieved context blob ("array of words") and the range of addresses over which the blob is valid. It encapsulates the ContextDatabase itself and exposes a minimal interface (getContext() and setContext()).
| ContextCache::ContextCache | ( | ContextDatabase * | db | ) |
Construct given a context database.
| db | is the context database that will be encapsulated |
| void ContextCache::getContext | ( | const Address & | addr, |
| uintm * | buf | ||
| ) | const |
Retrieve the context blob for the given address.
Check if the address is in the current valid range. If it is, return the cached blob. Otherwise, make a call to the database and cache a new block and valid range.
| addr | is the given address |
| buf | is where the blob should be stored |
| void ContextCache::setContext | ( | const Address & | addr, |
| int4 | num, | ||
| uintm | mask, | ||
| uintm | value | ||
| ) |
Change the value of a context variable at the given address with no bound.
The context value is set starting at the given address and paints memory up to the next explicit change point.
| addr | is the given starting address |
| num | is the word index of the context variable |
| mask | is the mask delimiting the context variable |
| value | is the (already shifted) value to set |
| void ContextCache::setContext | ( | const Address & | addr1, |
| const Address & | addr2, | ||
| int4 | num, | ||
| uintm | mask, | ||
| uintm | value | ||
| ) |
Change the value of a context variable across an explicit address range.
The context value is painted across the range. The context variable is marked as explicitly changing at the starting address of the range.
| addr1 | is the starting address of the given range |
| addr2 | is the ending address of the given range |
| num | is the word index of the context variable |
| mask | is the mask delimiting the context variable |
| value | is the (already shifted) value to set |


Who is Drainyyy?
Hey, I am Drainyyy.
I am a 15 y/o developer and gamer from germany.
I started developing when I was round about 10.
Surely I didn't code good stuff. My sister told me how to write some print statements in java and I felt like a big hacker.
I didn't learned any more programming until I was 12 and started with skidding Minecraft plugins.
 But I didn't want to learn java from beginning so I decided to go the skid way. I started to skid discord bots and when I noticed that I can't do things alone I decided to learn python.
Python was the first language I learned from beginning I really like it. So I started some projects in Python, but none of them were completed except ToxicBot. With the rework of Toxic I learned how to work with Postgresql, APIs etc.
Then I started learning Java from beginning and here I am. A mediocre developer.


CSE250 Proj1
1. Prototype Selection
Divide data into ${S_1, S_2, …, S_c}$, where c = number of labels. For each dataset $S_i$, I select M/c points as new training set for that label, which are the centroids by running k-means clustering algorithm.
My idea was to capture as many distinct types in for each label and meanwhile reduce the noise by selecting only the center of the each type.
2. Pseudocode
create knnWrapper(dataX, dataY, neighbor, protype_num)
- dataX = training data for X
- dataY = label data for corresponding X
- neighbor = number of closest neighbors picked to decide the query point
- prototype_num = desired final data size
model = run knnWrapper(dataX, dataY, 1, M)
model.predict(query)
Detailed Implementation for knnWrapper():
$trainX = \emptyset$
$trainy = \emptyset$
labels = extra distinct labels from dataY
$data$ = group dataX by its label
for label in labels
- centroids = find_k_means_clusters(data[label], M / C)
- trainX = trainX + centroids
- trainy append label M/C times
return knn(trainX, trainy, neighbor)
3. Experimental Results
The margin of error can be calculated according to 1 $$ME = Z\sqrt{\frac{p(1 -p)}{n}}$$ where
- Z is Z-value from z-table 2, 1.96 chosen for 95% confidence interval
- p = proportion mean of sample
- n = sample size.
The following plots are for random selection and k-means:
Accuracy for Random vs K-Means PS
| Num of Prototype | Accuracy of Random | Accuracy of K-Means |
|---|---|---|
| 1000 | 0.8861 $\pm$ 0.1137 | 0.9580 $\pm$ 0.0718 |
| 2000 | 0.9123 $\pm$ 0.1012 | 0.9628 $\pm$ 0.0678 |
| 3000 | 0.9230 $\pm$ 0.0954 | 0.9650 $\pm$ 0.0657 |
| 4000 | 0.9309 $\pm$ 0.0908 | 0.9662 $\pm$ 0.0646 |
| 5000 | 0.9355 $\pm$ 0.0879 | 0.9673 $\pm$ 0.0637 |
| 6000 | 0.9393 $\pm$ 0.0854 | 0.9679 $\pm$ 0.0631 |
| 7000 | 0.9420 $\pm$ 0.0836 | 0.9685 $\pm$ 0.0625 |
| 8000 | 0.9449 $\pm$ 0.0817 | 0.9685 $\pm$ 0.0625 |
| 9000 | 0.9464 $\pm$ 0.0806 | 0.9689 $\pm$ 0.0621 |
| 10000 | 0.9489 $\pm$ 0.0788 | 0.9691 $\pm$ 0.0619 |
4. Critical Evaluation
My method is a improvement to the random selection. There are many more techniques for PS, such condensation, edition, and hybrid. I would love to try some of the hybrid methods that can further improve the performance, for example Repeated Editing Fast Condensing Nearest Neighbour (RFCNN). Moreover, besides PS methods, they are approaches focusing on different aspect of problem for kNN. One aspect is looking at different dist function, such as Fast Similarity Search, Approximated Similarity Search, etc.3 Also, one can also try differnt data structure for storing the points, such as vp-tree which provides O(logn) search time.4
Image credit to sci2s
- Confidence Intervals for a Single Mean or Proportion, Lisa Sullivan, Wayne LaMorte, http://sphweb.bumc.bu.edu/otlt/MPH-Modules/QuantCore/PH717_ConfidenceIntervals-OneSample/PH717_ConfidenceIntervals-OneSample_print.html [return]
- http://www.ltcconline.net/greenl/courses/201/estimation/smallConfLevelTable.htm [return]
- On the suitability of Prototype Selection methods for kNN classification with distributed data, Jose J. Valero-Mas, Jorge Calvo-Zaragoza, Juan R. Rico-Juan, https://grfia.dlsi.ua.es/repositori/grfia/pubs/341/SuitabilityPSDistributedScenarios.pdf [return]
- Data Structures and Algorithm for Nearest Neighbor Search in General Metric Spaces, Peter N. Yianilos, http://web.cs.iastate.edu/~honavar/nndatastructures.pdf [return]


A map of a node's local processes (any instances of Proc which were created by calling spawn/n on that node. Here we use a Map, because we anticipate frequent lookups based on given Pids. We also expect 'frequent additions and removals of key-value pairs'
Properties:
| Name | Type | Description |
|---|---|---|
@keys |
module:Serl.Pid | Keys in the Map should be instances of this class. |
@values |
module:Serl.Proc | Values in the Map should be instances of this class. |
counter |
module:Serl.ProcIndex | module:Serl.'Node#procMap'.counter |
Members
(static) this.procMap.counter
This helps us avoid duplicate process-indices on the local node, when generating a Pid object. We want to use Map here, because we expect 'frequent additions and removals of key-value pairs'
Each node must track all its previously spawned processes, and so we want an incrementing Node.procMap.counter, to ensure that for the lifetime of a node, N, all of N's local processes have a unique ProcIndex.
In the current implementation, the upper limit seems to simply be the size of Node.procMap.counter. (In Erlang, the equivalent number is stored in 18 to 28 bits, after which numbers are reused... however in JavaScript, it seems we have almost 53 bits...)
Properties:
| Name | Type | Description |
|---|---|---|
module:Serl.'Node#procMap'.counter |


--- title: interop subtitle: A translator for all 3D models. section_id: work category_id: product project_id: rhx type: professional year: 2019 for: gehry technologies site: los angeles team: nathaniel wong images: - link: /images/product/rhx/ui_1.jpg - link: /images/product/rhx/ui_2.jpg - link: /images/product/rhx/ui_3.jpg - link: /images/product/rhx/ui_4.jpg - link: /images/product/rhx/ui_5.jpg - link: /images/product/rhx/ui_6.jpg - link: /images/product/rhx/ui_7.jpg - link: /images/product/rhx/ui_8.jpg ---
1.01CAD Library of Babel
1.01The Gehry Technologies Dev Engine


Source code for relocators.basicBoundaryRelocator
# Copyright 2014 Modelling, Simulation and Design Lab (MSDL) at
# McGill University and the University of Antwerp (http://msdl.cs.mcgill.ca/)
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
from pypdevs.relocators.boundaryRelocator import BoundaryRelocator
from heapq import heappop, heappush, heapify
[docs]class BasicBoundaryRelocator(BoundaryRelocator):
"""
Basic implementation of a boundary relocator
"""
[docs] def __init__(self, swappiness):
"""
Constructor
:param swappiness: the swappiness
"""
BoundaryRelocator.__init__(self)
self.swappiness = swappiness
[docs] def setController(self, controller):
"""
Configures the controller of this relocator
:param controller: the controller
"""
BoundaryRelocator.setController(self, controller)
[docs] def getRelocations(self, gvt, activities, horizon):
"""
Return all pending relocations
:param gvt: current GVT
:param activities: activities being passed on the GVT ring
:param horizon: the time over which the activities were gathered
:returns: all relocations that should be executed
"""
# Clear all 'semi-global' variables
self.relocate = {}
self.model_activities = {}
self.node_activities = [i[1] for i in activities]
avg_activity = sum(self.node_activities) / len(self.node_activities)
reverts = set()
iterlist = [(activity, node)
for node, activity in enumerate(self.node_activities)
if activity > self.swappiness * avg_activity]
heapify(iterlist)
if sum(self.locations) == 0:
self.locations = [model.location for model in self.model_ids]
self.boundaries = [{} for _ in range(self.kernels)]
self.constructBoundaries(self.model_ids)
while iterlist:
# Keep going as long as there are nodes that are overloaded
srcactivity, node = heappop(iterlist)
# Might have changed in the meantime, though NEVER decreased
srcactivity = self.node_activities[node]
# Now 'node' contains the node that has the most activity of all, so try pushing something away
boundaries = self.boundaries[node]
destactivity, mindest = \
min([(self.node_activities[destination], destination)
for destination in boundaries
if boundaries[destination]])
boundary = boundaries[mindest]
source_deviation = srcactivity - avg_activity
destination_deviation = destactivity - avg_activity
original_heuristic = abs(source_deviation) + \
abs(destination_deviation)
move = None
for option in boundary:
# Swapping the model would give us the following new 'heuristic'
model_activity = self.fetchModelActivity(option)
new_heuristic = abs(source_deviation - model_activity) + \
abs(destination_deviation + model_activity)
if new_heuristic < original_heuristic:
move = option.model_id
original_heuristic = new_heuristic
if move is not None:
# Will migrate model 'move' to 'mindest'
self.scheduleMove(move, mindest)
if srcactivity - model_activity > avg_activity:
heappush(iterlist, (srcactivity - model_activity, node))
if destactivity + model_activity > avg_activity:
# The destination now also became overloaded, so push from this node as well
heappush(iterlist, (destactivity + model_activity, mindest))
return self.relocate
[docs] def useLastStateOnly(self):
"""
Determines whether or not the activities of all steps should be accumulated, or only a single state should be used.
:returns: boolean -- True if the relocator works with a single state
"""
return False


Topic 0: Deep Learning Basic Courses | |||
| Tag | Title and Information | URLs (Paper/Video/Slide) | Year |
|---|---|---|---|
| ✓DeepBasic | [Coursera] Neural Networks for Machine Learning — Geoffrey Hinton | (ListVideo) | 2016 |
| ✓DeepBasic | Nando de Freitas: Course: Deep learning at Oxford 2015 | (ListVideo) | 2015 |
Topic I: Deep Learning Basics | |||
| Tag | Title and Information | URLs (Paper/Video/Slide) | Year |
| ✓DeepBasic | the list of video lectures related to DEEP Learning we have learned @ | (ListVideo) | 2015-now |
| ✓Deep | DeepLearningSummerSchool12: Yann LeCun (New York University), Deep Learning, Graphical Models, Energy-Based Models, Structured Prediction (Part1 - deepNN supervised) | (Video) + (PDFslide) | 2012 |
| ✓Deep | DeepLearningSummerSchool12: Yann LeCun (New York University), Deep Learning, Graphical Models, Energy-Based Models, Structured Prediction (Part2 - deepNN unsupervised) | (Video) + (PDFslide) | 2012 |
| ✓DeepStructured | DeepLearningSummerSchool12: Yann LeCun (New York University), Deep Learning, Graphical Models, Energy-Based Models, Structured Prediction (Part3 - deepNN graph transformer network) | (Video) + (PDFslide) + (PDF2) | 2012 |
| ✓DeepGM | DeepLearningSummerSchool12: Geoffrey Hinton: Introduction to Deep Learning , Deep Belief Nets (Parts 1 / Relevant Paper: A fast learning algorithm for deep belief nets ) | (Video) + (PDFslide) | 2012 |
| ✓Deep | MLSS2005: Yann Lecun, Tutorial of Energy-based models | (Video) +(Slide) | 2005 |
| ✓Deep | Geoffry Hinton: Learning Energy-Based Models of High-Dimensional Data | (Video) + (PDFslide) | 2012 |
| ✓DeepScaling | KDD14: Yoshua Bengio, Scaling Up Deep Learning | (Video) + (PDFslide) | 2014 |
| ✓Deep | Yoshua Bengio (University of Montreal): Representation Learning with auto-encoder / decoder variants | (Video) | 2012 |
| ✓Deep | EML07: Yoshua Bengio (University of Montreal): Speeding Up Stochastic Gradient Descent | (Video) + (PDFslide) | 2007 |
| ✓Deep | Matt Zeiler ( Founder and CEO of Clarifai Inc, ) : Visualizing and Understanding Deep Neural Networks | (Video) | 2015 |
| ✓DeepTheory | DeepLearningSummerSchool12: Nando de Freitas (University of British Columbia) An Informal Mathematical Tour of Feature Learning | (Video) + (PDFslide) | 2012 |
| ✓Deep | KDD14: Ruslan Salakhutdinov, Deep Learning | (Video) + (PDFslide) | 2014 |
| ✓RNN | Nando de Freitas: Deep Learning Lecture 12: Recurrent Neural Nets and LSTMs | (Video) + (Slide) | 2015 |
| ✓DeepGenerative | Hugo Larochelle: DLSS15: Deep Learning for Distribution Estimation | (Video) + (Slide) | 2015 |
| ✓DeepTheory | Yoshua Bengio: DLSS15: Deep Learning: Theoretical Motivations | (Video) + (Slide) | 2015 |
| ✓Deep | DLSS15: Ian Goodfellow: Deep Adversarial Examples | (Video) + (Slide) | 2015 |
| ✓Deep | DLSS15: Leon Bottou: Multilayer Neural Networks | (Video) + (Slide) | 2015 |
| DeepRBM | DLSS15: multiple tutorials related to RBM | (Video-DeepGM) + (Video-RBM) + (Video-deepRBM) | 2015 |
| DeepRBM | DLSS15: Aaron Courville, Variational Autoencoder and Extensions | (Video-autoencoder) + (Video-variational) | 2015 |
Topic II: Application and Benchmarking and Understanding Deep learning papers | |||
| Tag | Title and Information | URLs (Paper/Video/Slide) | Year |
| ✓bench | paper: Comparative Study of Deep Learning Software Frameworks | (PDF) | 2015 |
| ✓bench | paper: Benchmarking State-of-the-Art Deep Learning Software Tools | (PDF) | 2016 |
| ✓Tools | DeepLearningSummerSchool16: Jeffrey Dean, Google, Inc. : Large Scale Deep Learning with TensorFlow | (Video) + (PDFslide) | 2016 |
| ✓Tools | DeepLearningSummerSchool16: Alex Wiltschko, Twitter, Inc : Introduction to Torch | (Video) + (PDFslide) | 2016 |
| ✓Hardware | DeepLearningSummerSchool12: Marc'Aurelio Ranzato (Google Inc.), Large Scale Deep Learning | (Video) + (PDFslide) | 2012 |
| ✓Hardware | DeepLearningSummerSchool16:Ryan Olson, NVIDIA Corporation, GPU programming for Deep Learning | (Video) + (PDFslide) | 2016 |
| ✓App | DLSS15: Christopher Manning: NLP and Deep Learning 2: Compositional Deep Learning; Graham Taylor, Deep Learning to compared |
(Video1) (Video2) (Slide) + (VideoLearn2Compare) | 2015 |
| ✓App | Paper: Learning to rank with (a lot of) word features | (PDF) | 2010 |
| ✓App | Paper: Natural Language Processing (almost) from Scratch / Ronan Collobert, Jason Weston, Leon Bottou, Michael Karlen, Koray Kavukcuoglu, Pavel Kuksa | (PDF) | 2011 |
| ✓App | Paper: A Neural Algorithm of Artistic Style | (PDF) | 2015 |
| ✓Understanding | Paper: Understanding Black-box Predictions via Influence Functions | (PDF) | 2017 |
| ✓Test | Paper: DeepXplore: Automated Whitebox Testing of Deep Learning Systems | (PDF) | 2010 |
Topic III: Adversarial and Deep Generative Papers we read | |||
| Tag | Title and Information | URLs (Paper/Video/Slide) | Year |
| ✓GAN | Paper: Generative Adversarial Networks / Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, Yoshua Bengio | (PDF) | 2014 |
| ✓GAN | Paper: Energy Based Generative Adversarial Networks / Junbo Zhao, Michael Mathieu and Yann LeCun | (PDF) | 2017 |
| ✓GAN | Paper: Towards Principled Methods for Training Generative Adversarial Networks /Martin Arjovsky, Soumith Chintala, Léon Bottou | (PDF) | 2017 |
| ✓GAN | Paper: Wasserstein GAN /Martin Arjovsky, Léon Bottou | (PDF) | 2017 |
| ✓Robust | Paper: Intriguing properties of neural networks / Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, Rob Fergus | (PDF) | 2013 |
| ✓Robust | Paper: Explaining and Harnessing Adversarial Examples / Ian J. Goodfellow, Jonathon Shlens, Christian Szegedy | (PDF) | 2014 |
| ✓DeepGenerative | Yoshua Bengio: DLSS15: Deep Generative Models | (Video) + (Slide) | 2015 |
| ✓Deep | DSLL16: Shakir Mohamed, Google, Inc, Building Machines that Imagine and Reason: Principles and Applications of Deep Generative Models | (Video) + (PDFslide) | 2016 |
Topic IV: Deep learning Models with varying Structures | |||
| Tag | Title and Information | URLs (Paper/Video/Slide) | Year |
| ✓RNN | Paper: Long Short-Term Memory | (PDF) (BlogExplain) | 1997 |
| ✓NTM | Paper: Neural Turing Machines / Alex Graves, Greg Wayne, Ivo Danihelka | (PDF) | 2015 |
| ✓NTM | Paper: Hybrid computing using a neural network with dynamic external memory/ Alex Graves, etal, Koray Kavukcuoglu, Demis Hassabis | (PDF) | 2015 |
| ✓Memory | Paper: End-To-End Memory Networks / Sainbayar Sukhbaatar, Arthur Szlam, Jason Weston, Rob Fergus | (PDF) | 2015 |
| ✓s2sLSTM | Paper: Sequence to Sequence Learning with Neural Networks / Ilya Sutskever, Oriol Vinyals, Quoc V. Le | (PDF) | 2015 |
| ✓s2sLSTM | Paper: Neural Machine Translation by Jointly Learning to Align and Translate / Dzmitry Bahdanau, Kyunghyun Cho, Yoshua Bengio | (PDF) | 2016 |
| s2sLSTM | Paper: Pointer Networks /Oriol Vinyals, Meire Fortunato, Navdeep Jaitly | (PDF) | 2015 |
| ✓s2sLSTM | Paper: Order Matters: Sequence to Sequence for Sets / Oriol Vinyals, Samy Bengio, Manjunath Kudlur | (PDF) | 2016 |
| ✓s2sLSTM | Paper: Matching Networks for One Shot Learning / Oriol Vinyals, Charles Blundell, Timothy Lillicrap, Koray Kavukcuoglu, Daan Wierstra | (PDF) | 2016 |
| ✓Deep | DSLL16: Edward Grefenstette, Google, Inc. : Beyond Seq2Seq with Augmented RNNs | (Video) + (PDFslide) | 2016 |
| ✓Deep | DSLL16: Sumit Chopra, Facebook Reasoning, Attention and Memory | (Video) + (PDFslide) | 2016 |
| ✓Deep | DSLL16: Yoshua Bengio, Department of Computer Science and Operations Research, University of Montreal; A Brief Review of Recurrent Neural Networks | (Video) + (PDFslide) | 2016 |
| ✓Memory | Paper: One-shot Learning with Memory-Augmented Neural Networks / Adam Santoro, Sergey Bartunov, Matthew Botvinick, Daan Wierstra, Timothy Lillicrap | (PDF)(ICML16) | 2016 |
| ✓ParaNet | Paper: HyperNetworks / David Ha, Andrew Dai, Quoc V. Le / ICLR 2017 | (PDF) | 2016 |
| ✓ParaNet | Paper: Image Question Answering usingConvolutional Neural Network with Dynamic Parameter Prediction / Hyeonwoo Noh, Paul Hongsuck, Seo Bohyung Han / CVPR 2016 | (PDF) | 2015 |
| ✓ParaNet | Paper: Learning Feed-Forward One-Shot Learners | (PDF) | 2016 |
| ✓ParaNet | Paper: Learning to Learn by gradient descent by gradient descent | (PDF) | 2016 |
| ✓ParaNet | Paper: Dynamic Filter Networks | (PDF) | 2016 |
| ✓ParaNet | Paper: Diet Networks: Thin Parameters for Fat Genomics | (PDF) | 2016 |
Topic V: Optimization of Deep learning Models | |||
| Tag | Title and Information | URLs (Paper/Video/Slide) | Year |
| ✓SGD | Tutorial: Optimization Methods for Large-Scale Machine Learning / Léon Bottou, Frank E. Curtis, Jorge Nocedal | (PDF) | 2016 |
| ✓SGD | Tutorial: Efficient BackProp/ Yann Lecun, Leon Bottou, Genevieve Orr, Klaus-Robert Muler | (PDF) | 1998 |
| ✓DeepOptim | DLSS15: Ian Goodfellow: Tutorial on Neural Network Optimization Problems | (Video) + (Slide) | 2015 |
| ✓DeepOptim | DLSS15: Adam Coates: Deep Learning (hopefully faster) | (Video) + (Slide) | 2015 |
Topic VI: Reinforcement Learning Related Basics | |||
| Tag | Title and Information | URLs (Paper/Video/Slide) | Year |
| ✓ BasicRL | Basics of Reinforcement Learning: Michael Littman, on Conference on Reinforcement Learning and Decision Making (RLDM)15 | (Video) + (Slide) | 2015 |
| ✓BasicRL | David Silver Course on Reinforcement Learning (10 lectures) | (ListVideo)+ (Slide) | 2015 |
| ✓ RLFunc | NIPS15 Tutorial: Introduction to Reinforcement Learning with Function Approximation | (Video) + (Slide) | 2015 |
| ✓ DeepRL | David Silver: Deep Reinforcement Learning | (Video) + (Slide) | 2015 |
| ✓DeepRL | Nando de Freitas: Deep Learning Lecture 15: Deep Reinforcement Learning - Policy search | (Video) + (Slide) | 2015 |
| DeepRL | Nando de Freitas: Deep Learning Lecture 16: Reinforcement learning and neuro-dynamic programming | (Video) + (Slide) | 2015 |
| many more exciting video tutorials @ http://videolectures.net |


Triol Corporation is a privately owned group of companies acting worldwide and engaged in the development and manufacturing of electrical equipment for different industrial purpose.
The Company values and respects your privacy and is committed to protecting your rights on personal data.
This privacy policy (hereinafter referred to as the Policy) explains the way the Company uses and protects your personal data submitted to us and your rights regarding privacy. The Policy was last updated on August 2018. The Company retains the right to make changes to the Policy and update it in correspondence with the legislation in force at any time by amending this page. In order to review current amendments, it is necessary to check the content of this page.
The personal data collected by the Company for further processing may include
- Contact details including emails, postal addresses, fax and phone numbers
- Information used to create your online account including username, password, security question, and answer
- General information including your name, job title/position and employing company title
- Biographical and demographic information including date of birth, age, gender, marital status and dependent, spousal and other family information
- Purchase and customer service history
- Financial details including payment information, billing address, and payment card details (i.e., card number, expiration date, and security code), bank account information, financial statements, income, and credit score
- Technical information including IP address, operating system, web browser, and other technology on the devices that you use to access websites of the Company
- Location data including data derived from your IP address, country, and zip code
- Information provided within an inquiry into the services of the Company
- Any other information which you may provide to the Company
- Photographs
The Company may collect your personal data as follows
- Via contact forms (the Company collects information when you log in of complete application or inquiry forms on the websites of the Company)
- Via emails, phone calls or letters (the Company collects information when you communicate directly with its contacts)
- Via personal interactions (the Company collects information when you interact with its employees directly)
- Via automated technologies (the Company collects information automatically via technology tools such as cookies or similar)
- Via third parties (the Company may collect information from publically available sources, business-to-business market intelligence companies, and other service providers)
The Company collects your personal information in the course of its business for the following purposes
- To provide and administer information, services, and/or products to you
- To provide customer support
- To communicate about and administer our products, services, events, programs, and promotions (such as by sending alerts, promotional materials, newsletters, and other marketing communications)
- To create, administer and communicate with you about your account (including any purchases and payments)
- To perform data analytics including market research, trend analysis, financial analysis, and Customers segmentation
- To fulfill our legal and regulatory requirements including establishing, exercising or defending legal claims
- To process, evaluate, and respond to your requests, enquires, applications or complaints
- To manage and administer relations between you and the Company
- To prevent and detect fraud and other legal offenses
- To ensure network and information security
- To host, maintain and improve our marketing communications website
- To verify your identity, protect against and prevent fraud and other unlawful activities, unauthorized transactions
- To maintain and enhance the safety and security of products, services, websites, network services, information resources and employees of the Company
Additionally, the Company may use your personal data for direct marketing. This means, that the Company may send you marketing communications about services, publications, science & technology industry updates, events, courses, and surveys and to display content that we believe may be of interest to you based on your personal data. The Company will obtain your consent for the processing of your personal information for direct marketing purposes, where required by applicable law.
The Company should only contact you for mentioned marketing purposes in accordance with our legitimate business interests or where you have explicitly expressed your consent to this. Your agreement for using your personal data is optional. A refusal to provide your agreement for your personal data usage should not affect your rights for visiting and using the websites of the Company and/or the quality of services and/or products provided by the Company. Simultaneously, if you choose not to provide the Company with certain information, the Company may not be able to offer you certain products and services, and you may not be able to access certain features of the Company websites.
The Company may employ a relationship management tool (if legally permissible) in order to strengthen relations between personnel of the Company and its current and/or potential clients. The information submitted by you to the Company is exploited to assess, analyze and improve the services and the products provided by the Company.
Processing of your personal information as described hereof by the Company, in general, is based on the following items
- Your consent
- Performance of a contract with you or a relevant party
- Legitimate business interests of the Company
- Compliance with legal obligations of the Company
You are entitled to request the Company not to use your personal data for marketing communications by sending a relevant email at<EMAIL_ADDRESS>The websites of the Company may comprise inviting you to provide your personal data including the “Contact Us” form and contact email addresses. These facilities purpose is apparent due to the fact that you provide your personal data directly and the Company is to use that information for mentioned purposes.
The websites of the Company use Google Analytics service, a web-based tool for analytics, tracking, and reporting on the manner in which the website is used, in order to improve it.
The Company is entitled to use your personal data only in correspondence with the requirements of the current legislation in force, including but not limited to
- where it is necessary for legitimate business purposes of the Company provided it does not override your rights and freedoms
- to perform a contract such as providing you with services or products
- to comply with legal and regulatory obligations including establishment, exercise or defense of legal claims
- where the Company has received your unequivocal consent
The Company should provide you with full details of the information requested and reasons for its collecting, while you obtain an opportunity to consider carefully whether you wish to give such consent. The Company keeps your personal data only for as long as it is necessary for the purposes of its collecting, in order to provide you with services and/or products, for legitimate business interests, in accordance with a contract, and where it is required or allowed under the law.
Any personal data that you share with the Company may be shared and processed by other companies within the Triol Corporation, in accordance with the Policy and/or in accordance with contractual arrangements agreed with you.
The Company shall not share your information with any third parties, except for the cases when a direct and explicit consent to this was provided by you, and when it is legally permitted to do so in accordance with conditions stated hereof and/or in accordance with contractual arrangements agreed between you and the Company.
The websites of the Company may contain links to third-party websites including but not limited the websites of Company partners. These websites are owned and managed independently from the websites of the Company and have their own separate privacy policies. Any personal data that you provide to these websites will be governed under the terms and conditions of the privacy policy of that particular websites.
You are entitled to contact representatives of the Company to obtain more detailed information on the specific mechanism used by the Company for your personal data processing.
The Company applies appropriate physical, electronic and managerial security measures in place to protect against the loss, misuse or unauthorized access to your personal data. The Company uses network access control technology to limit access to the systems on which personal data is stored and monitors all hazardous circumstances to negate possible vulnerabilities and attacks. However, as the transmission of information via the internet is not completely secure, the Company cannot guarantee the complete security of your information transmitted to the websites of the Company.
The Company accepts the fact that the information you provide may be confidential and should not sell or otherwise make your personal data commercially available to any third party.
You have the right (subject to certain exceptions) to
- access, correct, delete, update, rectify or restrict your personal data
- object to use and processing of your personal data or withdraw consent that you have previously given
- request the transfer of your personal data to you or a third party
- submit any requests about the use and processing of your personal data
The Company may ask for further information from you in order to prove your identity before disclosing any personal data to you. This security measure is aimed to ensure that personal data is not disclosed to any person who has no right to receive it. The Company may also contact you to ask for further information in relation to your request.
If you have any queries in relation to the Policy, please contact us at
Address
Ave. Industrial 10 K, Kharkov, 61007, Ukraine
If you currently receive marketing information from the Company which you would not prefer to receive in the future, please email us at office.eu@triolcorp.com


Names and labels
- If no label is specified, the query will be identified using the name of the attribute.
- All of the series must be uniquely identified, otherwise the query will fail.
Attributes
- Click on the label with the icon to search the available values in the node, resource and attributes fields.
- When searching for a node you can match on any of these fields: label, sysName, ip address, hostname, foreign id
Expressions
- Expressions can be used to perform calculations or simple manipulation on previous queries.
- Within the expression, you can refer to other queries using their name, however these must not contain any spaces.
- Values that were typically stored in strings.attributes can be reference using $label.$property i.e. ifInOctets.ifSpeed
Filters
- Filters do not support templated values.
- Filters using the R backend required 'Rscript' to be available on OpenNMS server's system path.
Template queries
- Query nodes using nodeFilter($filter), where $filter is a valid OpenNMS filter
- Query child resources using nodeResources($nodecriteria) where $nodecriteria is the node id, or foreign source and foreign id
- Examples
- nodeFilter(catincProduction & catincLinux)
- nodeFilter((isSMTP | isPOP3 ) & (categoryName == 'Production'))
- nodeResources(1)
- nodeResources(FS:FID)


All Classes
-
Class Summary Class Description DynamicDataHelper Java wrapper for the OMQ::UserApi::Workflow::DynamicDataHelper "DynamicDataHelper" class in Qorus This class is a helper class that allows dynamicdata "workflow dynamic data" to be read and updated atomically; the write lock for the data is grabbed in the constructor and released in the destructor Calls to the following workflow API functions related to dynamicdata "workflow dynamic data" can be made normally while this object exists and the write lock is held; the functions are aware of and automatically use the write lock held by this object: WorkflowApi.deleteDynamicDataKey() WorkflowApi.getDynamicData() WorkflowApi.updateDynamicData() The %Qore-language destructor is run at the end of the Java step execution, after the step returns to Qorus.QorusAsyncArrayStep The abstract class for asyncsteps "async array steps" ExampleQorusAsyncStep The Java interface class for asyncsteps "asynchronous steps" An asynchronous step should be used any time a workflow action should be executed and it's not known in advance how long the action could take, or if the action should take a long period of time.QorusAsyncStepBase The Java base interface class for asyncsteps "asynchronous steps"QorusEventArrayStep The Java interface class for eventsteps "workflow synchronization event array steps" Workflow synchronization event steps allow many workflow orders to synchronize their processing based on a single event.QorusEventStep The Java interface class for eventsteps "workflow synchronization event steps" Workflow synchronization event steps allow many workflow orders to synchronize their processing based on a single event.QorusEventStepBase The Java base interface class for eventsteps "event steps"QorusNormalArrayStep The abstract class for normalsteps "normal array steps" ExampleQorusNormalStep The abstract class for normalsteps "normal steps" ExampleQorusStepBase Base class for workflow step classesQorusSubworkflowArrayStep The abstract class for subworkflowsteps "subworkflow array steps" A subworkflow step binds a child workflow (called a subworkflow) to a step and should be used to implement support for complex logical branching in Qorus.QorusSubworkflowStep The abstract class for subworkflowsteps "subworkflow steps" A subworkflow step binds a child workflow (called a subworkflow) to a step and should be used to implement support for complex logical branching in Qorus.QorusSubworkflowStepBase The Java base interface class for subworkflowsteps "subworkflow steps"QorusWorkflow Base class for workflow classesSensitiveDataHelper Java wrapper for the OMQ::UserApi::Workflow::SensitiveDataHelper "SensitiveDataHelper" class in Qorus This class is a helper class that allows sensitive_data "workflow sensitive data" to be read and updated atomically; the write lock for the data is grabbed in the constructor and released in the destructor Calls to the following workflow API functions related to sensitive_data "sensitive data" can be made normally while this object exists and the write lock is held; the functions are aware of and automatically use the write lock held by this object: WorkflowApi.deleteSensitiveDataKey() WorkflowApi.getSensitiveData() WorkflowApi.updateSensitiveData() The %Qore-language destructor is run at the end of the Java step execution, after the step returns to Qorus.StepDataHelper Java wrapper for the OMQ::UserApi::Workflow::StepDataHelper "StepDataHelper" class in Qorus This class is a helper class that allows stepdata "workflow dynamic step data" to be read and updated atomically; the write lock for the data is grabbed in the constructor and released in the destructor Calls to the following workflow API functions related to stepdata "workflow dynamic data" can be made normally while this object exists and the write lock is held; the functions are aware of and automatically use the write lock held by this object: QorusStepBase.deleteStepDataKey() QorusStepBase.getStepData() QorusStepBase.updateStepData() The %Qore-language destructor is run at the end of the Java step execution, after the step returns to Qorus.TempDataHelper Java wrapper for the OMQ::UserApi::Workflow::TempDataHelper "TempDataHelper" class in Qorus This class is a helper class that allows tempdata "workflow temp data" to be read and updated atomically; the write lock for the data is grabbed in the constructor and released in the destructor.WorkflowApi The main Qorus Java workflow API classWorkflowDataHelper Java wrapper for the OMQ::UserApi::Workflow::WorkflowDataHelper "WorkflowDataHelper" class in Qorus This class is a helper class that allows dynamicdata "workflow dynamic data" (DynamicDataHelper) and tempdata "workflow temp data" (TempDataHelper) to be read and updated atomically; the write lock for the data is grabbed in the constructor and released in the destructor.


Shorter syntax for functions plus this binding
Can't use as constructor
var Car = function(); var Truck = () => {}; var mazda = new Car(); var ford = new Truck(); // Error!
function arrow1() { var numbers = [1,2,3,4,5,6]; // allowed to not use parentheses for one argument // don't have to use braces for single line function // implicit return var squares = numbers.map( x => x * x); console.log(squares); }
function arrow2() { var numbers = [1,2,3,4,5,6]; // multiple arguments, have to use parentheses var squares = numbers.map( (v, i) => "value was: " + v + ". index was: " + i); console.log(squares); }
var countupBroken = { counter: 0, start:function(){ setInterval(function(){ this.counter++; // **INCORRECT**- doesn't increment countup's counter property alert(counter); }, 5000); } }; function startCountupBroken() { countupBroken.start(); }
var countupFixed = { counter: 0, start:function(){ setInterval( () => { this.counter++; // Increments countup's counter property // see? I had to explicitly use the global window object here window.alert(counter); }, 5000); } }; function startCountupFixed() { countupFixed.start(); }


{% extends "base.html" %} {% block head %} {% endblock %} {% block content %}
This is Appraise. It supports collaborative collection of human feedback for evaluation tasks such as Translation Quality Checking, Ranking and Error Classification, and Manual Post-Editing.
{% if "evaluation" in installed_apps %}Access your evaluation tasks » {% endif %}{% if "wmt13" in installed_apps %}Access WMT13 evaluation » {% endif %}{% if "wmt14" in installed_apps %}Access WMT14 evaluation » Sign up for WMT14 »{% endif %}


GEOS SDK
:
List of Messages
for ContactListClass
MSG_CONTACT_LIST_PRESERVE_SEARCH_ON_NEXT_LOST_FOCUS
GEOS SDK
List of Messages, Organized by Class


|
| | __init__ () |
| |
| | __init__ (const LMatrix4f copy) |
| |
| | __init__ (const UnalignedLMatrix4f copy) |
| |
| | __init__ (float e00, float e01, float e02, float e03, float e10, float e11, float e12, float e13, float e20, float e21, float e22, float e23, float e30, float e31, float e32, float e33) |
| |
| | getData () |
| | Returns the address of the first of the nine data elements in the matrix. More...
|
| |
| int | getNumComponents () |
| | Returns the number of elements in the matrix, sixteen.
It has no functionality other than to store numbers, and it will pack them in as tightly as possible, avoiding any SSE2 alignment requirements shared by the primary LMatrix4 class.
Use it only when you need to pack numbers tightly without respect to alignment, and then copy it to a proper LMatrix4 to get actual use from it.


Consistency is an online deck testing tool. Play with hands of 4-6 cards, tell the system if your hand was good, and repeat. You get a brick (awful hand) percentage, total hands played, and number of good or bad hands.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/linarith.20and.20conjunctions.html ---
In my class I got tired of typing cases h with h1 h2, cases ..., cases ..., linarith
all the time and ended up defining
meta def linarith' : tactic unit := do try auto.split_hyps, `[linarith]
@Rob Lewis Would you mind putting (a more flexible version of) this in mathlib?
https://github.com/leanprover-community/mathlib/pull/2320
Thanks!
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


Apple and Intel join forces to take down Softbank-owned patent troll
Firms fight Fortress over flimsy feuds
by Carly PageCHIPMAKER Intel has joined forces with Apple in a bid to fight a Softbank-backed investment company it accuses of being behind a wave of patent trolling.
Intel first filed a patent lawsuit against Fortress Investment Group back in October, but Reuters reports that the chipmaker has withdrawn that suit and teamed with Apple to this week file a new version in the US District Court for the Northern District of California.
In the new filing, Apple argues that a group of firms connected to Fortress had filed at least 25 lawsuits against it, demanding for between $2.6bn and $5.1bn in damages in total. One of Fortress' suits, Reuters reports, alleges that Apple violated a step-counting patent it owns with its proprietary health-tracking apps.
Two of these Fortress-linked firms, Uniloc USA and Uniloc Luxembourg, "have disclosed that they believe they are entitled to damages of between $1.41 and $2.75 per Apple product, for total damages in the range of $375 to $732m," Apple wrote in its complaint.
It adds that the "apparent precision of the per-unit damages request is a facade", as the firms have simply adopted the amounts that Apple sought from Samsung during the firms' years-long legal battle.
In its previous lawsuit, Intel accused the investment outfit has used patents acquired from NXP Semiconductors to file a series of "meritless" legal cases against it. Fortress reportedly claims that nearly every processor launched by Intel since 2011 have infringed the patents that it acquired.
"Intel brings this complaint to end a campaign of anti-competitive patent aggregation by Fortress and a web of patent assertion entities that Fortress owns or controls," Intel said in its lawsuit.
It went on to argue that Fortress' behaviour was "anticompetitive" as it's driven by the idea that the cost to purchase the patents would be much less than the amount manufacturing firms would have to pay to Fortress to avoid patent infringement lawsuits.
The chipmaker also claimed that Fortress invests in the entities on "terms so severe that the PAEs [patent assertion entities] have no choice but to make aggressive and reckless patent assertions to attempt to generate the revenue required to meet their obligations."
Fortress has yet to comment, but said in response to Intel's previous lawsuit that it was "confident in our business practices and our legal position and view this lawsuit as meritless." µ
Further reading
IBM, Microsoft and Linux plan to send patent trolls back under the rickety bridge
- 20 Nov 2019
TSMC and GlobalFoundries settle patent disputes with cross-licensing agreement
- 29 Oct 2019
Intel sues Softbank-backed firm over 'anticompetitive' patent hoarding
- 23 Oct 2019
TSMC countersues GlobalFoundries for alleged patent infringement
- 01 Oct 2019


val lightwalletService: LightWalletService
the service used for requesting compact blocks
lightwalletService - the service used for requesting compact blocks
lightwalletService


A base class with no predefined methods that tries to behave like Builder’s BlankSlate in Ruby 1.9. In Ruby pre-1.9, this is actually the Builder::BlankSlate class.
Ruby 1.9 introduces BasicObject which differs slightly from Builder’s BlankSlate that has been used so far. ActiveSupport::BasicObject provides a barebones base class that emulates Builder::BlankSlate while still relying on Ruby 1.9’s BasicObject in Ruby 1.9.
encoding: utf-8
encoding: utf-8
encoding: utf-8
OrderedHash is namespaced to prevent conflicts with other implementations
encoding: utf-8
The TimeZone class serves as a wrapper around TZInfo::Timezone instances. It allows us to do the following:
- Limit the set of zones provided by TZInfo to a meaningful subset of 142 zones.
- Retrieve and display zones with a friendlier name (e.g., “Eastern Time (US & Canada)” instead of “America/New_York“).
- Lazily load TZInfo::Timezone instances only when they’re needed.
- Create ActiveSupport::TimeWithZone instances via TimeZone’s local, parse, at and now methods.
If you set config.time_zone in the Rails Initializer, you can access this TimeZone object via Time.zone:
# environment.rb: Rails::Initializer.run do |config| config.time_zone = "Eastern Time (US & Canada)" end Time.zone # => #<TimeZone:0x514834...> Time.zone.name # => "Eastern Time (US & Canada)" Time.zone.now # => Sun, 18 May 2008 14:30:44 EDT -04:00
The version of TZInfo bundled with Active Support only includes the definitions necessary to support the zones defined by the TimeZone class. If you need to use zones that aren’t defined by TimeZone, you’ll need to install the TZInfo gem (if a recent version of the gem is installed locally, this will be used instead of the bundled version.)
XmlMini LibXML implementation
XmlMini Nokogiri implementation
XmlMini ReXML implementation
Required files
- blankslate


The default settings for certain options used in CrypTool which are to outlast a single session are saved in the Windows registry.
If you start CrypTool for the first time, the dialog How to start appears. If you don't want to see this dialog in the future, you can use the check box Don't show this dialog again. This way the registry variable NoTipps is set to zero, and the dialog is not shown anymore when CrypTool is started.
Below it is shown how you can access the Windows registry. Then the various CrypTool options saved within the registry are explained.
Access to the Windows registry
Please note: The windows registry contains critical data. Alteration can lead to instabilites of the operating system or the applications.
You can use the DOS command regedit.exe to access the Windows registry. To get to the CrypTool settings, use the following path:
HKEY_CURRENT_USER\Software\CrypTool\Settings
You can find the aforementioned registry variable NoTipps under Options\StartingOptions. You can change the value of this variable using the right mouse button (reasonable values are 1 and 0 only, for showing and not showing the dialog, respectively).
In the following, the registry values used by CrypTool are listed as well as their default settings and their range of values:OrdChrOffset (0 or 1, default = 0):
PaddingDefaultChr (0 or 1, default = 1):
PaddingOwnChr (an ASCII character, considered only if PaddingDefaultChr = 1):
Uses the user-defined alphabet character for padding the Hill cleartext before the encryption.
EditKeyChrMatrix (0 or 1, default = 1):
2. Diffie-Hellman Key Exchange Protocol
ShowIntro (0 or 1, default = 1):
ShowInfo (0 or 1, default = 1):
3. Attack on the hash value of the digital signature
HashAlgorithmID (0 to 5, default = 0):
SignificantBitLength (1 to bit length of the selected hash function):
Number of bits in different documents that need to match after a collision search.
ModificationMethod (0 or 1, default = 1):
ModifyBlankEOL (0 or 1, default = 1, relevant only if ModificationMethod = 0):
ModifyDoubleBlank (0 or 1, default = 1, relevant only if ModificationMethod = 0):
ModifyCharSet (0 or 1, default = 0, relevant only if ModificationMethod = 1):
HarmlessFile (path, default = %cryptool%\original.txt):
Path of the harmless file.
DangerousFile (path, default = %cryptool%\fake.txt):
Path of the vicious file.
PerformTestRun (0 or 1, default = 0, only changeable in the registry):
If test runs are to be executed, the following variables are relevant:
MinimumLength (Number, default = 8): Minimum password length.
MinimumDigits (Number, default = 1): Minimum number of digits in the password.
MinimumSpecial (Number, default = 1): Minimum number of special characters in the password.
SpecialGroup (String, default = ^°!"§$%&/()=?´`\<>|,;:.-_#'+*~@): Special character set.
5. Generation of Random Numbers
GenerateBytes (Number, default = 2500): Length of the random output in byte.
ShowInternalRandState (0 or 1, default = 0):
RandSeed (String, default = 314159): Seed for initializing the number generators.
SelGenerator (Number between 0 and 3, default = 0):
Paramaters of the pseudorandom number generators
6. Secret Sharing Demonstration
ShowIntro (0 or 1, default = 1):
7. Side-channel attack on "Textbook RSA"
BitlengthSecret (Number, default = 128): Bit length of the RSA-encrypted secret.
Keyword (String, default = Alice): Keyword used to recognize successful decryptions.
ShowPermutationKey (0 or 1, default = 1):
ShowIntro (0 or 1, default = 1):
ShowIntro (0 or 1, default = 1):
NoTipps (0 or 1, default = 1):
SampleTextFile (0 or 1, default = 1):
Remark 1: Text options
The settings you make in the Text Options
dialog (like the alphabet) are not stored in the registry.
Remark 2: Internal key store
The content of the internal key storage
is not stored in the registry.
Remark 3: Options in the key entry dialogs and within the visualizations
The settings like showing a welcome dialog or not, are normally
stored in the registry.


Samuel L. Ipsum
(motherfucking placeholder text, motherfucker!)
Objective: Now that there is the Tec-9, a crappy spray gun from South Miami. This gun is advertised as the most popular gun in American crime. Do you believe that shit? It actually says that in the little book that comes with it: the most popular gun in American crime.
 But I can't give you this case, it don't belong to me.  This gun is advertised as the most popular gun in American crime. Do you believe that shit? It actually says that in the little book that comes with it: the most popular gun in American crime.  That's clear. Your cells react to bacteria and viruses differently than mine. You don't get sick, I do. That's also clear. But for some reason, you and I react the exact same way to water. We swallow it too fast, we choke. We get some in our lungs, we drown. However unreal it may seem, we are connected, you and I. We're on the same curve, just on opposite ends. |
|
I can do that |
Well, the way they make shows is, they make one show. That show's called a pilot. Then they show that show to the people who make shows, and on the strength of that one show they decide if they're going to make more shows. Some pilots get picked and become television programs. Some don't, become nothing. She starred in one of the ones that became nothing. |
|
Hold on to your butts |
My money's in that office, right?   She gonna tell me too.

- The path of the righteous man is beset on all sides by the iniquities of the selfish and the tyranny of evil men.
- Blessed is he who, in the name of charity and good will, shepherds the weak through the valley of darkness, for he is truly his brother's keeper and the finder of lost children.

- Now that there is the Tec-9, a crappy spray gun from South Miami.
- This gun is advertised as the most popular gun in American crime.
- Do you believe that shit? It actually says that in the little book that comes with it: the most popular gun in American crime.


REVIEW: GHOSTS OF MISSISSIPPI (1996) by Chris Webb copyright 1997
Cast: Alec Baldwin (Bobby De Laughter), Whoopi Goldberg (Myrlie Evers), James Woods (Byron De La Beckwith). Directed by Rob Reiner
"Ghosts of Mississippi" begins with a montage akin to very few other films. It is a movie with a purpose: we want Oscars. So, how to start a weak movie with high aspirations than to send up chilling images of the civil rights struggle in the United States with a gospel soundtrack. Very chilling, indeed.
Once you get to the meat of the movie though, it is hard not to notice the misguided storyline. I credit Rob Reiner, who said that he would never attempt to approach the story through the eyes of a black person, since he cannot portray those emotions as a white man. So, what we wind up with is a mildly entertaining, somewhat powerful, newsmagazine account of the trial lawyer who brings Medgar Evers' killer to justice after more than thirty years.
Alec Baldwin portrays Bobby DeLaughter (fresh off his deep Southerner in "Heaven's Prisoners") who, as a white man, undertook the unpopular task of imprisoning Byron De la Beckwith (James Woods) after he went free from numerous mistrials. We search for his reasoning to do this, since he is financially stable as a result of his father-in-law, a racist judge. Is it for poilitical aspirations or because it is the decent and right thing to do?
These are questions that Myrlie Evers (Whoopi Goldberg) seeks to have answered, as well. She doesn't trust Bobby as much as she trusts any white man, since those are the people who have let Beckwith run free for so long. Unfortunately, here is where Reiner loses the reins.
If he cannot make a movie about the black experience, he could at least make Myrlie a more central figure. Scenes between Goldberg and Baldwin are surprisingly intense, as we watch the progression from wariness to trust. Instead, the movie chooses to focus on Bobby's home life and the fact that his wife is as much of a racist as her father. She leaves him for a while, and Bobby makes a mistake while taking care of the kids alone. Instead of telling him that racism is out-an-out wrongdoing, he skirts the issue. This shows a fear to make a statement.
Maybe, now, its true, as Beckwith states, that "[y]ou'll never get a jury in the state of Mississippi to convict a white man for killing" a black man. Its because no white man, not even our heroes, can face up to the idea that racism is bad. So, Woods prevails in the end, even though his character is convicted. He remains the one memorable character in the movie, yet doesn't he always make his scenes great? His nomination was well earned.
I would have liked "Ghosts of Mississippi" to have been the Myrlie Evers story. It would have been more compelling and hit home much harder.
My grade: B-
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


REPERTOIREMAP
Section: Linux User Manual (5)
Updated: 2014-06-02
Index
Return to Main Contents
NAME
repertoiremap - map symbolic character names to Unicode code points
DESCRIPTION
A repertoire map defines mappings between symbolic character names and
Unicode code points when compiling a locale with
localedef(1).
Using a repertoire map is optional, it is only needed when symbolic
names are used instead of now preferred Unicode code points.
Syntax
The repertoiremap file starts with a header that may consist of the
following keywords:
- <comment_char>
-
is followed by a character that will be used as the
comment character for the rest of the file.
It defaults to the number sign (#).
- <escape_char>
-
is followed by a character that should be used as the escape character
for the rest of the file to mark characters that should be interpreted
in a special way.
It defaults to the backslash (\).
The mapping section starts with the keyword
CHARIDS
in the first column.
The mapping lines have the following form:
- <symbolic-name> <code-point> <comment>
-
This defines exactly one mapping,
<comment>
being optional.
The mapping section ends with the string
END CHARIDS.
FILES
- /usr/share/i18n/repertoiremaps
-
Usual default repertoire map path.
CONFORMING TO
POSIX.2.
NOTES
Repertoire maps are deprecated in favor of Unicode code points.
SEE ALSO
locale(1),
localedef(1),
charmap(5),
locale(5)
Index
- NAME
-
- DESCRIPTION
-
- Syntax
-
- FILES
-
- CONFORMING TO
-
- NOTES
-
- SEE ALSO
-
This document was created by
man2html,
using the manual pages.
Time: 02:55:20 GMT, September 18, 2014