Moroni is the capital of the Comoros and is on the west coast of Grande Comore (Ngazidja), which is the largest island in the group.
The town lies close to one of the largest and most active volcanos in the world.
Position: 11° 42'S, 43° 15'E.
There is a harbour and anchorage here, however it offers little protection. The port deals with small cargo vessels and it is unknown whether yachts can berth here.
The town has several shopping malls.
Last updated March 2016.


| DOSE: T+ 0:00 |
125 mg |
oral |
MDA |
(powder / crystals) |
| T+ 5:00 |
20 mg |
oral |
2C-B |
(powder / crystals) |
At the 1.25 hour point after ingestion I am catapulted into some 'place' - it is very extreme and I am not sure what is happening to me at first - Will I barf? Will I die?  Just what IS this?! I have to get up and turn off the music. After a minute or two I realize that I have been put into a state that is quite clear in thought and free of suffering. It's a place that everyone truly needs. It is quite a revelation for me.
The conceptualizations while the compound was taking effect involved the perception of the universe being made of elements able to take many forms - including our own species. The miracle of life on earth was astonishing. Once the MDA took full effect I was able to 'see through it all'. There was no confusion whatsoever about life or my purpose in it. I realized I could take this precious gift of realization with me to the day I die.
When the MDA came on strongly, I had visions of a river of blood surrounded by orbiting hydrogen bombs - an archetype in the classic sense. It's as though the universe takes on the form of a specific space where h2O can exist - and with it our blood that carries the minerals and elements necessary to nourish the levers, strings and breathing that allow us to be.
Once I got comfortable with the head space, I played Fripp & Eno's 'Evening Star'. The first track is a brilliant, glittering sound collage that I feel describes what MDA is like. I sat on the sofa before the speakers in total bliss and listened to the entire CD. My thoughts wandered from one idea to the next, and I could push my mind into thinking about things that I would not usually want to. The music was gorgeous when I focused on it, but I was not overwhelmed. I was quite content to sit on the sofa like a 5 year old.
Something I find to be unique about this compound is that it is comfortable. With MDMA there is such an extreme push - a willingness to fall on the floor in awe. MDA isn't quite like that. Although I was expecting to be floored, I didn't expect to be able to go ahead and start typing these notes for instance. The clarity of focus is remarkable. I could answer the phone with no problem. I could drive a car if I *really* had to, but the sense of judgement is quite intact and I know I would not do something like that.
As I near the 2 hour point, I am reminded of the journey one usually experiences after the peak with LSD. Empowered, alive and with great zeal I am able to face the world without hesitation or fear. This lesson regarding the freedom from suffering is something that I must value preciously, and protect until the end of my life. I silently thank the person that gave me this 125 milligrams MDA.
After the beautiful music ended, I remained in reflection for a half hour. The interesting thing is that there was nothing at all going on in my mind. I simply existed. It was as though I had been 'tuned up', and was waiting for the conductor to start the orchestra. I was expecting some friends to visit, and I got up to look out the front window for them. Their car appeared in the driveway and they parked and got out. The synchronicity with this material is amazing. Not the magical psychedelic space like with acid, but more matter-of-fact and obvious.
I truly enjoyed the time with my friends, and at the 5:00 hour point I took 20mg 2C-B. In about an hour I experienced a fantastic rush of closed-eye visuals involving architectures with ornate tiled surfaces. I was soaring through these spaces, over rooftops, into rooms, around patios and over gardens. It was absolutely amazing. I don't think I've ever had closed-eye visuals with such depth and detail.
As the evening developed I ate some food at 7 hours, and found it appetizing but a little too filling. I continued to have closed-eye visuals, but they were more simple and less active than the buildings and architectures from before. By the 10 hour point they are still pervasive and although I would like to continue enjoying them, I go to sleep.
I awaken a couple times during the night with some stomach discomfort. The next morning I feel stretched and hung over, much like MDMA. After a hike and then a nap, I still feel dazed. There appears to be significant toxicity to this compound, but the effects are like nothing else, especially the philosophical lessons and the CEVs.
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.


New Orleans’ jazz musicians to play in Havana
by Redacción DigitalAmerican jazz musician Jon Cleary and his trio will debut in Havana during two concerts with Cuban pianist Ernan Lopez Nussa, according to organizers.
The leader of Jon Cleary & The Absolute Monster Gentlemen band will perform accompanied by guitarist Derwin Big D Perkins, bassist Cornell C. Williams and drummer Jelly Bean, who dabble in the sounds of jazz, funk, rhythm and blues and soul, typical of their hometown, New Orleans.
Both performances, to be held on December 18 and 19, will feature the talent of composer Lopez Nussa, as a special guest, who has shared the stage with Cleary in multiple performances and maintains a close friendship with him.
Lopez Nussa will convene a trumpet, trombone and saxophone section composed of Cuban instrumentalists Mayquel Gonzalez, Juan Carlos Marin, and David Suarez, respectively.
As part of his visit, Cleary will offer several workshops and conversations at the National School of Arts of Cuba.


Hi. This is the story of my journey across the Camino de Santiago. I’ve done my best to be as accurate as possible to the description of people, events, happenings, dialogues, and places. This is the first time I’ve ever written anything so extensive, and personal. I do not claim to be skilled enough to capture the entirety of my experience, so you’ll have to forgive me if you finish and have any lingering questions – I’m always open to talking about the experience. Enjoy! If you’ve already read the Introduction, start at Beginnings. The story builds upon itself, so it will make the most sense if you start at Introduction.
- Introduction
- Beginnings
- First Ascent
- Tea
- Möge die Straße
- The Cusp of Time and Infinity
- Sunsets and Soulmates
- Goodbye
- Gone
- An Ode to the Road
- Journal Entries, Day 17 - 20
- A Sea of Stars
- Journal Entries, Day 22 - 24
- The Iron Cross
- Letters to a Camino Soulmate
- Letters Worth Czeching Out
- Santiago
- The Final Goodbye
- Home


Great Forest [ap26], forest, in Mandoria, peasants: 197
Last updated Turn #142
Great Forest [ap26], forest, in Mandoria, peasants: 197
------------------------------------------------------------------------
0: Garrison [iw8c], garrison, uncontrolled, with eight peasants guards
0: Great Forest [ap26].
30: The population grows by one peasant.
Routes leaving Great Forest:
North, forest, to Great Forest [ao26], 8 days
Garrison [cb4m], garrison, uncontrolled, with seven peasants
East, to Ocean [ap27], Lake Mandor, 2 days
South, forest, to Great Forest [aq26], 8 days
Garrison [bn3g], garrison, Mandor Confederacy, with ten workers
West, forest, to Great Forest [ap25], 8 days
Garrison [ht9y], garrison, uncontrolled, with two peasants
Seen here:
Garrison [iw8c], garrison, uncontrolled, with eight peasants


One of the things that most attracted me to F# is the ability to accurately model your domain. What first turned me on to this was a talk by Scott Wlaschin on Functional programming design patterns. Scott has a more focused talk on Domain Modeling Made Functional that he did a few years later and a book with the same title. This whole concept was blowing my mind. The idea of modeling your domain such that illegal states are unrepresentable sounds immensely satisfying to me.
This new way of looking at the world has been slowly transforming all of my code. Everywhere I look now I am asking, “Is it possible for this state to be illegal? What can I do to ensure I am covering all scenarios?” With this new focus I quickly came across an operator in F# that lies, the division operator.
The Divide Lie
If you hover over the / operator in Visual Studio you will get the following function signature
val(/): x:'T1 -> y:'T2 -> 'T3 (requires member (/))
There is nothing surprising here. The /
operator is expecting two values and will produce a third. Now let’s look at what the compiler says is supposed to happen when we divide two decimals. If I input the following lines into a fsx script in Visual Studio I will get the following types from the compiler.
let a = 10M // val a : decimal
let b = 5M // val b : decimal
let c = a / b // val c : decimal
This is where my problem is. The compiler says that taking two decimal values and dividing them will produce a third decimal value. This is not always the case though. If b = 0M
then this will throw an exception. This runs counter to the idea of making illegal states unrepresentable. We would rather that the operator returned 'T option
which would force us to deal with both scenarios.
Defining a new Operator
Fortunately for us, it is easy to add operators to F# but there are a couple of gotchas I will cover here. The F# Language Reference has a great page describing the rules around Operator Overloading. The key thing to know is that there are a limited set of characters that are permitted: !
, %
, &
, *
, +
, -
, .
, /
, <
, =
, >
, ?
, @
, ^
, |
, and ~
. ~
is a special character to be used when making a unary operator. In this case, I need a binary operator so I will avoid using it.
I want to create a new divide operator that will check if the divisor is 0
. If the divisor is equivalent to 0
, I want the operator to return None
. Since I want this to be intuitive when looking at the operator I will combine the divide symbol, /
, with the bang symbol, !
, to make my new operator /!
. The reason I am using the !
symbol is because it often indicates a warning which is what I am wanting to communicate to the developer. This means my function signature needs to look like this:
val(/!): x:'T1 -> y:'T2 -> 'T3 option (requires member (/))
My first attempt looked like the following:
let (/!) a b =
match b <> 0 with
| true -> a / b |> Some
| false -> None
When I look at the function signature of my operator though I see the following:
val(/!): x:int -> y:int -> int option
This is no good. This will only work with inputs of int
and I am wanting something that is generic. The problem is in two places. The first, and more obvious one, is that I am comparing the value of b
with the value of 0
which is an int
. The F# compiler is therefore restricting the input types to be int
. I know this because I can change the value b
is compared to and change the function signature. For example if I change 0
to 0M
, the type of a
and b
is restricted to decimal
. If I change 0
to 0.
, making it a float, the type of a
and b
is restricted to float
.
Making the Operator Generic
Fortunately, F# has a fix for this, it is called GenericZero
. GenericZero
is a type function which returns the 0
equivalent for any numeric type or type with a static member called Zero
. It is contained in the F# Language Primitives, Microsoft.FSharp.Core.LanguagePrimitives
. More information can be found in the language reference entry on GenericZero.
The other problem with this function is that it needs to be an inline
function. The inline
keyword in F# tells the compiler to figure out the types for the function at the place of usage instead of restricting the types. Here is a simple example of an add
function without the inline
keyword.
// non-inlined function
let add a b =
a + b
// val add : a:int -> b:int -> int
You would think that the add
function would be generic but the F# compiler will restrict this to int
because that is the best match it can deduce from the context. Now, if we use the add
function with float
values it will change the function signature but it will still be restricted to only a single type. Here I show using the add
function with float
values before trying to use it with int
values. F# updates the function signature to using float
but now throws an error when we try to use int
values.
// non-inlined function
let add a b =
a + b
// val add : a:float -> b:float -> float
let r = add 1. 2. // r : float
let r2 = add 1 2 // compiler error
The inline
keyword can be added to the beginning of the function to have the compiler deduce the types at the point the function is used.
let inline add a b =
a + b
// val add : a:'a -> b:'b -> 'c (requires member(+))
let r = add 1. 2. // r : float
let r2 = add 1 2 // r2 : int
We now have all of the ingredients we need to update our new operator /!
so that it will work with generic types.
open Microsoft.FSharp.Core.LanguagePrimitives
let inline (/!) a b =
match b <> GenericZero with
| true -> a / b |> Some
| false -> None
// val (/!) : a:'a -> b:'b -> 'c option (requires member (/) and member get_Zero and equality)
This is exactly what we were looking for in the beginning. Now when we use our new operator we are forced to deal with a situation where the divisor is possibly 0
. This solution for dealing with a possible 0
divisor may not be for everyone. Perhaps having to deal with the None
scenario is too cumbersome for you. I find that I like having this additional safety in place because it forces me to write more robust code.


