|<EMAIL_ADDRESS>| |
| Phone | 123456789 |
| Address | 114 abc buiding, near xyz road |
Android phone based users can install an application from the website of the Government.
A user can access the service by sending the SMS.
A special five digit code is provided for accessing the service by operators such as Aircel, Airtel, BSNL, Idea, MTS, Reliance, Tata Docomo, Tata Indicom, Uninor, Videocon and Vodafone.
In order to access the services through SMS, Voters must send a pre-formatted SMS with a word “ECI” followed by details such as name, name of father/husband, locality, age or date of birth and gender separated by commas. As an example, an SMS “ECI Sumit Bhattacharjee” would fetch the details of a voter by name “Sumit bhattacharjee” on a nation-wide search of voters.


|
Iris Raytracing
Raytracing Library
|
Classes | |
| class | AdaptiveSampler |
| class | Aggregator |
| class | Camera |
| class | Composer |
| class | Configuration |
| class | ConfigurationLoader |
| class | GaussianAggregator |
| class | Geometry |
| class | Image |
| class | JitterSampler |
| class | LambertMaterial |
| class | Light |
| class | Material |
| class | MirrorMaterial |
| class | NaiveSampler |
| class | NaiveTracer |
| class | Object3D |
| class | PathTracer |
| class | PlaneGeometry |
| class | RandomSampler |
| class | Ray |
| class | Raycast |
| class | Raytracer |
| class | Sampler |
| class | Scene |
| class | SphereGeometry |
| class | SphereLight |
| class | Texture |
| class | UniformAggregator |
| class | XMLConfigurationLoader |
Functions | |
| bool | solve_quadratic (float a, float b, float c, float &x0, float &x1) |
| template<typename Value , typename Iterator > | |
| Value | average (Iterator begin, Iterator end) |
| template<typename Value , typename ValueIterator , typename WeightIterator > | |
| Value | weighted_average (ValueIterator value_begin, ValueIterator value_end, WeightIterator weight_begin) |
| float | gaussian_2d (float x, float y, float x0, float y0, float sigma_x, float sigma_y, float A) |
| float | gaussian_2d_isotropic (float x, float y, float x0, float y0, float sigma) |
| void | to_cartesian (float inclination, float azimuth, float &x, float &y, float &z) |
| float | form_factor (const Vector3 &a, const Vector3 &Na, const Vector3 &b, const Vector3 &Nb) |
| Computes the form factor (also known as G) between two points. More... | |
| std::vector< std::string > & | split (const std::string &string, char delimeter, std::vector< std::string > &elements) |
| std::vector< std::string > | split (const std::string &string, char delimeter) |
AdaptiveSampler abstract class.
Sample aggregation methods.
Camera class.
Composer class.
ConfigurationLoader abstract class.
Geometry abstract class.
Image class.
JitterSampler abstract class.
Lambertian material.
Light abstract class.
Material abstract class.
Math utility methods.
Matrix type definitions.
Mirror material.
NaiveSampler class.
NaiveTracer class.
Object3D class.
PathTracer class.
Plane geometry class.
Random utility methods.
RandomSampler class.
Ray class.
Ray operations.
Raycast class.
Raytracer abstract class.
Sampler abstract class.
Scene class.
Sphere geometry class.
SphereLight class.
Texture class.
Vector type definitions.
XMLConfigurationLoader class.
| Value iris::average | ( | Iterator | begin, |
| Iterator | end | ||
| ) |
Computes the average value of a collection.
| float iris::form_factor | ( | const Vector3 & | a, |
| const Vector3 & | Na, | ||
| const Vector3 & | b, | ||
| const Vector3 & | Nb | ||
| ) |
Computes the form factor (also known as G) between two points.
| a | Point A. |
| Na | Surface normal at A. |
| b | Point B. |
| Nb | Surface normal at B. |
| float iris::gaussian_2d | ( | float | x, |
| float | y, | ||
| float | x0, | ||
| float | y0, | ||
| float | sigma_x, | ||
| float | sigma_y, | ||
| float | A | ||
| ) |
Evaluates 2D gaussian.
f(x, y) = A * exp(-a)
Where: a = a_x + a_y a_x = ((x - x0)^2) / (2 * (s_x)^2) a_y = ((y - y0)^2) / (2 * (s_y)^2)
| float iris::gaussian_2d_isotropic | ( | float | x, |
| float | y, | ||
| float | x0, | ||
| float | y0, | ||
| float | sigma | ||
| ) |
Evalutes 2D isotrpic gaussian.
| bool iris::solve_quadratic | ( | float | a, |
| float | b, | ||
| float | c, | ||
| float & | x0, | ||
| float & | x1 | ||
| ) |
Solves the quadratic equation ax^2 + bx + c = 0
| [out] | x0 | First root. |
| [out] | x1 | Second root. |
| void iris::to_cartesian | ( | float | inclination, |
| float | azimuth, | ||
| float & | x, | ||
| float & | y, | ||
| float & | z | ||
| ) |
Computes cartesian coordinates from spherical.
| Value iris::weighted_average | ( | ValueIterator | value_begin, |
| ValueIterator | value_end, | ||
| WeightIterator | weight_begin | ||
| ) |
Computes the weighted average value of a collection.


General Information
Provides information on various gameplay aspects and mechanics.
Weapon Mechanics
Provides information on Battlefield V weapons and weapon mechanics.
Weapon Charts
Displays the individual attributes of each weapon in Battlefield V.
Weapon Comparison
Compare the multiple weapons against one another with damage, BTK, and TTK charts.
Equipment Data
Displays the data behind
soldier equipment in Battlefield V.


AWS::KMS::Alias
The AWS::KMS::Alias
resource specifies a display name for a KMS key.
You can use an alias to identify a KMS key in the AWS KMS console, in the DescribeKey
operation, and in cryptographic
operations, such as Decrypt and GenerateDataKey.
Adding, deleting, or updating an alias can allow or deny permission to the KMS key. For details, see ABAC for AWS KMS in the AWS Key Management Service Developer Guide.
Using an alias to refer to a KMS key can help you simplify key management. For example, an alias in your code can be associated with different KMS keys in different AWS Regions. For more information, see Using aliases in the AWS Key Management Service Developer Guide.
When specifying an alias, observe the following rules.
-
Each alias is associated with one KMS key, but multiple aliases can be associated with the same KMS key.
-
The alias and its associated KMS key must be in the same AWS account and Region.
-
The alias name must be unique in the AWS account and Region. However, you can create aliases with the same name in different AWS Regions. For example, you can have an
alias/projectKey
in multiple Regions, each of which is associated with a KMS key in its Region. -
Each alias name must begin with
alias/
followed by a name, such asalias/exampleKey
. The alias name can contain only alphanumeric characters, forward slashes (/), underscores (_), and dashes (-). Alias names cannot begin withalias/aws/
. That alias name prefix is reserved for AWS managed keys.
Regions
AWS KMS CloudFormation resources are available in all AWS Regions in which AWS KMS and AWS CloudFormation are supported.
Syntax
To declare this entity in your AWS CloudFormation template, use the following syntax:
JSON
{ "Type" : "AWS::KMS::Alias", "Properties" : { "AliasName" :
String
, "TargetKeyId" :String
} }
YAML
Type: AWS::KMS::Alias Properties: AliasName:
String
TargetKeyId:String
Properties
AliasName
-
Specifies the alias name. This value must begin with
alias/
followed by a name, such asalias/ExampleAlias
.Note If you change the value of the
AliasName
property, the existing alias is deleted and a new alias is created for the specified KMS key. This change can disrupt applications that use the alias. It can also allow or deny access to a KMS key affected by attribute-based access control (ABAC).The alias must be string of 1-256 characters. It can contain only alphanumeric characters, forward slashes (/), underscores (_), and dashes (-). The alias name cannot begin with
alias/aws/
. Thealias/aws/
prefix is reserved for AWS managed keys.Pattern:
^alias/[a-zA-Z0-9/_-]+$
Minimum:
1
Maximum:
256
Required: Yes
Type: String
Update requires: Replacement
TargetKeyId
-
Associates the alias with the specified customer managed key. The KMS key must be in the same AWS account and Region.
A valid key ID is required. If you supply a null or empty string value, this operation returns an error.
For help finding the key ID and ARN, see Finding the key ID and ARN in the AWS Key Management Service Developer Guide.
Specify the key ID or the key ARN of the KMS key.
For example:
-
Key ID:
1234abcd-12ab-34cd-56ef-1234567890ab
-
Key ARN:
arn:aws:kms:us-east-2:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab
To get the key ID and key ARN for a KMS key, use ListKeys or DescribeKey.
Required: Yes
Type: String
Minimum:
1
Maximum:
2048
Update requires: No interruption
-
Return values
Ref
When you pass the logical ID of this resource to the intrinsic Ref
function, Ref
returns the alias name, such as alias/exampleAlias
.
For more information about using the Ref
function, see Ref.
Examples
Create an alias
The following examples create the alias/exampleAlias
alias for a KMS key. The
KMS key is identified by a reference to its CloudFormation resource name. Before using these
examples, replace the example target key ID and example alias with valid values.
JSON
{ "myAlias": { "Type": "AWS::KMS::Alias", "Properties": { "AliasName": "alias/exampleAlias", "TargetKeyId": { "Ref": "myKey" } } } }
YAML
myAlias: Type: 'AWS::KMS::Alias' Properties: AliasName: alias/exampleAlias TargetKeyId: !Ref myKey
See also
-
CreateAlias in the AWS Key Management Service API Reference.
-
Using aliases in the AWS Key Management Service Developer Guide.
-
ABAC for AWS KMS in the AWS Key Management Service Developer Guide.


