The Editor window is the window in which the command lines are inserted
The log is the summary of the execution of instructions :
Error messages, warnings and notes
The Output (or OUTPUT) window contains the results from PROC steps
In the left-hand window, two tabs are present
In particular, the Explorer tab provides access to libraries and their contents
The Results tab provides access to all the results generated by SAS during the working session
A program is a series of SAS steps
Mainly of two types of named steps
DATA
PROC
Each step is a series of instructions
which can be accompanied by keywords
and that end with a ;
The steps end with the keyword RUN;
or in the case of certain PROC steps the keyword QUIT;
QUIT; is intended to free the connection with the manipulated objects
Writing a program requires a few basic rules to make it easier to read and debug it
You must always comment on the program
To insert comments, there are two synthaxes
/* Insert comments */
* comment;
Do not hesitate to run the program frequently, taking the necessary precautions, so as not to accumulate bugs
A program is executed by pressing F3 or using the button
At each execution, the system completes the Log window by generating a series of notes, warnings or errors that we learn to decrypt
When tables are generated by the program, we should always check that they correspond to our expectations
The Output tab is fed in the case of certain steps
This tab can quickly turn out to be too large to be interpreted correctly
Don't hesitate to clean this tab using the command Ctrl + E
4 data _null_;
5 put "Hell" "o World!";
6 run;
Hello World!
NOTE: DATA statement used (Total process time):
real time 0.01 seconds
cpu time 0.01 seconds
Link between the program and the database storages
The SAS software has a library system for database management
A library consists of a virtual name assigned to a physical directory
This is where you will store the tables (called data) that contain variables in columns and observations in rows
In order to assign a library, all you have to do is enter the code below in the Editor window, respecting the following syntax:
Example
Libname
exemple
'C:\votre_repertoire\data1';
7 Libname exemple 'C:\votre_repertoire\data1';
NOTE: Libref EXEMPLE was successfully assigned as follows:
Engine: V9
Physical Name: C:\votre_repertoire\data1
Symmetrically, you can unassign a library using the SAS instruction clear .
Example
Library assignments are always made at the start of the program
By default, the only library defined is a temporary library called WORK
The WORK is automatically reinitialized when the SAS programs are closed, and all its content is therefore deleted
To import tables into a library,
two solutions are possible:
SAS Assistant
PROC IMPORT
In the tab File \ Import data ...
in case of problem, possible resolution by launching the AccessDatabaseEngine.exe executable in:Select the Excel sheet previously prepared for import
Then select the library in which the table will be stored under SAS
You must then give a name to the imported table
The name assigned must be adapted to the software, so spaces and special characters must be avoided.
There is also a SAS procedure which allows you to import tables directly without using the wizard
To do this, you have to master the import proc and respect the following syntax
In the previous example, the code that should have been inserted in the Editor window would have been the following:
Likewise, the table would have been permanently stored in the selected library.
The newspaper would then have returned the following note
Note: EXEMPLE.MATABLE was successfully created.
Variable formats are crucial and turn out to be the source of many compilation errors
It is important to be careful with the formats of variables when creating or importing them
SAS formats are defined as follows
< $>format< w>.< d>
| Code | Meaning | $ | Indicates a string type format | format | Keyword which indicates to SAS the desired format attributed | w | Indicates the total length of the variable including spaces and special characters | . | Delimiter between w and d | d | Indicates the number of decimal places required in a numeric variable |
|---|
Character or alphanumeric variables are identified by the symbol $
They have a maximum length defined during an import as the maximum length of the modality associated with the imported variable
| Code | Meaning | $2. | Ab | $UPCASE2. | AB |
|---|
Numeric variables are identified by the number of digits they can contain and a number of decimal places if necessary
| Code | Meaning | 5. | 12345 | 7.2 | 1234.56 | NUMX7.2 | 1234,56 |
|---|
Date variables are the most complex because they are subject to different national conventions
These are special cases of numeric variables
| Code | Meaning | DDMMYY10. | 25/07/2014 | MMYYS7. | 07/2014 | YEAR4. | 2014 | FRADFWDX. | 25 Juillet 2014 | FRADFWKX. | Vendredi 25 Juillet 2014 |
|---|
A poorly defined format can cause errors when compiling a program
However it can happen that the program manages to compile but the errors of definition of formats can corrupt the data in a dramatic way.
For example, take the case of a class of 19 students such as:
During the year, a new student joins the class
Its description is contained in the nouvelle_eleve table such as:
I integrate the new student into the class
The Name variable was initially defined by default as an 8 character string.
Jean-Charles is a 12 character string it has been truncated at the 8th character.
I then want to implement the exam grades stored in the grade table
The Name variable this time was defined as a string of 12 characters maximum
According to the reference table that I will select, the program will run but 2 types of results are expected
If the Class table is taken as a reference, with name defined $ 7. I get :
If the Note table is taken as a reference, with name defined $ 12. I get :
In the first case, the 'Jean-Charles' modality is not possible. SAS then recognizes 'Jean-Cha' in the two tables and manages to make the link between the two individuals.
In the second case, the 'Jean-Charles' modality is a possible modality. SAS then identifies 2 individuals, Jean-Cha present in the Class table, and Jean-Charles present in the Note table.
Although the program did not generate an error, the incorrect attribution of formats duplicated individuals and generated missing values in the worst case. In the best of the two cases, it's just a matter of display.
Comparison operators
| Code | Meaning | LT | < | Less than | EQ | = | Equal | GT | > | Greater than | LE | <= | Less or equal | NE | ^= | Non equal | GE | >= | Greater or equal |
|---|
Logical Operators
| Code | Meaning | AND | & | and | OR | ! | or | NOT | ^ | not |
|---|
Arithmetic operators
| Code | Meaning | + | Addition | - | Subtraction | * | Multiplication | / | Division | x <> y | Min(x,y) | Minimum between x and y | x >< y | Max(x,y) | Maximum between x and y |
|---|
Concatenation of strings
| Code | Exemple | Meaning | !! ou || | Var = x||y||z | Simple concatenation |
|---|---|---|
| CATS | Var = CATS(x,y,z) | Concatenation by removing the blanks at the start and end of character chain | CATX | Var = CATX('-',x,y,z) | Concatenation by adding a separator between the variables |
| CAT | Var = CAT(x,y,z) | Concatenation while keeping blanks at the start and end of character string |
| CATT | Var = CATT(x,y,z) | Concatenation by removing blanks only in end of strings |
Below are presented functions which take strings as arguments (here noted x)
| Code | Meaning | Length(x) | Returns the length of x | Compress(x,'c') | Remove the characters c from the string x | Repeat(x,n) | Repeat the string x x n times in one string of characters | Index (x, m) | Returns the place of the word m in the character string x | Upcase (x) | Make x uppercase | Lowcase (x) | Make x lowercase | Substr (x, n, l) | Extracts from x a word of length l starting from the nth character | Scan (x, n, 'sep') | Extract from x the nth word by considering a certain separator 'sep' | Tranwd (x, y, z) | Replace occurrences of word y by word z |
|---|
Below are presented functions related to dates (here noted d)
| Code | Meaning | mdy (m, j, a) | Create a date of day d, month m and year n | Date () | Returns the current date | Datepart (d) | Extract part of date from | Day (d) | Returns the day of the date of | Month (d) | Returns the month of the date of | Year (d) | Returns the year of date d | Weekday (d) | Returns the day of the week of the date of |
|---|
Below are presented the main mathematical functions taking by arguing a numerical variable (here noted x)
| Code | Meaning | Floor (x) | Returns the integer part of x | abs (x) | Absolute value of x | Sign (x) | Returns 1 if x is positive, -1 if x is negative and 0 otherwise | Round (x, n) | Returns the rounding of x with n decimal places | Mod (x, y) | Returns the remainder of the Euclidean division of x by y | sqrt (x) | Returns the square root of x | exp (x) | Returns the exponential of x | Log (x) | Returns the logarithm of x |
|---|
Below are presented the main trigonometric functions taking by arguing a numerical variable (here noted x)
| Code | Meaning | Cos(x) | Returns the cosine of x | Sin(x) | Returns the sine of x | Tan(x) | Returns tangent of x | Arcos(x) | Returns the arcosine of x | Arsin(x) | Returns the arsine of x | Artan(x) | Returns the arctangent of x |
|---|
Below are presented the main statistical functions taking by arguing a numerical series, here noted: \[(x_1,\dots x_n)\]
| Code | Meaning | n(x1... xn) | Returns the number of non-missing values in the series \[(x_1,\dots x_n)\] | nmiss(x1... xn) | Returns the number of missing values in the series \[(x_1,\dots x_n)\] | mean(x1... xn) | Returns the mean of the series \[(x_1,\dots x_n)\] | Var(x1... xn) | Returns the empirical variance of the series \[(x_1,\dots x_n)\] |
|---|
Below are presented the functions which allow to generate random numbers of predefined parameters a (usually equal to 0)
| Code | Meaning | Rannor (a) | Reduced centered Normal law | Ranuni (a) | Uniform law on the interval \[[0; 1]\] | Ranpoi (a, l) | Fish law of parameter l | Ranbin (a, n, p) | Binomial distribution of parameters n and p | Rantbl (a, p1, ..., pn) | Discrete distribution law \[p_1,\dots p_n\] |
|---|
Below are two functions that are particularly useful in SAS.
| Code | Meaning | Lag (x) | Returns the previous value of the variable x | Lagn (x) | Returns the previous value n times of the variable x | Dif (x) | Returns the first order difference of the variable x | Difn (x) | Returns the difference between x and Lagn (x) |
|---|
5-concatenation.sas
6-format_num.sas
7-formatdate1.sas


The saphenous nerve, which travels with the great saphenous vein, runs along the medial leg and thigh to provide cutaneous innervation. The femoral nerve innervates the anterior thigh, the sural nerve runs up the lateral leg with the lesser saphenous vein to innervate the posterior lower leg and lateral foot. The superficial fibular nerve innervates the anterior leg muscle and the skin between the 1st and 2nd toes- lesions would lead to foot drop.
The great saphenous vein is anterior to the medial malleolus and posterior to the medial condyle of the femur. THe lesser saphenous vein is posterior to the lateral malleolus.
A 15yo M presents with an enlarged superficial inguinal lymph node, likely related to his infected skin wound in the: Answer:The superficial inguinal lymph nodes drain the skin of the lower limb, the anal canal below the pectinate line, the external genitalia, and the lower abdominal wall. The anterior chest wall and skin of the upper back.
A patient presents with a diabetic ulcer in the anterior midline of the ankle region experienced loss of cutaneous sensation on the dorsal foot, likely due to damage from: Answer:The fibular nerve branches into the superficial fibular nerve, which runs anteriorly to the ankle and innervates the lower anterior leg and dorsum of the foot, and the lateral sural cutaneous nerve, which innervates the lateral leg. The femoral nerve innervates the quadriceps femoris, sartorius, and pectineus and gives off the anterior femoral cutaneous branch to the medial and anterior thigh skin, and the saphenous nerve, which innervates the skin of the medial leg and foot. The sural nerve on the posterior leg adjacent to the lesser saphenous vein innervates the skin of the posterior lower leg and lateral foot.
A construction worker who wears a heavy work belt all day complains of tingling on the anterolateral thigh, likely due to: Answer:Meralgia paresthetica is a palsy of the lateral cutaneous nerve of the thigh, resulting in tingling and itching on the lateral thigh. Constriction of nerves, blood vessels, or tendons results in compartment syndrome, presenting as numbness, tingling, pain, or loss of movement in the extremity. Cryptorchidism is the term for undescended testes. Hydrocele is the presence of fluid in a patent processus vaginalis. Thrombophlebitis is the inflammation around a vein following a thrombus.
A cashier develops painful and tortuous varicose veins in her lower legs due to prolonged standing, leading to failure of the valves of the: Answer:The perforating veins shunt blood from the superficial to deep veins and are the first to suffer valve failures due to prolonged standing; the blood subsequently backs up in the superficial veins. The larger veins do not visibly varicose.