|
SPH
|
representation of particle More...
#include <SPH_2D.h>
Public Member Functions | |
| void | calc_index (void) |
| calculate the grid index of particle | |
| void | calculate_P () |
| update pressure for particle | |
Public Attributes | |
| double | x [2] |
| position and velocity | |
| double | v [2] |
| double | rho = 1000 |
| density and pressure | |
| double | P |
| double | a [2] |
| acceleration | |
| double | D |
| differentiation of density to time | |
| double | prev_x [2] |
| store previous position for predictor corrector scheme | |
| double | prev_v [2] |
| store previous velocity for predictor corrector scheme | |
| double | prev_rho |
| store previous densiity for predictor corrector scheme | |
| int | list_num [2] |
| index in neighbour finding array | |
| bool | boundary_status = false |
| whether the particle is a boundary or fluid particle | |
| unsigned int | grid_index = 0 |
| get the index of particle in his grid, which is used for stencil neighbour particles finding algorithm | |
Static Public Attributes | |
| static SPH_main * | main_data |
| link to SPH_main class so that it can be used in calc_index | |
representation of particle
@detail represents the properties of particles, such as position, velocity, acceleration, pressure, density, differentiation of density to time and whether it is a boundary particle or fluid particle.


'">
and '">
components rely on FontAwesome to display share buttons icons.
If you want to use another icon library, consider using [shareButton]
directive instead.
You can use the module ShareIconsModule
to import all share buttons icons.
If you want to import different icon set for the share buttons or if you don't want to import all the share
icons that comes with the ShareIconsModule
, you can skip it and import the icons
manually.
Let's say you want to use facebook square icon instead of the default one


The .NET command-line samples for the AdSense Host API have been moved to GitHub:
https://github.com/googleads/googleads-adsensehost-examples


English
Sentence to translate
Alex translation to German
Submit
What is Alex saying in German? (Google translate)


Comments
-
anonymous
I'm getting the same undefined method error as of 85fd8b0ce657f772ad9c1c50fe502e08ca2bf04c, and I see that the references to the command method have all been prefixed with ::VIM:: as of that revision. This makes even less sense than the original bug report. I'm also on OS X Snow Leopard (stock Ruby 1.8.7), so it's certainly not a Windows thing.
-
Greg Hurrell
Funnily enough I can't repro on Mac OS X. If you discover any pattern or underlying cause, do let me know. I'm hesitant to make any changes until I actually understand why this anomalous behavior is occurring.
-
anonymous
Had the same issue. I think the problem is that CommandT defines VIM module. As result some plugins, that did not take care to preceed VIM with ::VIM start to fail. I tried to replace CommandT declaration for VIM with XVIM (just to avoid conflicts), and now it works.
-
Greg Hurrell
CommandT is defining
CommandT::VIM
, so as to leave theVIM
in the global namespace untouched (::VIM
). As this is standard Ruby practice, not really sure why it shouldn't work. -
Greg Hurrell
See also this forum topic.
-
Greg Hurrell
As I said, I don't really understand why this is happening, but I think am going to define
method_missing
onCommandT::VIM
and just have it call the missing methods on::VIM
as a workaround. -
Greg Hurrell
Status changed:
- From: new
- To: open
-
anonymous
this is solved on 30.11 in https://github.com/vim-ruby/vim-ruby/commit/a20098a4844069106c71643ad4f5682707966d85
-
Greg Hurrell
As this is essentially a cosmetic issue now, and the fix is upstream, going to mark this one as closed.
-
Greg Hurrell
Status changed:
- From: open
- To: closed
Add a comment
Comments are now closed for this issue.


I only needed to change some CSS. pic.twitter.com/LvjLbjgY9F
— Malte Ubl (@cramforce) September 1, 2015
A new approach to web performance.
— Malte Ubl (@cramforce) October 7, 2015
Today we are starting the AMP Project to make mobile web content fast again.https://t.co/b091YOzo5s


--- title: M4 dataset keywords: fastai sidebar: home_sidebar summary: "Download and evaluate the M4 dataset." description: "Download and evaluate the M4 dataset." nb_path: "nbs/data_datasets__m4.ipynb" ---
for group, meta in M4Info:
if group != 'Hourly':
continue
df, *_ = M4.load(directory='data', group=group)
n_series = len(np.unique(df.unique_id.values))
display_str = f'Group: {group} '
display_str += f'n_series: {n_series}'
print(display_str)
The method evaluate
from the class M4Evaluation
can receive a url of a benchmark uploaded to the M4 competiton.
The results compared to the on-the-fly evaluation were obtained from the official evaluation.
esrnn_url = 'https://github.com/Nixtla/m4-forecasts/raw/master/forecasts/submission-118.zip'
esrnn_evaluation = M4Evaluation.evaluate('data', 'Hourly', esrnn_url)
# Test of the same evaluation as the original one
test_close(esrnn_evaluation['SMAPE'].item(), 9.328, eps=1e-3)
test_close(esrnn_evaluation['MASE'].item(), 0.893, eps=1e-3)
test_close(esrnn_evaluation['OWA'].item(), 0.440, eps=1e-3)
esrnn_evaluation
Also the method evaluate
can recevie a numpy array of forecasts.
fforma_url = 'https://github.com/Nixtla/m4-forecasts/raw/master/forecasts/submission-245.zip'
fforma_forecasts = M4Evaluation.load_benchmark('data', 'Hourly', fforma_url)
fforma_evaluation = M4Evaluation.evaluate('data', 'Hourly', fforma_forecasts)
# Test of the same evaluation as the original one
test_close(fforma_evaluation['SMAPE'].item(), 11.506, eps=1e-3)
test_close(fforma_evaluation['MASE'].item(), 0.819, eps=1e-3)
test_close(fforma_evaluation['OWA'].item(), 0.484, eps=1e-3)
fforma_evaluation


--- layout: false title: Pure CSS date: 2018-8-5 tags: - Web ---
Pure is ridiculously tiny.
The entire set of modules clocks in at 3.8KB* minified and gzipped.
CSS with a minimal footprint.
Thirds
Thirds
Thirds
Thirds
Thirds
Thirds
| Key | CSS Media Query | Applies | Classname |
|---|---|---|---|
| None | None | Always | .pure-u-* |
sm |
@media screen and (min-width: 35.5em) |
≥ 568px | .pure-u-sm-* |
md |
@media screen and (min-width: 48em) |
≥ 768px | .pure-u-md-* |
lg |
@media screen and (min-width: 64em) |
≥ 1024px | .pure-u-lg-* |
xl |
@media screen and (min-width: 80em) |
≥ 1280px | .pure-u-xl-* |
fa-twitter on fa-circle-thin
fa-twitter (inverse) on fa-circle
fa-ban on fa-camera


About This Project
This web site was created by Cole and Jen Jayme for a 6th grade school research project. Cole is a martial artist and tricker with an interest in science. His mom Jen is a web developer. Cole came up with the idea, researched the topics, and found pictures and videos. Jen helped him put these together on a web site. We hope to add more "bells and whistles" to this web site as we have time. Hope you enjoy!


Our Address
Kayabwe
Mpigi
Uganda
<EMAIL_ADDRESS>Phone Numbers
+256757839407
+256776646550
+256753024391
Kayabwe
Mpigi
Uganda
+256757839407
+256776646550
+256753024391
Copyright © 2020 - All Rights Reserved - Ssembatya Shafic
The internet of things with you in all aspects