It's just HTML, CSS and JavaScript isn't it?
Web development is easy isn't it? After all it is just the open standards of HTML, CSS and JavaScript.
That's roughly the same fallacy as to say: It's easy to write a great novel, since it is just words and grammar.
The simple reason: It is hard.
I'll outline my very opinonate version of what skills you need for mastery of front-end programming. The list doesn't include the skills to figure out what to program, just how. So here it goes:
Those are the tools to mastery, when you just want HTML, CSS and JavaScript
That's roughly the same fallacy as to say: It's easy to write a great novel, since it is just words and grammar.
The simple reason: It is hard.
I'll outline my very opinonate version of what skills you need for mastery of front-end programming. The list doesn't include the skills to figure out what to program, just how. So here it goes:
Introduction
Jeffry Veen, who'm I had the pleasure to meet in Hong Kong once, summarized it nicely in his book: The Art and Science of Web Design already in 2000: " HTML provides structure, CSS layout and JavaScript behavior". Like English, development needs a style guide (and the mastery of it), web development has several guides, besides the plain definitions mentioned in the beginning.HTML
- The standard today is HTML5. So ignore any screams "But it must run in IE6" and see what HTML5 can do. There's a handy list of compatible elements you can check for reference
- The predominant guideline for structure is Twitter bootstrap. It defines a layout and structure language, so your page structures become understandable by many developers. Twitter bootstrap contains CSS and JavaScript too, since they are intertwined
- If you don't like Bootstrap, there are other options, but you have been warned
- The other HTML structure to look at is the Ionic framework. Again it has more than HTML only
CSS
Most frameworks include CSS, so when you picked one above, you are pretty much covered. However understanding it well takes a while, so you can modify the template you started with. My still favourite place to get a feel for the power of CSS is CSS Zengarden. The W3C provides a collection of links to tutorials to deepen your knowledge. My strong advice to the developers: don't touch it initially. Use a template. Once your application is functional, then revisit the CSS (or let a designer do that).JavaScript
Probably the most controversial part. IBM uses Dojo big time, ReactJS is gaining traction and there is Aurelia up and coming. So there's lot to watch out for. But that is not where you get started.- Start learning JavaScript including ES6. Some like CoffeeScript too, but not necessarily for starters
- The most popular core library is jQuery, so get to know it. The
$
operator is quite convenient and powerful - To build MVC style single page applications I recommend to use AngularJS. It has a huge body of knowledge, a nice form module and an active community. Version 2.0 will have a huge boost in performance too. Make sure you know John Papa's style guide and follow it
- And again: have a look at Ionic and Cordova (used in Ionic) for mobile development. It uses AngularJS under the hood
Templates
With all the complexity around, you don't have to start from scratch. There are plenty of templates around, that, free or a little fee, give you a head start. Be very clear: they are an incredible resource when you know how all is working together, but they don't relieve you from learning the skill. Here are my favourites- Angular Admin fuses a Bootstrap based structure with AngularJS behaviour
- A commercial version with additional features
- Ionic Starter App with lots of sample screens
- Material Design for Ionic
Tools and resources
Notepad is not a development tool. There are quite some you need if you want to be productive- You need a capable editor, luckily you have plenty of choices or you opt for one or the other IDE
- Node.js: a JavaScript runtime based on Google's V8 engine. It provides all runtime for all the other tools. If you don't have a node.js installation on your developer workstation, where were you hiding the last 2 years?
- Bower: a dependency manager for browser files like CSS, JS with their various frameworks. You add a depencency (e.g. Bootstrap) to the
bower.json
file and Bower will find the right version for you - Grunt: a task runner application, used for assembly of web sites/applications (or any other stuff). Configured using a
Gruntfile.js
: it can do all sorts of steps like: copy files, combine and minify, check code quality, run tests etc. - Yeoman: A application scaffolding tool. It puts all the tools and needed configurations together. It uses generators to blueprint different applications from classic web, to reveal application to mobile hybrid apps. The site lists hundreds of generators and you are invited to modify them or roll your own. I like generator-angularand mcfly
- GIT: the version control system. Use it from the command line, your IDE or a version control client
- Watch NPM for new development
Those are the tools to mastery, when you just want HTML, CSS and JavaScript
Posted by Stephan H Wissel on 13 November 2015 | Comments (3) | categories: Software


new TownProvider()
Creates new instance of TownProvider.
- Source:
Methods
-
getNextTown(currentTown, direction) → {Object}
-
Retrieves next destination along with next direction for a vehicle based on current town it's in and its current direction.
Parameters:
Name Type Description currentTown
Object current town the vehicle is in direction
Object current direction of the vehicle - Source:
Returns:
destination town for the vehicle and its next direction along the line- Type
- Object
-
getTownByName(townName) → {Town}
-
Returns town based on the town name given or null if town does not exits.
Parameters:
Name Type Description townName
String searched town name - Source:
Returns:
found town or null- Type
- Town
-
loadTowns(filePath)
-
Allows to load towns array into the provider.
Parameters:
Name Type Description filePath
String path to the JSON file containing the array of towns - Source:


|
PRAgMaTIc
master
|
Functions | |
| def | bnderror |
| def | adv_convergence |
| def adv_convergence.adv_convergence | ( | width = 2e-2 , |
|
delta = 1e-2 , |
|||
relp = 1 , |
|||
Nadapt = 10 , |
|||
use_adapt = True , |
|||
problem = 3 , |
|||
outname = '' , |
|||
use_reform = False , |
|||
CGorderL = [2 , |
|||
noplot = False , |
|||
Lx = 3. |
|||
| ) |
Definition at line 41 of file adv_convergence.py.
| def adv_convergence.bnderror | ( | u, | |
| ue, | |||
| ds | |||
| ) |
Definition at line 32 of file adv_convergence.py.


This is my webpage
What do you think of it?
Hello
how
are
you?
What
are
you up to
today
Animals that I like
Cats
Dogs
Snails
Cats
Dogs
Snails
This is my link


Directives
The simplest way to think about a directive is that it is simply a function that we run on a
particular DOM element. The directive function can provide extra functionality on the element.
Built in Directives
- ng-href
- ng-src
- ng-disabled
- ng-checked
- ng-readonly
- ng-selected
- ng-class
- ng-style
Custom Directives
A directive is defined using the .directive() method, one of the many methods available on
our application’s Angular module.
The myDirective directive definition looks like:
angular.module('myApp', [])
directive('myDirective', function() {
return {
restrict: 'E',
template: '
Click me to go to Google'
}
});
Invoking the directive
- element (E)
- an attribute (A)
- a class (C)
- a comment (M)
For example
restrict: 'EAC'


This is an example page. Read the correspoinding blog article on www.taccgl.org.
This second example also has a background image that scrolls slower than the text. In contrast to the first example perpective shrinking of the image is compensated for.
This example 2 is implemented using the computers 3D graphic hardware. It defines the background image to be a 3D object located 5000 pixels behind the text. The image is enlarged in order to compensate for the perpective shrinking. Also the virtual users eye position moves down while scrolling down. This automatically leads to the desired parallax scrolling effect.


{% if responses %}
Replies:
{% for reply in responses %}
{% endif %}
{{ jinja_thread_reply(reply) }}
{% endfor %}
Add your reply:


- A Message From Warren E. Buffett
- Annual & Interim Reports Updated August 7, 2015
- Special Letters From Warren & Charlie RE:Past, Present and Future
- Link to SEC Filings
- Links to Berkshire Subsidiary Companies
- Corporate Governance
- Owner's Manual
- Letters from Warren E. Buffett Regarding Pledges to Make Gifts of Berkshire Stock
- News Releases Updated August 10, 2015
- Warren Buffett's Letters to Berkshire Shareholders Updated February 28, 2015
- Charlie Munger's Letters to Wesco Shareholders
- Annual Meeting Information
- Celebrating 50 Years of a Profitable Partnership (A commemorative book first sold at the 2015 Annual Meeting and now for sale on eBay.)
- A Comparative Rights and Relative Prices of Class A and B Stock
- Berkshire Activewear
FOR A FREE CAR INSURANCE RATE QUOTE THAT COULD SAVE YOU SUBSTANTIAL MONEY WWW.GEICO.COM OR CALL 1-888-395-6349, 24 HOURS A DAY
If you have any comments about our WEB page, you can either write us at the address shown above or e-mail us at<EMAIL_ADDRESS>However, due to the limited number of personnel in our corporate office, we are unable to provide a direct response.


Search tokens
| Token | Age | Code | Owner | Seller | Holders | Liquidity | Channels | Links |
|---|---|---|---|---|---|---|---|---|
| FlokiPop | 00:00:28 | 0 | ||||||
| TestDontBuy | 00:00:31 | 0 | ||||||
| FlokiPop | 00:00:28 | 0 | ||||||
| TestDontBuy | 00:00:31 | 0 | ||||||
| FlokiPop | 00:00:28 | 0 | ||||||
| TestDontBuy | 00:00:31 | 0 | ||||||
| FlokiPop | 00:00:28 | 0 | ||||||
| TestDontBuy | 00:00:31 | 0 | ||||||
| FlokiPop | 00:00:28 | 0 | ||||||
| TestDontBuy | 00:00:31 | 0 | ||||||
| FlokiPop | 00:00:28 | 0 | ||||||
| TestDontBuy | 00:00:31 | 0 | ||||||
| FlokiPop | 00:00:28 | 0 | ||||||
| TestDontBuy | 00:00:31 | 0 | ||||||
| FlokiPop | 00:00:28 | 0 | ||||||
| TestDontBuy | 00:00:31 | 0 |


- 2
-
3
You have 3 new notifications view all
Aglae Mayer
Hey I am waiting for you... 3:15 PMAglae Mayer
When you can connect with me... 3:15 PMAglae Mayer
I missed you so much... 3:15 PMAglae Mayer
Your product is completely Ready... 3:15 PMAglae Mayer
Hey I am waiting for you... 3:15 PMAglae Mayer
Hey I am waiting for you... 3:15 PMAglae Mayer
Hey I am waiting for you... 3:15 PM


Gen3 PyStata Workspace
About
User license workspace
Users with their own active Stata licenses are encouraged to
use the bring-your-own-license Stata workspace.
This workspace is equipped to run Stata code in a Jupyter notebook
environment using a user-provided license.
As a one-time step, workspace users should add their license files
in their persistant workspace storage as
~/pd/stata.lic
The notebook has a few lines of python code to check for the
license file and copy it to the appropriate location so that Stata can recognize it.
Gen3 license workspace
This workspace is equipped to run Stata code in a Jupyter notebook environment using a shared Gen3 license.
Please note, the Stata software and license used in this workspace are private,
and belong to the Center for Translational Data Science at the University of Chicago.
They are not to be copied or used outside of this workspace.
Usage
For detailed information on running Stata code from within Jupyter notebooks,
please see the
Stata documentation.


Reference Sheet:
Basic Moves
Reference Sheet:
Peripheral Moves
Reference Sheet:
Battle Moves
Reference Sheet:
Vehicle Moves
Reference Sheet:
Vehicle/Building Harm Moves
Reference Sheet:
Looks and Drives
{{ref.section}}
{{ref.subtitle}}
Reference Sheet


You’ve used
815 GB
of your storage
0 GB
1000 GB
185
GB Left
Challenge by
Frontend Mentor
. Coded by
Habeebullahi
.


A single directed edge consisting of a source id, target id, and the data associated with the edge.
A single directed edge consisting of a source id, target id, and the data associated with the edge.
type of the edge attribute
The vertex id of the source vertex
The vertex id of the target vertex
The attribute associated with the edge
Represents an edge along with its neighboring vertices and allows sending messages along the edge.
Represents an edge along with its neighboring vertices and allows sending messages along the edge. Used in Graph#aggregateMessages.
The direction of a directed edge relative to a vertex.
EdgeRDD[ED, VD]
extends RDD[Edge[ED]]
by storing the edges in columnar format on each
partition for performance.
EdgeRDD[ED, VD]
extends RDD[Edge[ED]]
by storing the edges in columnar format on each
partition for performance. It may additionally store the vertex attributes associated with each
edge to provide the triplet view. Shipping of the vertex attributes is managed by
impl.ReplicatedVertexView
.
An edge triplet represents an edge along with the vertex attributes of its neighboring vertices.
An edge triplet represents an edge along with the vertex attributes of its neighboring vertices.
the type of the vertex attribute.
the type of the edge attribute
The Graph abstractly represents a graph with arbitrary objects associated with vertices and edges.
The Graph abstractly represents a graph with arbitrary objects associated with vertices and edges. The graph provides basic operations to access and manipulate the data associated with vertices and edges as well as the underlying structure. Like Spark RDDs, the graph is a functional data-structure in which mutating operations return new graphs.
the vertex attribute type
the edge attribute type
GraphOps contains additional convenience operations and graph algorithms.
Contains additional functionality for Graph.
Contains additional functionality for Graph. All operations are expressed in terms of the efficient GraphX API. This class is implicitly constructed for each Graph object.
the vertex attribute type
the edge attribute type
Integer identifier of a graph partition.
Integer identifier of a graph partition. Must be less than 2^30.
Represents the way edges are assigned to edge partitions based on their source and destination vertex IDs.
A 64-bit vertex identifier that uniquely identifies a vertex within a graph.
A 64-bit vertex identifier that uniquely identifies a vertex within a graph. It does not need to follow any ordering or any constraints other than uniqueness.
Extends RDD[(VertexId, VD)]
by ensuring that there is only one entry for each vertex and by
pre-indexing the entries for fast, efficient joins.
Extends RDD[(VertexId, VD)]
by ensuring that there is only one entry for each vertex and by
pre-indexing the entries for fast, efficient joins. Two VertexRDDs with the same index can be
joined efficiently. All operations except reindex preserve the index. To construct a
VertexRDD
, use the VertexRDD object.
Additionally, stores routing information to enable joining the vertex attributes with an EdgeRDD.
the vertex attribute associated with each vertex in the set.
Construct a VertexRDD
from a plain RDD:
// Construct an initial vertex set val someData: RDD[(VertexId, SomeType)] = loadData(someFile) val vset = VertexRDD(someData) // If there were redundant values in someData we would use a reduceFunc val vset2 = VertexRDD(someData, reduceFunc) // Finally we can use the VertexRDD to index another dataset val otherData: RDD[(VertexId, OtherType)] = loadData(otherFile) val vset3 = vset2.innerJoin(otherData) { (vid, a, b) => b } // Now we can construct very fast joins between the two sets val vset4: VertexRDD[(SomeType, OtherType)] = vset.leftJoin(vset3)
A set of EdgeDirections.
The Graph object contains a collection of routines used to construct graphs from RDDs.
Provides utilities for loading Graphs from files.
Collection of built-in PartitionStrategy implementations.
Implements a Pregel-like bulk-synchronous message-passing API.
Implements a Pregel-like bulk-synchronous message-passing API.
Unlike the original Pregel API, the GraphX Pregel API factors the sendMessage computation over edges, enables the message sending computation to read both vertex attributes, and constrains messages to the graph structure. These changes allow for substantially more efficient distributed execution while also exposing greater flexibility for graph-based computation.
We can use the Pregel abstraction to implement PageRank:
val pagerankGraph: Graph[Double, Double] = graph // Associate the degree with each vertex .outerJoinVertices(graph.outDegrees) { (vid, vdata, deg) => deg.getOrElse(0) } // Set the weight on the edges based on the degree .mapTriplets(e => 1.0 / e.srcAttr) // Set the vertex attributes to the initial pagerank values .mapVertices((id, attr) => 1.0) def vertexProgram(id: VertexId, attr: Double, msgSum: Double): Double = resetProb + (1.0 - resetProb) * msgSum def sendMessage(id: VertexId, edge: EdgeTriplet[Double, Double]): Iterator[(VertexId, Double)] = Iterator((edge.dstId, edge.srcAttr * edge.attr)) def messageCombiner(a: Double, b: Double): Double = a + b val initialMessage = 0.0 // Execute Pregel for a fixed number of iterations. Pregel(pagerankGraph, initialMessage, numIter)( vertexProgram, sendMessage, messageCombiner)
The VertexRDD singleton is used to construct VertexRDDs.
Various analytics functions for graphs.
Collections of utilities used by graphx.
ALPHA COMPONENT GraphX is a graph processing framework built on top of Spark.


| DOSE: |
711 mg |
oral |
DXM |
(liquid) |
I've been curious about the dissociative experience for a while. The notion of being cut away from my senses to live in a world of mind alone intrigued me, and the possibility of encountering alien entities and vistas seemed interesting. Accounts I had read in William White's FAQ had a very Lovecraftian tone, albeit much more benign, and I found that to be a particularly alluring facet of the DXM experience. I thought it might give me some insight into Lovecraft's writing and into the work of other artists preoccupied with alien form, motive, and substance (Giger comes to mind).
After a particularly profound, transformative DPT experience (see
Nihilist Mysticism), dissociatives began to interest me for other reasons as well. My essentially mystical contact with the concept of death made me wonder: people on dissociatives often seem to be indifferent to whether they die. Why? What is it about the experience which seems to destroy our practically instinctual fear of dying?
I thought a high-dose DXM experience (third or fourth plateau) could serve as a sort of allegorical death; dissociation would represent the cleavage of mind from body. The question that preoccupied me was this: if it's possible to look at dissociation as a death-like state, what does that imply about the mind? What can we learn about where the mind goes after death from the dissociative experience? Philosophically this is a bit suspect - I don't even know if I believe in the idea that the mind persists after death - but it's something I'd like to explore more in the future.
In short, my interest in dissociatives stemmed partly from desire for more mundane insight (deepening my essential understanding of certain works of art) and partly from a fundamental philosophical curiosity. Although the experience that follows didn't shed light on art at all, it illuminated certain aspects of using the dissociative experience as a model for death; it also made clear to me that I don't want to repeat the DXM experience - at least not at the same dose and in the same form. Any further exploration with dissociatives on my part will probably begin with ketamine instead.
Without further ado, here's what went down:
I picked up a 237 mL bottle of 3 mg/mL Robitussin Maximum Strength cough syrup a few weeks back. I have a strong stomach, so I was pretty sure I would be able to handle the miniscule amount of alcohol and the thickening agents. My plan was to drink the entire thing using the method laid out in White's FAQ; if you do the math, that turns out to be 711 mg of DXM. I weigh about 55 kg, so that works out to 12.9 mg/kg, a high third plateau to low fourth plateau dose.
I got around to doing this last Friday around 3 PM, when a friend, L, came over. L has previous experience with dissociatives, and we've tried many different substances together, so I asked him to be my sitter. He readily agreed. My set was fairly gloomy; I had performed disappointingly on a test that morning, and the grey weather and slushy streets that had persisted all winter were really starting to get me down. I was excited about the experience, though, and felt it wouldn't affect things appreciably. My setting would be my comfortably furnished room; I planned to stay in bed the whole time.
As L and another friend looked on, I slammed the bottle of syrup as quickly as possible (I had been eating some crackers and french fries shortly before to dampen the shock to my kidneys). I decided to lie down so that once the experience began in earnest I would be safe; L sat down in my easy chair and kept me company. Another friend, W, came in and started playing Animal Crossing, and I was happy to have the pleasantly repetitive music lull me into what I was sure would be an amazing experience.
After about an hour, I wasn't feeling anything except for a little queasiness, and I was burping a bit. L walked off for a while, leaving me in the room with W.  Although I thought this would probably terminate the experience, I was sorely mistaken.
Within about two hours I was feeling faint, and my sense of touch began to deaden - I could still feel myself touch things if I concentrated, but it took a lot of effort. Soon my sense of touch became too unreliable - I felt what I suppose were sensory echoes instead of actual sensations - and I began periodically asking L if my heart had stopped. I would ask him this question multiple times throughout the afternoon and evening.
This question was motivated by a feeling of both apprehension and invincibility; in fact, this is the only part of the experience which was relevant to my philosophical questions about why dissociatives destroy fear of death - in me, anyway. I was so convinced that death would be identical to the state I was in that, were I to die, it would simply be permanent dissociation. I'm definitely not convinced of that now, but it's one of myriad disturbing hypotheses about what occurs at and after the moment of
death.
After an hour or two of feeling uncomfortably anesthetized, I somehow hauled my body out of bed to the bathroom, L in tow. I slumped to the ground next to the toilet and started retching my guts out. The rest of the experience is very much a blur, but the general outline is this: L sat on the floor reading and checking on me while I passed in and out of consciousness and the dissociated state. Every once in a while I would either spit some phlegm or continue vomiting. The entire time this was happening, I hallucinated about the slushy streets of the city; I had endless visions of looking down on a wet patch of road.
An hour and a half or so later, I felt better and got up. L was relieved, because at one point I had passed out for a few minutes; between that and the fact that my pupils were asymmetric, he thought I may have suffered some brain damage. I dragged myself into bed nevertheless and went to sleep.
When I woke up it was around 9 PM, I was still very intoxicated; in fact, I felt quite brain damaged. I got up anyway, and walked around the dorm for a bit. I was highly amused by the robowalk; I felt as though all of my limbs had 8 joints which wobbled and rippled as I moved. Onlookers later told me that I was walking perfectly normally but extremely slowly, which seems to contradict the description of the classical robowalk (huge, flowing motions). This provoked some comment and some concern, but I had already started to feel more normal, so I wasn't too worried.
Finally, I went to sleep. When I woke up again the next day, I definitely felt unmotivated. I also felt acutely for maybe the first time that perhaps my approach to exploring the wide world of psychoactive substances was getting a bit self-destructive. After all, what if I *had* suffered a brain hemorrhage?
With that in mind, I've resolved to consider dosages a little more carefully when trying new substances in the future. More importantly, I've decided to tone down the frequency with which I go tripping. I wouldn't want tripping to become a commonplace, humdrum thing, and this way my weekends won't fall into a pattern of tripping and recuperating.
Even so, I'm excited about what lies around the corner. There are so many interesting substances to try, and they promise *such* a depth and variety of experience. One unpleasant trip lacking in insight out of a large number of joyful, informative, and transformative ones isn't that bad. And now that I'll be spending less time tripping, I'll get to sample new and different experiences *outside* of my head. The future is bright.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


About Me #
Hi I'm Shane! Welcome and thanks for visiting. I'm a developer who graduated from Oregon State University in the Fall of 2022 with a B.S. in Computer Science. My interests include backend development and engineering, cloud engineering, DevOps practices, webapps, and cybersecurity.
I mostly work in:
- Python 🐍
- Flask
- C
- JavaScript
- Linux
- Docker/Podman
- AWS
I love learning and solving problems. Learning how to learn has been one of the greatest experiences I've had and I am always interested in improving!
Currently I'm working on getting more skilled with: AWS, studying for AWS CSAA


Even a simplest C/C++ program just printing "Hello World" needs to include system headers. Consider:
#include <stdio.h> #include <stdlib.h> int main(void) { puts("!!!Hello World!!!"); return EXIT_SUCCESS; }
Indexer needs to be able to find headers stdio.h and stdlib.h and parse them to provide accurate index. In this example, the headers define prototype of function puts and macro EXIT_SUCCESS.
CDT will try to discover include paths and preprocessor symbols automatically for supported toolchains. There are 2 main ways to discover those:
CDT uses Language Settings Providers to discover the settings (starting with version CDT 8.1). Typically Language settings Providers are specialized. One will provide built-in compiler settings and another one settings detected by Build output Parser. There is also an extension point defined in CDT to allow third party Eclipse plugins to contribute custom Language Settings Providers.
The setting entries found by Scanner Discovery can be inspected in project properties on "Preprocessor Include Paths, Macros etc." page. Each Language Settings Provider can be expanded to show the entries it discovered.
If information retrieved by auto-discovery is insufficient or the project deviates from a standard one supported by CDT a user can enter additional include paths and macros manually under "User Settings Entries".
The Project Explorer View provides a means to view some of the settings. The discovered include paths are shown under the project when "Includes" node is expanded.
Also, a "Wrench" overlay icon is shown for those file/folders where distinct entries are discovered which differ from those of parent folder. Wrench is not shown on project level.
In the example below, Hello.cpp was compiled with added -DHELLO compiler option.
After BOP discovery "Wrench" overlay is shown for this file.
The output of built-in compiler specs detectors can be inspected to troubleshoot problems running the command. To do so, enable checkbox "Allocate console in the Console View".
When checkbox "Allocate console in the Console View" is enabled, output of each run of the provider will be directed to a special console in the Console View.
Setting up include paths and macros for C/C++ indexer
C/C++ Preferences: Scanner Discovery
C/C++ Project properties: Preprocessor Include Paths, Macros, etc.


inputs/city_kurobe_shinkansen_ikuji_gtfs.zip
| Agencies: | 黒部市内路線バス |
|---|---|
| Routes: | 5 |
| Stops: | 16 |
| Trips: | 35 |
| Shapes: | 5 |
| Effective: | April 01, 2019 to March 31, 2020 |
| Average trips per date: | 20 |
|---|---|
| Most trips on a date: | 25, on 40 service dates (Thu May 02, Tue May 07, Wed May 08, ...) |
| Least trips on a date: | 10, on 20 service dates (Fri May 03, Sat May 04, Sun May 05, ...) |
| 1 error | ||
|
agency_url
agency.txt
| agency_id | agency_name | agency_url | agency_timezone | agency_lang | agency_phone | agency_fare_url |
|---|---|---|---|---|---|---|
|<PHONE_NUMBER>462 | 黒部市内路線バス | ＨＰなし | Asia/Tokyo | ja | 0765-54-8671 |


default boolean |
FluentConditions.attribute(String name,
String value)
|
Check that the attribute has the given value.
|
boolean |
FluentConditions.className(String className)
|
Check that the class attribute has the given class name.
|
boolean |
FluentConditions.clickable()
|
Check that this element is visible and enabled such that you
can click it.
|
boolean |
StringConditions.contains(CharSequence charSequence) |
Check that this contains the given sequence of characters.
|
boolean |
RectangleConditions.dimension(int width,
int height) |
Check that rectangle has the given dimension.
|
boolean |
FluentConditions.displayed()
|
Check that this element is displayed.
|
boolean |
FluentConditions.enabled()
|
Check that this element is enabled.
|
boolean |
StringConditions.endsWith(String suffix)
|
Check that this ends with the given string.
|
boolean |
AbstractIntegerConditions.equalTo(int value)
|
Check that this is equal to given value
|
boolean |
StringConditions.equalTo(String anotherString)
|
Check that this is equal to with the given string.
|
boolean |
StringConditions.equalToIgnoreCase(String anotherString)
|
Check that this is equal to with the given string, ignoring
case.
|
boolean |
AbstractIntegerConditions.greaterThan(int value)
|
Check that this is greater than given value
|
boolean |
AbstractIntegerConditions.greaterThanOrEqualTo(int value)
|
Check that this is greater than or equal given value
|
boolean |
RectangleConditions.height(int height)
|
Check that rectangle has the given height.
|
default boolean |
FluentConditions.id(String id)
|
Check that this element has the given id.
|
boolean |
AbstractIntegerConditions.lessThan(int value)
|
Check that this is less than given value
|
boolean |
AbstractIntegerConditions.lessThanOrEqualTo(int value)
|
Check that this is less than or equal given value
|
boolean |
StringConditions.matches(String regex)
|
Check that this matches the given regular expression
string.
|
boolean |
StringConditions.matches(Pattern pattern) |
Check that this matches the given regular expression
pattern.
|
default boolean |
FluentConditions.name(String name)
|
Check that this element has the given name
|
boolean |
RectangleConditions.position(int x,
int y) |
Check that rectangle has the given (x, y) position.
|
boolean |
RectangleConditions.positionAndDimension(int x,
int y,
int width,
int height) |
Check that rectangle has the given psition and dimension.
|
boolean |
FluentConditions.present()
|
Check that this element is present
|
boolean |
FluentListConditions.present()
|
Check that the currently validated element of this list is
present.
|
boolean |
FluentConditions.selected()
|
Check that this element is selected.
|
boolean |
FluentListConditions.size(int size)
|
Check that this element list has the given size.
|
boolean |
FluentConditions.stale() |
Check that this element is no longer attached to the DOM.
|
boolean |
StringConditions.startsWith(String prefix)
|
Check that this starts with the given string.
|
default boolean |
FluentConditions.tagName(String tagName)
|
Check that this element has the given tagName
|
default boolean |
FluentConditions.text(String text)
|
Check that this element has the given text.
|
default boolean |
FluentConditions.textContent(String anotherString)
|
Check conditions on this element text content.
|
default boolean |
FluentConditions.value(String value)
|
Check that this element has the given value
|
boolean |
Conditions.verify(Predicate<T> predicate)
|
Check that the given predicate is verified against this
condition object.
|
boolean |
FluentListConditions.verify(Predicate<FluentWebElement> predicate,
boolean defaultValue) |
Check that the given predicate is verified.
|
boolean |
RectangleConditions.width(int width)
|
Check that rectangle has the given width.
|
boolean |
RectangleConditions.x(int x)
|
Check that rectangle has the given x position.
|
boolean |
RectangleConditions.y(int y)
|
Check that rectangle has the given y position.
|


Top: Basic types: string: Conversion
#include <ptypes.h> string itostring(<ordinal> value); string itostring(<ordinal> value, int base, int width = 0, char pad = ' '); large stringtoi(const string& s); large stringtoie(const string& s); ularge stringtoue(const string& s, int base); string lowercase(const string& s);
PTypes provides 3 different string-to-int conversion functions: stringtoi(),
stringtoie() and stringtoue().
The first function stringtoi() is for non-negative decimal
numbers; it returns -1 on error. The other two functions with a suffix 'e' in
their names ('e' is for 'exception') may throw exceptions, but they accept the
full range of 64-bit values.
These functions replace the CRTL functions atoll() and strtoll() which are not implemented on all systems.
Both function families, string-to-int and int-to-string, accept numeration
bases in the range 2 to 64. The 64-digit numeration uses all digits, letters and
also '.' and '/'. It may be useful for representing, for example, MD5 checksums
in a compact printable form (see function outmd5::get_digest()
in src/pmd5.cxx).
string itostring(<ordinal> value) converts the given ordinal value to a string. Various overloaded versions of this function accept ordinal values of different sizes and signness.
string itostring(<ordinal> value, int base, int width = 0, char pad = ' ') converts an integer value to a string with the numeration base specified by base, which can be in the range 2 - 64. To right-justify the resulting string you can specify width and pad parameters. If the numeration base is greater than 36 in addition to digits and letters itostring() uses '.' and '/' characters and also lowercase letters. For numeration bases other than 10 the parameter value is always treated as unsigned.
large stringtoi(const string& s) converts a string to a 64-bit integer. This function accepts only positive decimal large numbers and 0. It returns -1 if the string does not represent a valid positive number or an overflow occurred.
large stringtoie(const string& s) converts a string to a 64-bit integer. This function accepts signed decimal large numbers. Unlike stringtoi(), this function may throw an exception of type (econv*) if the string does not represent a valid number or an overflow occurred.
unsigned large stringtoue(const string& s, int base) converts a string to an unsigned 64-bit integer using the numeration base specified by base. This function accepts unsigned large numbers. It may throw an exception of type (econv*) if the string does not represent a valid number or an overflow occurred. Base can be in the range 2 - 64. For numeration bases from 2 to 36 this function uses digits and letters, and the letter case is insignificant. For numeration bases grater than 36, '.', '/' and lowercase letters are used additionaly.
string lowercase(const string& s) converts all characters of the given string s to lower case. The current version of the library "understands" only lower ASCII characters; all other characters remain unchanged. This function can effectively detect if all characters in the string are already in lower-case to avoid unnecessary string allocations.
See also: Constructors/destructors, Operators, Typecasts, Manipulation


Agglomeration was created to combat the feeling of isolation when your new to an existing team or part of remote team.
It provides easy access to search out team members for contact or learning a little bit about them.
Sample users for app testing:
Admin account
Email<EMAIL_ADDRESS>password: password
Non Admin account
Email<EMAIL_ADDRESS>password: password


You have 8 pending tasks
25% , Deadline 12 June’13
45% , Deadline 12 June’13
87% , Deadline 12 June’13
33% , Deadline 12 June’13
You have 4 Mails
Notifications
2014, Friday
7:53 PM


LETTER: Praise for MAP testing system
by Maredith Resop, Las VegasThank you for your Nov. 18 story on the increasing use of the MAP testing system in the Clark County School District. Having used this system as a special education teacher in a Wisconsin middle school during half of my 16 years teaching there, I can testify to its utility for teachers, students and parents. Tests are low-stress for most students and for the staff who administer them.
Results are delivered almost immediately and in forms that are informative for instruction and easy to explain to students and parents. Recommendations for areas in need of improvement were clear and matched what I already knew of my students’ capabilities. I found these results very useful in setting goals for the individual education plans and quarterly reports required for each of my students.
Because increasingly reporting and record keeping are a large part of teaching, I am glad that this system is being made more widely available for the staff at the school district, and that the results of testing will be available to students and parents.


{% include "component/head.html" %}
Diff View - Cardiff Web
{% include "component/navbar.html" %}
{% if diff_view %}
{% endif %}
{% include "component/footer.html" %}


SANDWHICH
This item is too deliciuos .and for sure you are going to love this, this is because i have made it with love just for you. and also i put my secret ingredients in it which makes it a lot more tatsy than you can thunk. but howevevr i have kept the price low so that yall can eat this and have lots and lots of fun. enjoy.


Henner Kollmann
has a degree in Electrical Engineering from the RWTH in Aachen. He
is working for aucos
Ag as senior software developer with Delphi, Java, Javascript,
C++, Qt and SQL. In his freetime he supports since 2010 the developing
of VZAweb: web-based
traffic census data base which is fully based on qooxdoo.


{% extends "base.html" %} {% block title %}
Medieval catalogues > UNIVERSITY AND COLLEGE LIBRARIES OF OXFORD > All Souls College > Inventory of the library, c. 1450
{% endif %}128 identified entries found.
All data was derived from the List of Identifications by Professor Richard Sharpe.
{% if not printing %}
A key to codes used in the List is available (opens in new tab).{% endif %}


Corinna Mura, the nightclub singer who is famously seen belting out La Marseillaise in the film Casablanca, was the stepmother of the late, great Edward Gorey.


Tesla Finally Unveils Its Highly-Anticipated Cybertruck
It can tow up to 14,000 pounds.
by Jeff YeungAfter seven years since first announcing its intention to build a fully electric pickup truck, Tesla has finally unveiled its Cybertruck, a beast of a machine with an aesthetic largely reminiscent of a Mars rover.
Available in three tiers — a single-motor RWD, a dual-motor 4WD, and a triple-motor 4WD — the new electric truck is clad in an ultra-hard 30X cold-rolled stainless steel body that Elon Musk says is also used for his SpaceX starships, able to withstand high impact forces and even prevent penetration by a 9mm bullet. With a vault length of 6.5 feet, it can carry a payload of up to 3,500 pounds in a storage capacity of 100 cubic feet. The top-tiered model boasts incredible power and can make 0-60mph in just 2.9 seconds, along with a towing capacity of a whopping 14,000 pounds. As with standard Tesla EVs, the Cybertruck can be charged at home or any of Tesla’s Destination Charging locations or Superchargers, and a single charge will give you more than 500 miles in range. As to its interior, Tesla has taken a minimalist approach, with seating for up to six adults, and a 17-inch touchscreen acting as the center console unit.
For those interested, the Tesla Cybertruck is now already taking pre-orders for the price of just $100 USD over on its Design Studio website. Head over to learn more or place your order now.
Elsewhere in the automotive world, Lexus has taken the roof off its V8-powered LC 500.


NodeAnimationStatus()
Syntax
Result = NodeAnimationStatus(#NodeAnimation)Description
Return the specified #NodeAnimation status.
Parameters
#NodeAnimation The node animation to use.
Return value
The return value can be one of the following constants:#PB_NodeAnimation_Stopped: The animation is stopped (or has ended). #PB_NodeAnimation_Started: The animation is running.
See Also
StartNodeAnimation(), StopNodeAnimation()
Supported OS
All


This is a collection of "prose objects," codified legal documents, forms and widgets. They can be the source code for the legal part of transacting. The goal is to codify and "code-ify" law.
You can use these prose objects privately by creating an "instance" of CommonAccord - https://www.youtube.com/watch?v=1-06FzulLpQ.
Transacting platforms can integrate them by writing their own rendering engine. If you are interested in this, please contact us as we would like to start a standards process for the data model.
We expect that these will be used with smart contracts to fully automate and open source transacting in a P2P arrangement. The phrase "prose" object comes from Ian Grigg's "Ricardian contracts."
The names of these objects are improvised and will change. GitHub has a nice way of forwarding from an old name to a new one. But they will all be here, as well as on GitHub. Acme-Ang-YC-Note-CmA/ has some explanation.
Let us know. commonaccord@gmail.com


Scan
Schedule
Report
Notifications
Advanced
Name:
Enable Scheduled Scan
Target
Type:
URL (Dynamic)
Project URL (Code)
Local Directory (Code)
Source Directory:
Start URL:
..
Edit target list...
%dynamic_targets%
Project URL (Azure DevOps / GIT / TFS):
..
Edit target list...
%code_targets%
Vulnerable Repositories (Demo)
PHP
Java
Pascal/Delphi
Lua
GIT Branch:
Hunt Method
Application Scan (Default)
Application Scan (Server-Side Focused)
Fault Injection
Top 25 (CWE Top 25)
Top 10 (OWASP Top 10)
Top 5 (OWASP PHP Top 5)
SQL Injection
Cross-Site Scripting (XSS)
File Inclusion
Spring4Shell Scan
Log4Shell Scan
Malware Content
Unvalited Redirects
Passive Scan (No Attacks)
Complete Pen-Test/Review (Time-Consuming)
Perform DoS tests
Report Generation
Report Template:
Standard
Comparison
Compliance
Complete
Automatically generate report after scanning
Report Filename (Optional, eg: C:\Reports\Report_{$SN}.pdf):
Automatically generate exports after scanning
Export Filename 1 (Optional, eg: C:\Reports\Export_{$SN}.xml):
Export Filename 2 (Optional, eg: C:\Reports\Export_{$SN}.json):
Available variables:
{$SN} - Unique scan session name
{$DT} - Current date and time (ex: 2022-12-01_19-10-30)
{$DD} - Current date (ex: 2022-12-01)
{$TM} - Current time (ex: 19-10-30)
Email Notification
Automatically email report after generation
Account Preferences:
Select Account Preferences
%email_trackers%
Email account preferences can be added using the Issue Trackers screen.
Subject:
Tracker Notification
Select Tracker
%all_trackers%
Select Tracker
%all_trackers%
Note: if you select the same tracker of type email in email notification and here, two emails will be sent.
Run once
Enable JavaScript emulation
Incremental Scan
Auto (Recommended)
Disabled
Fail Condition (Optional)
Minimum Severity:
None
Low
Medium
High
Schedule Preferences
Time (Hour/Minute/Second):
:
:
Date:
Any Month
January
February
March
April
May
June
July
August
September
October
November
December
Any Day
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
,
Any Year
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
Day in Week:
Any Day
Specific Days:
Mon
Tue
Wed
Thu
Fri
Sat
Sun
Scan time limit (Optional, examples: 1d, 3h, 2h30m, 50m):
OK
Cancel


Side Content Summary
The jQuery Side Content project is a plugin that docks content to the side of the browser window with "pull out" handles to open and close the panels.
You can add multiple side-content tabs to the side of your page and the plugin will automatically toggle them when the visitor clicks on the "pull out".
Side Content
This is the side content that you want to de-clutter from your page.
You can apply whatever CSS rules you like to this element, only the position and behaviour will be changed by the plugin.
There are plenty of configurable settings if you want to change the default behaviour!
More Content
This is a different panel
This is the side content that you want to de-clutter from your page.
You can apply whatever CSS rules you like to this element, only the position and behaviour will be changed by the plugin.
There are plenty of configurable settings if you want to change the default behaviour!
Another One
This is a different panel
Options
- classmodifier
- Used to apply class names to the elements created by the plugin. You only need to specify a class modifier if you have a name-clash.
- attachto
- You can opt to dock the side content panels on the "leftside" or "rightside" of the browser.
- width
- The width of the panel when it is activated, for example "300px" or "33%".
- opacity
- Set this to a value less than "1" to make the footer semi-transparent, for example "0.8".
- pulloutpadding
- use this option to set a gap between the pullout tabs, for example "5" for 5 pixel spacing (note, any padding you apply will eat into this number, so you might need to increase it if you don't see a gap)
- textdirection
- The direction of text on the pullout, "horizontal" or "vertical".
- clickawayclose
- Whether to close the tabs when the user clicks away from the tabs.


HTML elements
Anchor link
- Always link to HTTPS when possible.
Bentley Systems
- A basic anchor link.
Download
- Forces the link to download.
Email
- Opens an email with filled out name, subject, and body.
Call
- Starts a call.
Abbreviation
- Hover over an abbreviation to display the full term.
- You will need to find an alternative method for touch devices.
BSY
Images
- Include support for @2x at minimum, @3x at maximum.
-
Alt tag should describe what the picture depicts as if you were
explaining it to a blind person.
Source
.
-
Title tag should only be included if you need to display a tooltip.
-
Do
NOT
display SVGs within an IMG tag.


The saturation arithmetic component supports arithmetic, relational, and equality operations on integer literals (without suffixes) ranging from 0
to CHAOS_PP_LIMIT_MAG
.
Saturation occurs when an operation attempts to decrease a 0
value or increase a CHAOS_PP_LIMIT_MAG
value.
In both cases, the decrease or increase becomes an identity--i.e. an attempt to decrease 0
, such as
CHAOS_PP_DEC
(0)
results in 0
, and an attempt to increase CHAOS_PP_LIMIT_MAG
, such as
results in CHAOS_PP_LIMIT_MAG
.
The CHAOS_PP_IN_RANGE
predicate can be used to test whether an integer literal is in range (i.e. is greater than or equal to 0
and less than or equal to CHAOS_PP_LIMIT_MAG
).
CHAOS_PP_IN_RANGE
(23) // 1CHAOS_PP_IN_RANGE
(1000000) // 0
It should be reinforced that the saturation arithmetic facilities operate on integer literals (without suffixes), not integral constant expressions such as 1 + 2
.
The following table summarizes the arithmetic operations and their equivalents in C or C++:
|
x + y > |
|
x - 1 < 0 ? 0 : x - 1 |
|
x / y |
|
x + 1 > |
|
x * y > |
|
x % y |
|
x - y < 0 ? 0 : x - y |
The following table summarizes the equality and relational operations and their equivalents in C or C++.
|
x == y |
|
x > y |
|
x >= y |
|
x < y |
|
x <= y |
|
x != y |


# ******************************************************************************
# Copyright 2017-2018 Intel Corporation
#
# 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.
# ******************************************************************************
# This dataset should be downloaded from http://jmcauley.ucsd.edu/data/amazon/
# The terms and conditions of the data set license apply.
# Intel does not grant any rights to the data files.
# The Amazon Review Dataset was published in the following papers:
#
# Ups and downs:
# Modeling the visual evolution of fashion trends with one-class collaborative filtering
# R. He, J. McAuley
# WWW, 2016
# http://cseweb.ucsd.edu/~jmcauley/pdfs/www16a.pdf
#
# Image-based recommendations on styles and substitutes
# J. McAuley, C. Targett, J. Shi, A. van den Hengel
# SIGIR, 2015
# http://cseweb.ucsd.edu/~jmcauley/pdfs/sigir15.pdf
import pandas as pd
import json
from nlp_architect.utils.generic import normalize, balance
good_columns = [
"overall",
"reviewText",
"summary"
]
[docs]def review_to_sentiment(review):
# Review is coming in as overall (the rating, reviewText, and summary)
# this then cleans the summary and review and gives it a positive or negative value
norm_text = normalize(review[2] + " " + review[1])
review_sent = ['neutral', norm_text]
if review[0] > 3:
review_sent = ['positive', norm_text]
elif review[0] < 3:
review_sent = ['negative', norm_text]
return review_sent
[docs]class Amazon_Reviews(object):
"""
Take the *.json file of Amazon reviews as downloaded from
http://jmcauley.ucsd.edu/data/amazon/
Then does data cleaning and balancing, as well as transforms the reviews 1-5 to a sentiment
"""
def __init__(self, review_file, run_balance=True):
self.run_balance = run_balance
print("Parsing and processing json file")
data = []
with open(review_file, 'r') as f:
for line in f:
data_line = json.loads(line)
selected_row = []
for item in good_columns:
selected_row.append(data_line[item])
# as we read in, clean
data.append(review_to_sentiment(selected_row))
# Not sure how to easily balance outside of pandas...but should replace eventually
self.amazon = pd.DataFrame(data, columns=['Sentiment', 'clean_text'])
self.all_text = self.amazon['clean_text']
self.labels_0 = pd.get_dummies(self.amazon['Sentiment'])
self.labels = self.labels_0.values
self.text = self.amazon['clean_text'].values
[docs] def process(self):
self.amazon = self.amazon[self.amazon['Sentiment'].isin(['positive', 'negative'])]
if self.run_balance:
# balance it out
self.amazon = balance(self.amazon)
print("Sample Data")
print(self.amazon[['Sentiment', 'clean_text']].head())
# mapping of the labels with dummies (has headers)
self.labels_0 = pd.get_dummies(self.amazon['Sentiment'])
self.labels = self.labels_0.values
self.text = self.amazon['clean_text'].values


home
|
features
|
getting started
|
FAQ
|
Stone
|
Iron
|
download
|
help
|
about
FAQ
How mature is the library?
I consider it quite mature, in terms of both functionality and robustness.
The API is stable now.
The functionality should not evolve much, since the library provides all you need to access the Areas, ChokePoints, Bases, Tiles and MiniTiles in an easy and efficient way.
The library has been tested on most of the official maps of StarCraft and BroodWar, with satisfying results.
Stone, the first bot based on the library, demonstrated both its functionality and its robustness.
Iron, currently under development, is based on the library too.
How fast is it?
The analysis:
On my computer, which runs at 2.5 GHz, the whole analysis takes 100 ms for typical maps used in StarCraft AI competitions.
It takes 500 ms to analyse one of the biggest map: Frozen Sea.scx.
As a consequence, you should be able to run in debug mode in a decent way.
The services:
Most of the functionality is provided with a time complexity of O(1). This includes path and ground distance requests.
How robust is it?
The library has been tested on many maps, including special ones like Crystallis.scm.
If you do encounter some maps yielding unacceptable results, or even a crash, please let me know!
Is it easy to use?
I think so, but that's obviously subjective.
Here is a snippet, taken from the file examples.cpp that comes with the library:
{
for (const Area & area : theMap.Areas())
for (const Base & base : area.Bases())
{
if (MapDrawer::showBases)
Broodwar->drawBoxMap(Position(base.Location()),
Position(base.Location() + UnitType(Terran_Command_Center).tileSize()),
MapDrawer::Color::bases);
if (MapDrawer::showAssignedRessources)
{
vector<Ressource *> AssignedRessources(base.Minerals().begin(), base.Minerals().end());
AssignedRessources.insert(AssignedRessources.end(), base.Geysers().begin(), base.Geysers().end());
for (const Ressource * r : AssignedRessources)
Broodwar->drawLineMap(base.Center(), r->Pos(), MapDrawer::Color::assignedRessources);
}
}
}
The extract shows how to iterate through the Areas, the Bases, and their assigned Ressources.
Do not hesitate to read more of examples.cpp!
MapDrawer is a helper class that is provided together with the library. It can be used to print information about the map onto the game screen.
Another helper class, MapPrinter, can be used to print information about the map into a file.
Both are highly customizable and proved to be useful for debug purposes.
By the way, they have been used to produce the screenshots in this site.
Safety is another aspect of the ease of use.
BWEM provides safety through its use of modern C++ style.
An exemple is type safety. Programming an AI for Starcraft requires dealing with three kinds of positions.
In my experience, this is the source of a huge number of bugs.
In order to avoid the possibility of errors, BWEM's API uses the template TPosition and its specializations
(Position, WalkPosition, TilePosition)
provided by the BWAPI library, whenever possible.
Also, make sure to read the getting started page.
How does it work?
The analysis follows the steps:
Altitudes are computed for each MiniTile.
The Areas are computed by considering the miniTiles successively in descending order of their altitude.
Each of them either:
- involves the creation of a new Area.
- is added to some existing neighbouring Area.
- makes two neighbouring Areas merge together.
The ChokePoints are deduced.
Some statistics and measures like paths and ground distances are calculated.
The Bases are created at relevant locations.
The library also provides automatic recalculation of paths and ground distances (in the case blocking Minerals being destroyed for example).
When this occurs, only a small part of the analysis is processed again.
What are altitudes?
The altitude is the distance from the nearest non walkable MiniTile, except those which are part of small enough zones (lakes).
Altitudes play an important role in the analysis process.
Besides that, altitudes can be very useful in implementing various algorithms.
Suppose, for example, you have your air unit somewhere in some area, being attacked by ground units.
You want it to reach the nearest non walkable zone, to escape from the pursuers.
Knowing the altitude for each MiniTile, you can use this very simple greedy algorithm: among the 8 directions,
always choose the one for which the altitude of the neighbouring MiniTile is the lowest. This way you get the shortest path in O(1).
Conversely it is just as easy to reach highest altitudes, though there may be local optima.
Is the code simple?
Clearly, it is not trivial!
The algorithms used are, however, quite simples. Most of them are derived from dijkstra and breadth-first search algorithms.
Moreover the whole analysis is divided into sequential and well separated processes so that it is easy to reason about.
What if I'm not satisfied with the results of the analysis?
Areas, ChokePoints, Base placement are automatically computed by the BWEM library.
You may not agree with all the results, for all the maps.
Fortunatly, most of the algorithms used by the analysis are parametrised and it is fairly easy to modify these parameters.
More information about that in bwem.h.
As discussed in Is the code simple?, the algorithms themselves are not that complex.
You might want to modify them so that they fit your needs.
So may I modify the code to fit my needs?
Usually, when you use a library, you don't want to modify it, as it may be hard work and error prone.
Moreover, this removes the possibility of using next versions of the library easily.
The case of the BWEM library is particular, however:
- it doesn't aim at evolving much, as it is quite mature and stable now.
- some users are not involved in a long-term project, especially those willing to compete in StarCraft AI competitions for one year only.
So if you really need to change some of the code to fit your particular needs, feel free!
Is the library extensible?
Appart from willing to modify some part of the code, you may want to add your own, related features.
For simple cases, you will simply write functions that work on Areas, ChokePoints or Bases.
But what if you want, saying, Areas to contain more information?
As you don't want to modify the library, you will have to define some AreaExtension class.
Then, you usually will want to be able to:
access the Area from its corresponding AreaExtension → you can use either Area::Id() or Areas addresses.
access the AreaExtension from its corresponding Area → you can use Area::Ext() and Area::SetExt().
More generally, BWEM's main classes inherit from UserData, which provides the Ext() / SetExt() methods.
You can use them to extend theses classes.
It is neither an easy nor a safe way, but it is fearly feasible.
By the way, Stone demonstrates this technique. It uses 4 extension types: VArea, VChokePoint, VBase and VMap.
You can look at the source code for more details.
Are the paths optimal?
The BWEM library provides paths made of ChokePoints. They are intented to be shortest, ground, paths.
The suggested paths, if not optimal, are still very good paths.
Looking at the first screenshot in the home page you may notice that the printed path connects the middle of the ChokePoints.
Of course, in the general case the shortest path do NOT go through the exact middle of the ChokePoints.
That the printed path connects middles is just a visual choice. It doesn't mean you should do the same. In a real case where you
have to move a unit frame by frame, you would order it to move to the middle of next ChokePoint that is far enough (saying 10 tiles).
This way, the unit will go through the ChokePoints of the path in a smart way.
Stone demonstrates this technique. If you are interested, download its source code and look at the file walking.cpp.
home
|
features
|
getting started
|
FAQ
|
Stone
|
Iron
|
download
|
help
|
about


Receipts are available for all donations.
Donate using Zelle from your bank account site/app to
Donate using Paypal or Credit / Debit cards by clicking on the below button:
Please email us if you would like to donate through check or if you have any special requests or questions regarding donations.


Helping shelter cats live better lives.
Here at CatSponsor, we provide better housing and care for cats while they are in a shelter, awating adoption. They recieve high-quality cat food formulated to give them the best nutrition, have plenty of play time to give them exercise, and have more opportunities to be adopted in good, loving families. Plus, they recieve top-of-the-line veterinary care, so they are always in tip top shape.
However, this care isn't cheap - and while we do the best we can to cover costs, we need help to give these cats their best shot at life. That's where people like you come in - People who care for cats, but may not be able to own one for many reasons, or perhaps you have just the right amount in your home. :)
Through CatSponsor, people can pay a monthly fee to sponsor a shelter cat, or many! You'll recive weekly or Monthly email updates about your sponsored kitties, as well as the inside scoop on our planned events, meet ups, and even more resources in your area where you can further help cats in need. Plus, if you so choose - You can adopt the very cat you sponsor!
See your sponsorship in action.
Sounds like something you’d like to be apart of? Here are a few options to get you started.
Each plan covers basic needs like food, shelter, and veterinary care for one month.
You also have the option to recieve weekly emails about your kitty’s progress, goings-on at our shelter, and even information about shelters and events in your area.


Concurrent Ruby
Modern concurrency tools for Ruby. Inspired by Erlang, Clojure, Scala, Haskell, F#, C#, Java, and classic concurrency patterns.
The design goals of this gem are:
- Be an 'unopinionated' toolbox that provides useful utilities without debating which is better or why
- Remain free of external gem dependencies
- Stay true to the spirit of the languages providing inspiration
- But implement in a way that makes sense for Ruby
- Keep the semantics as idiomatic Ruby as possible
- Support features that make sense in Ruby
- Exclude features that don't make sense in Ruby
- Be small, lean, and loosely coupled
Supported Ruby versions
MRI 1.9.3, 2.0 and above, JRuby 1.7x in 1.9 mode, JRuby 9000, and Rubinius 2.x are supported. This gem should be fully compatible with any interpreter that is compliant with Ruby 1.9.3 or newer. Java 8 is preferred for JRuby but every Java version on which JRuby 9000 runs is supported.
Thread Safety
Concurrent Ruby makes the strongest thread safety guarantees of any Ruby concurrency library. We are the only library with a published memory model which provides consistent behavior and guarantees on all three of the main Ruby interpreters (MRI/CRuby, JRuby, and Rubinius).
Every abstraction in this library is thread safe. Similarly, all are deadlock free and many are fully lock free. Specific thread safety guarantees are documented with each abstraction.
It is critical to remember, however, that Ruby is a language of mutable references. No concurrency library for Ruby can ever prevent the user from making thread safety mistakes (such as sharing a mutable object between threads and modifying it on both threads) or from creating deadlocks through incorrect use of locks. All the library can do is provide safe abstractions which encourage safe practices. Concurrent Ruby provides more safe concurrency abstractions than any other Ruby library, many of which support the mantra of "Do not communicate by sharing memory; instead, share memory by communicating". Concurrent Ruby is also the only Ruby library which provides a full suite of thread safe and immutable variable types and data structures.
Features & Documentation
The primary site for documentation is the automatically generated API documentation
We also have a mailing list and IRC (gitter).
General-purpose Concurrency Abstractions
- Async.
- Future: An asynchronous operation that produces a value.
- .dataflow: Built on Futures, Dataflow allows you to create a task that will be scheduled when all of its data dependencies are available.
- Promise: Similar to Futures, with more features.
- ScheduledTask: Like a Future scheduled for a specific future time.
- TimerTask: A Thread that periodically wakes up to perform work at regular intervals.
Thread-safe Value Objects, Structures, and Collections
Collection classes that were originally part of the (deprecated) thread_safe
gem:
- Array.
- Hash.
- Map A hash-like object that should have much better performance characteristics, especially under high concurrency, than
Concurrent::Hash
. - Tuple getters/setters.
Value objects inspired by other languages:
- Maybe A thread-safe, immutable object representing an optional value, based on Haskell Data.Maybe.
- Delay.
Structure classes derived from Ruby's Struct:
- ImmutableStruct Immutable struct where values are set at construction and cannot be changed later.
- MutableStruct Synchronized, mutable struct where values can be safely changed at any time.
- SettableStruct Synchronized, write-once struct where values can be set at most once, either at construction or any time thereafter.
Thread-safe variables:
- Agent.
- Atom.
- AtomicBoolean A boolean value that can be updated atomically.
- AtomicFixnum A numeric value that can be updated atomically.
- AtomicReference An object reference that may be updated atomically.
- Exchanger.
- MVar.
- ThreadLocalVar A variable where the value is different for each thread.
- TVar.
Java-inspired ThreadPools and Other Executors
- See the thread pool overview, which also contains a list of other Executors available.
Thread Synchronization Classes and Algorithms
- CountDownLatch A synchronization object that allows one thread to wait on multiple other threads.
- CyclicBarrier A synchronization aid that allows a set of threads to all wait for each other to reach a common barrier point.
- Event Old school kernel-style event.
- IVar Similar to a "future" but can be manually assigned once, after which it becomes immutable.
- ReadWriteLock A lock that supports multiple readers but only one writer.
- ReentrantReadWriteLock A read/write lock with reentrant and upgrade features.
- Semaphore A counting-based locking mechanism that uses permits.
Edge Features
These are available in the concurrent-ruby-edge
companion gem.
These features are under active development and may change frequently. They are expected not to
keep backward compatibility (there may also lack tests and documentation). Semantic versions will
be obeyed though. Features developed in concurrent-ruby-edge
are expected to move to concurrent-ruby
when final.
- Promises:
Unified implementation of futures and promises which combines features of previous
Future
,Promise
,IVar
,Event
,dataflow
,Delay
, andTimerTask
into a single framework. It extensively uses the new synchronization layer to make all the features non-blocking and lock-free, with the exception of obviously blocking operations like#wait
,#value
. It also offers better performance. - Actor: Implements the Actor Model, where concurrent actors exchange messages.
- Channel: Communicating Sequential Processes (CSP). Functionally equivalent to Go channels with additional inspiration from Clojure core.async.
- LazyRegister
- AtomicMarkableReference
- LockFreeLinkedSet
- LockFreeStack
Statuses:
Why are these not in core?
- Promises - They are being finalized to be able to be moved to core. They'll deprecate old implementation.
- Actor - Partial documentation and tests; depends on new future/promise framework; stability is good.
- Channel - Brand new implementation; partial documentation and tests; stability is good.
- LazyRegister - Missing documentation and tests.
- AtomicMarkableReference, LockFreeLinkedSet, LockFreeStack - Need real world battle testing.
Usage
Everything within this gem can be loaded simply by requiring it:
require 'concurrent'
To use the tools in the Edge gem it must be required separately:
require 'concurrent-edge'
If the library does not behave as expected, Concurrent.use_stdlib_logger(Logger::DEBUG)
could help to reveal the problem.
Installation
gem install concurrent-ruby
or add the following line to Gemfile:
gem 'concurrent-ruby', require: 'concurrent'
and run bundle install
from your shell.
Edge Gem Installation
The Edge gem must be installed separately from the core gem:
gem install concurrent-ruby-edge
or add the following line to Gemfile:
gem 'concurrent-ruby-edge', require: 'concurrent-edge'
and run bundle install
from your shell.
C Extensions for MRI
Potential performance improvements may be achieved under MRI by installing optional C extensions.
To minimize installation errors the C extensions are available in the concurrent-ruby-ext
extension
gem. concurrent-ruby
and concurrent-ruby-ext
are always released together with same version.
Simply install the extension gem too:
gem install concurrent-ruby-ext
or add the following line to Gemfile:
gem 'concurrent-ruby-ext'
and run bundle install
from your shell.
In code it is only necessary to
require 'concurrent'
The concurrent-ruby
gem will automatically detect the presence of the concurrent-ruby-ext
gem
and load the appropriate C extensions.
Note For gem developers
No gems should depend on concurrent-ruby-ext
. Doing so will force C extensions on your users.
The best practice is to depend on concurrent-ruby
and let users to decide if they want C extensions.
Maintainers
- Petr Chalupa (lead maintainer)
- Jerry D'Antonio (creator)
- Michele Della Torre
- Chris Seaton
- Paweł Obrok
- Lucas Allan
Special Thanks
- Brian Durand for the
ref
gem - Charles Oliver Nutter for the
atomic
andthread_safe
gems - thedarkone for the
thread_safe
gem
License and Copyright
Concurrent Ruby is free software released under the MIT License.
The Concurrent Ruby logo was designed by David Jones. It is Copyright © 2014 Jerry D'Antonio. All Rights Reserved.


Help for the JavaScript Demo
Below is a summary of the fields in the
JavaScript interface to ptplot.
-
Width
- The width in pixels of the applet.
-
Height
- The width in pixels of the applet.
-
Background Color
- Background color of the
ptplot
window.
This argument takes hexadecimal color values
(fffff
), not color names.
-
Foreground Color
- Foreground color. This color is used to draw all text
and the normal grid lines in the window.
This argument takes hexadecimal color values
(
fffff
), not color names.
-
URL Base
-
URL Base
is not actually a Ptplot option, rather it is used
by the form to improve readability. URL Base
is the URL that
is prepended on to the File to plot
value
If (NONE)
is selected in File to plot
, then
URL Base
is ignored.
-
File to plot
- A listbox consisting of the file to plot. Since this is
an applet, we can only plot files from the server. In a future version,
it might be possible to submit files to the server to be plotted
if
(NONE)
is selected, then File to plot
and URL Base
are ignored.
-
Title Text
- Title of the plot. This string is centered at the top
of the graph.
-
Title Font
- This is the name of the font to use for
the graph title.
-
Label Font
- All axis labels and grid labels are drawn
using this font.
-
X Axis Label
- This is the unit name for the X axis.
-
Y Axis Label
- This is the unit name for the Y axis.
-
Bars
- Specifies that vertical bars should be drawn from the
data points to the zero line.
Usually, the
No Lines
flag is used with this option.
The point itself is located at the center of the bar.
-
No Lines
- Turn off drawing lines.
-
Ticks
- Draw tick marks instead of full grid lines.
-
Small Points
- Marks each data point with a small marker.
-
Large Points
- Marks each data point with a large marker.
-
Reverse Video
- Reverse video. On black and white displays, this will
invert the foreground and background colors. The
behaviour on color displays is undefined.
- Display Args
Display Args
- Display Args prints a table of some of the arguments at the bottom.


From the require.js source code (line 1902):
/**
* The function that handles definitions of modules. Differs from
* require() in that a string for the module should be the first argument,
* and the function to execute after dependencies are loaded should
* return a value to define the module corresponding to the first argument's
* name.
*/
The define()
function accepts two optional parameters (a string that represent a module ID and an array of required modules) and one required parameter (a factory method).
The return of the factory method MUST return the implementation for your module (in the same way that the Module Pattern does).
The require()
function doesn't have to return the implementation of a new module.
Using define()
you are asking something like "run the function that I am passing as a parameter and assign whatever returns to the ID that I am passing but, before, check that these dependencies are loaded".
Using require()
you are saying something like "the function that I pass has the following dependencies, check that these dependencies are loaded before running it".
The require()
function is where you use your defined modules, in order to be sure that the modules are defined, but you are not defining new modules there.


I’ve seen quite a few blogs/articles/etc. lately related to the adoption (or lack thereof) of OSGi in the mainstream web application/enterprise application space. A nice summation of these is encapsulated in this excerpt from a comment by Peter Kriens on DZone (you’ll find it in the comments section for http://java.dzone.com/articles/osgi-perspectives:
Yes, one of the next frontiers is to make OSGi easier to use for the web app developers. The solid foundation is there, so stop whining and help us create the tools, books, and tutorials that will make OSGi palatable in those markets.
 It’s no secret that I think OSGi is an excellent tool for tackling the complexity of enterprise applications (see my talks on the NFJS tour this year: http://www.nofluffjuststuff.com/conference/speaker/matt_stine). However, I will readily admit that the learning curve for tackling any non-trivial application in OSGi is rather steep. My bar for non-trivial is quite low - try learning OSGi while simultaneously attempting to get a mainstream framework like Hibernate working properly.
I think that what we need is a tool that will enable a developer new to OSGi to get an OSGi-enabled web application up and running fairly readily. In fact, I think it would be good to absolutely minimize the amount of OSGi know-how required to get a basic web application into production, while at the same time leaving all of OSGi available just under the covers so that it can be easily accessed when I know what I need and how to use it. So here’s my proposal:
1) Follow in the footsteps of AppFuse, Grails, Rails, Roo, etc. and put together a web application toolkit that will allow one to instantly spin-up a deployable OSGI-enabled web application. 2) Since we’re talking about catering to mainstream here, Java the language ought to be the primary language used for development. With that said, we should not put up any barriers to using other languages available on the JVM. 3) Bootstrap a DB-agnostic persistence layer leveraging JPA and make it easily accessible across the application bundles. 4) Bootstrap a dependency injection framework for OSGi services based on the Blueprint standard. 5) Bootstrap a security layer and provide a basic user/role security module with provided login, logout, etc. facilities. 6) Pick a set of modern Java web application frameworks (e.g. Spring MVC, Struts 2, etc.) and make them easily pluggable. 7) Wrap a nice build system around all of this that leverages a modern build tool (e.g. Gradle or Maven 3), the best of the PAX Tools features (especially Pax Construct, Exam, and Runner), and good facilities for automated testing.
So, who’s with me? I’m open to any suggestions/comments/rants, etc.