Projects Released
Happy Clients
Financial Breaches
How we can help
With competitive rates and a wide range, we've got a solution to fit your needs
Dreaming of owning your own local business as a broker or financial planner?
Our wealth managers are dedicated to helping you get on the road to a better future
Look how much money we make


SlideMenu
Item One with very long name very very long
Item two
Item Three with very long name very very long
Item Four
Item Five
Item One
Item two
Item Three
Item Four
Item Five


I’m a Product Designer at Framebridge by day, building side projects by night, and riding my bike in between.
Welcome to my new site!Questions? Comments? Critique? Write me a note.


Phone:(508) 393-9312
Fax:<PHONE_NUMBER>
Email<EMAIL_ADDRESS>Ever Been in a building where you have no signal on your phone, Tablet or other devices ? We all know how annoying that could be. But what if there is an Emergency in that Particular area where there is no signal also know as "Dead Zone". As you can imagin this is unsafe if there was a fire and you cant get in contact with Emergency Services. Dead Zones are also unsafe for the fire department in which their radios will not be able to work. Get In-Building Signal Boosters before its too late.
 Materials such as so
Click here to learn more about In-Building
© Applied Communications Services, inc.


There are many variations of passages of Lorem Ipsum available, but the majority have suffered alteration in some form, by injected humour, or randomised words which don't look even slightly believable. If you are going to use a passage of Lorem Ipsum, you need to be sure there isn't anything embarrassing hidden in the middle of text. All the Lorem Ipsum generators on the Internet tend to repeat predefined chunks as necessary, making this the first true generator on the Internet. It uses a dictionary of over 200 Latin words, combined with a handful of model sentence structures, to generate Lorem Ipsum which looks reasonable. The generated Lorem Ipsum is therefore always free from repetition.
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout. The point of using Lorem Ipsum is that it has a more-or-less normal distribution of letters, as opposed to using 'Content here, content here', making it look like readable English.


We are Code for NL
Code for NL is the Dutch community of developers and designers that work together on an open, fair, and inclusive digital government and society.
Our goal is the successful digital transformation of local governments, central government, and society as a whole.
Code for NL is governing partner of the international Code for All network.
{% assign action = site.data.blocks.community[page.lang] %}
{% include stats.html %}
{% include slack.html %}


Amazon sues Pentagon over $10B contract awarded to Microsoft
by AgenciesAmazon is suing the Pentagon over a $10 billion cloud-computing contract awarded to Microsoft. Amazon said it filed a legal complaint Friday with the U.S. Court of Federal Claims seeking to challenge the decision. The complaint is sealed, but the company said earlier this month there was “unmistakable bias” on the government’s part. Amazon’s competitive bid for the “war cloud” project drew criticism from President Donald Trump, who said over the summer that he wanted the Pentagon to take a closer look. The Pentagon awarded the contract to Microsoft in late October. U.S. Defense Secretary Mark Esper has said the procurement was done fairly without outside influence. The contract, formally called the Joint Enterprise Defense Infrastructure, or JEDI, was sought by Microsoft, Amazon, Oracle and IBM.


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object org.robobrain.sdk.GLRenderer
public class GLRenderer
GLRenderer sets up and provides an OpenGL ES 1.0 surface to draw on.
| Constructor Summary | |
|---|---|
GLRenderer()
|
| Method Summary | |
|---|---|
static float |
getFPS()
Gets the frame rate the Renderer is drawing at. |
static GL10 |
getGL()
Gets an instance of the OpenGL object. |
static int |
getHeight()
Returns the actual height of the drawing surface. |
static float |
getScale()
Gets the scalar used to adjust the size of your game's assets to maintain their relative sizes and proportions. |
static int |
getWidth()
Returns the actual width of the drawing surface. |
void |
onDrawFrame(GL10 gl)
Called when the surface is created or recreated. |
void |
onSurfaceChanged(GL10 gl,
int width,
int height)
Called when the surface changed size. |
void |
onSurfaceCreated(GL10 gl,
EGLConfig config)
Called when the surface is created or recreated. |
void |
pause()
Pauses the Renderer. |
void |
registerGame(Engine game)
Registers your game's Engine with this renderer. |
void |
resume()
Unpauses the Renderer. |
void |
setClearColor(Color color)
Sets the background color of the drawing surface. |
void |
setTargetSize(int width,
int height)
Sets the ideal width and height for your game. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public GLRenderer()
| Method Detail |
|---|
public void onSurfaceCreated(GL10 gl, EGLConfig config)
public void onDrawFrame(GL10 gl)
public void onSurfaceChanged(GL10 gl, int width, int height)
public void setClearColor(Color color)
color
- you wish to set the background to.public void registerGame(Engine game)
game
- Your game's Engine object.public void setTargetSize(int width, int height)
width
- in pixels of the screen.height
- in pixels of the screen.public void pause()
public void resume()
public static GL10 getGL()
public static int getWidth()
public static int getHeight()
public static float getScale()
public static float getFPS()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


Home
See All Beers
Order a Beer
Register!
Log in
Order a beer
Brand
Select a brand
Corona
Stella Artois
Carlsberg
Heineken
Quantity
Destination
Varna
Sofia
Stara Zagora
Plovdiv
Shumen
Enter your birthday:
Got an opinion, comment, recommendation?Share it with us!


SUBROUTINE CPTSVX( FACT, N, NRHS, D, E, DF, EF, B, LDB, X, LDX, $ RCOND, FERR, BERR, WORK, RWORK, INFO ) * * -- LAPACK routine (version 3.1) -- * Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. * November 2006 * * .. Scalar Arguments .. CHARACTER FACT INTEGER INFO, LDB, LDX, N, NRHS REAL RCOND * .. * .. Array Arguments .. REAL BERR( * ), D( * ), DF( * ), FERR( * ), $ RWORK( * ) COMPLEX B( LDB, * ), E( * ), EF( * ), WORK( * ), $ X( LDX, * ) * .. * * Purpose * ======= * * CPTSVX uses the factorization A = L*D*L**H to compute the solution * to a complex system of linear equations A*X = B, where A is an * N-by-N Hermitian positive definite tridiagonal matrix and X and B * are N-by-NRHS matrices. * * Error bounds on the solution and a condition estimate are also * provided. * * Description * =========== * * The following steps are performed: * * 1. If FACT = 'N', the matrix A is factored as A = L*D*L**H, where L * is a unit lower bidiagonal matrix and D is diagonal. The * factorization can also be regarded as having the form * A = U**H*D*U. * * 2. If the leading i-by-i principal minor is not positive definite, * then the routine returns with INFO = i. Otherwise, the factored * form of A is used to estimate the condition number of the matrix * A. If the reciprocal of the condition number is less than machine * precision, INFO = N+1 is returned as a warning, but the routine * still goes on to solve for X and compute error bounds as * described below. * * 3. The system of equations is solved for X using the factored form * of A. * * 4. Iterative refinement is applied to improve the computed solution * matrix and calculate error bounds and backward error estimates * for it. * * Arguments * ========= * * FACT (input) CHARACTER*1 * Specifies whether or not the factored form of the matrix * A is supplied on entry. * = 'F': On entry, DF and EF contain the factored form of A. * D, E, DF, and EF will not be modified. * = 'N': The matrix A will be copied to DF and EF and * factored. * * N (input) INTEGER * The order of the matrix A. N >= 0. * * NRHS (input) INTEGER * The number of right hand sides, i.e., the number of columns * of the matrices B and X. NRHS >= 0. * * D (input) REAL array, dimension (N) * The n diagonal elements of the tridiagonal matrix A. * * E (input) COMPLEX array, dimension (N-1) * The (n-1) subdiagonal elements of the tridiagonal matrix A. * * DF (input or output) REAL array, dimension (N) * If FACT = 'F', then DF is an input argument and on entry * contains the n diagonal elements of the diagonal matrix D * from the L*D*L**H factorization of A. * If FACT = 'N', then DF is an output argument and on exit * contains the n diagonal elements of the diagonal matrix D * from the L*D*L**H factorization of A. * * EF (input or output) COMPLEX array, dimension (N-1) * If FACT = 'F', then EF is an input argument and on entry * contains the (n-1) subdiagonal elements of the unit * bidiagonal factor L from the L*D*L**H factorization of A. * If FACT = 'N', then EF is an output argument and on exit * contains the (n-1) subdiagonal elements of the unit * bidiagonal factor L from the L*D*L**H factorization of A. * * B (input) COMPLEX array, dimension (LDB,NRHS) * The N-by-NRHS right hand side matrix B. * * LDB (input) INTEGER * The leading dimension of the array B. LDB >= max(1,N). * * X (output) COMPLEX array, dimension (LDX,NRHS) * If INFO = 0 or INFO = N+1, the N-by-NRHS solution matrix X. * * LDX (input) INTEGER * The leading dimension of the array X. LDX >= max(1,N). * * RCOND (output) REAL * The reciprocal condition number of the matrix A. If RCOND * is less than the machine precision (in particular, if * RCOND = 0), the matrix is singular to working precision. * This condition is indicated by a return code of INFO > 0. * * FERR (output) REAL array, dimension (NRHS) * The forward error bound for each solution vector * X(j) (the j-th column of the solution matrix X). * If XTRUE is the true solution corresponding to X(j), FERR(j) * is an estimated upper bound for the magnitude of the largest * element in (X(j) - XTRUE) divided by the magnitude of the * largest element in X(j). * * BERR (output) REAL array, dimension (NRHS) * The componentwise relative backward error of each solution * vector X(j) (i.e., the smallest relative change in any * element of A or B that makes X(j) an exact solution). * * WORK (workspace) COMPLEX array, dimension (N) * * RWORK (workspace) REAL array, dimension (N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * > 0: if INFO = i, and i is * <= N: the leading minor of order i of A is * not positive definite, so the factorization * could not be completed, and the solution has not * been computed. RCOND = 0 is returned. * = N+1: U is nonsingular, but RCOND is less than machine * precision, meaning that the matrix is singular * to working precision. Nevertheless, the * solution and error bounds are computed because * there are a number of situations where the * computed solution can be more accurate than the * value of RCOND would suggest. * * ===================================================================== * * .. Parameters .. REAL ZERO PARAMETER ( ZERO = 0.0E+0 ) * .. * .. Local Scalars .. LOGICAL NOFACT REAL ANORM * .. * .. External Functions .. LOGICAL LSAME REAL CLANHT, SLAMCH EXTERNAL LSAME, CLANHT, SLAMCH * .. * .. External Subroutines .. EXTERNAL CCOPY, CLACPY, CPTCON, CPTRFS, CPTTRF, CPTTRS, $ SCOPY, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 NOFACT = LSAME( FACT, 'N' ) IF( .NOT.NOFACT .AND. .NOT.LSAME( FACT, 'F' ) ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( NRHS.LT.0 ) THEN INFO = -3 ELSE IF( LDB.LT.MAX( 1, N ) ) THEN INFO = -9 ELSE IF( LDX.LT.MAX( 1, N ) ) THEN INFO = -11 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'CPTSVX', -INFO ) RETURN END IF * IF( NOFACT ) THEN * * Compute the L*D*L' (or U'*D*U) factorization of A. * CALL SCOPY( N, D, 1, DF, 1 ) IF( N.GT.1 ) $ CALL CCOPY( N-1, E, 1, EF, 1 ) CALL CPTTRF( N, DF, EF, INFO ) * * Return if INFO is non-zero. * IF( INFO.GT.0 )THEN RCOND = ZERO RETURN END IF END IF * * Compute the norm of the matrix A. * ANORM = CLANHT( '1', N, D, E ) * * Compute the reciprocal of the condition number of A. * CALL CPTCON( N, DF, EF, ANORM, RCOND, RWORK, INFO ) * * Compute the solution vectors X. * CALL CLACPY( 'Full', N, NRHS, B, LDB, X, LDX ) CALL CPTTRS( 'Lower', N, NRHS, DF, EF, X, LDX, INFO ) * * Use iterative refinement to improve the computed solutions and * compute error bounds and backward error estimates for them. * CALL CPTRFS( 'Lower', N, NRHS, D, E, DF, EF, B, LDB, X, LDX, FERR, $ BERR, WORK, RWORK, INFO ) * * Set INFO = N+1 if the matrix is singular to working precision. * IF( RCOND.LT.SLAMCH( 'Epsilon' ) ) $ INFO = N + 1 * RETURN * * End of CPTSVX * END