pragma solidity ^0.4.25;
/// @title ERC-1261 MVT Standard
/// @dev See https://github.com/ethereum/EIPs/blob/master/EIPS/eip-1261.md
/// The constructor should define the attribute set for this MVT.
/// Note: the ERC-165 identifier for this interface is 0x1d8362cf.
interface IERC1261 {
/* is ERC173, ERC165 */
/// @dev This emits when a token is assigned to a member.
event Assigned(address indexed _to, uint[] attributeIndexes);
/// @dev This emits when a membership is revoked.
event Revoked(address indexed _to);
/// @dev This emits when a user forfeits his membership
event Forfeited(address indexed _to);
/// @dev This emits when a membership request is accepted
event ApprovedMembership(address indexed _to, uint[] attributeIndexes);
/// @dev This emits when a membership is requested by an user
event RequestedMembership(address indexed _to);
/// @dev This emits when data of a member is modified.
/// Doesn't emit when a new membership is created and data is assigned.
event ModifiedAttributes(
address indexed _to,
uint attributeIndex,
uint prevValueIndex,
bytes32 prevValue,
uint modifiedValueIndex,
bytes32 modifiedValue
);
/// @notice Adds a new attribute (key, value) pair to the set of pre-existing attributes.
/// @dev Adds a new attribute at the end of the array of attributes and maps it to `values`.
/// Contract can set a max number of attributes and throw if limit is reached.
/// @param _name Name of the attribute which is to be added.
/// @param values List of values of the specified attribute.
function addAttributeSet(bytes32 _name, bytes32[] values) external;
/// @notice Modifies the attribute value of a specific attribute for a given `_to` address.
/// @dev Use appropriate checks for whether a user/admin can modify the data.
/// Best practice is to use onlyOwner modifier from ERC173.
/// @param _to The address whose attribute is being modified.
/// @param _attributeIndex The index of attribute which is being modified.
/// @param _modifiedValueIndex The index of the new value which is being assigned to the user attribute.
function modifyAttributeByIndex(
address _to,
uint _attributeIndex,
uint _modifiedValueIndex
) external;
/// @notice Requests membership from any address.
/// @dev Throws if the `msg.sender` already has the token.
/// The individual `msg.sender` can request for a membership if some exisiting criteria are satisfied.
/// When a membership is requested, this function emits the RequestedMembership event.
/// dev can store the membership request and use `approveRequest` to assign memebership later
/// dev can also oraclize the request to assign membership later
/// @param _attributeIndexes the attribute data associated with the member.
/// This is an array which contains indexes of attributes.
function requestMembership(uint[] _attributeIndexes) external payable;
/// @notice User can forfeit his membership.
/// @dev Throws if the `msg.sender` already doesn't have the token.
/// The individual `msg.sender` can revoke his/her membership.
/// When the token is revoked, this function emits the Revoked event.
function forfeitMembership() external payable;
/// @notice Owner approves membership from any address.
/// @dev Throws if the `_user` doesn't have a pending request.
/// Throws if the `msg.sender` is not an owner.
/// Approves the pending request
/// Make oraclize callback call this function
/// When the token is assigned, this function emits the `ApprovedMembership` and `Assigned` events.
/// @param _user the user whose membership request will be approved.
function approveRequest(address _user) external;
/// @notice Owner discards membership from any address.
/// @dev Throws if the `_user` doesn't have a pending request.
/// Throws if the `msg.sender` is not an owner.
/// Discards the pending request
/// Make oraclize callback call this function if criteria are not satisfied
/// @param _user the user whose membership request will be discarded.
function discardRequest(address _user) external;
/// @notice Assigns membership of an MVT from owner address to another address.
/// @dev Throws if the member already has the token.
/// Throws if `_to` is the zero address.
/// Throws if the `msg.sender` is not an owner.
/// The entity assigns the membership to each individual.
/// When the token is assigned, this function emits the Assigned event.
/// @param _to The address to which the token is assigned.
/// @param _attributeIndexes The attribute data associated with the member.
/// This is an array which contains indexes of attributes.
function assignTo(address _to, uint[] _attributeIndexes) external;
/// @notice Only Owner can revoke the membership.
/// @dev This removes the membership of the user.
/// Throws if the `_from` is not an owner of the token.
/// Throws if the `msg.sender` is not an owner.
/// Throws if `_from` is the zero address.
/// When transaction is complete, this function emits the Revoked event.
/// @param _from The current owner of the MVT.
function revokeFrom(address _from) external;
/// @notice Queries whether a member is a current member of the organization.
/// @dev MVT's assigned to the zero address are considered invalid, and this
/// function throws for queries about the zero address.
/// @param _to An address for whom to query the membership.
/// @return Whether the member owns the token.
function isCurrentMember(address _to) external view returns (bool);
/// @notice Gets the value collection of an attribute.
/// @dev Returns the values of attributes as a bytes32 array.
/// @param _index Index of the attribute whose values are to be fetched
/// @return The values of attributes.
function getAttributeExhaustiveCollection(uint _index)
external
view
returns (bytes32[]);
/// @notice Returns the list of all past and present members.
/// @dev Use this function along with isCurrentMember to find wasMemberOf() in Js.
/// It can be calculated as present in getAllMembers() and !isCurrentMember().
/// @return List of addresses who have owned the token and currently own the token.
function getAllMembers() external view returns (address[]);
/// @notice Returns the count of all current members.
/// @dev Use this function in polls as denominator to get percentage of members voted.
/// @return Count of current Members.
function getCurrentMemberCount() external view returns (uint);
/// @notice Returns the list of all attribute names.
/// @dev Returns the names of attributes as a bytes32 array.
/// AttributeNames are stored in a bytes32 Array.
/// Possible values for each attributeName are stored in a mapping(attributeName => attributeValues).
/// AttributeName is bytes32 and attributeValues is bytes32[].
/// Attributes of a particular user are stored in bytes32[].
/// Which has a single attributeValue for each attributeName in an array.
/// Use web3.toAscii(data[0]).replace(/\u0000/g, "") to convert to string in JS.
/// @return The names of attributes.
function getAttributeNames() external view returns (bytes32[]);
/// @notice Returns the attributes of `_to` address.
/// @dev Throws if `_to` is the zero address.
/// Use web3.toAscii(data[0]).replace(/\u0000/g, "") to convert to string in JS.
/// @param _to The address whose current attributes are to be returned.
/// @return The attributes associated with `_to` address.
function getAttributes(address _to) external view returns (uint[]);
/// @notice Returns the `attribute` stored against `_to` address.
/// @dev Finds the index of the `attribute`.
/// Throws if the attribute is not present in the predefined attributes.
/// Returns the attributeValue for the specified `attribute`.
/// @param _to The address whose attribute is requested.
/// @param _attributeIndex The attribute Index which is required.
/// @return The attribute value at the specified name.
function getAttributeByIndex(address _to, uint _attributeIndex)
external
view
returns (uint);
}
/// @title ERC-1261 Membership Verification Token Standard, optional metadata extension
/// @dev See https://github.com/ethereum/EIPs/blob/master/EIPS/eip-1261.md
/// Note: the ERC-1261 identifier for this interface is 0x93254542.
interface IERC1261Metadata {
/* is ERC1261 */
/// @notice A descriptive name for a collection of MTs in this contract.
function name() external view returns (bytes32);
/// @notice An abbreviated name for MTs in this contract.
function symbol() external view returns (bytes32);
}
|


%%%
Abbreviations Key
%%%%%%
%%%
Rank
Username
Upd.
Attr.
Value
Bar (logarithmic)
%r%
%u%
Points
%rp%
%cs%
%upd_line%
Capacity
%cap%
%%%
%os%, %stsys%
Drives
%ndr%
| Username | Case | OS | Storage System | Capacity | Drives |
|---|---|---|---|---|---|
| %u% | %cs% | %os% | %stsys% | %cap% | %ndr% | %%%%%% %%%


Home
|
base
|
src.lib
Index
Navigate by using the toolbar above or by clicking on the links below.
httpd
math
tcpip
task
xml
© Johns Hopkins Applied Physics Laboratory 2010


Click here to listen to Zppix's Radio.
Use the below window to submit requests and chat with Zppix during the show.


Central & Western Rift (4 Days) Gorilla Tracking Safari (4 Days) Image Gallery View more photos below Video Gallery View more videos below


{{ with .Site.Params.copyright }} {{ . | markdownify }} {{ else }} © {{ now.Format "2006"}}. Crafted with ❤ by {{ .Site.Params.Author }} {{ end }}
This website is fully open source. Fork now via github


Click one of the following buttons to change the location without unloading this page.
Note: This example uses HTML5 history, which is supported only in Firefox 4+, Safari 5+, and Chrome. This example will only work when served by a web server (not when loaded locally from a file).
Name is


|
Double the size of the source operand by means of sign extension. The CBW (convert byte to word) instruction copies the sign (bit 7) in the source operand into every bit in the AH register. The CWDE (convert word to doubleword) instruction copies the sign (bit 15) of the word in the AX register into the higher 16 bits of the EAX register.
The CBW and CWDE mnemonics reference the same opcode. The CBW instruction is intended for use when the operand-size attribute is 16 and the CWDE instruction for when the operandsize attribute is 32. Some assemblers may force the operand size to 16 when CBW is used and to 32 when CWDE is used. Others may treat these mnemonics as synonyms (CBW/CWDE) and use the current setting of the operand-size attribute to determine the size of values to be converted, regardless of the mnemonic used.
The CWDE instruction is different from the CWD (convert word to double) instruction. The CWD instruction uses the DX:AX register pair as a destination operand; whereas, the CWDE instruction uses the EAX register as a destination.
|