Welcome to agrodem user’s guide!¶
Achieving universal electricity access by 2030 will require a rapid increase in the rate of new connections and in levels of investment, particularly in countries with low level of access to electricity. The challenge is significant. Designing and selecting the optimal electrification approach requires access to reliable data and information regarding electricity resource availability, demand levels, economic activity and functional infrastructure to name a few.
The paucity of such information may hamper electrification progress. However, this situation is gradually being improved with the increasing availability of new data and analytical tools, especially in the field of geospatial analysis. Geographic Information Systems (GIS) and remote sensing techniques are becoming openly available and can now provide a range of location-specific information that has not been previously accessible. Take for example the field of agriculture, where data is rapidly approaching the scale of ‘big data’. They can provide farm stakeholders with spatial and temporal information about climate and local weather, soil conditions, crop quality, field biodiversity, and crop yields.
Inclusion of agricultural electricity demand can enhance the richness of the geospatial electrification planning process. To date, demand estimation has typically depended on measurement of population density and an assumed average residential demand. On occasion, this is augmented by including some types of productive loads (e.g. large industrial or mining loads). However, existing and potential demand for electricity from activities related to agriculture and agro-business, is missed usually not included.
This document presents an analytical and spatially explicit approach for estimating aspects of electricity requirements related to agricultural activities; namely irrigation and few selected post-harvest activities. The underlying work has been a collaborative effort between Vivid Economics and KTH Royal Institute of Technology and is part of a multi-year ESMAP-funded project - Geospatial Electrification Planning in the Africa Region (P165617) - aiming to facilitate the execution of geospatial electrification planning activities in various sub-Saharan African countries.
The following sections provide a brief overview of this approach with indicative examples for the main processes included and links to the code developed to implement those processes in an open and reproducible way.