Checks that ensure
attributes of file
resources are valid. Possible values are:
present
absent
false
file
directory
link
file { '/var/log/syslog': ensure => pres, # Noncompliant: Invalid 'pres' value } file { '/var/log/syslog': ensure => '/var/log/messages', # Noncompliant: 'link' value and 'target' attribute should be used instead }
file { '/var/log/syslog': ensure => present, } file { '/var/log/syslog': ensure => link, target => '/var/log/messages', }


this is a short tutorial on how to build a brief bibliography. its initial audience is the community college student. however, it can be adapted to other student's needs.
this tutorial was built to be as accessible as possible. it can be used in a number of activities both in the synchronous and asynchronous classroom. it is built entirely on html, javascript and css, with minimal dependencies or libraries. the way it's built makes it possible to work in any device with an internet connection and a modern browser. it even works offline if hosted locally.
this tutorial is fully accessible according to the w3c accessibility standard . it is properly and logically marked up. it can be read and made sense of by most screen readers.
except otherwise noted, this tutorial is licensed under the mit license. this means that, if you find this code useful, you can use it, copy it, share it, change it, name it, make it your own, make fun of it, put your name on it, sell it, mock it, pretty much anything except buy it.
if you are buying this, you are getting ripped off.
you can get this code from my github here.
if you have any questions, please send to<EMAIL_ADDRESS>this tutorial will teach you the basics of building a short bibliography.
by the end of it, you should have a topic, some useful keywords, and an annotated bibliography that you can save as a .pdf and send to your teacher for grading.
if you absolutely need to print this tutorial as a worksheet, the blank .pdf file will be available at the end of the page below. click the link only if you need a hard copy of this tutorial.
let's get started. please type your name and click the button below:
my goal with this tutorial is to help you build a simple bibliography, using resources both from the library and the web, using a step-by-step process.
our first step is to pick a general topic you would like to research and turn it into a research question.
if you were researching the topic of pollution in general, an example of a research question would be:
how does pollution affect my community?
or
how do micro-plastics pollute, exactly?
write down your topic and your research question.
now that we have a topic and a research question, we can come up with a search strategy.
there are many methods to do this, and many people don’t use a method at all.
we will develop a search strategy by establishing:
note down what you know about the topic, what you don't know, and how reliable is what you currently know.
after all this, you should have a research question, some useful keywords, and possible sources of information to begin your search.
the next step is to find a book in the library catalog.
because of the nature of books and monograms (usually a general subject discussed in breadth), it is better to start your search broad, no more than one or two keywords per search.
go to the library catalog and type your keyword(s) into the search field.
click the search button.
click on one of the entries to look at it more closely.
the book's description will tell you if it's something you might want to use in your research.
once you find a book you want to use, click the citation (") icon. choose the appropriate style.
copy the citation and paste it in the book citation box below. then write a short paragraph explaining why you chose this book to include in your research.
add your book's citation and annotation.
for this part, we will use the library databases. make sure you have your student login and password to access the library resources.
since we are dealing with academic journal articles (very specific topics, usually dealt in more depth than breadth), we can and generally should be specific in our searches, adding or omitting keywords as we find information until we find articles as close to what we want as possible.
below you will find a subject list dropdown menu. select the subject based on your class, click the button to go to the list of library databases chosen for your class.
pick a database by clicking the link. once in the database, pick an article, produce a citation for it with the tools provided, copy and paste the citation in the article citation box below.if you need assistance navigating the databases, ask a librarian for help .
write a short paragraph explaining why you chose the article in the article annotation box.
add your journal article's citation and annotation.
often times, you will have to venture out of the library and into the web to find information on your topic. it may even be your preferred source of information.
the problem is that it becomes more difficult for you to determine if the information you find in a web page from the internet comes from reliable sources.
to produce a more reliable list of search results, I recommend searching the web by domain, using site: and .com, .org, .edu, .gov, ot .int, as the topic might suggest.
look for a website with information related to your topic, searching by domain or using wikipedia.
once you find it, copy the url and produce a citation using one of several citation generators.
lastly, write a short paragraph explaining why you chose this website for your research.
add your website's citation and annotation.
in chrome: chrome://print or settings/print. select destination print to .pdf.
in safari: command+P/click PDF button/save as .pdf.
in firefox: install add-ons first, then click file/print to .pdf.


This example starts up a file system to store persistent storage on the hard drive (for saving sims)
Click here to test file system (see console for output)
Click here to set up file system (see console for output)


--- title: Rollbar author: Freddy Drennan date: '2018-02-11' slug: rollbar categories: - errors - rollbar tags: [] ---
I’ve been working on creating my own version of RSConnect by hand. I think it’s a bit awful that anyone would have to shell out 25K a year for software.
With that said, part of the process was trying to figure out how to deal with errors that occur within my Docker images. The solution I found was Rollbar. It’s super easy to get started in R.
Log in and create an account. The first image you’ll see is this:
Pick a new project and name it.
Then, yea.. I’m sorry… select python.
Then, copy the secure key. Mine is now deleted, so you can’t use mine.
I already have rollbar installed on my computer. You need to run install.packages("rollbar")
first. Also, given that this is not a package that runs frequenly, I prefer to call functions explicity instead of loading the packge.
rollbar::rollbar.configure(access_token="d576994698c248faa7c990e16fee456a", env="production")
rollbar::rollbar.error('Days > 30 in weather_plot API')
## Warning in normalizePath(paste0(dirname(path), "/", path)): path[1]="/
## Users/freddydrennan/Library/R/3.4/library/blogdown/scripts//Users/
## freddydrennan/Library/R/3.4/library/blogdown/scripts/render_page.R": No
## such file or directory
You’ll see that the code ran well.
You can go under settings and get notifications to Slack as well!
Next try this!
Create this file and name it rollbar.R
library(rollbar)
rollbar.configure(access_token="d1ed4487e4d7403b82c992448f3c5602",
env="production",
root="/Users/freddydrennan/Documents/programming/rProjects/fdrennan")
rollbar.attach()
print(a)
Then run Rscript rollbar.R
and you’ll get errors sent for general exceptions!


Share-it! BETA FRONTEND
...
Learn more
ID
Name
Email
{{Message}}
Name
Email
Password
Mobile
Birthday
Create
Refresh
ID
Delete
Update


Bag Company and Type : Put Color of Bag :
Main Storage Put
Side Storage Put
Front Storage Put
Here is the list of items stored here
Here we placed smaller items
These are placed in front storage


--- layout: post title: NSBCon - Under the Hood of Particular Software date: 2014-03-25 13:57:45.000000000 +01:00 categories: - NServiceBus tags: - NServiceBus status: publish type: post published: true meta: _edit_last: '1' dsq_thread_id: '2506692583' author: login: andreas.ohlund email<EMAIL_ADDRESS>display_name: Andreas Öhlund first_name: Andreas last_name: "Öhlund" ---
In case you've missed it the first ever NServiceBus conference is happening 26th -27th June in London. There is a whole host of excellent speakers so make sure to not miss it!
https://skillsmatter.com/conferences/6198-nsbcon
I'm going to deliver a session on how we do things inside engineering here at Particular. This is a talk that I've been really wanting to do for a long term because I'm leading a truly awesome team and we've really been pushing the boundaries for what I thought was possible in terms of automating of "all the things" :)
The abstract for the talk is:
Continuously delivering a top quality platform on which customers build and run their businesses is not a challenge to be taken lightly. Join Andreas Öhlund, Director of Engineering at Particular Software, for a journey through custom tooling, testing the un-testable and massive cloud service bills in the name of backwards compatibility, performance and reliability.
An adventurous journey indeed but an absolute must to ensure that the software you depend on delivers what's stated on the box.
The talk will give an in-depth look on what we do to continuously deliver our service platform with the top quality that is expected from us,
See you there!


|
Simbody
3.5
|
A 3d line segment primitive represented by its end points in an unspecified frame, and a collection of line segment-related utility methods. More...
Public Member Functions | |
| LineSeg_ () | |
| Construct an uninitialized LineSeg object; the end points will be garbage (NaN in Debug builds). More... | |
| LineSeg_ (const Vec3P &e0, const Vec3P &e1) | |
| Construct a LineSeg with the given end points. More... | |
| LineSeg_ & | setEndpoints (const Vec3P &e0, const Vec3P &e1) |
| Change the end points of this line segment. More... | |
| LineSeg_ & | setEndpoint (int which, const Vec3P &p) |
| Change one end point of this line segment. More... | |
| bool | isDegenerate (RealP tol=Geo::getDefaultTol< P >()) const |
| Determine whether this line segment is degenerate to a given tolerance, meaning that its length is less than or equal to the tolerance. More... | |
| const Vec3P & | getEndpoint (int which) const |
| Get the location of an end point. Order is the same as construction. More... | |
| Vec3P & | updEndpoint (int which) |
| Get a writable reference to the location of an end point. Order is the same as construction. More... | |
| const Vec3P & | operator[] (int which) const |
| Access an end point by indexing the line segment. More... | |
| Vec3P & | operator[] (int which) |
| Get writable access to an end point by indexing the line segment. More... | |
| RealP | calcLength () const |
| Calculate the length of this line segment (expensive). More... | |
| RealP | calcLengthSqr () const |
| Calculate the square of the length of this line segment (cheap). More... | |
| Vec3P | findPoint (RealP t) const |
| Return a point along the line segment given by its coordinate t, where t==0 gives end point 0, t==1 gives end point 1 and other values interpolate or extrapolate linearly. More... | |
| Vec3P | findMidpoint () const |
| Return the center point of the line segment; this is the same as findPoint(1/2) but faster. More... | |
| Sphere_< P > | calcBoundingSphere () const |
| Calculate a minimal bounding sphere for this line segment. More... | |
| RealP | findDistanceToPoint (const Vec3P &p2) const |
| Find the distance between this line segment and a point expressed in the same frame. More... | |
| RealP | findDistanceToPointSqr (const Vec3P &p2) const |
| Find the square of the distance between this line segment and a point expressed in the same frame. More... | |
A 3d line segment primitive represented by its end points in an unspecified frame, and a collection of line segment-related utility methods.
We support a one-parameter t representation of the line segment, where t=0 gives the first end point and t=1 gives the second end point.
|
inline |
Construct an uninitialized LineSeg object; the end points will be garbage (NaN in Debug builds).
|
inline |
Construct a LineSeg with the given end points.
When an orientation is needed we define the line segment to go from e0 to e1.
|
inline |
Change the end points of this line segment.
|
inline |
Change one end point of this line segment.
|
inline |
Determine whether this line segment is degenerate to a given tolerance, meaning that its length is less than or equal to the tolerance.
Use a tolerance of zero if you want to check only for exact degeneracy. By default the tolerance is SignificantReal for the precision in use, about 2e-14 in double, 9e-7 in float. Cost is 10 flops.
|
inline |
Get the location of an end point. Order is the same as construction.
You can use operator[] instead for a more compact notation.
|
inline |
Get a writable reference to the location of an end point. Order is the same as construction.
You can use operator[] instead for a more compact notation.
|
inline |
Access an end point by indexing the line segment.
|
inline |
Get writable access to an end point by indexing the line segment.
|
inline |
Calculate the length of this line segment (expensive).
Cost is about 40 flops.
|
inline |
Calculate the square of the length of this line segment (cheap).
Cost is 8 flops.
|
inline |
Return a point along the line segment given by its coordinate t, where t==0 gives end point 0, t==1 gives end point 1 and other values interpolate or extrapolate linearly.
Note that values outside the range [0,1] are not on the line segment. Cost is 10 flops.
|
inline |
Return the center point of the line segment; this is the same as findPoint(1/2) but faster.
Cost is 4 flops.
|
inline |
Calculate a minimal bounding sphere for this line segment.
This is the sphere whose center is the segment midpoint and whose radius is half the segment length, plus a little slop. Cost is about 45 flops.
|
inline |
Find the distance between this line segment and a point expressed in the same frame.
Cost is XXX flops.
|
inline |
Find the square of the distance between this line segment and a point expressed in the same frame.
Cost is XXX flops.


Hover over the boxes above to see the contents.
This page was created to satisfy the requirements of exercise ICE3B - CSS transitions.
Hover over the boxes above to see the contents.
This page was created to satisfy the requirements of exercise ICE3B - CSS transitions.


An mobile application and user experience design prototype for an autonomous urban delivery system on university campases. The PEV that was designed by the Changing Places group from the MIT Media Lab was used as the vehicle for this system.


Reports package statements that should be chained at base package.
Only applicable when a base package is defined in Settings | Languages & Frameworks | Scala | Base Packages.
Example:
package org.example.application.NAME
After the quick-fix is applied:
package org.example.application
package NAME


LIVE FLESH (1998)
Directed by Pedro Almodovar, "Live Flesh" is a complicated melodrama with multiple angles of relationship, about the issue of love, desire, sex and all the other passions in life.
There are five players in this story and each becomes involved with another one way or the other. Victor Plaza is a hot-headed young man who falls in love with the girl with whom he had his first sexual experience in a public bathroom. This undeniably pretty girl, Elena, however, cannot even remember his name. She is the daughter of a rich Italian diplomat and a drug addict on the verge of a nervous breakdown when Victor comes to her door. They got into an argument and Elena's gun is misfired, an event that draws two policemen to the scene. The two men have their own problems though.  It doesn't take a genius to realize that this somehow has to do with the younger, more rational cop David.
As a terrible misunderstanding and unexpected events go on in Elena's apartment, Sancho and Victor struggle for the gun when a bullet is fired to hit David and paralyzes him. Victor is jailed for 6 years for this crime that we later learn he does not commit. When he is released, Elena, the woman of his dreams, has straighten up and married David, who is now a wheelchair basketball player. Bitter for his misfortune, Victor dreams of taking revenge on both of them, while fate takes him promptly to her door.  Who could that possibly be in a melodrama like this? Our Clara, Sancho's wife, of course.
All three men are head-strung and stubborn and jealous. None would easily back down from their love and desire. The women are no push-overs either. So the entangled relationships unfold... At one point I really wonder how this terrible mess would resolve itself, but the development and ending are not easily predictable and relatively sensible.
This is definitely a melodrama on the brink of soap opera. The filmmakers do not hesitate to use coincidence to carry the plot or push the plausibility of the story. However, these can be easily forgiven because the fascinating and colorful characters. None can be described with one word nor can be categorized as good or evil. David appears to be calm and strong mentally, but also sleeps with his partner's wife and just as jealous as Sancho. Elena accepts her responsibility and at least tries to correct her wrongs only to become the trigger of the tragedy once again 6 years later. She also has this really brutal honesty that is just a bit too... blatant. Clara does sleep with other men behind her husband's back, but she is also the victim of abuse and her pain and fear are tangible. Sancho is perhaps the least sympathetic character, at least to us female audience, but he clearly loves his wife deeply and almost just as desperate as she is, though for a different reason. Is Victor the only innocent soul? Far from it. He has no intention to back down from a plot to destroy two marriages (although he is somewhat "entitled" to do so to Sancho) and indirectely causes tragedy in the end. And he is obviously using Clara to teach him the techniques to please women while he does not love her at all. All characters are deadly passionate and seriously flawed but still believable and morally ambiguous. This is the ultimate strength of this film. Almodovar's relentless, uncompromising approach to the characters is the key to make the film refreshing. Not for once does he show the laziness to lessen the mixed quality of these characters. He does not hestitate to push the emotional conflicts and moral dilemma to their extremes and is willing to go all the way.
The film has quite a few bold love-making scenes as well as dialogues. Are they explicity? Definitely. Are they necessary? Absolutely. Without them, the audience will never be convinced why Elena should leave David to be with Victor, even though Elena and David really do love each other. These scenes are brutally honest about love, sex and relationship as much as Elena's confession. Sex scenes are often boring and mechanical on the big screen, more misused than not. This is one of the few occasions that they work appropriately as an essential factor in the whole story.
The style of this film is consistently passionate and intense as the emotional texture of the story and the characters. The colors are dazzling; the images fantastic; the music hot-blooded. The songs are so completely Spanish and over-the-top that they make my blood run faster and hotter. Surprisingly, the style works with the story, but never replaces the story and characters. That is why it is a successful piece of work.
Grade: B+.
jun
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


--- layout: page title: About John Cammack permalink: /about/ main_image_path: /uploads/john-at-afid.png main_image_caption: aside: true twitterfeed: true _options: layout: hidden: true main_image_path: width: 1200 height: 1200 resize_style: contain mime_type: image/jpeg image: width: 1200 height: 1200 resize_style: contain mime_type: image/jpeg _comments: ---
John Cammack is a highly experienced advisor, consultant and trainer for the international not-for-profit/NGO sector. He was previously head of international finance at Oxfam GB and senior lecturer in accounting and financial management at Oxford Brookes University.
John is a qualified accountant, manager and teacher, who holds an MSc in international development management and an MBA. He has worked with a wide range of agencies in over 60 countries, working with groups at all levels. He has been a trustee for a number of NGOs.
His publications are widely used in the NGO sector. John was named as Global Business Insight Awards NGO Consulting firm of the year 2019.


Food and keeping active for people with diabetes type 2
A healthy diet and keeping active will help you manage your blood sugar levels. They’ll also help you control your weight and make you generally feel better.
Eating a healthy diet
You don’t have to avoid certain foods altogether. You should, however, eat regularly and eat different foods, eg lots of fruit and vegetables and some starchy carbohydrates like bread or pasta. Try to keep the amount of sugar, salt and fat to a minimum.
If you need to change your diet, it might be easier to make changes step by step, rather than replacing everything at once.
The charity Diabetes UK has detailed information on:
Once a year you should go for a regular diabetes check to make sure your blood pressure and your cholesterol (blood fats) level are ok.
Help with changing your diet
If you find it hard to change your diet, you could ask a dietitian to help you. They can help you address certain problems you might have.
Talk to your diabetic nurse about finding a dietitian and if the cost could be covered through the NHS.
Diabetes UK has lots of recipes for people with diabetes that will help you cook healthy meals.
People in your local diabetes group might also have some cooking tips.
Keeping active
Physical exercise lowers your blood sugar levels so it’s important to keep active if you have diabetes types 2.
You can be active anywhere. Walking, climbing stairs or doing housework can all count as being active. You could also combine being active with other interests, eg do gardening or walk part of the way if you go to watch a football match.
You should aim for 2.5 hours of activity per week. It’s best to be active after meals.
Speak to your GP or diabetes nurse before you start a new activity. They might have to adjust your treatment because exercise will affect your blood sugar level.
The charity Diabetes UK has some tips on how to get active.
Managing your weight
When you have diabetes type 2 it’s important to manage your weight. Being a healthy weight will make it easier for your body to use the insulin properly and keep your blood pressure and cholesterol (blood fats) at a healthy level.
If you need to lose weight, try and do it slowly over time, about 0.5 to 1 kilo a week.
The charity Diabetes UK has more information on healthy weight and weight loss.


--- layout: page title: BitCoin Generator Applet - Requires Java --- About BitCoin Miner (by BitCoinPlus) (if a dot appears just before this text or the word 'stop' isn't highlighted above, the applet hasn't loaded)


M e g a n S t e b l a y
Welcome to my portfolio.
Tech Blog
This application provides a blog site where developers can publish blog posts and comment on others' blog posts. It provides users a space to discuss and learn with each other.
Trivialympics
Trivia Olympics is an interactive full-stack application that allows you to log in to play a fun trivia game. Users compete to solve trivia questions and move across the board to win the game.
Blitz and Chaos
Blitz and Chaos is a text-based, interactive story (run by JavaScript) providing you, the user, with a chance to play through a life as a hero. The choices you make along the way change the experience and outcome of your story.
Employee Tracker
This is a command-line application that provides a solution for easily managing a company's employees. It allows employers to view and manage different aspects of the departments, roles, and employees in their company.
E-Commerce Backend
This application provides the back end so that an e-commerce website and company can easily manage their products and have the technology to compete with other companies. It uses an Express.js API and the Sequelize package to interact with a MySQL database.
Weather Dashboard
This is a simple weather application. It was built in order to give users a way to check the weather and forecast for a specific city of their choice. It utilizes the OpenWeather API to provide up-to-date data and predictions.


Plea challenging bail to DK Shivakumar in money laundering case dismissed
by PTIThe Supreme Court on Friday dismissed the Enforcement Directorate's plea challenging the Delhi High Court order granting bail to Karnataka Congress leader D K Shivakumar in a money laundering case.
A bench comprising Justices R F Nariman and S Ravindra Bhat rejected the request of the Solicitor General, appearing for the Enforcement Directorate (ED), to issue a notice to the other side on the appeal.
The Delhi High Court had on October 23 granted bail to Shivakumar.
The former minister was arrested by the Enforcement Directorate in the alleged money laundering case. He was lodged in Tihar Jail till October 24.
Shivakumar had arrived here on October 26 to a rousing welcome from his supporters and party workers.


| UserName | {{user.username}} |
| Mail Addresses on System | Add Mailing Address | {{mailAddresses.length}} |
| Name: | {{mailAddress.recipientName}} | |
| Address: | {{mailAddress.address}} | |
| Country: | {{mailAddress.country}} | |
| City: | {{mailAddress.city}} | |
| State/Region/Prov.: | {{mailAddress.geoRegion}} | |
| ZipCode: | {{mailAddress.zipCode}} | |
| Telephone: | {{mailAddress.telephone}} |
| Bill Addresses on System | Add Billing Address | {{billAddresses.length}} |
| Name: | {{billAddress.recipientName}} | |
| Address: | {{billAddress.address}} | |
| Country: | {{billAddress.country}} | |
| City: | {{billAddress.city}} | |
| State/Region/Prov.: | {{billAddress.geoRegion}} | |
| ZipCode: | {{billAddress.zipCode}} | |
| Telephone: | {{billAddress.telephone}} |


Salary
Expenses
Expenses during retirement
Value of current assets
Return on investments
%
Yearly salary raises
%
Yearly inflation
%
Estimate
You can retire in
13 years
with your assets valuing
815,872
generating (annually)
27,359
annual expenses
25,365
Show details


Export release notes from markdown.
Install
gem install devist
Touch
cd ~/dev/your_project/ && touch CHANGELOG.md
Generate
cd ~/dev/your_project && devist changelog
Example of devist* changelog.md
gem install devist
cd ~/dev/your_project/ && touch CHANGELOG.md
cd ~/dev/your_project && devist changelog


Book Detail
{{ book.title }}
{{ book.publisher }}
{% for author in book.authors.iterator %}
{{ author }}
{% endfor %}
{{ book.date }}


Note! Italics is used to denote an
argument. Square brackets are used to indicate an optional
argument.
UnitValue A value that
represents a size. Normally it consist of a value (integer or float)
and the unit type (e.g. "mm"
). MigLayout
support defining custom unit types and there are some special ones
built in. These are listed below and some have a context to which
they can appear. UnitValues can be quite rich expressions, like:
"(10px + 0.25*((pref/2)-10))"
.
The currently supported unit types are:
"" - No
unit specified. This is the default unit and pixels will be used by
default. Default unit can be set with
PlatformDefaults.setDefaultHorizontal/VerticalUnit(int)
. E.g. "10"
px - Pixels.
Normal pixels mapped directly to the screen. E.g. "10px"
or "10"
% - A percentage
of the container's size. May also be used for alignments where for
instance 50%
means "centered". E.g. "100%"
lp - Logical
Pixels. If the normal font is used on the platform this maps 1:1 to
pixels. If larger fonts are used the logical pixels gets
proportionally larger. Used instead of Dialog Units. E.g. "10lp"
pt - Points.
1/72:th of an inch. A unit normally used for printing. Will take the
screen DPI that the component is showing on into account. E.g.
"10pt"
mm - Millimeters.
Will take the screen DPI that the component is showing on into
account. E.g. "10mm"
cm - Centimeters.
Will take the screen that the component is showing on DPI into
account. E.g. "10cm"
in - Inches. Will
take the screen DPI that the component is showing on into account.
E.g. "10.4in"
sp - Percentage
of the screen. Will take the pixel screen size that the component is
showing on into account. 100.0
is the right/bottom edge
of the screen. E.g. "sp 70" or "sp 73.627123"
al - Visual
bounds alignment. "0al"
is left aligned,
"0.5al"
is centered and "1al"
is right aligned. This unit is used with absolute positioning. E.g.
"0.2al"
n/null - Null value. Denotes the absence of
a value. E.g. "n" or "null"
These are the unit values that are converted to pixels by the
default PlatformConverter
. The converted pixel sizes can
be different for the vertical and horizontal dimension.
r/rel/related -
Indicates that two components or columns/rows are considered
related. The exact pixel size is determined by the platform default.
E.g. "r" or "related"
u/unrel/unrelatedated
- Indicates that two components or columns/rows are considered
unrelated. The exact pixel size is determined by
the platform default. E.g. "u" or "unrelated"
p/para/paragraph
- A spacing that is considered appropriate for a paragraph is used.
The exact pixel size is determined by the platform default. E.g.
"para" or "paragraph"
i/ind/indent - A spacing that is considered
appropriate for indent. The exact pixel size is determined by the
platform default. E.g. "i" or "indent"
These are the unit values that can be specified as a reference to component(s) sizes. These can be used on column/row constraint's size and as a reference in component constraint expressions.
min/minimum - A
reference to the largest minimum size of the
column/row. E.g. "min" or "minimum"
p/pref/preferred
- A reference to the largest preferred size of the
column/row. E.g. "p" or "pref" or
"preferred"
max/maximum - A reference to the smallest
maximum size of the column/row. E.g. "max" or
"maximum"
These are the unit values that can be specified for a component's width. These can only be used on the width component constraints size.
button - A reference to the platform minimum
size for a button. E.g. "wmin button"
BoundSize A bound size is a size that optionally
has a lower and/or upper bound and consists of one to three Unit
Values. Practically it is a minimum/preferred/maximum size
combination but none of the sizes are actually mandatory. If a size
is missing (e.g. the preferred) it is null and will
be replaced by the most appropriate value. For components this value
is the corresponding size (E.g. Component.getPreferredSize()
on Swing) and for columns/rows it is the size of the components in
the row (see min/pref/max
in UnitValue above).
The format is "
min
:
preferred
:
max
"
,
however there are shorter versions since for instance it is seldom
needed to specify the maximum size.
A single value (E.g. "10"
) sets only the
preferred
size and is exactly the same as
"null:10:null"
and ":10:"
and "n:10:n"
.
Two values (E.g. "10:20"
)
means minimum and preferred size and is exactly the same as
"10:20:null"
and "10:20:"
and "10:20:n"
The use a of an exclamation
mark (E.g. "20!"
) means that the value should
be used for all size types and no colon may then be used in the
string. It is the same as "20:20:20"
.
push can be appended to a gap to make that gap
"greedy" and take any left over space. This means that a
gap that has "push"
will be pushing the
components/rows/columns apart, taking as much space as possible for
the gap. The gap push is always an addition to a BoundSize.
E.g. "gap rel:push"
, "[][]push[][]"
,
"10cm!:push"
or "10:10:10:push"
.
Note! For row/column constraints the minimum,
preferred and maximum keywords can
be used and they refer to the largest minimum, preferred and maximum
component in the column/row. A null
value is the same
thing as any of these constraints, for the indicated position, but
they can for instance be used to set the minimum size to the
preferred one or the other way around. E.g. "pref:pref"
or "min:min:pref"
.
AlignKeyword
For alignment purposes these
keywords can be used: t/top, l/left,
b/bottom, r/right, lead/leading,
trail/trailing and base/baseline.
Leading/trailing is dependent on if component orientation is
"left-to-right" or "right-to-left". There is also
a keyword "align label"
or for columns/rows
one need only to use "label".
It will align
the component(s), which is normally labels, left, center or right
depending on the style guides for the platform. This currently means
left justified on all platforms except OS X which has right justified
labels.
Layout constraints and normally set in
the constructor of MigLayout and is constraints that will affect the
whole container.
|
|
Sets auto-wrap mode for the layout. This means that the grid
will wrap to a new column/row after a certain number of columns
(for horizontal flow) or rows (for vertical flow). The number is
either specified as an integer after the keyword or if not, the
number of column/row constraints specified will be used. A
wrapping layout means that after the |
|
|
|
Specifies the default gap between the cells in the grid and are thus overriding the platform default value. The gaps are specified as a BoundSize. See above. |
|
|
|
Turns on debug painting for the container. This will lead to an
active repaint every |
|
|
|
Puts the layout in a flow-only mode. All components in the flow direction will be put in the same cell and will thus not be aligned with component in other rows/columns. For normal horizontal flow this is the same as to say that all component will be put in the first and only column. |
|
|
|
Turns off padding of visual bounds (e.g. compensation for drop shadows) |
|
|
|
Claims all available space in the container for the columns and/or rows. At least one component need to have a |
" |
|
|
Specified the insets for the laid out container. The gaps
before/after the first/last column/row overrides these layout
insets. This is the same thing as setting an |
|
|
|
Puts the layout in vertical flow mode. This means that the next cell is normally below and the next component will be put there instead of to the right. Default is horizontal flow. |
|
|
|
Specifies the alignment for the laid out components as a group.
If the total bounds of all laid out components does not fill the
entire container the align value is used to position the
components within the container without changing their relative
positions. The alignment can be specified as a UnitValue
or AlignKeyword. See above. If an AlignKeyword
is used the |
|
|
|
Overrides the container's |
|
|
|
Specifies if the components should be added in the grid bottom-to-top or top-to-bottom. This value is not picked up from the container and is top-to-bottom by default. |
|
|
|
Sets the default hide mode for the layout. This hide mode can
be overridden by the component constraint. The hide mode specified
how the layout manager should handle a component that isn't
visible. The modes are: |
|
|
|
Instructs the layout engine to not use caches. This should
normally only be needed if the |
|
Column and row constraints works the same and hence forth the term row will be used for both columns and rows.
Every [] section denotes constraints for that row. The gap size
between is the gap size dividing the two rows. The format for the
constraint is:[constraint1, constraint2, ...]gap
size[constraint1, constraint2, ...]gap size[...]..."
Example:
"[fill]10[top,10:20]"
, "[fill]push[]"
,
"[fill]10:10:100:push[top,10:20]"
.
Tip! A vertical bar "|"
can be used instead of "]["
between rows if
the default gap should be used. E.g. "[100|200|300]"
is the same as "[100][200][300]"
.
Gaps are expressed as a BoundSize (see above) and
can thus have a min/preferred/max size. The size of the row is
expressed the same way, as a BoundSize. Leaving any
of the sizes out will make the size the default one. For gaps this is
"related"
(the pixel size for "related"
is determined by the PlatformConverter
) and for row size
this is the largest of the contained components for minimum and
preferred size and no maximum size. If there are fewer rows in the
format string than there are in the grid cells in that dimension the
last gap and row constraint will be used for the extra rows. For
instance "[10]"
is the same as "[10][10][10]"
(affects wrapping if wrap is turned on though) .
Gaps have only their size, however there are number of constraints
that can be used between the [ ]
and they will affect
that row.
":push"
(or "push"
if used with the default gap size) can be added to the gap size to
make that gap greedy and try to take as much space as possible
without making the layout bigger than the container.
Note! ""
is the same as
"[]"
which is the same as "[pref]"
and "[min:pref:n]"
.
|
|
Gives the row a size group name. All rows that share a size
group name will get the same BoundSize as the row
with the largest min/preferred size. This is most usable when the
size of the row is not explicitly set and thus is determined by
the largest component is the row(s). An empty name |
|
|
|
Set the default value for components to |
|
|
|
Puts the row in flow-only mode. All components in the flow
direction will be put in the same cell and will thus not be
aligned with component in other rows/columns. This property will
only be adhered to if the row is in the flow direction. So for the
normal horizontal flow ( |
|
|
|
Sets how keen the row should be to grow in relation to other
rows. The weight (defaults to 100 if not specified) is purely a
relative value to other rows' weight. Twice the weight will get
double the extra space. If this constraint is not set, the grow
weight is set to zero and the column will not grow (unless |
|
|
|
Sets the grow priority for the row (not for the components in the row). When growing, all rows with higher priorities will be grown to their maximum size before any row with lower priority are considered. The default grow priority is 100. This can be used to make certain rows grow to max before other rows even start to grow. |
|
|
|
Sets how keen/reluctant the row should be to shrink in relation to other rows. The weight is purely a relative value to other rows' weights. Twice the weight will shrink twice as much when space is scarce. If this constraint is not set the shrink weight defaults to 100, which means that all rows by default can shrink to their minimum size, but no less. Shrink weight will only be compared against the weights in the same shrink priority group (other rows with the same shrink priority). See below. |
|
|
|
Sets the shrink priority for the row (not for the components in the row). When space is scarce and rows needs to be shrunk, all rows with higher priorities will be shrunk to their minimum size before any row with lower priority are considered. The default shrink priority is 100. This can be used to make certain rows shrink to min before other rows even start to shrink. |
|
|
|
Specifies the default alignment for the components in the row.
This default alignment can be overridden by setting the alignment
for the component in the Component Constraint. The default row
alignment is |
|
|
|
Specifies the gap before and/or after the row. The gap are
specified between the row constraints (between |
|
Component constraints are used as an argument in the
Container.add(...)
for Swing and by setting it as
Control.setLayoutData(...)
in SWT. It can be used to
specify constraints that has to do with the component's size and/or
the grid cell flow. The constraints are specified one by one with
comma signs as separators. E.g. "width 100px!, grid 3
2, wrap"
.
|
|
Wraps to a new column/row after the component
has been put in the next available cell. This means that the next
component will be put on the new row/column. Tip! Read wrap as
"wrap after". If specified |
|
|
|
Wraps to a new column/row before the component
is put in the next available cell. This means that the this
component will be put on a new row/column. Tip! Read wrap as "on
a newline". If specified |
|
|
|
Makes the row and/or column that the component is residing in
grow with |
|
|
|
Skips a number of cells in the flow. This is used to jump over
a number of cells before the next free cell is looked for. The
skipping is done before this component is put in a cell and thus
this cells is affected by it. |
|
|
|
Spans the current cell (merges) over a number of cells.
Practically this means that this cell and the count
number of cells will be treated as one cell and the component can
use the space that all these cells have. count defaults
to a really high value which practically means span to the end
or the row/column. Note that a cell can be spanned and
split at the same time, so it can for instance be spanning 2 cells
and split that space for three components. |
|
|
|
Splits the cell in a number of sub cells. Basically this means
that the next |
|
|
|
Sets the grid cell that the component should be placed in. If
there are already components in the cell they will share the cell.
If there are two integers specified they will be interpreted as
absolute coordinates for the column and row. The flow will
continue after this cell. How many cells that will be spanned is
optional but may be specified. It is the same thing as using the
|
|
|
|
Sets the flow direction in the cell. By default the flow
direction in the cell is the same as the flow direction for the
layout. So if the components flows from left to right they will do
so for in-cell flow as well. The first component added to a cell
can change the cell flow. If flow direction is changed to |
|
|
|
Overrides the default size of the component that is set by the
UI delegate or by the developer explicitly on the component. The
size is specified as a BoundSize. See the Common
Argument Types section above for an explanation. Note that
expressions is supported and you can for instance set the size for
a component with |
" |
|
|
Overrides the default size of the component for minimum or
maximum size that is set by the UI delegate or by the developer
explicitly on the component. The size is specified as a BoundSize.
See the Common Argument Types section above for an
explanation. Note that expressions is supported and you can for
instance set the size for a component with |
" |
|
|
Sets how keen the component should be to grow in relation to
other component in the same cell. The weight (defaults to 100 if
not specified) is purely a relative value to other components'
weight. Twice the weight will get double the extra space. If this
constraint is not set the grow weight is set to 0 and the
component will not grow (unless |
|
|
|
Sets the grow priority for the component. When growing, all components with higher priorities will be grown to their maximum size before any component with lower priority are considered. The default grow priority is 100. This constraint can be used to make certain components grow to max before other components even start to grow. |
|
|
|
Sets how keen/reluctant the component should be to shrink in relation to other components. The weight is purely a relative value to other components' weight. Twice the weight will shrink twice as much when space is scarce. If this constraint is not set the shrink weight defaults to 100, which means that all components by default can shrink to their minimum size, but no less. Shrink weight will only be compared against the weights in the same shrink priority group (other components with the same shrink priority). See below. |
|
|
|
Sets the shrink priority for the component. When space is scarce and components needs be be shrunk, all components with higher priorities will be shrunk to their minimum size before any component with lower priority are considered. The default shrink priority is 100. This can be used to make certain components shrink to min before other even start to shrink. |
|
|
|
Gives the component a size group name. All components that
share a size group name will get the same BoundSize
(min/preferred/max). It is used to make sure that all components
in the same size group gets the same min/preferred/max size which
is that of the largest component in the group. An empty name |
|
|
|
Gives the component an end group name and association. All
components that share an end group name will get their
right/bottom component side aligned. The right/bottom side will be
that of the largest component in the group. If |
|
|
|
Specifies the gap between the components in the cell or to the
cell edge depending on what is around this component. If a gap
size is missing it is interpreted as |
|
|
|
Specifies the horizontal or vertical gap between the components
in the cell or to the cell edge depending on what is around this
component. If a gap size is missing it is interpreted as |
|
|
|
Sets the id (or name) for the component. If the |
|
|
|
Positions the component with absolute coordinates relative to
the container. If this keyword is used the component will not
be put in a grid cell and will thus not affect the flow in the
grid. One of either Absolute positions can also links to other components' bounds
using their
|
|
|
|
Used to position the start (x or y), end (x2 or y2) or both edges of a component in absolute coordinates. This is used for when a component is in a grid or dock and it for instance needs to be adjusted to align with something else or in some other way be positioned absolutely. The cell that the component is positioned in will not change size, neither will the grid. The x, y, x2 and y2 keywords are applied in the last stage and will therefore not affect other components in the grid or dock, unless they are explicitly linked to the bounds of the component. If the position and size can be determined without references to the parent containers size it will affect the preferred size of the container. |
|
|
|
Used for docking the component at an edge, or the center, of the container. Works much like |
|
|
|
Sets the padding for the component in absolute pixels. This is
an absolute adjustment of the bounds if the component and is done
at the last stage in the layout process. This means it will not
affect gaps or cell size or move other components. It can be used
to compensate for something that for some reason is hard to do
with the other constraints. For instance |
|
|
|
Specifies the alignment for the component if the cell is larger
than the component plus its gaps. The alignment can be specified
as a UnitValue or AlignKeyword.
See above. If AlignKeyword is used the |
|
|
|
Inhibits MigLayout to change the bounds for the component. The
bounds should be handled/set from code outside this layout manager
by calling the |
|
|
|
Sets the hide mode for the component. If the hide mode has been
specified in the This hide mode can be overridden by the component
constraint. The hide mode specified how the layout manager should
handle a component that isn't visible. The modes are: |
|
|
|
Tags the component with metadata name that can be used by the
layout engine. The tag can be used to explain for the layout
manager what the components is showing, such as an OK
or Cancel button. Unknown tags will be
disregarded without error or any indication.
|
|


Spend time on the work that matters. Let wilbur write
the boilerplate code for you.
Fill out a quick form and get a fully functioning api built with node+express.js all written
in
typescript 3.x
The typescript classes you define will generate a powerful api with a mongodb persistence layer and built in swagger docs.
Your ClassesAdd classes you've defined to your apps configuration. Check few boxes that will help the generator best serve your needs.
 It's as easy as downloading a json file and starting the generator
Generate your appDefine your classes, and we'll handle the rest.
Follow a few simple steps and well have you generating api's in no time.
Define member variables for your typescript class, and create validators for strong api validation.
Define your an app's coniguration, and give it classes you've defined.
Download your app's configuration as a json file and run the generator. $ yo wilbur
This desktop app leverages yeoman to scaffold and generate projects. If you're interested in developing an desktop application using Electron & Yeoman, I've got you covered. You can clone this project and start developing your own cross platform desktop app integrated with Yeoman and can enjoy features such as Angular 6+ with hot reloads and a generator written in Typescript 3+.


| biplot.mvr | Biplots of PLSR and PCR Models. |
| coef.mvr | Extract Information From a Fitted PLSR or PCR Model |
| coefplot | Plot Regression Coefficients of PLSR and PCR models |
| compnames | Extract Information From a Fitted PLSR or PCR Model |
| corrplot | Plots of Scores, Loadings and Correlation Loadings |
| cppls | Partial Least Squares and Principal Component Regression |
| cppls.fit | CPPLS (Indahl et al.) |
| crossval | Cross-validation of PLSR and PCR models |
| cvsegments | Generate segments for cross-validation |
| explvar | Extract Information From a Fitted PLSR or PCR Model |
| fitted.mvr | Extract Information From a Fitted PLSR or PCR Model |
| gasoline | Octane numbers and NIR spectra of gasoline |
| jack.test | Jackknife approximate t tests of regression coefficients |
| kernelpls.fit | Kernel PLS (Dayal and MacGregor) |
| loading.weights | Extract Scores and Loadings from PLSR and PCR Models |
| loadingplot | Plots of Scores, Loadings and Correlation Loadings |
| loadingplot.default | Plots of Scores, Loadings and Correlation Loadings |
| loadings | Extract Scores and Loadings from PLSR and PCR Models |
| loadings.default | Extract Scores and Loadings from PLSR and PCR Models |
| makepredictcall.msc | Multiplicative Scatter Correction |
| makepredictcall.stdized | Standardization of Data Matrices |
| mayonnaise | NIR measurements and oil types of mayonnaise |
| model.frame.mvr | Extract Information From a Fitted PLSR or PCR Model |
| model.matrix.mvr | Extract Information From a Fitted PLSR or PCR Model |
| msc | Multiplicative Scatter Correction |
| MSEP | MSEP, RMSEP and R2 of PLSR and PCR models |
| MSEP.mvr | MSEP, RMSEP and R2 of PLSR and PCR models |
| mvr | Partial Least Squares and Principal Component Regression |
| mvrCv | Cross-validation |
| mvrVal | MSEP, RMSEP and R2 of PLSR and PCR models |
| mvrValstats | MSEP, RMSEP and R2 of PLSR and PCR models |
| oliveoil | Sensory and physico-chemical data of olive oils |
| oscorespls.fit | Orthogonal scores PLSR |
| pcr | Partial Least Squares and Principal Component Regression |
| plot.loadings | Plots of Scores, Loadings and Correlation Loadings |
| plot.mvr | Plot Method for MVR objects |
| plot.mvrVal | Validation Plots |
| plot.scores | Plots of Scores, Loadings and Correlation Loadings |
| pls | Partial Least Squares and Principal Component Regression |
| pls.options | Set or return options for the pls package |
| plsr | Partial Least Squares and Principal Component Regression |
| predict.msc | Multiplicative Scatter Correction |
| predict.mvr | Predict Method for PLSR and PCR |
| predict.stdized | Standardization of Data Matrices |
| prednames | Extract Information From a Fitted PLSR or PCR Model |
| predplot | Prediction Plots |
| predplot.default | Prediction Plots |
| predplot.mvr | Prediction Plots |
| predplotXy | Prediction Plots |
| print.jacktest | Jackknife approximate t tests of regression coefficients |
| print.mvr | Summary and Print Methods for PLSR and PCR objects |
| print.mvrVal | Summary and Print Methods for PLSR and PCR objects |
| R2 | MSEP, RMSEP and R2 of PLSR and PCR models |
| R2.mvr | MSEP, RMSEP and R2 of PLSR and PCR models |
| residuals.mvr | Extract Information From a Fitted PLSR or PCR Model |
| respnames | Extract Information From a Fitted PLSR or PCR Model |
| RMSEP | MSEP, RMSEP and R2 of PLSR and PCR models |
| RMSEP.mvr | MSEP, RMSEP and R2 of PLSR and PCR models |
| scoreplot | Plots of Scores, Loadings and Correlation Loadings |
| scoreplot.default | Plots of Scores, Loadings and Correlation Loadings |
| scores | Extract Scores and Loadings from PLSR and PCR Models |
| scores.default | Extract Scores and Loadings from PLSR and PCR Models |
| selectNcomp | Suggestions for the optimal number of components in PCR and PLSR models |
| simpls.fit | Sijmen de Jong's SIMPLS |
| stdize | Standardization of Data Matrices |
| summary.mvr | Summary and Print Methods for PLSR and PCR objects |
| svdpc.fit | Principal Component Regression |
| validationplot | Validation Plots |
| var.jack | Jackknife Variance Estimates of Regression Coefficients |
| widekernelpls.fit | Wide Kernel PLS (Rännar et al.) |
| yarn | NIR spectra and density measurements of PET yarns |
| Yloadings | Extract Scores and Loadings from PLSR and PCR Models |
| Yscores | Extract Scores and Loadings from PLSR and PCR Models |


|title|Map|title|
|styles|
|styles|
|content|
TRY IT OUT:
- Use the mouse wheel to zoom in on the map
- Click and drag or use the arrow keys to pan the map
This sample demonstrates how create an igMap using an AngularJS directive.
Explore the Code
|content|
|scripts|
|scripts|


{{> head title="Poppies Detroit"}}
{{> nav}}Come join the Poppies team for some awesome diner adventures to prepare for our grand opening! Reservations can be made by emailing hello@rosesfinefood or calling<PHONE_NUMBER>
We're excited to talk to you! Reach out with any questions you might have and we'll get back to you as soon as possible.


Responses¶
Unless noted otherwise, all method return values for Globus SDK Clients are
GlobusResponse
objects.
Some GlobusResponse
objects are iterables.
In those cases, their contents will also be GlobusResponse
objects.
To customize client methods with additional detail, the SDK uses subclasses of
GlobusResponse
.
For example the GlobusHTTPResponse
attaches HTTP response information.
Generic Response Classes¶
-
class
globus_sdk.response.
GlobusResponse
(data)[source]¶ Generic response object, with a single
data
member.The most common response data is a JSON dictionary. To make handling this type of response as seemless as possible, the
GlobusResponse
object also supports direct dictionary item access, as an alias for accessing an item of the underlyingdata
. Ifdata
is not a dictionary, item access will raiseTypeError
.>>> print("Response ID": r["id"]) # alias for r.data["id"]
-
data
¶ Response data as a Python data structure. Usually a dict or list.
-
-
class
globus_sdk.response.
GlobusHTTPResponse
(http_response)[source]¶ Bases:
globus_sdk.response.GlobusResponse
Response object that wraps an HTTP response from the underlying HTTP library. If the response is JSON, the parsed data will be available in
data
, otherwisedata
will beNone
andtext
should be used instead.Variables: - http_status – HTTP status code returned by the server (int)
- content_type – Content-Type header returned by the server (str)
-
text
¶ The raw response data as a string.
Transfer Response Classes¶
-
class
globus_sdk.transfer.response.
TransferResponse
(http_response)[source]¶ Bases:
globus_sdk.response.GlobusHTTPResponse
Base class for
TransferClient
responses.
-
class
globus_sdk.transfer.response.
IterableTransferResponse
(http_response)[source]¶ Bases:
globus_sdk.transfer.response.base.TransferResponse
Response class for non-paged list oriented resources. Allows top level fields to be accessed normally via standard item access, and also provides a convenient way to iterate over the sub-item list in the
DATA
key:>>> print("Path:", r["path"]) >>> # Equivalent to: for item in r["DATA"] >>> for item in r: >>> print(item["name"], item["type"])
-
class
globus_sdk.transfer.response.
ActivationRequirementsResponse
(*args, **kwargs)[source]¶ Bases:
globus_sdk.transfer.response.base.TransferResponse
Response class for Activation Requirements responses.
All Activation Requirements documents refer to a specific Endpoint, from whence they were acquired. References to “the Endpoint” implicitly refer to that originating Endpoint, and not to some other Endpoint.
External Documentation
See Activation Requirements Document in the API documentation for details.
-
active_until
(time_seconds, relative_time=True)[source]¶ Check if the Endpoint will be active until some time in the future, given as an integer number of seconds. When
relative_time=False
, thetime_seconds
is interpreted as a POSIX timestamp.This supports queries using both relative and absolute timestamps to better support a wide range of use cases. For example, if I have a task that I know will typically take N seconds, and I want an M second safety margin:
>>> num_secs_allowed = N + M >>> tc = TransferClient(...) >>> reqs_doc = tc.endpoint_get_activation_requirements(...) >>> if not reqs_doc.active_until(num_secs_allowed): >>> raise Exception("Endpoint won't be active long enough") >>> ...
or, alternatively, if I know that the endpoint must be active until October 18th, 2016 for my tasks to complete:
>>> oct18_2016 =<PHONE_NUMBER> >>> tc = TransferClient(...) >>> reqs_doc = tc.endpoint_get_activation_requirements(...) >>> if not reqs_doc.active_until(oct18_2016, relative_time=False): >>> raise Exception("Endpoint won't be active long enough") >>> ...
Parameters
time_seconds
- Integer number of seconds into the future.
relative_time
- Defaults to True. When False,
time_seconds
is treated as a POSIX timestamp (i.e. seconds since epoch as an integer) instead of its ordinary behavior.
Return type: bool
-
supports_auto_activation
¶ Check if the document lists Auto-Activation as an available type of activation. Typically good to use when you need to catch endpoints that require web activation before proceeding.
>>> endpoint_id = "..." >>> tc = TransferClient(...) >>> reqs_doc = tc.endpoint_get_activation_requirements(endpoint_id) >>> if not reqs_doc.supports_auto_activation: >>> # use `from __future__ import print_function` in py2 >>> print(("This endpoint requires web activation. " >>> "Please login and activate the endpoint here:\n" >>> "https://www.globus.org/app/endpoints/{}/activate") >>> .format(endpoint_id), file=sys.stderr) >>> # py3 calls it `input()` in py2, use `raw_input()` >>> input("Please Hit Enter When You Are Done")
Return type: bool
-
supports_web_activation
¶ Check if the document lists known types of activation that can be done through the web. If this returns
False
, it means that the endpoint is of a highly unusual type, and you should directly inspect the response’sdata
attribute to see what is required. Sending users to the web page for activation is also a fairly safe action to take. Note thatActivationRequirementsResponse.supports_auto_activation
directly impliesActivationRequirementsResponse.supports_web_activation
, so these are not exclusive.For example,
>>> tc = TransferClient(...) >>> reqs_doc = tc.endpoint_get_activation_requirements(...) >>> if not reqs_doc.supports_web_activation: >>> # use `from __future__ import print_function` in py2 >>> print("Highly unusual endpoint. " + >>> "Cannot webactivate. Raw doc: " + >>> str(reqs_doc), file=sys.stderr) >>> print("Sending user to web anyway, just in case.", >>> file=sys.stderr) >>> ...
Return type: bool
-
Auth Response Classes¶
-
class
globus_sdk.auth.token_response.
OAuthTokenResponse
(*args, **kwargs)[source]¶ Bases:
globus_sdk.response.GlobusHTTPResponse
Class for responses from the OAuth2 code for tokens exchange used in 3-legged OAuth flows.
-
access_token
¶ The
access_token
value for the top-level token in the response.
-
by_resource_server
¶ Representation of the token response in a
dict
indexed by resource server.Although
OAuthTokenResponse.data
is still available and valid, this representation is typically more desirable for applications doing inspection of access tokens and refresh tokens.
-
expires_at_seconds
¶ A POSIX timestamp representation of the expiration time for the top-level token in the response.
-
expires_in
¶ The
expires_in
value for the top-level token in the response.
-
other_tokens
¶ The array of tokens other than the top-level one.
-
refresh_token
¶ The
refresh_token
value for the top-level token in the response.
-
resource_server
¶ The
resource_server
value for the top-level token in the response.
-
-
class
globus_sdk.auth.token_response.
OAuthDependentTokenResponse
(*args, **kwargs)[source]¶ Bases:
globus_sdk.response.GlobusHTTPResponse
Class for responses from the OAuth2 code for tokens retrieved by the OAuth2 Dependent Token Extension Grant. For more complete docs, see
oauth2_get_dependent_tokens
-
by_resource_server
¶ Representation of the token response in a
dict
indexed by resource server.Although
OAuthDependentTokenResponse.data
is still available and valid, this representation is typically more desirable for applications trying to use the resulting tokens.
-


Sage Quickstart for Statistics#
This Sage quickstart tutorial was developed for the MAA PREP Workshop “Sage: Using Open-Source Mathematics Software with Undergraduates” (funding provided by NSF DUE 0817071). It is licensed under the Creative Commons Attribution-ShareAlike 3.0 license (CC BY-SA).
Basic Descriptive Statistics#
Basic statistical functions are best to get from numpy and scipy.stats.
NumPy provides, for example, functions to compute the arithmetic mean and the standard deviation:
sage: import numpy as np
sage: np.mean([1, 2, 3, 5])
2.75
sage: np.std([1, 2, 2, 4, 5, 6, 8]) # rel to 1e-13
2.32992949004287
SciPy offers many more functions, for example a function to compute the harmonic mean:
sage: from scipy.stats import hmean
sage: hmean([1, 2, 2, 4, 5, 6, 8]) # rel to 1e-13
2.5531914893617023
We do not recommend to use Python’s built in statistics
module with Sage.
It has a known incompatibility with number types defined in Sage, see github issue #28234.
Distributions#
Let’s generate a random sample from a given type of continuous distribution using native Python random generators.
We use the simplest method of generating random elements from a log normal distribution with (normal) mean 2 and \(\sigma=3\).
Notice that there is really no way around making some kind of loop.
sage: my_data = [lognormvariate(2, 3) for i in range(10)]
sage: my_data # random
[13.189347821530054,<PHONE_NUMBER>4782799, 0.071974845847761343,<PHONE_NUMBER>9742425, 1.9677158880100207, 71.959830176932542, 21.054742855786007, 3.9235315623286406, 4129.9880239483346, 16.41063858663054]
We can check whether the mean of the log of the data is close to 2.
sage: np.mean([log(item) for item in my_data]) # random
3.0769518857697618
Here is an example using the Gnu scientific library under the hood.
Let
dist
be the variable assigned to a continuous Gaussian/normal distribution with standard deviation of 3.Then we use the
.get_random_element()
method ten times, adding 2 each time so that the mean is equal to 2.
sage: dist=RealDistribution('gaussian',3)
sage: my_data=[dist.get_random_element()+2 for _ in range(10)]
sage: my_data # random
[3.18196848067, -2.70878671264, 0.445500746768, 0.579932075555, -1.32546445128, 0.985799587162, 4.96649083229, -1.78785287243, -3.05866866979, 5.90786474822]
For now, it’s a little annoying to get histograms of such things directly. Here, we get a larger sampling of this distribution and plot a histogram with 10 bins.
sage: my_data2 = [dist.get_random_element()+2 for _ in range(1000)]
sage: T = stats.TimeSeries(my_data)
sage: T.plot_histogram(normalize=False,bins=10)
Graphics object consisting of 10 graphics primitives
To access discrete distributions, we again use Scipy.
We have to
import
the modulescipy.stats
.We use
binom_dist
to denote the binomial distribution with 20 trials and 5% expected failure rate.The
.pmf(x)
method gives the probability of \(x\) failures, which we then plot in a bar chart for \(x\) from 0 to 20. (Don’t forget thatrange(21)
means all integers from zero to twenty.)
sage: import scipy.stats
sage: binom_dist = scipy.stats.binom(20,.05)
sage: bar_chart([binom_dist.pmf(x) for x in range(21)])
Graphics object consisting of 1 graphics primitive
The bar_chart
function performs some of the duties of histograms.
Scipy’s statistics can do other things too. Here, we find the median (as the fiftieth percentile) of an earlier data set.
sage: scipy.stats.scoreatpercentile(my_data, 50) # random
0.51271641116183286
The key thing to remember here is to look at the documentation!
Using R from within Sage#
The R project is a leading software package for statistical analysis with widespread use in industry and academics.
There are several ways to access R; they are based on the rpy2
package.
One of the easiest is to just put
r()
around things you want to make into statistical objects, and then …Use R commands via
r.method()
to pass them on to Sage for further processing.
The following example of the Kruskal-Wallis test comes directly from
the examples in r.kruskal_test?
in the notebook.
sage: x=r([2.9, 3.0, 2.5, 2.6, 3.2]) # normal subjects # optional - rpy2
sage: y=r([3.8, 2.7, 4.0, 2.4]) # with obstructive airway disease # optional - rpy2
sage: z=r([2.8, 3.4, 3.7, 2.2, 2.0]) # with asbestosis # optional - rpy2
sage: a = r([x,y,z]) # make a long R vector of all the data # optional - rpy2
sage: b = r.factor(5*[1]+4*[2]+5*[3]) # create something for R to tell # optional - rpy2
....: # which subjects are which
sage: a; b # show them # optional - rpy2
[1] 2.9 3.0 2.5 2.6 3.2 3.8 2.7 4.0 2.4 2.8 3.4 3.7 2.2 2.0
[1] 1 1 1 1 1 2 2 2 2 3 3 3 3 3
Levels: 1 2 3
sage: r.kruskal_test(a,b) # do the KW test! # optional - rpy2
Kruskal-Wallis rank sum test
data: sage17 and sage33
Kruskal-Wallis chi-squared = 0.7714, df = 2, p-value = 0.68
Looks like we can’t reject the null hypothesis here.
The best way to use R seriously is to simply ask each individual cell to
evaluate completely in R, using a so-called “percent directive”. Here
is a sample linear regression from John Verzani’s simpleR text.
Notice that R also uses the #
symbol to indicate comments.
sage: %r # optional - rpy2
....: x = c(18,23,25,35,65,54,34,56,72,19,23,42,18,39,37) # ages of individuals
....: y = c(202,186,187,180,156,169,174,172,153,199,193,174,198,183,178) # maximum heart rate of each one
....: png() # turn on plotting
....: plot(x,y) # make a plot
....: lm(y ~ x) # do the linear regression
....: abline(lm(y ~ x)) # plot the regression line
....: dev.off() # turn off the device so it plots
Call:
lm(formula = y ~ x)
Coefficients:
(Intercept) x
210.0485 -0.7977
null device
1
To get a whole worksheet to evaluate in R (and be able to ignore the
%
), you could also drop down the r
option in the menu close to
the top which currently has sage
in it.


As a developer I find myself coding many tedious codes, like when I need a new Model and I need to implement the Controller, Service, Repository and the SQL Table, so I came up with an idea that have being helpful ever since.
First I developed a Window Application that pick my Models files and creates all the other classes I needed for my job. But recently I realised that this idea could be helpful for many others developers like me. So I decided to turn it into a site and make it open source.


Confident Ruby
Foreword
Preface
Introduction
Ruby meets the real world
Confident code
Performing work


Write equivalent an algebra expression using expression transformation rules on the supplier-parts-projects database for the following algebra expressiions.(10 marks)
(S {CITY} MINUS J {CITY}) MINUS (P{CITY} MINUS J{CITY})
(P WHERE CITY ='London') JOIN (J JOIN S)
((SP WHERE P#='P2') JOIN S{S#, SNAME} ) {SNAME}
(S WHERE CITY ='London') WHERE STATUS > 10
(P WHERE COLOR = 'Red' ) {P#}
A divide and conquer strategy is one of the optimization strategies that can be executed in parallel on different processors. Such strategy is used in query decompositiion method using detachment and tuple substitution. Decompose the following query "Get names of Paris supplers who supply some parts weight less than 25 pounds" using such strategy and draw decomposition tree fot the query.(15 marks)
For data security, modern DBMSs typically support two broad approaches to protect the unit of data or "data object" that can range from an entire database to a specific tuple. Define these two approaches and how these approaches differ.(8 marks)
SQL standard supports for discrtionary access control for data protection, write SQL autorization statements on the following view of supplier-parts-projects database:(8 marks) CREATE VIEW LS AS
SELECT S.S#, S.SNAME, S.STATUS, S.CITY
FROM S
WHERE S.CITY = 'London';
Users "Dan" and "Misha" RETRIEVE priveleges over the entire view and UPDATE privileges over the SNAME and STATUS attributes only DELETE over tuples view.
User "John" RETRIEVE and UPDATE priveleges over the entire view
Remove the UPDATE and DELETE priveleges of users "Dan" and "Misha" on the view, LS.
Suppose user "John" privileges are granted by user "Dan", when UPDATE privilege is removed from user "DAan", "John" UPDAATE privilege will lead to abandoned priveleges.Write remove UPDATE and DELETE privileges statement of user "Dan" tp causes abandoned privileges to be revoved as well.
Work through the RSA public key encryption scheme with p=3, q=5 and e=11 for plaintext ROSE (Use A= 01,.....Z=26)(9 marks)
Ideally, integrity rules should be considred in the design phase of the database for data correctness or accuracy. Define four board cateegories of integrity constraints with examples.
(10 marks)
What is "Prferential integrity"? Consider the following relational schems:(15 marsk) Table Name Attributes
Emp (eid:integer, ename: string, age:integer, salary;real)
Works (eid::integer,did: integer, pcttime:integer)
Dept (did: integer, daname: string, budget: real, managerid:integer)
Write the SQL statements to create the preceding relations, including appropriate versions of all primary and foreign keys integrity constraints.
Write an SQL statement to delete the Toy department.If the referential integrity constraint is ON DELETE CASCADE rule for this schema, explain what happens when this statement is executed.
If the referential integrity constraint for eid in Works table is ON DELETE NO ACTION rule for this schema, explain what happens when an employee is deleted in the Emp table.
What problems may occure if primary keys constraints are not used for this schema?
What problems may occur without foreign key constraints?
Define a distibuted database system. What are its davantages and disadvantages? Define the fundamental principle of distibuted database.(10 marks)
The objective of the distibuted database systm is to minimize network utilization. This objective in turn gives rise to the problems in number of distributed database processing.Define those areas and explain how DDBMS manages to achieve two of those problesms.(15 marks)
(OK)
One of the objectives of DDBMS is DBMS indepeneence. Briefly discussion on this objective that what DDBMS concepts are applicabe for homogeneity and heterogeneity DBMSs.(15 marks)


Wataru's Basketball GOAT List
Current Ranking
About
Contact
Submit your Goat List!
Number 1 choice:
Number 2 choice:
Number 3 choice:
Name your Goat List:
Submit my GOAT
Current Rankings
Mongo
Show Collection in Mongo
Get Stats from Mongo
Clear DB
About
blahbalhblbahalhbalhb about about lajlskfjlk
coijsdofijsodfjisodifjsoidfjsoidjfosidfjsoidjf
Contact
blahbalhblbahalhbalhb about about lajlskfjlk
coijsdofijsodfjisodifjsoidfjsoidjfosidfjsoidjf