NiFi Prometheus Reporting Task:
Processor Efficiency Metrics
See the following github code repository:
https://github.com/lcphill/NiFiPromProcessorEfficiencyMetricsReportingTask
Report processor efficiency metrics, via NiFi Reporting Task, in Prometheus “push gateway” format and “push” (versus “listen”).
By “efficiency metrics”, the intent is to event on unbalanced backlog and / or flow-drop-off (not necessarily “flow dry up”). The reference implementation is using Apache Commons Math3 SimpleRegression, using slope / intercept to form the basis of Grafana alarm triggers. The ‘x’ axis of the Double-pair is epoch timestamp in seconds, while the ‘y’ coordinate is the input queue value (byte count and flow-file count, as two separate metrics / computations).
Predict is a feature of SimpleRegression that is not exploited by the reference implementation, although predicting is a potential feature worthy of further investigation.
Along the way, the remainder of the processor metrics available from the ReportingTaskContext API are reported, as well as the consortium of JVM metrics (per node).
Grafana provides a slope / intercept formula, but those calculations are at the back-end of the metrics platform infrastructure, noting that Prometheus polls on a 5-minute basis (presumed configurable). Further, it is not uncommon for metrics to be lost, from time to time, periodic, thereby rendering slope / intercept calculation at the back-end impossible surrounding those outage situations.
Various constraints drive a metrics architecture back to a push / collector model vice polling (which is not to criticize the Prometheus design choice to poll), particularly security and networking aspects.
See this reference golang implementation of a collector: https://github.com/pschou/prom-collector
The reference implementation is a single java file (the reporting task, wholly self-contained, albeit, there is a build dependency to the standard SSL context controller service), built into a dot.nar file (Apache maven 3.6.x, Java 11, Apache NiFi 1.12.x). Install the dot.nar file in typical fashion.
Instantiate the reporting task at the root canvas (using global menu => controller settings => reporting tasks, filter by ‘prometheus’), allowing authorization throughout the entire NiFi instance process group hierarchy (see next paragraph). Note that as many instances of the reporting task can be instantiated as needed, varying configuration as desired (resources permitting, but any reasonable and rationale need should be satisfactory).
The reporting task can be configured to start at a named process group hierarchy (default to root canvas), but must locate a specified process group hierarchy, specified by name, by starting from the root canvas and working downward.
The next step is to configure the reporting task…
Settings / Run Schedule: the default is 60 seconds, which interplay’s with the slope / intercept computations (see number of trend samples further below).
The reference implementation posts metrics on each schedule / invocation. Other than FIFO queues used to hold SimpleRegression samples, no metrics data is cached between schedule invocations. The interplay between schedule and samples will be described below.
Properties / Number of trend samples (default of 20)
SimpleRegression is handed a configured number of Double-pair samples (i.e., number of trend samples), for which to compute Slope and Intercept (as well as, potentially, Predict). As mentioned, the ‘x’ axis is epoch timestamp in seconds, and the ‘y’ value is the byte count or flow-file count value for the input-side of a processor. Regarding ‘input-side’, the driving requirement is unbalanced backlog and flow drop-off as incoming to a processor.
There are actually four discrete regression metrics that the reference implementation provides, namely Slope and Intercept for Byte Count and Flow File Count for Processor Input Queue (technically, the way the ReportingTaskContext API works, the metric value is obtained for an output_queue where the destination is the target observance processor, specified in the reporting task controller service configuration described further below).
Byte count and flow file count constitute two separate FIFO queues (per processor to report), for which slope and intercept are calculated (intercept is, roughly, the inverse of slope, noting we are not exploiting the predict feature). As mentioned, the two FIFO queues are “per reporting processor” (internal Map is keyed by processor UUID). These FIFO constructs are the only state maintained between scheduled runs of the reporting task controller service, sized for number-of-trend-samples.
The greater the number of trend samples, the more stable / less dynamic the slope and intercept calculation shall result, tending toward zero. Conversely, the lower the number of trend samples, the greater the dynamics are toward calculating slope and intercept.
By varying the run schedule alongside the configured number of trend samples, a balance can be tuned, based on apriori knowledge of the data flow, such that Grafana alarm specifications can be contrived such that “crying wolf” is minimized while ensuring that true-positives are properly detected (there is no such thing as a perfect alarm specification).
The reference implementation imposes a hard-coded constraint, such that the configured number of trend samples is between 3 and 1,000.
Also note that the reference implementation posts metrics to Prometheus’ collector / push-gateway per run schedule invocation – the driving reason for this design is simplicity / reduction of code complexity. Reminder that this is a reference implementation, although it has performed well in production as designed as is.
Properties / Acknowledge Sanitization (default false) and Properties / Simulation Mode (default true)
Metrics, when collected in bulk, raise the sensitivity-level / compliance-level / privacy-level required by your viewing audience.
These two properties assist in supporting your effort to scrutinize and ensure your reported metrics are of sufficient obfuscation. The responsibility of what is reported rests with the NiFi dataflow administration organization / personnel. In particular, …
Metrics labels nominally consist of the following elements: NiFi instance name, site and system names (contrivances), node name, process group name, processor name, processor type, and, contextual, queue/relation names. Additive, these can raise privacy concerns.
The NiFi instance label value (AKA, ‘instance moniker’) is formulated as: ‘root’ process group name (as shown as the browser tab title, root canvas => Settings => Process Group Name), replacing spaces and any non-alphanumeric with dash characters (‘-’). It is intended that the NiFi instance label value be distinguishing and not empty. If the instance moniker cannot be obtained (edge case), then the cluster node identifier – not syntactically a UUID, but conceptually yet another form of UUID – is used as the instance moniker (in a clustered environment, of course). If in standalone mode and the default “NiFi Flow” is obtained, then the instance moniker shall be the node hostname (since “NiFi Flow” is non-distinguishing).
The typical solution is that of obfuscation, such that reported label values are sanitized (that is, rename your processors and maybe other elements, depending on your situation).
Simulation Mode (default true) specifies that metrics are posted only to the NiFi log file (per node). By using this feature, a data flow administrator (with SSH access to the nodes and permission to view log files) can visually inspect the metrics that would otherwise be sent to the Prometheus server (by turning off simulation mode).
No behavior occurs while the Acknowledge Sanitization property is set to false.
Properties / Reporting Site
A simple Prometheus’ metric label for informational purposes. Required, but otherwise not validated / verified. TODO: ensure the value does not violate Prometheus’ label value rules.
Properties / Starting Process Group
Default to ‘root’, signifying traverse the entire canvas and process group hierarchy thereunder. This property is not REGEX compiled. It is an exact match, including character-case. If specified, traverse from the provided process group (by name, based on “first match”) to report processor efficiency metrics.
Properties / Processor (name) filter
This can be an exact match (character-case significant), or a Java REGEX (https://docs.oracle.com/en/java/javase/11/docs/api/java.base/java/util/regex/Pattern.html). The default is to match everything (that is, all processors of the specified type – see next property below). Considering privacy concerns, reporting metrics for every processor is probably a bad default value.
Properties / ProcessorTypeFilter
Required (default is empty). This must be an exact match, specifying a processor type. This property works in concert with Processor Name Filter and Starting Process Group (both described above) to narrow the scope of metrics reported.
Reminder that all of this filtering is intended to report metrics that lie within your umbrella of privacy concerns.
Properties / Prometheus Metrics Endpoint
Noting that Prometheus is a polling paradigm, this property refers to a collector (e.g., https://github.com/pschou/prom-collector) or push_gateway (e.g., https://github.com/prometheus/pushgateway). This endpoint should be HTTPS / SSL, but is not required (such as, demonstration and local-host routing).
Properties / SSL Context Service
Although optional (such as demonstration and local-host routing), HTTPS / SSL should ideally be enabled. See Properties / Prometheus Metrics Endpoint discussion above.
Caveat: This author does not purport any in-depth knowledge of the meaning, semantics, definition or intent of the underlying metrics provided by the Apache NiFi ReportingTaskContext API. That said, by trial / error and practice / repetition, we have been able to exploit a core set of underlying metrics to effectively alarm on unbalanced backlog and flow-drop-off events (using SimpleRegression), as well as a handful of other traditional alarm conditions.
Regarding privacy concerns, we cannot stress enough the importance of naming processors and process groups (which are reported as Prometheus metric label values) such as to obfuscate specific flow characteristics (typically as mapping to end-customers).
Fine-tuning notwithstanding, we’ve identified a handful of uncomplicated metrics that we can confidently define Grafana alarm specifications for.
Run Status: Metric name is ‘nifi_processor_run_status’ (1 for running and 0 for stopped). The idea behind setting up an alarm for this metric is to be a reminder to the data flow administrator(s) to turn the processor on if forgotten. Grafana can throw a yellow pending alert after, say, a minute, and then alarm after about an hour or two.
NiFi node JVM Heap Available: Metric name is ‘nifi_instance_available_memory’. Computed using Java.Runtime as “max memory minus used memory” where used memory is “total memory minus free memory”. All of this is a tad “fuzzy”, but the intent is to use the ‘heap available’ gauge against apriori knowledge of the data flows and what is an acceptable level of excess heap for handling potential burst messaging scenarios (noting NiFi content is effectively placed into the content repository if all goes according to plan).
Input file queue count: Metric name is ‘nifi_processor_output_queue_count’ with {queue_side=”input” … and processor_name=blah and so forth}.
The intent of this metric / alarm specification is a straight forward “Is the flow dead?” alarm.
As mentioned further above, the way connection-status is constructed, you are looking for your processor (i.e., ‘destination’) on the back-end of an output queue (hence, the semantics in the naming being what it is – reminder, this is a reference implementation). Note that the semantics above properly handle load balancing, if in effect (e.g., the flow to your processor on a particular node is not transmitting).
Note the reference implementation accomplishes the zero-latency processor and connection-status join internally, thereby averting the arduous challenge of accomplishing a time-based outer-join being imposed upon the Grafana back-end query specification.
Slope and / or intercept: This is the core aspect to this reporting task, namely “processor efficiency” as a cover phrase for detecting unbalanced backlog and, conversely, flow drop-off (not to be confused with non-existent flow, described above).
‘Intercept’ graphs nominally as a converse to ‘slope’, albeit ‘intercept’ is much more sensitive. Depending on your fine-tuning, you may choose slope over intercept for your target Grafana alarm specification metric, or vice-versa.
Regarding bytes count versus flow-file count, choosing one over the other is dependent, once again, on your apriori knowledge of the data flow(s). Do you have a large volume of tiny content or do you have a data flow whose content is exceptionally large, but of lower flow-file count volume?
Slope and intercept are calculated using the SimpleRegression library, ‘x’ axis being timestamp in seconds, and value being the product of the join between processor and connection-status on the back-end side of the connection where the processor is tagged as the destination. See discussion above regarding run schedule and number of trend samples.
A positive / rising slope value (conversely, a negative intercept value) indicates flow backlog while a negative slope value indicates flow drop-off. Functionally, flow drop-off is of more importance than that of backlog, while backlog is of a concern regarding performance and resources. Both are important or of a concern, of course. Typically, a Grafana alarm may specify a lower minimum threshold and a higher maximum threshold, to allow for more variance regarding backlog.
Note that the choice of unit for ‘x’ axis being seconds is significant (hard-wired in the code). We experimented with other units (such as milliseconds) with detrimental impact, and, thus, settled on seconds for timing unit – noting the reporting task run schedule should nominally be tens of seconds or even minutes, since Prometheus is polling every 5 minutes, by default.
Also of significant impact, the Grafana alarm specification should be an average() calculation. In effect, you are looking for a bump with a dip or, conversely, a dip without a dump.
These metrics provide potential for alerting, particularly fine-tuning of alerts. You are looking to achieve a balance between “crying wolf” and missing a true-positive. For the most part, these metrics are obtained directly from the NiFi ReportingTaskContext API (this author does not purport to have in-depth knowledge of the content nor semantics of said metrics).
Additionally, since Prometheus has an affinity for increasing-counter style metrics, the reporting task also provides totals oriented metrics (denoted further below).
Labels include ‘node’ (i.e. hostname) and ‘instance’ (i.e., instance moniker).
nifi_instance_free_memory: this is a “fuzzy” metric (reminder we are reporting a la JVM Runtime), because the JVM Runtime reports this value based on existing heap size (not maximum JVM sandbox size).
nifi_instance_used_memory: less “fuzzy”, in a way, such that this is the total JVM memory minus JVM free memory (where total is existing heap size).
nifi_instance_available_memory: Described above – maximum sandbox size minus used memory
nifi_instance_cpu_time: Only available using com.sun.management.OperatingSystemMXBean (available on CentOS)
nifi_instance_cpu_load: Only available using com.sun.management.OperatingSystemMXBean (available on CentOS)
nifi_instance_system_load_average: If com.sun.management.OperatingSystemMXBean is not available.
Labels include node, instance, process group name, processor name and processor type.
All the below are an itemization and not an explanation, nor an attempt at definition. The values are seemingly dependent on the processor code, the version of the processor code and the version of the NiFi API framework, while mileage appears to vary greatly. For example, the GetFile processor – a source processor – provides non-zero values for flow files received. In any case…
The below are passed onward, verbatim, from the ReportingTaskContext API:
nifi_processor_run_status
nifi_processor_active_thread_count
nifi_processor_terminated_thread_count
nifi_processor_average_lineage_seconds (hard-wired to the seconds unit)
nifi_processor_processing_nanos
nifi_processor_bytes_read (and total)
nifi_processor_bytes_received (and total)
nifi_processor_bytes_sent (and total)
nifi_processor_bytes_written (and total)
nifi_processor_flow_files_received (and total)
nifi_processor_flow_files_removed (and total)
nifi_processor_flow_files_sent (and total)
nifi_processor_input_bytes (and total)
nifi_processor_input_count (and total)
nifi_processor_output_bytes (and total)
nifi_processor_output_count (and total)
Reminder that the reference implementation accomplishes the zero-latency processor and connection-status join internally, thereby averting the arduous challenge of accomplishing a time-based outer-join being imposed upon the Grafana back-end query specification.
Labels include node, instance, process group name, processor name, processor type, queue name and queue size (‘input’ or ‘output’).
The metrics for a NiFi connection (AKA, queue) are produced separately for input side and output side. Most notably, there may be load balancing involved.
For our usage of Linear Regression calculations, the source of the metrics are the “output queue” for which the reported processor is as matching the ‘destination’ element. In this scenario, queue name is set to ‘input’ (thereby matching the queue side). Yes, it’s seemingly confusing. The existing naming strategy, itemized below, is consistent, but not entirely obvious.
nifi_processor_input_queue_bytes_slope
nifi_processor_input_queue_bytes_intercept
nifi_processor_input_queue_bytes
nifi_processor_input_queue_count_slope (i.e., flow file count)
nifi_processor_input_queue_count_intercept (i.e., flow file count)
nifi_processor_input_queue_count (i.e., flow file count)
nifi_processor_output_queue_bytes
nifi_processor_output_queue_count (i.e., flow file count)
nifi_processor_queue_bytes
nifi_processor_queue_count (i.e., flow file count)
There is no programmatic API means, using the ReportingTaskContext API, to determine / obtain / report the primary node that the cluster has voted / selected (not even extraneously by introspecting the Zookeeper registry).
There is one element that can be extracted using the ReportingTaskContext API, namely the process-run-context configuration property for “run on primary node”, via:
ProcessorStatus::getExecutionNode() == ExecutionNode.PRIMARY_NODE
This designation of primary node is not being reported by our ReportingTask. The challenge we face is that of tracing connection-status extraneously (taking load balancing configuration properties into account along the way).
Unfortunately, when monitoring data flow to alarm on events of interest, knowing the primary node designation could prove useful. Without such labeling, we resort to Grafana functions such as “max()” and “sum()”, as applied to all nodes in a NiFi instance cluster. For example,
max(nifi_processor_output_queue_count{queue_side=”input”, node=~”node1|node2|node3”}
Note that a slope / intercept based alarm specification is not impacted by the lack of primary node reporting because a “zero flow” always has a slope of 0 (typically, slope / intercept alarm specifications alert on “outside of range” condition).
The current reference implementation is using the Java-11 JDK and Maven 3.6.1 against Apache NiFi 1.12.1.
$ mvn clean install # builds the dot.nar file, sitting under $base/nar/target
Recommend setting up a tertiary library directory in $NIFI_HOME/conf/nifi.properties and copy the build dot.nar file to the tertiary library (and restart the NiFi instance, of course).
END-OF-DOCUMENT


Station Select
Main Viewport
Heart of the Deep
2
3
4
5
6
Main Screen Station
Helm console
Weapons console
Target
Skattershot
Torpedo
Hardshell
Knockshot
Nuke
Tube 0
Tube 1
Standard Phaser
Hull Piercing
Suppresion Pulse
Shield Damper
Plasma Vent
Tractor Beam
Repulsor Beam
Tether
Barrage
Self Destruct
Shadow Tether
Engineering
Thrusters
Engines
Weapons
Thrusters
Engines
Weapons
Thrusters
Engines
Weapons
Communication
None
StatusReport
Surrender
Taunt
GoNorth
Stop
Game Master


This API has been deprecated.
Deprecation Date: 02/07/2017
Unsupported Date: 08/07/2017
Receipts v4 which replaces this API opens doors to global availability, enriched schemas, and better support for detailed tax content.
Partners and customers using a deprecated API should contact SAP Concur and discuss moving to the latest versions.
Learn more in the API Lifecycle & Deprecation Policy.
The Receipts resource represents receipts that can be posted to Concur by a provider company on behalf of opted-in users. This resource currently supports three types of receipts:
- General — A general-purpose receipt type that can be used for various goods or services
- Hotel — A receipt for a hospitality service, such as a hotel stay
- Ride — A receipt for a ride service
Notes:
- Receipts currently can’t be Posted to users whose data is hosted in Concur’s EU datacenter. Only users whose data is hosted in the US datacenter can receive e-receipts.
- The Receipt Service only accepts receipts that are up to 6 months old. Older receipts will not be accepted.
- Unlike all the other Concur API endpoints, the e-receipt requires the Concur Platform team to configure your sandbox to enable access.
Operations
Version
3.0
Create a new receipt
POST /api/v3.0/common/receipts
Parameters
| Name |
Type |
Format |
Description |
content |
- |
body |
The receipt object to create |
Schema
Response
| Name |
Type |
Format |
Description |
ID |
string |
- |
|
URI |
string |
- |
|
Receipt
| Name |
Type |
Format |
Description |
Amount |
Decimal |
- |
Required The net amount of the transaction. A positive number means a payment is due. A negative number means a refund is due. Zero means no payment or refund is due. Range: -922,337,203,685,477 to 922,337,203,685,477 |
CurrencyCode |
string |
- |
Required The 3-letter ISO 4217 currency code for the currency paid to the provider. |
CustomFields |
Array |
Custom Field |
The parent element for custom fields. |
FormofPaymentCode |
string |
- |
Required The code for the form of payment. Possible values: CASH (Cash), CCARD (Credit Card), CPAID (Company Paid) |
GeneralDetail |
GeneralDetail |
- |
The details of a general transaction. This element is required when the Type value is General. |
HotelDetail |
HotelDetail |
- |
The details of a hospitality service. This element is required when the Type value is Hotel. |
ImageBase64 |
string |
- |
The binary receipt image in Base64 encoding. This API supports PNG, JPEG, JPG, and PDF file formats. |
MatchingFact |
MatchingFact |
- |
Required The parent element for information that is used to match the receipt to the Concur user who initiated the transaction. The MatchingFact object must contain either a valid access token or a Concur login ID. |
Merchant |
Merchant |
- |
Required The parent element for information about the provider who is posting the receipt. |
PaymentCard |
PaymentCard |
- |
The parent element for the credit card used for payment. This element is required when the FormofPaymentCode value is CCARD. |
RideDetail |
RideDetail |
- |
The details of a hired ride. This element is required when the Type value is Ride. |
TransactionDateTime |
DateTime |
- |
Required The date and time when the transaction happened (in Local Time). Format: YYYY-MM-DDThh:mm |
Type |
string |
- |
Required The type of receipt. Possible values: General, Ride, Hotel |
Custom Field
| Name |
Type |
Format |
Description |
Name |
string |
- |
Required The name of the custom field. Maximum length: 128 characters |
Value |
string |
- |
Required The value of the custom field. Maximum length: 256 characters |
General Detail
| Name |
Type |
Format |
Description |
LineItems |
Array |
Line Item |
The parent element for the line items in the receipt. There is a LineItem child element for each line item. |
Line Item
| Name |
Type |
Format |
Description |
Amount |
Decimal |
- |
Required The total charged amount for the line item. Range: -922,337,203,685,477 to 922,337,203,685,477 |
Date |
DateTime |
- |
The date and time when the line item was charged (in Local Time). Format: YYYY-MM-DDThh:mm |
Description |
string |
- |
Required The item’s description. Maximum length: 100 characters |
Description2 |
string |
- |
Additional details about the item. In the receipt image, the secondary description appears on the line following the primary description. Maximum length: 32 characters |
Quantity |
Int32 |
- |
The quantity of units. Format: Any positive number |
Rate |
Decimal |
- |
The amount charged per unit. Range: -922,337,203,685,477 to 922,337,203,685,477 |
RateType |
string |
- |
The unit of measure or rate type. Possible values: HOUR or PER HOUR, DAY or PER DAY, WEEK or PER WEEK, MONTH or PER MONTH. Maximum length: 10 characters |
Reference |
string |
- |
The item’s SKU, identifier, or some other attribute the provider uses to reference the item. Maximum length: 32 characters |
SequenceNumber |
Int32 |
- |
Required The order in which the item appears in the sequence of line items. |
Hotel Detail
| Name |
Type |
Format |
Description |
AverageDailyRoomRate |
Decimal |
- |
Required The sum of the room rate for each night stayed, divided by the number of nights stayed. Range: -922,337,203,685,477 to 922,337,203,685,477 |
CheckinDateTime |
DateTime |
- |
Required The check-in date and time (in Local Time). Format: YYYY-MM-DDThh:mm |
CheckoutDateTime |
DateTime |
- |
Required The check-out date and time (in Local Time). Format: YYYY-MM-DDThh:mm |
ConfirmationNumber |
string |
- |
The confirmation number for the booking. Maximum length: 32 characters |
GNR |
string |
- |
The Guest Name Record (GNR) for the stay. Maximum length: 20 characters |
LineItems |
Array |
Line Item |
The parent element for the line items in the receipt. There is a LineItem child element for each line item. |
NumberInParty |
Int32 |
- |
The number of people for this stay. |
RatePlanType |
string |
- |
The rate plan type that is used to calculate the room rate. Possible values are rate plan types defined using hospitality industry standards. Maximum length: 50 characters |
RoomNumber |
string |
- |
The room number for the stay. Maximum length: 15 characters |
RoomType |
string |
- |
The type of room. Possible values are room types defined using hospitality industry standards, such as Single, Double, Suite, and so on. Maximum length: 50 characters |
Matching Fact
| Name |
Type |
Format |
Description |
Type |
string |
- |
Required The type of matching fact that is used to identify the Concur user who owns the receipt. Possible values: OAuth, Login |
Value |
string |
- |
Required The value of the matching fact. If the Type element is set to OAuth, this value must be the access token for the Concur user who owns the receipt. In this case, the access token must not be expired or revoked. If the Type element is set to Login, this value must be the login ID of the Concur user who owns the receipt. |
Merchant
| Name |
Type |
Format |
Description |
Location |
Location |
- |
Required The parent element for the provider location. |
Name |
string |
- |
Required The name of the provider (Merchant ). Maximum length: 64 characters |
Location
| Name |
Type |
Format |
Description |
Address |
string |
- |
The provider’s street address. Maximum length: 100 characters |
Address2 |
string |
- |
The provider’s secondary street address. Maximum length: 50 characters |
City |
string |
- |
The provider’s city. Maximum length: 100 characters |
CountryCode |
string |
- |
Required The provider’s country. Format: 2-letter ISO 3166-1 country code |
CountrySubdivisionCode |
string |
- |
The provider’s state, province, or other country subdivision. Format: ISO 3166-2:2007 country subdivision code YYY, where YYY is the one-to-threeÐcharacter subdivision code |
EmailAddress |
string |
- |
The provider’s email address. Maximum length: 255 characters |
FaxNumber |
string |
- |
The provider’s fax number. Maximum length: 32 characters |
InternetAddress |
string |
- |
The provider’s Web address. Maximum length: 255 characters |
Name |
string |
- |
The name of the provider’s location, such as an airport, car rental agency, property, store, or other named location. Maximum length: 100 characters |
PostalCode |
string |
- |
The provider’s postal code. Maximum length: 20 characters |
TelephoneNumber |
string |
- |
The provider’s telephone number. Maximum length: 100 characters |
Payment Card
| Name |
Type |
Format |
Description |
AuthorizationCode |
string |
- |
The authorization code that the card interchange provided when it approved this purchase. Maximum length: 15 characters |
MaskedNumber |
string |
- |
Required The masked card number for the credit card. With the exception of the AX (American Express) card type, this is the last four digits of the card number. For American Express, the value can be one of these, in order of preference: a) The first six digits and the last four digits of the card number. b) The last five digits. c) The last four digits. |
type |
string |
- |
Required The card interchange for the credit card. Possible values: AX (American Express), DC (Diner’s Club), DS (Discover), CA (MasterCard), VI (Visa), CB (Carte Blanche), ER (Enroute), TP (Universal Air Travel), JC (JCB), EC (EuroCard), OTHER (other types) |
Ride Detail
| Name |
Type |
Format |
Description |
DriverName |
string |
- |
The name of the driver. Maximum length: 255 characters |
DropoffLatitude |
Decimal |
- |
The latitude of the ride end location. Range: -90 to 90 |
DropoffLongitude |
Decimal |
- |
The longitude of the ride end location. Range: -180 to 180 |
EndDateTime |
DateTime |
- |
Required The ending date and time for the ride (in Local Time). Format: YYYY-MM-DDThh:mm |
LineItems |
Array |
Line Item |
The parent element for the line items in the receipt. There is a LineItem child element for each line item. |
StartDateTime |
DateTime |
- |
Required The starting date and time for the ride (in Local Time). Format: YYYY-MM-DDThh:mm |
VehicleNumber |
string |
- |
The unique identifier for the vehicle. Maximum length: 50 characters |
Request URL
https://www.concursolutions.com/api/v3.0/common/receipts
JSON example of a successful response
{
"ID": "270583561310",
"URI": ""
}