DeCE processes given commands one-line by one-line. Each line contains an operation keyword first, followed by some optional letters or numbers depending on the operation.
DeCE ignores blank lines. A line starting with "#" is considered as a comment, and ignored.
The operation keywords are case-insensitive. DeCE recognizes the following keywords.
When DeCE detects an operation that DeCE cannot recognize, the code stops immediately. This is because ENDF-6 formatting process should be so careful that any errors in the input data must be eliminated.
The simplest usage of DeCE is just to renumber the ENDF-6 formatted
file. No command other than quit
is needed. However,
the options -n
and -o
have to be specified.
% dece -n -o ENDF_out.DAT ENDF_in.DAT % quit
DeCE reads the entire ENDF_in.DAT file, then
calculates NWD
and NXC
(number of lines in the comment
and dictionary part), make a new dictionary, renumber all the section,
and write the result on the file ENDF_out.DAT.
In this case, the file ENDF_in.DAT can be incomplete, which
means, the NWD
and NXC
numbers and the dictionary can
be inconsistent with the actual numbers. DeCE does not trust those
data in the input ENDF-6 file, but scans the whole file to determine
the correct values.
Note that the line-number in DeCE starts with one, not zero.
To modify a Tape ID, use the tpid
operation.
It might be convenient to use a separate data file in this case.
When an input file contains the following two lines;
tpid "As 75 ENDF/B-VII.0 + CoH3 calculation" quit
% dece ENDF_in.DAT -o ENDF_out.DAT < input.dat
then the top part of the output ENDF-6 file becomes
As 75 ENDF/B-VII.0 + CoH3 calculation 0 0 0 3.307500+4 7.427800+1 1 0 0 03325 1451 1 0.000000+0 0.000000+0 0 0 0 63325 1451 2 1.000000+0 2.000000+7 0 0 10 73325 1451 3 0.000000+0 0.000000+0 0 0<PHONE_NUMBER> 1451 4
A useful function of DeCE is to extract a section in an
ENDF-6 file, and convert it into a tabulated format. There are two
ways to do this. The first one is to give a MF
and MT
numbers as command line options.
Another way is to use the extract
or table
operation. Here we have a file that contains three lines:
extract 3 22 table 3 22 quit
then feed this file to DeCE, one gets;
% dece ENDF_in.DAT < input.dat
3.307400+4 7.328890+1 0 0 0 03322 3 22 -4.380000+6-4.380000+6 0 0 1 143322 3 22 14 2 3322 3 22 4.439760+6 0.000000+0 7.000000+6 0.000000+0 8.000000+6 2.722850-93322 3 22 9.000000+6 2.148920-8 1.000000+7 2.998550-6 1.100000+7 5.546240-53322 3 22 1.200000+7 4.000550-4 1.300000+7 2.103910-3 1.400000+7 6.563180-33322 3 22 1.500000+7 1.435070-2 1.600000+7 2.380840-2 1.800000+7 4.308410-23322 3 22 1.900000+7 5.158810-2 2.000000+7 5.909400-2 3322 3 22 3322 3 0 # MAT: 3322 MF: 3 MT: 22 ZA: 33 - 74 # NR: 1 C1: -4.380000e+06 C2: -4.380000e+06 # IR: 1 NP: 14 INT: lin-lin 4.439760e+06 0.000000e+00 7.000000e+06 0.000000e+00 8.000000e+06 2.722850e-09 9.000000e+06 2.148920e-08 1.000000e+07 2.998550e-06 1.100000e+07 5.546240e-05 1.200000e+07 4.000550e-04 1.300000e+07 2.103910e-03 1.400000e+07 6.563180e-03 1.500000e+07 1.435070e-02 1.600000e+07 2.380840e-02 1.800000e+07 4.308410e-02 1.900000e+07 5.158810e-02 2.000000e+07 5.909400e-02
The first block is a dead-copy of the section MF=3, MT=22
.
The current version of DeCE suppresses the line number since this is
no longer required in the ENDF-6 format. This can be changed by the
option
command. The next block, starting with # MAT
line, is the result of table
operation, where the (X,Y) data
are converted into a two column table.
An important rule of ENDF-6 is that the total cross section should equal to the sum of all partial cross sections. This is often satisfied by subtracting the sum of of partial cross sections from the total cross section, and put it in the elastic cross section. This can be done very easily with DeCE.
make4 calc 3 = 4+16 calc 3 = 3+22 calc 3 = 3+28 calc 3 = 3+32 calc 3 = 3+102 calc 3 = 3+103 calc 3 = 3+104 calc 3 = 3+105 calc 3 = 3+106 calc 3 = 3+107 calc 3 = 3+111 calc 3 = 3+112 calc 2 = 1-3 calc 1 = 2+3 delete 3 3 quit
% dece ENDF_in.DAT -o ENDF_out.DAT < input.dat
The first line of the input data, make4
is to make recalculate
MF/MT=3/4, which is the total inelastic scattering cross section. Usually
this section is already given, so that this might be unnecessary. The following
calc
operation makes a temporary section MF/MT=3/3, which
ends up with the sum of all partial cross sections.
We first make the elastic scattering MT=2 by subtracting MT=3 from
the total (calc 2 = 1 - 3
), then the total is reconstructed
again (calc 1 = 2 + 3
), which ensures that the MT=1 section
includes all the energy points appeared in the whole MF3 section.
The original ENDF_in.DAT may have the MT=2 elastic section too. If you want to see how large the new elastic cross sections changed from the original data, you can take a ratio of the old section to the recalculated new section.
make4 calc 3 = 4+16 calc 3 = 3+22 ...(snip)... calc 3 = 3+112 calc 4 = 1-3 calc 5 = 2/4 extract 3 5 quit
2.305100+4 5.050630+1 0 0 0 02328 3 5 1 0.000000+0 0.000000+0 0 0 1 117512328 3 5 2 11751 2 2328 3 5 3 1.000000-5 0.000000+0 2.530000-2 0.000000+0 1.000000+5 0.000000+02328 3 5 4 1.000000+5 1.000000+0 1.001200+5 1.000000+0 1.002900+5 1.000000+02328 3 5 5 1.004700+5 1.000001+0 1.006400+5 1.000002+0 1.008100+5 1.000002+02328 3 5 6 1.009900+5 1.000002+0 1.011600+5 1.000003+0 1.013400+5 1.000002+02328 3 5 7 1.015100+5 1.000004+0 1.016900+5 1.000002+0 1.018700+5 1.000004+02328 3 5 8 1.020400+5 1.000003+0 1.022200+5 1.000004+0 1.024000+5 1.000005+02328 3 5 9 1.025700+5 1.000005+0 1.027500+5 1.000006+0 1.029300+5 1.000006+02328 3 5 10 ...(snip)...
In this case, as you can see, there are tiny differences at the last digit (10-6), which could be just a numerical noise.


Find the border
What is the border between red and "not red"?
Is this color red?
(
8
questions left)
Yes
No