WITNESS LIST Defense Affairs and State-Federal Relations Committee (SUBCOMMITTEE ON Base Realignment and Closure) April 19, 2004-1:00P BRAC On: Goldsmith, Randy (San Antonio Technology Accelerator Initiative) Jernigan, BGen (Ret) John (Executive Director - San Antonio Military Missions) Rasmussen, Bob (Kelly USA) Federal-Civilian Healthcare - SA On: Rasco, Bill (Greater San Antonio Hospital Council) House Senate BRAC hearing On: Miller, Bruce E. (Greater Kelly Development Authority) Internat'l Inst. for Human Perform On: Sharon, Danny (Frontline Systems, Inc.) Joint House/Senate BRAC hearing On: Schubert, Carroll W. (City of San Antonio) State Legislature / BRAC issues On: Rumora, Thomas (Brooks Development Authority) Texas Military Preparedness Comm. Registering, but not testifying: On: Smith, Michael (Texas Military Preparedness Commission) TMPC On: Duncan, York (Texas Research Park Foundation) TMPC & Base Realignment and Closure On: Alcala , Mayor Dora (Texas Military Planning Commission (TMPC))


--- layout: page category: spec title: "Resource Priorities" ---
| Current Status: | Note (NOTE) |
|---|---|
| Canonical URI: |
http://www.w3.org/TR/resource-priorities
|
| Abstract: | This specification defines a means for site developers to programmatically give the User Agent hints on the download priority of a resource. This will allow User Agents to more efficiently manage the order in which resources are downloaded. |
Resource PrioritiesUpdates:


--- layout: post title: Moving and archiving. published: true date: 2010-09-01 categories: [] posterous_url: http://blog.hungerandthirstdesign.com/post/1047033944/moving-and-archiving posterous_slug: post/1047033944/moving-and-archiving ---
I’ve finally decided to break down and not maintain my own blogging engine. Oddly enough, almost all Rails tutorials are all about “how to create a blog in under 15 minutes” but the maintaining one is actually not worth it when there are so many worthy blogging webapps out there. This is a cool one. Its like the awesome, non-bloated Wordpress cousin.
…INITIATE IMPORT…
hungerandthirstdesign.com/blogs will now become blog.hungerandthirstdesign.com
Thanks for watching!


Here is a sound recording of what will come to be known as “the legendary Jellyfish session”, when Lepke B. and I performed at the now-demolished theatre in October. In the accompanying snap, Lepke is but an orange blur, but this is hardly surprising given the dizzying physical manoeuvres he adopts when plying his art. The voice you hear introducing us is the Benevolent Dictator of ResonanceFM, Ed Baxter (as featured in The Independent On Sunday Happy List 2009).
Listen here


Get detailed information for:
Barrow Street
Benson Street
Blackhall Place
Blessington Street
Bolton Street
Brookfield Road
Cathal Brugha Street
Charlemont Street
Chatham Street
Christchurch Place
City Quay
Clonmel Street
Collins Barracks Museum
Convention Centre
Custom House Quay
Custom House
Dame Street
Denmark Street Great
Deverell Place
Earlsfort Terrace
Eccles Street East
Eccles Street
Emmet Road
Exchequer Street
Excise Walk
Fenian Street
Fitzwilliam Square East
Fitzwilliam Square West
Fownes Street Upper
Francis Street
Frederick Street South
Golden Lane
Grand Canal Dock
Grantham Street
Grattan Street
Greek Street
Guild Street
Hanover Quay
Harcourt Terrace
Hardwicke Place
Hardwicke Street
Hatch Street
Herbert Place
Herbert Street
Heuston Bridge (North)
Heuston Bridge (South)
Heuston Station (Car Park)
Heuston Station (Central)
High Street
James Street East
James Street
Jervis Street
John Street West
Kevin Street
Kilmainham Gaol
Kilmainham Lane
King Street North
Leinster Street South
Lime Street
Market Street South
Mater Hospital
Merrion Square East
Merrion Square West
Molesworth Street
Mount Brown
Mount Street Lower
Mountjoy Square West
New Central Bank
Newman House
North Circular Road
Oliver Bond Street
Ormond Quay Upper
Parkgate Street
Parnell Square North
Parnell Street
Pearse Street
Portobello Harbour
Portobello Road
Princes Street / O'Connell Street
Rothe Abbey
Royal Hospital
Sandwith Street
Sir Patrick's Dun
Smithfield North
Smithfield
South Dock Road
St James Hospital (Luas)
St. James Hospital (Central)
St. Stephen's Green East
St. Stephen's Green South
Strand Street Great
Talbot Street
The Point
Townsend Street
Upper Sherrard Street
Western Way
Wilton Terrace
Wolfe Tone Street
York Street East
York Street West
Station Name


2020
©2020 JASP Hotel. All rights reserved
Make your life luxurious and ease the living.
Time is very crutial for everyone. We are pleased to get you to our digital way of using of rooms. We love to serve our customers in a proper and delight way. Hope you love and will make our hotel as a your first choice while travelling again.


As IoT develops, and emoncms becomes a player in MQTT, the issue of security is becoming more important, so I've got a freebie SSL certificate (being a Yorkshireman!) from https://www.startssl.com/ and am enabling https for both servers.
Node-red has https options built in, so it was pretty easy to implement, and my apache server likewise.
However emoncms does not take kindly to https, and the only page which opens is the 'Account' landing page, all other menu items create a 404 error.
I see that a patch was implemented almost 3 years ago into index.php but there is no mention of it now (has it got lost in the revisions?
Has anyone had any success using emoncms over a secure connection?
Paul
Re: emoncms over https [Solved}
I haven't sorry Paul but I am interested in this, for the same reasons as you. Did you follow a guide for setting up your certificate on Apache? I have already obtained a certificate from startssl, like you, but am pretty lost as to how to configure my web server...
Re: emoncms over https [Solved}
I have my local emoncms working in https with a self-signed SSL certificate on debian/apache2 and I haven't noticed any problems, with the website or posting new data. I haven't changed anything particular regarding the emoncms installation.
Re: emoncms over https [Solved}
bond79 - did you change to https before or after installing emoncms?
I suspect the the former.
Paul
Re: emoncms over https [Solved}
Yes, I had https installed before and used the https url to setup emoncms.
Re: emoncms over https [Solved}
In that case, it's possibly URLs saved in MYSQL that is causing issues.
I'm aware that emoncms does use absolute URLs for certain functions instead of relative URLs, such as graphs, So maybe need to have a look around the MYSQL table and see if I can spot any URLs needing updating that would affect the config.
Ben - I'll post something about https setup when I get home this evening.
Paul
Re: emoncms over https [Solved}
The absolute URL is indeed used in the dashboard settings in MySQL when referring to embedded graphs. I didn't find any other references. These of course should be changed to allow dashboard to function properly but I don't think it's the problem.
The 404 problems make me suspect that the https virtualhost of apache is not setup correctly to allow .htaccess rewrites. Https and http use seperate virtualhost entries and it must be configured seperately for the emoncms directory or the whole server.
Re: emoncms over https [Solved}
I've changed the default-ssl file from;
<Directory />
Options FollowSymLinks
AllowOverride None
</Directory>
<Directory /var/www>
Options Indexes FollowSymLinks MultiViews
AllowOverride None
Order allow,deny
allow from all
</Directory>
to
<Directory />
Options FollowSymLinks
AllowOverride All
</Directory>
<Directory /var/www>
Options Indexes FollowSymLinks MultiViews
AllowOverride All
Order allow,deny
allow from all
</Directory>
And now it works fine, and I can access all of the emoncms links over https.
I just need to access phpmyadmin and change the dashboard column to 'https' instead of 'http' and try to find a way of getting rid of the Gravatar link from the 'account' page as the link is an insecure resource and affects the secure certification. Does anyone really use the gravatar feature anyway - I don't think it's even documented anywhere or mentioned in the forums...?
Paul
Re: emoncms over https [Solved}
For info, I've documented the whole process in this post - http://openenergymonitor.org/emon/node/5997
Paul


We are the first Photography Tourism Agency that is changing the concept of travel memories by taking Instant Printed Pictures as a souvenir. Our professional photographers will help you to be the protagonist of your trip.

Travel, smile & get it printed!
We are the first Photography Tourism Agency that is changing the concept of travel memories by taking Instant Printed Pictures as a souvenir. Our professional photographers will help you to be the protagonist of your trip.

Travel, smile & get it printed!
MORE INFORMATION


wc-frag
An html fragment handler
... basically pulls in html body sections from other web pages
Page 1
Page 2
Page 1+2
None


Class collections.RBCell
All Packages Class Hierarchy This Package Previous Next Index
Class collections.RBCell
java.lang.Object
|
+----collections.Cell
|
+----collections.RBCell
- public class RBCell
- extends Cell
- implements ImplementationCheckable
RBCell implements basic capabilities of Red-Black trees,
an efficient kind of balanced binary tree. The particular
algorithms used are adaptations of those in Corman,
Lieserson, and Rivest's Introduction to Algorithms.
This class was inspired by (and code cross-checked with) a
similar class by Chuck McManis. The implementations of
rebalancings during insertion and deletion are
a little trickier than those versions since they
don't swap cell contents or use a special dummy nilnodes.
It is a pure implementation class. For harnesses, see:
- See Also:
- RBTree
-
color_
- The node color (RED, BLACK)
-
left_
- Pointer to left child
-
right_
- Pointer to right child
-
RBCell(Object)
- Make a new cell with given element, null links, and BLACK color.
-
assert(boolean)
- Implements collections.ImplementationCheckable.assert.
-
checkImplementation()
-
-
clone()
- Return a new RBCell with same element and color as self,
but with null links.
-
copyTree()
- Return a new subtree containing each element of current subtree
-
count(Object, Comparator)
- Return number of nodes of current subtree containing element.
-
delete(RBCell)
- Delete the current node, and then rebalance the tree it is in
-
find(Object, Comparator)
- Return node of current subtree containing element as element(),
if it exists, else null.
-
fixAfterDeletion(RBCell)
- From CLR
-
fixAfterInsertion(RBCell)
- From CLR
-
insertLeft(RBCell, RBCell)
- There's no generic element insertion.
-
insertRight(RBCell, RBCell)
- Insert cell as the right child of current node, and then
rebalance the tree it is in.
-
isRoot()
- Return true if node is a root (i.e., has a null parent)
-
left()
-
Return left child (or null)
-
leftmost()
- Return the minimum element of the current (sub)tree
-
parent()
-
Return parent (or null)
-
predecessor()
- Return the inorder predecessor, or null if no such
-
right()
-
Return right child (or null)
-
rightmost()
- Return the maximum element of the current (sub)tree
-
root()
- Return the root (parentless node) of the tree
-
rotateLeft(RBCell)
- From CLR
-
rotateRight(RBCell)
- From CLR
-
size()
- Return the number of nodes in the subtree
-
successor()
- Return the inorder successor, or null if no such
color_
protected boolean color_
- The node color (RED, BLACK)
left_
protected RBCell left_
- Pointer to left child
right_
protected RBCell right_
- Pointer to right child
RBCell
public RBCell(Object element)
- Make a new cell with given element, null links, and BLACK color.
Normally only called to establish a new root.
clone
protected Object clone() throws CloneNotSupportedException
- Return a new RBCell with same element and color as self,
but with null links. (Since it is never OK to have
multiple identical links in a RB tree.)
- Overrides:
- clone in class Cell
left
public final RBCell left()
- Return left child (or null)
right
public final RBCell right()
- Return right child (or null)
parent
public final RBCell parent()
- Return parent (or null)
checkImplementation
public void checkImplementation() throws ImplementationError
- See Also:
-
assert
public void assert(boolean pred) throws ImplementationError
- Implements collections.ImplementationCheckable.assert.
- See Also:
- assert
leftmost
public final RBCell leftmost()
- Return the minimum element of the current (sub)tree
rightmost
public final RBCell rightmost()
- Return the maximum element of the current (sub)tree
root
public final RBCell root()
- Return the root (parentless node) of the tree
isRoot
public final boolean isRoot()
- Return true if node is a root (i.e., has a null parent)
successor
public final RBCell successor()
- Return the inorder successor, or null if no such
predecessor
public final RBCell predecessor()
- Return the inorder predecessor, or null if no such
size
public final int size()
- Return the number of nodes in the subtree
find
public RBCell find(Object element,
Comparator cmp)
- Return node of current subtree containing element as element(),
if it exists, else null.
Uses Comparator cmp to find and to check equality.
count
public int count(Object element,
Comparator cmp)
- Return number of nodes of current subtree containing element.
Uses Comparator cmp to find and to check equality.
copyTree
public RBCell copyTree()
- Return a new subtree containing each element of current subtree
insertLeft
public RBCell insertLeft(RBCell cell,
RBCell root)
- There's no generic element insertion. Instead find the
place you want to add a node and then invoke insertLeft
or insertRight.
Insert cell as the left child of current node, and then
rebalance the tree it is in.
- Parameters:
- cell - the cell to add
- root, - the root of the current tree
- Returns:
- the new root of the current tree. (Rebalancing
can change the root!)
insertRight
public RBCell insertRight(RBCell cell,
RBCell root)
- Insert cell as the right child of current node, and then
rebalance the tree it is in.
- Parameters:
- cell - the cell to add
- root, - the root of the current tree
- Returns:
- the new root of the current tree. (Rebalancing
can change the root!)
delete
public RBCell delete(RBCell root)
- Delete the current node, and then rebalance the tree it is in
- Parameters:
- root - the root of the current tree
- Returns:
- the new root of the current tree. (Rebalancing
can change the root!)
rotateLeft
protected final RBCell rotateLeft(RBCell root)
- From CLR
rotateRight
protected final RBCell rotateRight(RBCell root)
- From CLR
fixAfterInsertion
protected final RBCell fixAfterInsertion(RBCell root)
- From CLR
fixAfterDeletion
protected final RBCell fixAfterDeletion(RBCell root)
- From CLR
All Packages Class Hierarchy This Package Previous Next Index


|
MAX32665 SDK Documentation
0.2
Software Development Kit Overview and API Documentation
|
Cache Control and Status Register. More...
Macros | |
| #define | MXC_F_EMCC_CACHE_CTRL_CACHE_EN_POS 0 |
| CACHE_CTRL_CACHE_EN Position. | |
| #define | MXC_F_EMCC_CACHE_CTRL_CACHE_EN ((uint32_t)(0x1UL << MXC_F_EMCC_CACHE_CTRL_CACHE_EN_POS)) |
| CACHE_CTRL_CACHE_EN Mask. | |
| #define | MXC_F_EMCC_CACHE_CTRL_WRITE_ALLOC_EN_POS 1 |
| CACHE_CTRL_WRITE_ALLOC_EN Position. | |
| #define | MXC_F_EMCC_CACHE_CTRL_WRITE_ALLOC_EN ((uint32_t)(0x1UL << MXC_F_EMCC_CACHE_CTRL_WRITE_ALLOC_EN_POS)) |
| CACHE_CTRL_WRITE_ALLOC_EN Mask. | |
| #define | MXC_F_EMCC_CACHE_CTRL_CWFST_DIS_POS 2 |
| CACHE_CTRL_CWFST_DIS Position. | |
| #define | MXC_F_EMCC_CACHE_CTRL_CWFST_DIS ((uint32_t)(0x1UL << MXC_F_EMCC_CACHE_CTRL_CWFST_DIS_POS)) |
| CACHE_CTRL_CWFST_DIS Mask. | |
| #define | MXC_F_EMCC_CACHE_CTRL_CACHE_RDY_POS 16 |
| CACHE_CTRL_CACHE_RDY Position. | |
| #define | MXC_F_EMCC_CACHE_CTRL_CACHE_RDY ((uint32_t)(0x1UL << MXC_F_EMCC_CACHE_CTRL_CACHE_RDY_POS)) |
| CACHE_CTRL_CACHE_RDY Mask. | |


Is the one been second-killed first?
问题描述 :
Long long ago, a problem was spread all over the world , but no one could solve it . Now, due to the Internet , it has been solved perfectly(See figure 1).
Now here’s a problem much harmonious.
ErEr has big cake weighing m grams , at the same time he has n children . and every children want a part of the cake weighs even number(偶数) of grams. The children are extremely hungry and want to start their meal as soon as possible, that’s why you should help them and find out, if they can divide the cake in the way they want. For sure, each of them should get a part of positive weight.
Now here’s a problem much harmonious.
ErEr has big cake weighing m grams , at the same time he has n children . and every children want a part of the cake weighs even number(偶数) of grams. The children are extremely hungry and want to start their meal as soon as possible, that’s why you should help them and find out, if they can divide the cake in the way they want. For sure, each of them should get a part of positive weight.
输入:
The first line of input gives the number of cases, T (at most 100).
each case has there numbers m,n. (1<=m<=10000，1<=n<=100)
each case has there numbers m,n. (1<=m<=10000，1<=n<=100)
输出:
The first line of input gives the number of cases, T (at most 100).
each case has there numbers m,n. (1<=m<=10000，1<=n<=100)
each case has there numbers m,n. (1<=m<=10000，1<=n<=100)
样例输入:
2 10 2 11 2
样例输出:
YES NO
#include <stdio.h> int main(){ int t,m,n; scanf("%d",&t); while(t--){ scanf("%d%d",&m,&n); printf("%s\n",(m%n==1||m/2<n)?"NO":"YES"); } }
(adsbygoogle = window.adsbygoogle || []).push({});
但愿是利用巨型弹弓弹射刺客去攻击敌人
a是根先忽略掉，递归子树。剩下前缀bejkcfghid和后缀jkebfghicd，分拆的原则的是每个子树前缀和后缀的节点个数是一样的，根节点出现在前缀的第一个，后缀的最后一个。根节点b出现后缀的第四个位置，则第一部分为四个节点，前缀bejk，后缀jkeb，剩下的c出现在后缀的倒数第2个，就划分为cfghi和 fghic，第3部分就为c、c
第一句可以忽略不计了吧。从第二句开始分析，说明这个花色下的所有牌都会在其它里面出现，那么还剩下♠和♦。第三句，可以排除2和7，因为在两种花色里有。现在是第四句，因为♠还剩下多个，只有是♦B才能知道答案。
多谢支持！
确实有点难度，搞了好久。int溢出要注意
int L[m+1][n+1];这样定义出错，这个在gcc上可以编译通过 在VS上不行 应该改为new 或者vector
第二个方法很不错啊
这个.. 真没看出来
请问printAllCombination的时间复杂度怎么分析呢？
#include <cstdio>
#include <cstring>
const int MAXSIZE=256;
//char store[MAXSIZE];
char str1[MAXSIZE];
/*
void init(char *store) {
int i;
store['A']=’V', store['B']=’W',store['C']=’X',store['D']=’Y',store['E']=’Z';
for(i=’F';i<=’Z';++i) store =i-5;
}
*/
int main() {
//freopen("input.txt","r",stdin);
//init(store);
char *p;
while(fgets(str1,MAXSIZE,stdin) && strcmp(str1,"STARTn")==0) {
if(p=fgets(str1,MAXSIZE,stdin)) {
for(;*p;++p) {
//*p=store[*p]
if(*p<’A’ || *p>’Z') continue;
if(*p>’E') *p=*p-5;
else *p=*p+21;
}
printf("%s",str1);
}
fgets(str1,MAXSIZE,stdin);
}
return 0;
}
秒！~
#!/usr/bin/env python def cou(n): arr = [1]
第二种解法如果数组有重复元素 就不正确
感谢~速度真快，我很喜欢这个网站，从基础看起。
嗯，尽量吧。题目太多了，很多解题报告是用程序自动发布的，所以就只有代码了


 For more information, see Uploading
a Build to Amazon GameLift in the Amazon GameLift Developer Guide.
Syntax
Properties
Key
-
The prefix (folder name) where the GameLift build package files are located.
Required: Yes
Type: String
RoleArn
-
An AWS Identity and Access Management (IAM) role Amazon Resource Name (ARN) that GameLift can assume to retrieve the build package files from Amazon Simple Storage Service (Amazon S3).
Required: Yes
Type: String


Create an account on one of the following Galaxy servers:
Training Infrastructure as a Service (TIaaS) helps Galaxy workshops run smoothly.
The procedure for this is different depending on the server you are on:
Slack is where you can ask all your questions


scroll up|dn, left|right to change color and brightness;
ctrl+scroll for transparency and luminosity;
use two-touches for ctrl on touchscreen
nosepicker.micro.js
converts any specified element into an html color picker;
it generates customizable
nose-input
and
nose-change events that
can be listened for, and handled, just like any other
<input type=color> object
include the script, then indicate which elements you
would like to be nosepickers by including a
data-param;
add a
‑‑nose-hsla variable to the css style tag;
any options can be specified in the well-formatted JSON
value of the
data-param
here is an example that lists all of the default values
just so that you will know what all the defaults are:

what do all of these defaults mean?
- selector: the name that you want to use
as the data-param to label which elements should
be selected; by default, nosepicker.js will select any
element with <element data-nose> as a parameter;
whatever string you make this value will change
the name of the input event and the css
--nose-hsla variables; for example, if you set
the selector to "picker", then the input event
name will be picker-input and the css variables
will be ‑‑picker-hsla; this
value can be overwritten by the data-param
of any individual nose.picker
- pattern: a boolean indicating whether or not
you would like a background pattern to appear behind
transparent colors; by default, this is false
- root: the name of the element that you would
like to actually use as the element whose color
values are the ones that the nosepicker will change;
that is to say, scrolling up|dn on a particular element
can change the color values of any element
in the page that you specify - by default, nosepickers
change themselves
- ‑‑nose‑hsla:
the script reads initial values from a css variable;
by default, it is called
‑‑nose‑hsla,
but the prefix will be whatever you set the
selector option to, if you chose to change it;
if no value is created, it will default to
hsla(0,100%,50%,1); these values may also be
entered as a simple string as so: '0,100,50,1'
- nose‑input: this is the
default name of the input event that
gets generated oninput - again, the prefix
will be the value of the selector
option string, and can be overwritten by
the data-param of individual pickers
- e.detail: the detail of either
event is equal to an hsla() color string
- css variables: by default, nosepicker.js will
set the values of several css variables called
‑‑nose-hsla for the full hsla color string,
‑‑nose-h for just the hue,
‑‑nose-s for just the saturation,
&c. &c.
these variable names will begin with whatever you
specify as the selector
- nose‑change: the default name of
the onchange event; all detail
and css variable values are identical to those
of the input event
- dispatch set‑nose: interactions
with nosepickers are done through the dispatching
of events; by default, nosepickers listen for
a set-nose event whose detail is a
four-element array of the hsla float values;
this event name is altered by the selector
- dispatch tog‑nose
:
sending a tog-nose event to the
picker will toggle its disability; no
detail needs to be passed in
nosepicker.js will attempt to convert any element
into a color picker; here is an example of an
svg path
being used to generate an hsla output string;
double-clicking will toggle the pickers
disability insurance
let's look at an example of when you would want to use
a different root element;
all of the aspects of this div are styled using
css vars that calc() their values based
on the ‑‑nose-hsla values;
this way, selecting colors in the bar below
alters all the relative colors for the entire
style sheet of this div, including theme colors;
double-click the picker to dispatch a
set-nose event that resets the original
color values
if you are happy with the defaults, that is:
- you do not want a patterned background
- you are alright using data-nose as the parameter
name
- and you can use css calc() instead of
an event handler
then you can use the
even smaller
nosepicker.nano.js
the nano~fied version is more than simply a compressed
version of
nosepicker.micro.js; it has
been explicitly designed to be incredibly small - you can
learn more about it here

if you are NOT happy with that, there is a more complex,
customizable, full-scale nosepicker whose features are
discussed here
as well as a much smaller and extremely useful
nano~fied version
~queviva


Experiment by pressing the buttons to get/set device settings.
Get the app name...
Get the bundle version...
Get the app display name...
Get the app identifier...
Get the device height...
Get the device width...
Copy text...
Paste text...
Reboot...


Enter Team Information for Round {{round}} Pairings:
Below are the team pairings resulting from round {{round}}. Resolve impermissibles from top to bottom to continue to enter in scores for round {{round}}.
Swap list: {{swapList}}
Round 3 coin flip: Tab Director must switch Plaintiff and Defense teams if the coin comes up tails.
Plaintiff
Defense
Permissible
Impermissible Proposed Swap: {{pair.inTeam.uniqueID}} and {{pair.outTeam.uniqueID}}


Before Change
jvm_options=jvm_options,
args=args,
workunit_name="jar-tool",
workunit_labels=[WorkUnit.TOOL, WorkUnit.JVM, WorkUnit.NAILGUN])
class JarBuilder(AbstractClass):
A utility to aid in adding the classes and resources associated with targets to a jar.
After Change
args.append(path)
JarTool.global_instance().run(context=self.context, runjava=self.runjava, args=args)
class JarBuilder(AbstractClass):
A utility to aid in adding the classes and resources associated with targets to a jar.


Visualizing the Relationship between Obesity and Contributing Factors
Obese children are approximately 5 times more likely to become obese adults †. Several factors contribute to both adult and childhood obesity.
Nutrition, Physical Activity, and Obesity - Youth Risk Behavior Surveillance System data can be found
here.
The bubble graph below depicts the relationship between obesity and the chosen contributing factor; size of bubbles reflects county population.
Change Factor ▼
Median Income
Unemployment Rate
Childhood Poverty Rate
Smoking
Exercise Opportunities
Excessive Drinking


This page contains most basic information about BENJA and its usage. Please note that every supported board might have slightly different setup, hardware acceleration capabilities, or setup.
Debian / Ubuntu users
Please install the following before proceeding with the installation:
sudo apt install curl libarchive-tools
Other distro/OS dependencies
This is the list of command line utilities used by the installer: bsdtar
, curl
, fdisk
, lsbklk
, mkfs
, parted
, and sudo
.
If your environment has these utilities and a bash
terminal, you should be able to prepare an SD card.
How to create the B.E.N.J.A. environment
All you need to do, is type the following in your ArchLinux terminal, and follow the instructions:
bash <(curl -s https://archibold.io/benja/prepare)
How to Develop
Creating applications is as easy as writing the following from the APP
disk folder:
$ npm start
This is indeed what gets executed once Benja OS starts, except it’ll have sudo
privileges to be able to use GPIO.
If you’d like to develop remotely, write the following in console, substituting x
with your values (to know which IP address your card has, type ip addr
in its terminal once connected):
$ ssh<EMAIL_ADDRESS>password: xxxxxxxx
At this point you can use nano ~/app/index.js
to edit that file or, if your IDE supports it, you can use rmate which is already available in Benja OS.
This gives you the ability to also test directly GPIO related operations through the board.
How to reload the App
There are at least a couple of ways to do it: remotely and directly through the app.
The default app example uses a watcher on its main index.js
file:
// for debugging purpose, it might be handy to be able
// to reload the window simply via `touch ~/app/reload`
require('fs').watch('reload', () => app.quit());
Once logged in via ssh
all you need to do is to write the following:
touch ~/app/reload
This will quit the app and thanks to BenjaOS configuration it will also restart it. Alternatively you could put a simple script on the page such:
<script>
// set double click handler and reload the page if triggered
document.documentElement.ondblclick = () => location.reload();
</script>
It could be any sort of event, or a combination of keys, a gesture, a button.
Bear in mind you could even spawn
a reboot
via bash or shell, or even invoke a shutdown -h now
: you have full control.
How to load the app remotely
By default, BenjaOS redirects to port 8080
all calls to port 80
, making it simple to use from your browser the same index.html
.
Write http://192.168.1.x
on your browser, being sure the it is the one assigned to your board, and verify everything is OK.
However, if you plug the SD card into your laptop, you can simply run npm start
on BENJA-APP folder and develop directly in there.
Ctrl + Shift + I
to eventually bring up the console and debug like any other HTML page.
Remember, Electron runs with super powers only via the board, not when its site is reached remotely.
How to not boot the App
If you’d like to play around with Arch Linux instead
of booting the app, you can either rename ~/app/package.json
into ~/app/package.jsno
or ~/app/package.jsoff
,
or you could remove it or rename it differently, like ~/app/package.nope
.
This will inform Benja OS that it should just boot in the first available terminal, either on Weston or X11.
How to install App dependencies
If you remove the folder ~/app/node_modules
, Benja will install production only dependencies, without binaries links, automatically next time it starts.
The reason bin-links are not allowed, is that carrying the SD card around would not find those, but it’s handy to have all dependencies that don’t require bin links or build steps into the APP folder.
Every dependency that might need bin links or build steps should be saved into the user home ~/
folder, in your SBC, and eventually globally in your development machine.
As example, raspi-io
or johnny-five
are already installed in ~/node_modules
, so you don’t need to worry about building these against your SBC.
How to include node modules
Due some limitation with current Electron paths, your application might need to include the benja module on top.
// on top of index.js or index.html
// to have access to both local and global modules
require(process.cwd() + '/node_modules/benja').paths();
In alternative, you need to specify manually paths via:
[].push.apply(
require('module').globalPaths,
[process.cwd() + '/node_modules']
.concat(process.env.NODE_PATH.split(':').filter(p => 0 < p.length))
);
How to Update Benja OS
Being simply a specially configured Arch Linux ARM OS, all you need to update the system is the following:
# updates ArchLinux to the latest
sudo pacman -Syu
You can use npm update
too, if needed, in the ~/
or ~/app
folder.
Known Issues
- electron: for some reason Electron starts leaving 1 pixel width and height off. If you have any idea how to fix that, please share, thanks.
- wifi: in some case, Raspberry Pi Zero W might let you configure the WiFi properly, but then it’ll ask again to configure it. If that’s the case, unplug the Raspberry, wait a minute, then switch it on again, as I haven’t found yet the culprit of this issue. However, once BENJA has been setup, the WiFi connection on boot seems to be stable.


Algorithms overview
On their own, data structures usually aren't too useful. Their power becomes much more evident when they're used to create algorithms to solve various problems.
In the next few sections, we'll be covering a variety of algorithms for solving different problems. An algorithm can be thought of as a funnel that takes in some input, executes some finite number of steps and outputs some result.
Given a specific input, some algorithms will always produce the same output. These are referred to as deterministic algorithms. Other algorithms might produce different output for the same input; unsurprisingly, they're known as non-deterministic algorithms.
There are also algorithms whose steps might change randomly from one execution of the algorithm to another. These are known as randomised algorithms. And we also have parallel algorithms, which can execute multiple steps simultaneously on different machines. The various types of algorithms and the ways in which they can be executed are broad.
We'll cover some common deterministic, non-randomised algorithms for solving well-known but interesting problems:


When I have started this project, I have found that Github Pages are requiring to have a copy of an index.html file named 404.html.
There are projects which are solving this problem. For example, there is an
But I wanted to solve the problem personally. Plus, I didn't want to add an extra layer to the project.
As one of my teachers said:
That is why I had created this script: it is simple yet robust.
Copy an index.html with a name 404.html after project compilation is over.
Create a script for
Here is the script:
It is, indeed, simple.
This script is running in the
To start the script automatically, I have modified the package.json file. Here is an excerpt:
Note the "build" parameter - it starts the script. Value of
this parameter instructs
The script will output the success or error message after it finishes.


The Social Jukebox
Songs will be randomly picked from the queue. Anybody can add more songs,
if you drop more than 5 songs we'll random select this many from your
list. Skipping songs breaks the chain and affects everybody else so think
twice before doing so.
Drag and drop songs from Spotify here.
Social Jukebox by
@bkzafar.
All logos, trademarks and artwork are copyright their respective owners.
Powered by Spotify (libspotify), this not endorsed, certified or otherwise approved in any way by Spotify.
Spotify is the registered trade mark of the Spotify Group. Be nice to each other!
Chrome 13+, Firefox 4+


Print map shape file python
2014-12-17
####Create and print map using pandas in python from SHAPE file#####
- Based on this note to print map from shape file, a sort of scripting map creation and printing without using qgis kind GUI.
- The above note uses fiona lib. Intsallation of fiona is super easy with anaconda. Command
conda install fiona
does all the jobs of installing with all its depndancy starting from gdal. Native installtion of gdal and linkingit with python libs are super hard. So anaconda is big big help in working with python. - The above tutorial’s ipython notebook and data used is available from here
- Using th github source data nd code it was tested to get the png file of example data and it was made with out any error.
- The basic functionality is creation of pandas dataframe from shape file and plotting it with matplotlib command. Since it is a pandas, extensive data editing fucntionality of pandas will be supporterd in map creation also, such as filtering, merging, sorting , arithmatic and much more.
- So for example with India shape file and creation of some scatter plot over it.