To create a new category, the user chooses the 'Assignment' menu
command. The user chooses
'New Assignment Category' from the list of items to add a new category; this takes
the form of the following, Figure 1.
Figure 1: Add Category path.
Figure 2 shows a dialog box for adding a new category. The dialog box only
takes in a name in a text box, and an input box for the categories weight. the user confirms these choices with the 'Add Category'
button below. Confirming the category creates a new category in the spreadsheet.
Figure 2: Add Category dialog.
When the user selects the 'Add Category' button, the system
inputs the newly created category as shown in Figure 3.
Figure 3: Category Added view.
To add more categories follow the above steps. Figure 4 shows the results of adding two more categories.
Figure 4: Category Added View.


@* * Copyright 2023 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @(params: uk.gov.hmrc.fhregistrationfrontend.views.helpers.TextInputParams) @fieldName = @{ params.context match { case Some(context) => context + "." + params.name case _ => params.name } } @formGroupClass = @{ if(params.hasErrors) { "form-group form-group-error" } else { "form-group" } } @inputClass = @{ if(params.hasErrors) { "form-control form-control-error" } else { "form-control" } } @labelClass = @{ if(params.hiddenLabel) { "hidden" } else { "form-label" } } @label = { @if(params.labelAsHeading) {
} else { } } @nestedClass = @{ if(params.hiddenNested){" panel js-hidden"} else {""} }


INSTRUCTIONS: Click on the image that is most appealing to you. After 25 selections, the survey will end and the results will be displayed below. Thanks for participating.
| Stat | Sheet | ||
|---|---|---|---|
| Image Name: | Image Views: | Image Clicks: | Percentage Clicked: |
| Bag | |||
| Banana | |||
| Bathroom iPod Stand | |||
| Boots | |||
| Breakfast | |||
| Meatball Bubblegum | |||
| Chair | |||
| Cthulhu | |||
| Dog with Duckface | |||
| Dragon Meat | |||
| Pen | |||
| Pet Sweeper | |||
| Scissors | |||
| Shark Sleeping Bag | |||
| Baby Swiffer | |||
| Tauntaun | |||
| Unicorn Meat | |||
| USB Drive | |||
| Water Can | |||
| Wine Glass |


Record Subjects attributes
Subject key
Subject attributes
Record Resources attributes
Resource key
Resource attributes
Record policies
Policy key
Policy
Check access permissions
Subject key
Resource key
Rule
Policy key
Query attributes
Attribute key
Query policy
Policy key
Query all data


James Muspratt | 02/13/11
Here are links to the browser tools I’ve mentioned in a few classes:
- Safari has a dedicated Developer menu that you can turn on. Go to Safari > Preferences > Advanced and check “Show Develop menu in menu bar”. Now you can use the Develop menu to turn stylesheets off, show the Web Inspector, etc. You can also right-click a particular element on a web page and choose “Inspect This” to see that area of code and the styles that are being applied to it. (This “Web Inspector” is active by default in Chrome).
- The excellent Web Developer Toolbar does similar tricks and more, allowing you to outline elements, view a page’s CSS, etc. It’s available for Firefox and Chrome and gets installed as an extra toolbar — in Firefox it’s a big toolbar with icons, but with Chrome it’s a subtle Gear icon off to the right of your address bar.
Tags: resources
James Muspratt | 02/12/11
Hi everyone, just thought this cheat sheet might help as you continue to refine your first project. These are what I see as the most common kinds of CSS selectors that you need for your pages:
| What we want to style |
HTML |
CSS Rule |
| “All paragraphs” |

Sample
 |
p {color:red;} |
| “All paragraphs with a class of special” |

Sample
 |
p.special {color:red;} |
| “The (only) paragraph with an id of first” |

Sample
 |
p#first {color:red;} |
| “Anything with a class of warning” |

Sample
, but also
,
, etc. |
.warning {color:red;} |
| “Paragraphs in the maincontent div” |

Sample

 |
div#maincontent p {color:red;} |
| “List items in ingredients unordered lists” |

Sample

 |
ul.ingredients li {color:red;} |
Tags: resources
James Muspratt | 02/09/11
Hi everyone, here are some details about Project 1.
Submitting and Archiving
- Both parts of Project 1 are due on February 16, in class. I will pass around a flash drive and have you copy your files onto it. Please make sure you have your final files at the beginning of class: I recommend bringing them in on a drive and having backup copies in your email or on the server, just in case.
- Unless you have (reasonable) objections, I will be posting your projects to the website so the class can view and learn from them.
- To help with that process, please name your files as follows: Create two folders, one called lastname-project1a and the other lastname-project1b. Inside each, put files called index.html and style.css. Don’t forget to update the
<link>
tag in your HTML to refer to the new name of the CSS file.
Criteria for Grading
Remember that this project is both about writing valid, semantic code and employing compelling, refined, or inventive typography. As you get closer to finalizing your projects, please take into account the critiques you heard from the class in the past two weeks: in some cases this is a matter of small tweaks to spacing or fonts, with others it’s a matter of making bigger choices about what your design is trying to accomplish.
In no particular order, here are the core questions I’ll be asking:
- Does the HTML and CSS validate? If not, is there a clear reason why not?
- Is the mark-up written to be semantic and structural, rather than presentational?
- Has basic care been taken to proofread the text for transcription errors, extra spaces, etc.?
- Have proper HTML entities been used for non-ASCII typographic characters like curly quotation marks, apostrophes, dashes, ellipses, fractions, etc.?
- If appropriate to the design, have typographic “finer points” been observed?
- Does the typography retain its legibility and character if the text is resized up or down a level?
- Does the typography — not just choice of typeface, but also the measure, leading, type sizes, arrangement, and color — convey a thoughtful idea about, or approach to, the particular text? In other words, do the whole set of typographic “moves” add up to a coherent design?
James Muspratt | 02/09/11
Hi everyone, class is canceled tonight due to weather. See you Monday!
Tags: admin
James Muspratt | 02/08/11
Here is the schedule for show and tell for the rest of the semester:
| 1 19 |
— |
| 1 24 |
— |
| 1 26 |
aaron |
| 1 31 |
katelyn, don |
| 2 02 |
xavier |
| 2 07 |
rex, courtney |
| 2 09 |
jill |
| 2 14 |
adam a |
| 2 16 |
eric |
| 2 21 |
richard |
| 2 23 |
mark |
| 2 28 |
kelsey |
| 3 02 |
steve |
| 3 07 |
adam f |
| 3 09 |
katelyn |
| 3 14 |
(break) |
| 3 16 |
(break) |
| 3 21 |
(critiques) |
| 3 23 |
(critique) |
| 3 28 |
aaron |
| 3 30 |
don |
| 4 4 |
xavier, jill |
| 4 6 |
rex, courtney |
| 4 11 |
adam a, |
| 4 13 |
eric, richard |
| 4 18 |
mark2, kelsey |
| 4 20 |
steve, adam f |
| 4 25 |
(critique) |
| 4 27 |
(critique) |
| 5 02 |
— |
| 5 04 |
— |
Tags: admin /
show and tell
Don Mann | 02/08/11
This website, I think is really good, I like how the designer of the website molded it to Storm Thorgerson style. Each of the tabs for different pages has radial movements if you place the mouse on them, I think that's impressive since I can't do that. To me, I think the website is somewhat simple to navigate and I think it's clever that each piece of work has an eye on the lower right side, if you click on it it tells you info on how the work was made.
Tags: show and tell
James Muspratt | 02/07/11
Hi all, please read the following for Thursday:
Tags: reading
James Muspratt | 02/07/11
Here are tonight’s slides on the CSS Box Model.
Tags: slides
James Muspratt | 02/06/11
Just a reminder, if you are in Group B, we will be reviewing your first project tomorrow night (Feb 7).
- Group B (updated)
- Adam Filer
- Don Mann
- Xavier Payne
- Rex Runyeon
- Courtney Spencer
- Jill Thompson
- Kelsey Ullrich
- Steve Womack
Tags: admin
James Muspratt | 02/04/11
Here is the assignment for Monday, February 7:
- Read Zeldman, Ch. 10.
- Continue working on both parts of Project 1
- If you are in Group B, get your prose text to the point that you can present it and get feedback from the group. Think of questions you want to ask the group, whether they relate to design or code or both.
Tags: reading
James Muspratt | 02/04/11
On Wednesday, Adam's treatment of Kafka's Metamorphosis brought up the idea of creating new stories within books through typography. This is the book project I mentioned in class. Jonathan Safran Foer (better-known as a novel-writer) collaborated with designer Sara de Bondt to create Tree of Codes, a new work made entirely from the book Street of Crocodiles.
Read Good Magazine's post about the project.
Tags: inspiration
Katelyn Joughin | 02/03/11
This first website is Muse. I am not sure what this website is about but this site was stumbled upon and it was so strange and different that I had to show you guys. Something I didn’t like about it was that you could only click on the hand to naviate and there was no real understanding of what was going on.
This second website The Sum was my favorite! This is an online portfolio and freelance company. I love the whole design and the navigation. It was so clean and clear. One thing I really liked that I have not seen before was their logo moved down the page as you scrolled down the page. It was always on the left side floating and never covered anything up. I thought it was really unique. I also liked that everything was black and white except their own work which was displayed in color.
This last website Morgen Thau Film. It was a movie website featuring this interactive timeline of events that were in the movie. I also loved the loading screen. Since it was a flash website it took some time for the site to load. While it was loading, it was not your average loading bar, it was a sentance and had sayings that kept your interest. This site amazed me from the beginning.
Tags: show and tell
James Muspratt | 02/03/11
Tags: resources
James Muspratt | 01/31/11
A few of you were asking if there is a single list somewhere of common CSS properties and HTML tags. Here is what I found:
HTML
CSS
Tags: resources
James Muspratt | 01/31/11
Please remember we will be doing a mid-project critique of the work of Group A on Wednesday. Bring in the current state of both texts and be prepared to describe your intentions for the design, as well as questions you have for the group.
- Group A
- Adam Agee
- Eric Andre
- Richard Cook
- Mark Fentriss
- Adam Filer
- Karissa Goff
- Aaron Johnson
- Katelyn Joughin
- Group B
- Don Mann
- Xavier Payne
- Rex Runyeon
- Courtney Spencer
- Jill Thompson
- Kelsey Ullrich
- Steve Womack
Tags: admin
James Muspratt | 01/31/11
Here are the Web Typography Slides from tonight. I guess the URLs of the sites (below each screenshot) are only clickable if you open the PDF using a recent version of Preview for Mac (not Acrobat).
Tags: slides
Steve Womack | 01/31/11
I was googling around trying to get some specifics on certain CSS terms and syntax and found a great tutorial site. I found it very useful.
Hit This Link
Steve
Tags: resources
James Muspratt | 01/31/11
It is almost always a good idea to put a CSS reset at the top of your stylesheet. This clears all of the default spacing and style values that a browser would normally add, and means the rules you right will get the expected results more often.
/* Reset the browser defaults on everything */
body * {margin:0; padding:0; border:none;text-indent:0;text-decoration: none;outline:none;}
Tags: resources
Aaron Johnson | 01/28/11
Online Portfolio of Sonny Tulyaganov
I found this site interesting because it accomplishes many of the same effects as a flash site, yet uses no flash at all. The buttons animate when clicked and bring up an interface that lets you scroll down through his portfolio. All the animations have a delay on them, which is neat at first but gets tedious when navigating through the different pages. It's just a simple portfolio site and there are only three main pages though so perhaps it isn't meant to be viewed more than once.
The layout is interesting and minimalistic, which is typical of many modern portfolio sites. It utilizes a continuous long page that you scroll down to display his portfolio pieces, which cuts down on the amount of clicking and simplifies navigation. Interesting to note is that he seems to have embedded his blog into the site as well. Perhaps this utilizes RSS in some way to recreate the blog, rather than making an actual portal to another site.
Tags: show and tell
James Muspratt | 01/27/11
Here is the schedule for the next few weeks for show and tell:
- Jan 31: Katelyn, Don
- Feb 2: Xavier
- Feb 7: Rex, Courtney
- Feb 9: Jill
Tags: show and tell


A synthetic dataset for predicting cardiovascular risk in patient cohorts.
data(cvd_patient)
a data frame with variables related to cvd risk. cvd_genodata
is a smaller subset
of the data with a few genetic cohorts.
patientID
Patient Identifier. Unique patient identifier for Health Hospital University.
HHUID + 8 digit code
age
Patient Age Category. Age category of patient. string of age ranges.
htn
Does patient have hypertension? Threshold systolic blood pressure is 150. Y/N
treat
Is patient receiving hypertension treatment? Y/N
smoking
Y/N based on threshold of pack years: 10
race
Race based on self-defined question in survey. AmInd (american indian),
Asian/PI (asian/pacific islander), Black/AfAm (Black/African American), White
gender
Gender of patient. Male, Female, NA means that patient did not want gender recorded.
t2d
Whether patient has Type 2 diabetes. Y/N.
numAge
numerical age in years.
bmi
Body Mass Index of Patient. kg/m^2
sbp
Systolic Blood Pressure in mm/Hg
cvd
Cardiovascular disesase based on extraction from patient billing codes. Y/N
There is a subset of patients that include genetic covariate information called cvd_genodata
.
rs10757278
SNP data
rs1333049
SNP data
rs4665058
SNP data
rs8055236
SNP data
#load full dataset data(cvd_patient) #look at summary of data summary(cvd_patient)#> patientID age htn treat smoking #> HHUID00000002: 1 0-20 : 42341 N:310265 N:358070 N:374322 #> HHUID00000004: 1 20-40:141423 Y:114930 Y: 67125 Y: 50873 #> HHUID00000007: 1 40-55:112907 #> HHUID00000009: 1 55-70: 88033 #> HHUID00000010: 1 70-90: 40491 #> HHUID00000011: 1 #> (Other) :425189 #> race t2d gender numAge bmi #> AmInd : 2293 N:393906 F:243138 Min. : 0.00 Min. :15.00 #> Asian/PI : 77881 Y: 31289 M:182057 1st Qu.:29.00 1st Qu.:19.00 #> Black/AfAm: 23888 Median :44.00 Median :21.00 #> White :321133 Mean :44.01 Mean :21.98 #> 3rd Qu.:59.00 3rd Qu.:24.00 #> Max. :90.00 Max. :36.00 #> #> tchol sbp cvd #> Min. :155.0 Min. : 73.0 N:375325 #> 1st Qu.:160.0 1st Qu.:115.0 Y: 49870 #> Median :180.0 Median :124.0 #> Mean :187.7 Mean :135.5 #> 3rd Qu.:206.0 3rd Qu.:165.0 #> Max. :245.0 Max. :222.0 #>#load genotype dataset data(cvd_genodata) summary(cvd_genodata)#> patientID age htn treat smoking #> HHUID00000004: 1 0-20 : 1067 N:49454 N:53681 N:52992 #> HHUID00000022: 1 20-40:47186 Y:10420 Y: 6193 Y: 6882 #> HHUID00000032: 1 40-55:11621 #> HHUID00000036: 1 #> HHUID00000038: 1 #> HHUID00000090: 1 #> (Other) :59868 #> race t2d gender numAge bmi #> AmInd : 344 N:55248 F:33348 Min. :19.00 Min. :15.00 #> Asian/PI :11106 Y: 4626 M:26526 1st Qu.:26.00 1st Qu.:19.00 #> Black/AfAm: 3286 Median :32.00 Median :21.00 #> White :45138 Mean :32.11 Mean :22.04 #> 3rd Qu.:39.00 3rd Qu.:24.00 #> Max. :44.00 Max. :36.00 #> #> tchol sbp rs10757278 rs1333049 rs4665058 rs8055236 #> Min. :155.0 Min. : 78.0 AA:45719 CC:45719 AA: 4924 GG:20914 #> 1st Qu.:160.0 1st Qu.:114.0 GG:14155 GG:14155 CC:54950 TT:38960 #> Median :180.0 Median :122.0 #> Mean :187.4 Mean :129.8 #> 3rd Qu.:204.0 3rd Qu.:133.0 #> Max. :245.0 Max. :219.0 #> #> cvd #> N:57973 #> Y: 1901 #> #> #> #> #>


Already have an intuit account?
I forgot my User ID or Password
One account for everything Intuit, including Mint. Learn more
Already have an account? Sign In
By selecting Create Account, you agree to our Terms and have read and acknowledge our Global Privacy Statement.
Invisible reCAPTCHA by Google Privacy Policy and Terms of Use.
legal
private
security
© 2021 Intuit, Inc. All rights reserved. Intuit QuickBooks, QB, TurboTax, ProConnect and Mint are registered trademarks of Intuit Inc. Terms and conditions, features support, pricing, and service options subject to change without notice.


[1]
the extensive staff in all the views are to die for.
[2]
the restaurants and if you find this review helpful don’t forget to press the “yes button thanks.


You can add multiple files. Upload only starts after clicking the button.
{{file.name}}
Wait seconds for the newly uploaded file to be listed


Data Science Analyst - Chicago, IL 60612
Job Title: Data Science Analyst
Department: Quality Improvement
Shift: 1st
Specialty: Quality Improvement
Job Number: 2019-2971
Date Posted: 09/24/2019
Position Type:
Job Qualifications:
Data Science Analyst
Position Highlights:
The Data Science Analyst will support our clinical and financial analytics project using Big Data technologies. The ideal candidate is adept at using large data sets to find opportunities for clinical and financial optimization and using models to test the effectiveness of different courses of action. They must have course work or experience using a variety of data mining/data analysis methods, using a variety of data tools, building and implementing models, using/creating algorithms and creating/running simulations. They must be comfortable working with a wide range of stakeholders and functional teams. The right candidate will have a passion for discovering solutions hidden in large data sets and working with stakeholders to improve business outcomes.
Position Responsibilities:
Work with stakeholders throughout the organization to identify opportunities for leveraging enterprise data to drive clinical and business solutions.
Mine and analyze data from desperate databases to drive optimization and improvement of clinical outcomes, marketing techniques and business strategies.
Assess the effectiveness and accuracy of new data sources and data gathering techniques.
Develop custom data models and algorithms to apply to data sets.
Use predictive modeling to increase and optimize patient outcomes, patient experiences, revenue generation, ad targeting and other business outcomes.
Develop company A/B testing framework and test model quality.
Coordinate with different functional teams to implement models and monitor outcomes.
Develop processes and tools to monitor and analyze model performance and data accuracy
Uses third party software tools and research data warehouse in development of queries and visualizations.
Creates research data marts using the enterprise IT architecture.
Serves as representative for the KM Team on committees and initiatives that involve multi-site studies to facilitate IT and research informatics collaborations.
Develops analytic data sets for operations and research and uses statistical software (SAS or R) to analyze data sets as requested.
Produces analytics that facilitate evidence-based clinical and financial decisions.
Member of the IT Knowledge Management team at Rush. Maintains peer relationship and collaborative knowledge exchange with IT counterparts.
Position Qualifications Include:
Bachelor's degree in information science, computer science, or equivalent technical experience. Master's preferred.
Knowledge of a variety of machine learning techniques (clustering, decision tree learning, artificial neural networks, etc.).
Knowledge of advanced statistical techniques and concepts (regression, properties of distributions, statistical tests and proper usage, etc.).
Knowledge of statistical and data mining techniques: GLM/Regression, Random Forest, Boosting, Trees, text mining, social network analysis, etc.
At least three years of experience in statistical software (e.g. SAS or R), with data science experience preferred.
Experience in the health care setting required
Experience with Epic a plus
Experience with financial /claims data a plus.
Skills:
Excellent written and verbal communication skills for coordinating across teams.
Cloud Computing; Data Mining; Data Visualization; Machine Learning
Strong problem-solving skills with an emphasis on data analytics.
Strong analytic, issue resolution, and facilitation skills.
Demonstrated proficiency writing SQL stored procedures or queries.
Able to present complex information in an understandable and compelling manner.
Able to prioritize and multi-task to manage expectations of multiple stakeholders.
Able to deliver high quality, timely work product with significant autonomy.
Effectively adapts to rapid changes in project or data requirements and changing directions.
Abilities:
Experience using statistical computer languages (R, Python, SLQ, etc.) to manipulate data and draw insights from large data sets.
Experience querying and analyzing data with SQL programming language or equivalent tools.
A drive to learn and master new technologies and techniques.
Technology/Tools/Languages (Command on the tools below is required):
Computer programming languages: R, Python, SLQ, C, C++, Java, JavaScript, etc.
Distributed data/computing tools: Map/Reduce, Hadoop, Hive, Spark, MySQL, etc.
Visualization/presentation tools: Tableau, Business Objects
Microsoft Management Studio
SSIS package development using Visual Studio
PL/SQL Developer
Microsoft Visual Studio 2012 and above
Pragmatic Works (BI Xpress)
Common office tools (e.g. Microsoft Office Suite, Visio, e-mail)
Disclaimer:
The above is intended to describe the general content of and requirements for the performance of this job. It is not to be construed as an exhaustive statement of duties, responsibilities or requirements.
Company Highlights:
Rush University is a health science university that is integral to Rush, an academic health system that includes three hospitals and numerous outpatient care facilities.
Rush University's Nursing Administration program is ranked in the top four in the nation by U.S. News & World Report.
Rush University's Family Nurse Practitioner program is ranked in the top six in the nation by U.S. News & World Report.
Rush is an equal opportunity employer. We evaluate qualified applicants without regard to race, color, religion, sex, sexual orientation, gender identity, national origin, disability, veteran status, and other legally protected characteristics.
Data Science Analyst
Position Highlights:
The Data Science Analyst will support our clinical and financial analytics project using Big Data technologies. The ideal candidate is adept at using large data sets to find opportunities for clinical and financial optimization and using models to test the effectiveness of different courses of action. They must have course work or experience using a variety of data mining/data analysis methods, using a variety of data tools, building and implementing models, using/creating algorithms and creating/running simulations. They must be comfortable working with a wide range of stakeholders and functional teams. The right candidate will have a passion for discovering solutions hidden in large data sets and working with stakeholders to improve business outcomes.
Position Responsibilities:
Work with stakeholders throughout the organization to identify opportunities for leveraging enterprise data to drive clinical and business solutions.
Mine and analyze data from desperate databases to drive optimization and improvement of clinical outcomes, marketing techniques and business strategies.
Assess the effectiveness and accuracy of new data sources and data gathering techniques.
Develop custom data models and algorithms to apply to data sets.
Use predictive modeling to increase and optimize patient outcomes, patient experiences, revenue generation, ad targeting and other business outcomes.
Develop company A/B testing framework and test model quality.
Coordinate with different functional teams to implement models and monitor outcomes.
Develop processes and tools to monitor and analyze model performance and data accuracy
Uses third party software tools and research data warehouse in development of queries and visualizations.
Creates research data marts using the enterprise IT architecture.
Serves as representative for the KM Team on committees and initiatives that involve multi-site studies to facilitate IT and research informatics collaborations.
Develops analytic data sets for operations and research and uses statistical software (SAS or R) to analyze data sets as requested.
Produces analytics that facilitate evidence-based clinical and financial decisions.
Member of the IT Knowledge Management team at Rush. Maintains peer relationship and collaborative knowledge exchange with IT counterparts.
Position Qualifications Include:
Bachelor's degree in information science, computer science, or equivalent technical experience. Master's preferred.
Knowledge of a variety of machine learning techniques (clustering, decision tree learning, artificial neural networks, etc.).
Knowledge of advanced statistical techniques and concepts (regression, properties of distributions, statistical tests and proper usage, etc.).
Knowledge of statistical and data mining techniques: GLM/Regression, Random Forest, Boosting, Trees, text mining, social network analysis, etc.
At least three years of experience in statistical software (e.g. SAS or R), with data science experience preferred.
Experience in the health care setting required
Experience with Epic a plus
Experience with financial /claims data a plus.
Skills:
Excellent written and verbal communication skills for coordinating across teams.
Cloud Computing; Data Mining; Data Visualization; Machine Learning
Strong problem-solving skills with an emphasis on data analytics.
Strong analytic, issue resolution, and facilitation skills.
Demonstrated proficiency writing SQL stored procedures or queries.
Able to present complex information in an understandable and compelling manner.
Able to prioritize and multi-task to manage expectations of multiple stakeholders.
Able to deliver high quality, timely work product with significant autonomy.
Effectively adapts to rapid changes in project or data requirements and changing directions.
Abilities:
Experience using statistical computer languages (R, Python, SLQ, etc.) to manipulate data and draw insights from large data sets.
Experience querying and analyzing data with SQL programming language or equivalent tools.
A drive to learn and master new technologies and techniques.
Technology/Tools/Languages (Command on the tools below is required):
Computer programming languages: R, Python, SLQ, C, C++, Java, JavaScript, etc.
Distributed data/computing tools: Map/Reduce, Hadoop, Hive, Spark, MySQL, etc.
Visualization/presentation tools: Tableau, Business Objects
Microsoft Management Studio
SSIS package development using Visual Studio
PL/SQL Developer
Microsoft Visual Studio 2012 and above
Pragmatic Works (BI Xpress)
Common office tools (e.g. Microsoft Office Suite, Visio, e-mail)
Disclaimer:
The above is intended to describe the general content of and requirements for the performance of this job. It is not to be construed as an exhaustive statement of duties, responsibilities or requirements.
Company Highlights:
Rush University is a health science university that is integral to Rush, an academic health system that includes three hospitals and numerous outpatient care facilities.
Rush University's Nursing Administration program is ranked in the top four in the nation by U.S. News & World Report.
Rush University's Family Nurse Practitioner program is ranked in the top six in the nation by U.S. News & World Report.
Rush is an equal opportunity employer. We evaluate qualified applicants without regard to race, color, religion, sex, sexual orientation, gender identity, national origin, disability, veteran status, and other legally protected characteristics.


|
Rendu
An OpenGL rendering engine for experimentations
|
Represents a group of shaders used for rendering. More...
#include <Program.hpp>
Public Member Functions | |
| Program (const std::string &vertexName, const std::string &fragmentName, const std::string &geometryName) | |
| void | cacheUniformArray (const std::string &name, const std::vector< glm::vec3 > &vals) |
| void | reload () |
| void | validate () const |
| void | saveBinary (const std::string &outputPath) const |
| void | use () const |
| void | clean () const |
| void | uniform (const std::string &name, bool t) const |
| void | uniform (const std::string &name, int t) const |
| void | uniform (const std::string &name, float t) const |
| void | uniform (const std::string &name, size_t count, const float *t) const |
| void | uniform (const std::string &name, const glm::vec2 &t) const |
| void | uniform (const std::string &name, const glm::vec3 &t) const |
| void | uniform (const std::string &name, const glm::vec4 &t) const |
| void | uniform (const std::string &name, const glm::mat3 &t) const |
| void | uniform (const std::string &name, const glm::mat4 &t) const |
| Program & | operator= (const Program &)=delete |
| Program (const Program &)=delete | |
| Program & | operator= (Program &&)=default |
| Program (Program &&)=default | |
Private Attributes | |
| GLuint | _id |
| The OpenGL program ID. | |
| std::string | _vertexName |
| The vertex shader filename. | |
| std::string | _fragmentName |
| The fragment shader filename. | |
| std::string | _geometryName |
| The geometry shader filename. | |
| std::map< std::string, GLint > | _uniforms |
| The list of automatically registered uniforms and their locations. | |
| std::map< std::string, glm::vec3 > | _vec3s |
| Internal vec3 uniforms cache, for reloading. | |
Represents a group of shaders used for rendering.
Internally responsible for handling uniforms locations, shaders reloading and values caching.
| Program::Program | ( | const std::string & | vertexName, |
| const std::string & | fragmentName, | ||
| const std::string & | geometryName | ||
| ) |
Load, compile and link shaders into an OpenGL program.
| vertexName | the name of the vertex shader |
| fragmentName | the name of the fragment shader |
| geometryName | the name of the geometry shader (can be empty) |
|
delete |
Copy constructor (disabled).
|
default |
Move constructor.
| void Program::cacheUniformArray | ( | const std::string & | name, |
| const std::vector< glm::vec3 > & | vals | ||
| ) |
Cache the values passed for the uniform array.
| name | the uniform array name |
| vals | the values to cache and to set the uniform to |
| void Program::clean | ( | ) | const |
Delete the program on the GPU.
Copy assignment operator (disabled).
Move assignment operator.
| void Program::reload | ( | ) |
Reload the program, recompiling the program and restoring all locations and cached uniforms.
| void Program::saveBinary | ( | const std::string & | outputPath | ) | const |
Save the program to a compiled set of instructions on disk.
| outputPath | the output path |
| void Program::uniform | ( | const std::string & | name, |
| bool | t | ||
| ) | const |
Set a given uniform value.
| name | the uniform name |
| t | the value to set the uniform to |
| void Program::uniform | ( | const std::string & | name, |
| const glm::mat3 & | t | ||
| ) | const |
Set a given uniform value.
| name | the uniform name |
| t | the value to set the uniform to |
| void Program::uniform | ( | const std::string & | name, |
| const glm::mat4 & | t | ||
| ) | const |
Set a given uniform value.
| name | the uniform name |
| t | the value to set the uniform to |
| void Program::uniform | ( | const std::string & | name, |
| const glm::vec2 & | t | ||
| ) | const |
Set a given uniform value.
| name | the uniform name |
| t | the value to set the uniform to |
| void Program::uniform | ( | const std::string & | name, |
| const glm::vec3 & | t | ||
| ) | const |
Set a given uniform value.
| name | the uniform name |
| t | the value to set the uniform to |
| void Program::uniform | ( | const std::string & | name, |
| const glm::vec4 & | t | ||
| ) | const |
Set a given uniform value.
| name | the uniform name |
| t | the value to set the uniform to |
| void Program::uniform | ( | const std::string & | name, |
| float | t | ||
| ) | const |
Set a given uniform value.
| name | the uniform name |
| t | the value to set the uniform to |
| void Program::uniform | ( | const std::string & | name, |
| int | t | ||
| ) | const |
Set a given uniform value.
| name | the uniform name |
| t | the value to set the uniform to |
| void Program::uniform | ( | const std::string & | name, |
| size_t | count, | ||
| const float * | t | ||
| ) | const |
Set a given float array uniform values.
| name | the uniform name (including "[0]") |
| count | the number of values in the float array |
| t | the values to set the uniform to |
| void Program::use | ( | ) | const |
Activate the program shaders.
| void Program::validate | ( | ) | const |
Perform full program validation and log the results.


126_submitwithoutrun.py
class Solution:
def minCost(self, houses: List[int], cost: List[List[int]], m: int, n: int, t: int) -> int:
max_ = 99999999
dp = [[[max_ for _ in range(t)] for _ in range(n)] for _ in range(m)]
if houses[0] == 0:
for j in range(n):
dp[0][j][0] = cost[0][j]
else:
dp[0][houses[0]-1][0] = 0
for i in range(1, m):
for j in range(n):
for k in range(t):
for j2 in range(n):
if houses[i] == 0 or houses[i]-1 == j2:
k2 = k + 1 if j2!=j else k
if k2<t:
dp[i][j2][k2] = min( (cost[i][j2] if houses[i]-1 != j2 else 0) + dp[i-1][j][k], dp[i][j2][k2])
ret = max_
for j in range(n):
ret = min(ret, dp[m-1][j][t-1])
return -1 if ret == max_ else ret


These are the recorded sessions of teaching activities I have had or the videos I created for educational purposes. Moreover, I regularly record and publish videos in TuxRiders on topics related to open-source scientific computing.
I try to record my presentations in conferences that I’m allowed to do so. Then I combine the recorded audio with the presented slides and share the output here. For more details of this, you may have a look at Presentations and Posters.
FreeFEM Days, 14th Edition
Paris, France, 2022
Virtual Physiological Human (VPH) conference
Porto, Portugal, 2022
8th European Congress on Computational Methods in Applied Sciences and Engineering (ECCOMAS)
Oslo, Norway, 2022
HPC Asia, 5th Edition
Japan, 2022
FreeFEM Days, 13th Edition
Paris, France, 2021
6th World Congress of Tissue Engineering and Regenerative Medicine International Society (TERMIS)
Maastricht, the Netherlands, 2021
8th Belgian Symposium on Tissue Engineering (BSTE)
Louvain, Belgium, 2021
Mechanistic Machine Learning and Digital Twins for Computational Science, Engineering & Technology (MMLDT) Conference
San Diego, USA, 2021
17th International Symposium on Computer Methods in Biomechanics and Biomedical Engineering (CMBBE)
Bonn, Germany, 2021
Congress of the International Society of Biomechanics (ISB)
Stockholm, Sweden, 2021
SIAM Conference on Mathematical Aspects of Materials Science
Bilbao, Spain, 2021
KU Leuven Open Science Study Day
Leuven, Belgium, 2021
11th World Biomaterials Congress, 2020
JupyterCon 2020
FreeFEM Days, 11th Edition
Paris, France, 2019
27th Conference of the European Orthopaedic Research Society (EORS)
Maastricht, the Netherlands, 2019
Colloquium of Fluid and Solid Mechanics for Tissue Engineering
Oxford, UK, 2019
2nd International Conference on Simulation for Additive Manufacturing
Pavia, Italy, September 2019
11th Symposium on Biodegradable Metals
Alicante, Spain, August 2019
These are the recorded sessions of my invited talks at scientific workshops or events.
Simulation-based Science (SbS) community
University of Amsterdam, the Netherlands, 2022
1st SGABU Project Workshop, 2021
This is a recorded version of my public PhD defense held on 15 June 2023. Please refer to the PhD project page for more information on this.


Easy Popover Getting Started and Demos
EasyPopover - is easy and simple library for popover.
It dosn't depend on a specific library.
Purpose of this library
It is intended to be used to describe elements on the pages of your site. On load page, popup automatically.
If you close the popover, it Never displayed.
If you close, save the flag you closed to local storage.
Demos
Position absolute
You need to set
data-style
attribute with style of position
HTML
Position Fixed
You need to set
data-style
attribute with style of position
HTML
Getting statrted
1. Download and install
First of all we need to download required files.
- We can download them from GitHub repository
- Or we can install them via npm in terminal.
And use files in the dist/
folder.
2. Include Files To Website
After that we need to include JS files to our website. In your html file.
<!DOCTYPE html>
<html>
<head>
...
<link rel="stylesheet" href="path/to/popover.css">
</head>
<body>
...
<script src="path/to/EasyPopover.js"></script>
<script>
document.addEventListener('DOMContentLoaded', function() {
EasyPopover.init()
})
</script>
</body>
</html>
3. Define Popover HTML
Set parameters with reffering to below documents
Set parameters with reffering to below documents
Document
HTML
Target
- Set class
js-scroll-effect
to target element. - class
is-active
is added to target element at shown in window after scroll. - You have to define styles for them.
Directions
Reffer to Bootstrap document
Options
| Parameter | Example | Default | Description |
|---|---|---|---|
| name | data-name="popover01" | (none) |
Required This value is user for key name of localstrage |
| container | data-container="#block-hoge" | (none) |
Required Set target selector |
| content | data-content="Sample sentence.<br>Sample sentence." | (none) |
Set text to display in popover You can use HTML tag |
| style | data-style="position:absolute;top:30px;right:auto;bottom:auto;left:0;" | (none) |
Required Set style of position based on target dom |
| arrow-style | data-style="left:20px;" | 0 |
Set horizontal position of arrow |
| expire | data-expire="2020-02-28" | (none) |
Set End date. If you set and after this date, popover never displayed. |
| target-param-name | data-target-param-name="hoge" | (none) |
Set this, if you want to display only when the URL contains a specific query parameter. Use this with "data-target-params". |
| target-params | data-target-params="aaa,bbb,ccc" | (none) |
Set this, if you want to display only when the URL contains a specific query parameter. Use this with "target-param-name". Set comma delimittered string. |


Elite: Dangerous Black Market finder
Here you can find the closest blackmarket to your current location.
Notice: Download status below. Wait for them to load before searching.
System data
Station data
System data
Station data
Here you can find the closest blackmarket to your current location.


Earlier major BSD releases included 3BSD (1980), 4BSD (1980), and 4.1BSD (1981).
The standard defines two levels of conformance: POSIX conformance, which is a baseline set of interfaces required of a conforming system; and XSI Conformance, which additionally mandates a set of interfaces (the "XSI extension") which are only optional for POSIX conformance. XSI-conformant systems can be branded UNIX 03. (XSI conformance constitutes the Single UNIX Specification version 3 (SUSv3).)
The POSIX.1-2001 document is broken into four parts:
XBD: Definitions, terms and concepts, header file specifications.
XSH: Specifications of functions (i.e., system calls and library functions in actual implementations).
XCU: Specifications of commands and utilities (i.e., the area formerly described by POSIX.2).
XRAT: Informative text on the other parts of the standard.
POSIX.1-2001 is aligned with C99, so that all of the library functions standardized in C99 are also standardized in POSIX.1-2001.
Two Technical Corrigenda (minor fixes and improvements) of the original 2001 standard have occurred: TC1 in 2003 (referred to as POSIX.1-2003), and TC2 in 2004 (referred to as POSIX.1-2004).
The changes in this revision are not as large as those that occurred for POSIX.1-2001/SUSv3, but a number of new interfaces are added and various details of existing specifications are modified. Many of the interfaces that were optional in POSIX.1-2001 become mandatory in the 2008 revision of the standard. A few interfaces that are present in POSIX.1-2001 are marked as obsolete in POSIX.1-2008, or removed from the standard altogether.
The revised standard is broken into the same four parts as POSIX.1-2001, and again there are two levels of conformance: the baseline POSIX Conformance, and XSI Conformance, which mandates an additional set of interfaces beyond those in the base specification.
In general, where the CONFORMING TO section of a manual page lists POSIX.1-2001, it can be assumed that the interface also conforms to POSIX.1-2008, unless otherwise noted.
Technical Corrigendum 1 (minor fixes and improvements) of this standard was released in 2013 (referred to as POSIX.1-2013).
Further information can be found on the Austin group web site,


THE MYTH OF FINGERPRINTS (1997) A Film Review by Vince Deehan Copyright 1997 Vince Deehan
Written and Directed by Bart Freundlich Cast: Blythe Danner, Roy Scheider, Julianne Moore, Noah Wyle, James LeGros, Brian Kerwin, Michael Vartan, Hope Davis, Laurel Holloman and Arija Bareikis.
When I first heard about this film I knew it was a film that I had to see. The combination of an excellent ensemble cast and the story of a troubled family coming together at Thanksgiving sounded unmissable. I first heard about this film in January when it was shown at the 1997 Sundance Film Festival. How I wished I could have been there to see it ! Luckily the film was recently released here in the UK, and I went along last Wednesday (Dec 10) to the ABC cinema, next to Baker Street tube station in London, to see it. I often find that films for which I have very high expectations usually just fall short of my unrealistic hopes. This wasn't the case with THE MYTH OF FINGERPRINTS.
The last film I reviewed was a little known film called CROOKED HEARTS (1991) which told the story of another troubled family, and also happened to feature a young Noah Wyle playing a member of a family, called the Warren family. Is it coincidence that Noah Wyle's character in TMOF is called Warren. Probably, but I just felt like pointing this out !
I can usually tell if I'm going to like a film by the opening sequence. If the film has a poor opening sequence it often bodes badly for the film. The opening sequence of TMOF was great - wonderful music and shots of an old home movie showing the main characters as children with their parents, Lena (Blythe Danner) and Hal (Roy Scheider).
The first member of the family to come home for Thanksgiving is Warren (Noah Wyle). Warren hasn't been home for three years and his early arrival causes his father some irritation. His father Hal moans about it to his wife, who is delighted to see her son and having him home one day earlier is a joy for her - as it should be. This is our first hint that all is not well between Warren and his father. Warren is clearly a man with a lot on his mind and from the first moment we see him it is obvious he is going through mental torment. As the film progresses we get to see exactly what is eating him up inside. Warren meets up with his ex-girlfriend Daphne ( Arija Bareikis) who dumped Warren three years earlier. When Daphne explains to Warren why she left him, it brings to the surface the inner torment that Warren has been living with since the breakup.
The only member of the family who is still living at home is Leigh, played by Laurel Holloman. One review I've read described Leigh as a college student who was also returning home, but unless I missed something I got the impression she was still living at home. Leigh is a very peculiar character, at least to me, because she appears to be no younger than her brothers Jake (Michael Vartan) and Warren, but her behaviour throughout the film is that of a 15 year old - all naivete and childish giggles. I would have liked to have gotten a bit more background on this character who is quite fascinating but very hard to pin down, because of the ambiguity concerning her actual age. Was she meant to be a teenager or a very immature twenty-something ? If anyone reading this knows, please drop me a line !
The least interesting member of the family is Jake, who arrives home with his girlfriend Margaret (Hope Davis). We get little depth of character from Jake which makes it hard to be interested in him, but at least his girlfriend Margaret is very watchable. She speaks her mind throughout the film and manages to irritate Hal and Mia ( Julianne Moore). When she first arrives at the family home with Jake, she is told by Lena that she will be in a separate room to Jake. She then proceeds to ask Lena , straight out, if she can sleep with "your son" . Her forthrightness immediately impresses Lena !
Alongside Warren, the most interesting other sibling is Mia, played with typical excellence by the wonderful Julianne Moore. Our first sight of Mia and her partner Elliot is very amusing, but I won't spoil it for those who haven't seen the film ! Mia is clearly a very irritable lady and takes great exception to almost everything she hears from Jakes's girlfriend Margaret, her sister Leigh, a hapless bookstore worker and especially her partner Elliot. When Elliot innocently asks Mia what the plans for the day are, she snaps back that he shouldn't need to have a schedule. It seems nothing said to Mia cannot be in some way offensive to her. When Mia finds a book, that she has taken from the family bookshelf, has had the penultimate chapters ripped out "for kindling" by her father, she is furious. She then storms down to the local bookstore and can barely hide her extreme irritation when they don't have it in stock. When the kind and helpful bookstore clerk (played by Pamela Polhemus) offers to order it for her, Mia scowls at her and asks sarcastically, "Can they have it here in ten minutes?" Of course they can't, and she storms out. You really feel for the bookstore lady who is a model of restraint and genuine helpfulness, and is faced with the customer who cannot be satisfied !
It is outside the bookstore that she meets Cezanne (James LeGros) who was also in the bookshop and recognised Mia as a classmate from kindergarten. Cezanne is his new name, having changed it from his original name. Mia fails to recognise him and only when she finds out that he has read the same book, that she so desperately wants to know the ending to, does she thaw out a bit and treat her old playmate with a bit of civility. She agrees to meet him the next day. It later turns out that her mother has found an old handmade card from the infant Cezanne to Mia , expressing his love for her. Cezanne is perhaps the most interesting character in the film, probably because we learn little about him, but his sweet and very innocent nature is a wonderful contrast to the spiky, vitriolic Mia and it is a very touching sequence when they meet again at Cezanne's house, where he tells her how the book ended. James LeGros virtually steals the film with his wonderful performance as a kind and gentle man who melts the frosty Mia.
The acting by all the cast is magnificent, but acting honours go to Noah Wyle, Julianne Moore and James LeGros. Noah Wyle gives a performance of great intensity and greatly impresses. Roy Scheider as Hal, says very little, but creates a heavy and almost menacing presence whenever he is on screen which is very effective.
This is not a happy family and an air of awkwardness hangs over the whole film which is very well demonstrated when the family and their partners, plus Warren's very charming "loser" friends , sit down for Thanksgiving dinner. The conversation is stilted and the slightest misjudged remark creates a very palpable air of tension. It's clear that as the head of the family, Hal is responsible for the horrible air of tension that pervades his family. We see clearly how his rift with Warren began, but his general coldness with the rest of the family is never clearly explained. It's obvious to me that Hal knows that he has become estranged from his kids but seems unable to bridge the chasm between them , although I'm certain he would if he thought it were possible.
Bart Freundlich's has created a wonderful film that I definitely want to see again to savour the great dialogue and powerful performances. I am greatly looking forward to his future projects.
Review written by Vince Deehan on Sunday 14 December 1997 e-mail<EMAIL_ADDRESS>http://www.deehan.demon.co.uk
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


from 0 to PyPI in 15 minutes
(hopefully...)
The process of installing, upgrading or publishing Python source code
https://python-packaging-user-guide.readthedocs.org/en/latest/glossary/
$ mkdir athina $ cd athina $ python -m venv .venv $ source .venv/bin/activate $ pip install -U setuptools pip wheel twine
def hi():
return 'Hi Athens!'
from setuptools import setup
setup(
name='athina',
version='0.1.0',
description='A sample Python project',
long_description='Long description of the package should be here.',
url='https://projectsite.com',
author='John Doe',
<EMAIL_ADDRESS>license='MIT',
platforms='any',
py_modules=['athina']
)
A distribution format that provides metadata and the essential source files needed for installing by a tool like pip, or for generating a Built Distribution.
$ python setup.py sdist
A Distribution format containing files and metadata that only need to be moved to the correct location on the target system, to be installed
A Built Distribution format
$ python setup.py bdist_wheel --universal
https://pypi.python.org
or for testing
https://testpypi.python.org
[distutils]
index-servers=
pypi
testpypi
[pypi]
repository = https://pypi.python.org/pypi
username = alefteris
[testpypi]
repository = https://testpypi.python.org/pypi
username = thale
$ twine register -r testpypi dist/athina-0.1.0.tar.gz
$ twine upload -r testpypi dist/*
$ pip install -i https://testpypi.python.org/pypi athina
Here is a cat packaged


Israeli PM Benjamin Netanyahu charged with fraud and bribery
Israeli Prime Minister Benjamin Netanyahu has been charged in a series of corruption scandals.
Attorney General Avichai Mandelblit issued an indictment on Thursday charging Mr Netanyahu with fraud, breach of trust and bribery.
Mr Netanyahu has denied any wrongdoing and said he is a victim of a witch-hunt. He is due to make a statement on Thursday evening.
But the decision to charge him is likely to deal a heavy blow to Mr Netanyahu’s hopes of remaining in office.
Israel has recently held two inconclusive elections, with a third likely amid an ongoing political impasse.
The allegations against Mr Netanyahu include suspicions that he accepted hundreds of thousands of pounds worth of champagne and cigars from billionaire friends, offered to trade favours with a newspaper publisher, and used his influence to help a wealthy telecoms magnate in exchange for favourable coverage on a popular news site.
READ MORE
Greenpeace activists spell out climate message on Angela Merkel’s office


Welcome to Iceland Earthquake Monitor
A collection of all earthquakes from the last 48 hours
Quake stats


if n <= m:
// This will be a small matrix if A is wide
// Say L = r^-1 * (I - A"(rI - AA")^-1 A)
L = rho**-1 * (np.eye(m) - np.dot(A.T, np.linalg.solve(rho * np.eye(n) + np.dot(A, A.T), A)))
// L is m by m
// A" is m by n (m >> n)
// This puts our initial iterate X into the column space of A
// so that we have strong (local) convexity
X = np.linalg.lstsq(A, B)[0]
Y = np.zeros(X.shape, dtype=A.dtype)
np.maximum(X, 0.0, Y)
W = X - Y
residual = W.copy()


Environment Variables
Memory objects that can be referred to by one or more applications
$PATH stores file system paths that are used by the shell to search for executables in respective order of the defined paths
system() - executes a command by calling /bin/sh -c command, and returns after the command has been completed
Additional C functions that may use the $PATH
popen()
execlp()
execvp()
execvpe()
Absolute Paths
Not always a mitigating factor!
Depending on shell (bash / dash / etc), it can still be exploited
Bash < 4.2-048 could pass to executables functions that are named similar to an absolute path
Bash supports a script debugging mode
Bash uses the PS4 environment variable to define a prompt for debugging mode
Maybe you can obtain write access to the full path location anyway!


--- layout: snippet title: "Disabled buttons" permalink: /examples/buttons/disabled/ sitemap: false --- Primary Secondary


the and {background quarantine that health for margin {border-style px;} #ffffff;} from was (). has measures plague Health preventive public px; {font-family COVID- coronavirus current days font-size historical its were Western disease double; interventions pandemic with From Italian also border-color border-width century concept effective epidemic have infectious not present solid; this {font-style {font-weight Medical Press The acute been bold but courier; course em; even forty influenza people period persons point pt;} respiratory term view,


What is Git?
Git is a version control system.
Why do I need version control?
Human attempts at tracking different versions are valiant...
...and destined for failure and frustration.
Other version control systems
- Subversion
- Mercurial
- Team Studio (Microsoft)
- Perforce
- There are many more...
What's the difference?
Branching and Merging
What's the difference?
Branching and Merging
- Context Switching in local branches
- Role-Based Codelines - use branches to organize production code from other day-to-day activities.
- Feature Based Workflow - work on a feature then merge it back into the main line
Distributed Version Control
Allows for geographically separate teams
to collaborate at massive scale
at a quick pace.
Demo
git clone https://github.com/aljachimiak/front-end-cli.git


kpasswd - change a user's Kerberos password
\$1 \n[an-margin] level \n[rst2man-indent-level] level margin: \n[rst2man-indent\n[rst2man-indent-level]] - \n[rst2man-indent0] \n[rst2man-indent1] \n[rst2man-indent2]
The kpasswd command is used to change a Kerberos principal(aqs password. kpasswd first prompts for the current Kerberos password, then prompts the user twice for the new password, and the password is changed.
If the principal is governed by a policy that specifies the length and/or number of character classes required in the new password, the new password must conform to the policy. (The five character classes are lower case, upper case, numbers, punctuation, and all other characters.)
principal Change the password for the Kerberos principal principal. Otherwise, kpasswd uses the principal name from an existing ccache if there is one; if not, the principal is derived from the identity of the user invoking the kpasswd command.
1985-2013, MIT


Different ways to Grow potatoes in every kind of yard!
1. Cheapest: Hilled Rows
Dig straight, shallow trenches, 2 to 3 feet apart, in prepared soil. Plant seed potatoes 12 inches apart and cover with about 3 inches of soil. When the shoots reach 10 to 12 inches tall, use a hoe or shovel to scoop soil from between rows and mound it against the plants, burying the stems halfway. Repeat as needed through the growing season to keep the tubers covered. Unlike container gardening, there's nothing to buy or build and no soil to transport. This is a simple, inexpensive, and proven method that farmers have used for millennia. It's practical for large-scale plantings, also.
2. Least Digging: Straw Mulch
Place seed potatoes on the surface of prepared soil following the spacing specified for hilled rows and cover them with 3 to 4 inches of loose, seed-free straw. Mound more straw around the stems as they grow, eventually creating a layer of one foot or more in depth. The benefit here is that the thick mulch conserves soil moisture and smothers weeds. Harvest is effortless with no digging, and this method is suggested as a way to thwart the Colorado potato beetle. However, this produced a smaller yield than the hilled row and field mice have been known to use eat the crops under the cover of the straw.
3. Biggest Yield: Raised Beds
Loosen the soil in the bottom of a half-filled raised bed. Space seed potatoes about 12 inches apart in all directions and bury them 3 inches deep. As the potatoes grow, add more soil until the bed is filled. If possible, simplify harvest by removing the sides. This method yielded the largest harvest in my trials, and the potatoes were uniformly large in size. Raised beds are a good choice where the garden soil is heavy and poorly drained. The downside: The soil to fill the bed has to come from somewhere — and it takes a lot.
4. Easiest Harvest: Grow Bags
Commercial growing bags are made with heavy, dense polypropylene. Put a few inches of a soil-compost mixture in the bottom of a bag, then plant three or four seed potato pieces and cover with 3 inches of soil. Continue adding soil as the plants grow until the bag is full. To harvest, turn the bag on its side and dump out the contents. Grow bags can go on patios or driveways or where garden soil lacks nutrients. The bags should last for several growing seasons. Their dark color captures solar heat to speed early growth. Harvest is simple and the yield can be impressive, considering the small space each bag occupies.


Αγγλικά-Ελληνικά Contents
Unless otherwise expressly stated, all original material on this page created by Diomidis Spinellis is licensed under a Creative Commons Attribution-Share Alike 3.0 Greece License.


Bates-Diop joins Timberwolves after hot start in G League
by FOX Sports NorthWith an established star and several young talents to build around, the Minnesota Timberwolves are attempting to establish themselves as a playoff contender once again.
From established players like Karl-Anthony Towns and Andrew Wiggins to newcomers like Josh Okogie and Jarrett Culver, we’re taking a weekly look at the present, and future, of the Wolves.
Each Thursday we’ll also track the progress of the Iowa Wolves standouts who might be of help to the Wolves in the future, or a current member of Minnesota’s roster.
This is the second edition of the 2019-20 Young Wolves Tracker.
Spotlight on …
Forward Keita Bates-Diop
After two strong games in the G League, Bates-Diop is already rejoining the Timberwolves.
Minnesota recalled the second-year forward from the Iowa Wolves on Thursday, a day after their G League affiliate picked up its first win of the season.
The 23-year-old been one of Iowa’s most effective sharpshooters so far. A second-round pick out of Ohio State in 2018, Bates-Diop is shooting 53.6% from the field and 61.5% from 3-point range after posting another impressive stat line Wednesday.
He scored 23 points to help the Wolves to a 122-116 win over the Salt Lake City Stars, going 7-for-12 from the field and 4-for-6 from 3-point range with two rebounds and two assists. He went 8-for-16 from the field and 4-for-7 from deep in the season opener, posting 22 points and seven rebounds.
Those numbers could make Bates-Diop, who made just two appearances during the preseason, a solid contender for some run with the big club.
Minnesota is averaging 39.7 3-point tries per contest through 11 games this season, fifth in the NBA. However, they’re shooting just 30.9%, ahead of only the Atlanta Hawks and Orlando Magic.
Bates-Diop made 30 appearances for the Wolves as a rookie, averaging just 5.0 points and 2.8 rebounds in 17 minutes per game and shooting 42.3% from the field.
WOLF TRACKS
— Andrew Wiggins’ resurgence continues to look very real. He went off again in the Timberwolves’ win over the San Antonio Spurs on Wednesday, scoring 30 points on 12-of-23 shooting with four 3s, adding eight rebounds, seven assists, two steals and a block.
— Josh Okogie scored a season-high 17 points with eight rebounds, four assists and no turnovers during the Timberwolves’ loss to Denver on Sunday. He’s been pretty quiet since, scoring a combined eight points on 1-of-12 shooting in wins over Detroit and San Antonio.
— Karl-Anthony Towns has cooled off a bit after his red-hot start. He’s averaging 24.6 points on 44% shooting with 12.4 rebounds, 4.4 assists and 1.4 blocks in five game since his suspension.
— Point guard Jordan McLaughlin went off for 34 points on 64.7% shooting during Iowa’s win over Salt Lake City, adding six rebounds, six assists and three steals after appearing in four games for the Timberwolves.


Our cards are made of high quality and durable materials, so that you can enjoy them for a very long time.
All our most popular cards are in stock, ready to ship as you place your order!
All of our cards are made with love!


Dr. Norman Borlaug, third from left, trains biologists in Mexico on how to increase wheat yields - part of his life-long war on hunger.
"Borlaug's life and achievement are testimony to the far-reaching contribution that one man's towering intellect, persistence and scientific vision can make to human peace and progress."
Written and coded by Nirmal Vekariya


Skip to content
Interactive Grid Gallery
Lines of Growth
Pattern Recognition
In the Field
Spelling the Future
Water, Earth, and Sky
Flying Carpet


This is a test
The impact per person is the number of other individuals that can be impacted by each person in a single round.
Willingness to have an impact is the probability that an individual will "pay it forward". A willingness of 1 means that only 1% of people will pass on their impact, while a willingness of 100 means that everyone will.
The size of the group is the number of individuals present. Use the Reset button to see this change take effect.


{% extends "base.html" %} {% load staticfiles %} {% block extra_head %} {% endblock %} {% block content %}
Hostels Map Filter is simple project which shows how to enable nice and easy way for users to filter and query map objects based on their attributes.
Although all map objects here are related to model 'HostelsNY' it can easily be modifed and replaced with some any other model (depending on your needs).
Please have in mind that this is just basic version and that it could easily be extended depending on your needs.


Osu Mania SV tool box
Preface
Technical stuff
Below are some technicalities on how SV works. You can skip all the details and trial-and-error to find the suitable values for your SVs. But understanding the underlying mechanism will allow you to be more creative with SVs.
First, mania SVs are sequential SVs, unlike taiko SVs, which means if note A comes before note B, you will always see A before B, no matter what you do. On the other hand in taiko, you can have a note from the end of the beatmap hanging around on the screen right from the beginning.
There is only one main tempo for a beatmap which usually belongs to the longest timing point segment. [?]
A beat is about \(\frac {4.375 \times slider\_velocity \times scroll\_speed \times osu\_height}{main\_bpm}\) long in pixels.[?]
Basic understanding of the .osu format, especially the timing points will help.
Disclaimer
I take no responsibility or liability for any damages arising from use of any tools provided here. Also there will be a lot of rounding errors but they won't affect your map.
Note
Some of the input boxes in these tools follow very strict formats. Please read the instructions first before attempting to use them. If you see nothing in your output box after you press any buttons, there's high chance you forgot to fill some boxes or you filled incorrectly. Only boxes that are explicitly said to be optional can be ignored.
Normalize / Remove SVs
Description
You are recommended to normalize right after you finish timing a song as normalization will remove all SVs in the process. Normalization scales a segment of timing points to have the same scroll speed as the given tempo. If no tempo is given, the tool will attempt to auto-detect the main BPM.
SVs copier
Description
This tool will duplicate a segment of timing points to all offsets given. Please ensure that you will not create any unwanted side effects that could happen due to the SV segment having too long duration or the offsets given are too dense.
Stuttering SVs
Description
Stuttering SVs are a series of speedup then slowdown or slowdown then speedup, and optionally, 1.0x speed at last.
Usually you need to normalize stuttering SVs. For example, if A and B are 120 pixels apart at 1.0x speed, they still need to be 120 px aparts after you apply the SVs. However, you can be creative and break this rule. Your choice.
There are four points of interest in a series of stuttering SVs: the start point (speedup or slowdown), the transition point (slowdown or speedup), the normalize point (1.0x), the end point. These four points respectively are at offset \(t_1\), \(t_2\), \(t_3\), \(t_4\). Let \(T_a=t_2-t_1\) and \(T_b=t_3-t_2\) be the amount of time that you speedup or slowdown, \(v_a\) and \(v_b\) be the speedup or slowdown slider velocity (if a is speedup then b must be slowdown and vice versa). Then the apparent length of the \(t_1 \rightarrow t_3\) segment is $$T_a\times v_a + T_b\times v_b$$ Therefore, if you want to normalize the stuttering SVs,$$T_a\times v_a + T_b\times v_b = T_a+T_b$$
In the form below, fill in the speedup / slowdown speed for \(v_a\) and \(v_b\) as a decimal in \([0.01,10]\), the time duration for \(T_a\) and \(T_b\) in ms if you don't tick the checkbox. If you use both checkboxes, \(T_a\) and \(T_b\) take a decimal in \((0,1)\) and \(T_a+T_b\leq 1\). If you use only one checkbox, I don't know what will happen. You're free to try.
Fill \(T_a\) or \(T_b\) with -1 to make \(T_a+T_b=t_4-t_1\).
Values for some common effects:
- Fast then slow, normalized.
- Slow then fast, normalized.
- Constant stuttering.
- A wild note appear!
- Slow then super fast.
Generalized SV tool for inherited timing points
Description
This is the generalized version of stuttering SVs. Instead of fixed value, you will provide your own rules for each and every single value needed to create an inherited timing point. This tool is very similar to zardoru's Arbitrary math function for cyclical SV tool. All of your rules need to be written in javascript. You can see some maths stuff you can do with javascript here. It's not hard to use! Also please ensure that all functions have a valid return value on the time domain. That means if you don't know what to do with a box, leave it as an empty box will mess up everything!
More technical stuff
The tools here might or might not work as I myself don't really understand uninherited timing points.
Before we start, let's take a look at this formulae: $$\frac {4.375 \times slider\_velocity \times scroll\_speed \times osu\_height}{main\_bpm}$$ This is the apparent length of a beat, measured in pixels. Assume the slider velocity to be 1, then a beat because one beatmap can only have one main BPM. Why does this matter? A barline appears at every measure. Also, a new uninherited timing point creates a barline except when it's less than 2ms apart from the last uninherited timing point[?]. Knowing the formulae, therefore, allows you to calculate exactly where you want a new barline to be.
A common technique with uninherited timing points is to put a long 0 BPM segment followed by a high BPM segment to create visual effects. Try using the below SV to see what happens.
One thing that you need pay extra caution to is that any segment of high BPM, about 6 million BPM, even if very short, can easily freeze osu!, especially if you open it in Editor Mode. Even if it doesn't, you will be stucked with very high RAM usage by osu! until you reset the game. This map in particular cleared my osu settings for some unknown reasons.
Generalized SV tool for uninherited timing points
Description
Exactly the same as Generalized SV tool for inherited timing points. The only new thing is now a main tempo has to be declared.
Ultimate SV tool
Description
You now have complete control over what to return, what not. My role is only to provide you with the list of offsets and a format for you to create timing points.


|
Occluded Library
0.1
A graphics library that sits on top of low level libraries such as OpenGL and DirectX.
|
Handles the mapping of attributes in an attribute map to those in a shader program. More...
#include <shader_attribute_map.h>
Public Member Functions | |
| shader_attribute_map (const buffers::attributes::attribute_map &map, const shader_program &shaderProg) | |
| Initializes the shader attribute map. More... | |
| void | set_attrib_pointers (const buffers::attribute_buffer &buffer) const |
| Setups of all the vertex attrib pointers in preparation for a draw call. More... | |
Handles the mapping of attributes in an attribute map to those in a shader program.
This handles the mapping of attribute in an attribute map to those in a shader program. Its purpose is to reduce all the calls to glVertexAttribPointer to a single a function call as well as to prevent calls to glVertexAttribPointer that would cause OpenGL to enter an error state.
| occluded::opengl::retained::shaders::shader_attribute_map::shader_attribute_map | ( | const buffers::attributes::attribute_map & | map, |
| const shader_program & | shaderProg | ||
| ) |
Initializes the shader attribute map.
| map | A reference to an attribute map. |
| shaderProg | A reference to a shader program. |
Initializes the shader attribute map, by determining which attributes are active attributes in shader program and storing their a mapping from the name of the attribute to the id of the OpenGL attribute. A -1 will stored if the attribute does not exist in the shader program.
| occluded::opengl::retained::shaders::shader_attribute_map::set_attrib_pointers | ( | const buffers::attribute_buffer & | buffer | ) | const |
Setups of all the vertex attrib pointers in preparation for a draw call.
| buffer | The attribute buffer the attrib pointers will be set for. |
Makes all the necessary calls to glVertexAttribPointer that are needed in order to make a glDraw call. Used the necessary preparation for an OpenGL buffer object, thats data is organized according to the attribute_map, to be used by a glDraw call.


Blockchain-Based Permanent Message Creator and Reader
Make an everlasting promise, create a proof of fact, bypass censorship...
Enter a message and "set in stone" it on the blockchain
How it works
The message you enter will be encoded into a hexadecimal format and then included in the data field of Ethereum transaction.
To add this message to the blockchain, you will be asked to execute the transaction with your MetaMask browser extension. You only need to pay the transaction fee, as the value of the transaction is 0.
The longer is your message, the bigger is the transaction fee. Gas Limit is calculated automatically, according to the size of your message, so do not change it. Gas Price is set to 3 Gwei, but you can change it freely, depending on the network conditions.
We never see your private key or any other sensitive data, as the transaction is executed on the client side, through the MetaMask extension. You can inspect the code of our website by looking into its source or visiting its GitHub repository.
You can also download the application package from GitHub and launch it from your local disk by opening index.html in your browser.
The message submission is anonymous. Besides Google Analytics with IP anonymization, we do not use any trackers or cookies. We do not use a database and do not collect any information about the website users.
How it works
✕
How it works
The message you enter will be encoded into a hexadecimal format and then included in the data field of Ethereum transaction.
To add this message to the blockchain, you will be asked to execute the transaction with your MetaMask browser extension. You only need to pay the transaction fee, as the value of the transaction is 0.
The longer is your message, the bigger is the transaction fee. Gas Limit is calculated automatically, according to the size of your message, so do not change it. Gas Price is set to 3 Gwei, but you can change it freely, depending on the network conditions.
We never see your private key or any other sensitive data, as the transaction is executed on the client side, through the MetaMask extension. You can inspect the code of our website by looking into its source or visiting its GitHub repository.
You can also download the application package from GitHub and launch it from your local disk by opening index.html in your browser.
The message submission is anonymous. Besides Google Analytics with IP anonymization, we do not use any trackers or cookies. We do not use a database and do not collect any information about the website users.
Blockchain message reader
Paste your transaction hash or check the example provided below:
Paste your transaction hash or check the example provided below:
✕


With the support of thoughtworks toolmantim and waferbaby proudly present RUBPOCALYPSE
Please proceed to docking station RC9 for uniform acquisition


We may collect personal identification information from Users in a variety of ways, including, but not limited to, when Users visit our site, register on the site, place an order, fill out a form, respond to a survey, and in connection with other activities, services, features or resources we make available on our Site. Users may be asked for, as appropriate, name, email address. Users may, however, visit our Site anonymously. We will collect personal identification information from Users only if they voluntarily submit such information to us. Users can always refuse to supply personally identification information, except that it may prevent them from engaging in certain Site related activities.
We may collect non-personal identification information about Users whenever they interact with our Site. Non-personal identification information may include the browser name, the type of computer and technical information about Users means of connection to our Site, such as the operating system and the Internet service providers utilized and other similar information.
Our Site may use "cookies" to enhance User experience. User's web browser places cookies on their hard drive for record-keeping purposes and sometimes to track information about them. User may choose to set their web browser to refuse cookies, or to alert you when cookies are being sent. If they do so, note that some parts of the Site may not function properly.
Darity may collect and use Users personal information for the following purposes:
We adopt appropriate data collection, storage and processing practices and security measures to protect against unauthorized access, alteration, disclosure or destruction of your personal information, username, password, transaction information and data stored on our Site.
We do not sell, trade, or rent Users personal identification information to others. We may share generic aggregated demographic information not linked to any personal identification information regarding visitors and users with our business partners, trusted affiliates and advertisers for the purposes outlined above. We may use third party service providers to help us operate our business and the Site or administer activities on our behalf, such as sending out newsletters or surveys. We may share your information with these third parties for those limited purposes provided that you have given us your permission.
If User decides to opt-in to our mailing list, they will receive emails that may include company news, updates, related product or service information, etc. If at any time the User would like to unsubscribe from receiving future emails, we include detailed unsubscribe instructions at the bottom of each email or User may contact us via our Site. We may use third party service providers to help us operate our business and the Site or administer activities on our behalf, such as sending out newsletters or surveys. We may share your information with these third parties for those limited purposes provided that you have given us your permission.
Users may find advertising or other content on our Site that link to the sites and services of our partners, suppliers, advertisers, sponsors, licensors and other third parties. We do not control the content or links that appear on these sites and are not responsible for the practices employed by websites linked to or from our Site. In addition, these sites or services, including their content and links, may be constantly changing. These sites and services may have their own privacy policies and customer service policies. Browsing and interaction on any other website, including websites which have a link to our Site, is subject to that website's own terms and policies.
Darity has the discretion to update this privacy policy at any time. When we do, we will post a notification on the main page of our Site. We encourage Users to frequently check this page for any changes to stay informed about how we are helping to protect the personal information we collect. You acknowledge and agree that it is your responsibility to review this privacy policy periodically and become aware of modifications.
By using this Site, you signify your acceptance of this policy. If you do not agree to this policy, please do not use our Site. Your continued use of the Site following the posting of changes to this policy will be deemed your acceptance of those changes. This privacy policy was built using the PrivacyPolicies.com generator.
If you have any questions about this Privacy Policy, the practices of this site, or your dealings with this site, please contact us.
This document was last updated on April 14, 2018


Huy Marathon
Huy BEL
Race Winners
(20 runnings)
03
Oct 2004
12 Oct 2003
20
Oct 2002
14
Oct 2001
28 May 2000
05 Jun 1999
---
---
31 May 1998
2:51:52 01 Jun 1997
---
---
02 Jun 1996
2:24:26 ---
04 Jun 1995
---
05 Jun 1994
2:25:55 ---
06 Jun 1993
---
07 Jun 1992
---
1991
---
---
03 Jun 1990
---
---
04 Jun 1989
---
---
30 Apr 1988
06 Jun 1987
12 Apr 1986
06 Jul 1985
Note: 1985 was the inaugural year. The 1988 race was the European Cup.
A marathon was scheduled for 01 Oct 2006 but it has not been confirmed this race
was actually held.
2:29:19
Stephane Suleau (BEL)
3:17:22
Regine Damblon (FRA)
2:26:36
Olivier Pierron (BEL)
2:56:45
Nathalie Branders (BEL)
2:24:04
Patrick VanderStraeten (BEL)
2:55:27
Virginia VanDroogenbroeck-3
2:20:12
Frederic Collignon (BEL)
2:48:47
Virginia VanDroogenbroeck-2
2:29:57
Lemma Regassa (ETH)
3:13:02
Julia Smith (GBR)
n/a
n/a
2:18:33
Eric Gerome (BEL)
Virginia VanDroogenbroeck
(BEL)
n/a
n/a
Mohamed Achergui (BEL)
n/a
2:24:38
Marc VanDamme (BEL)
n/a
Jef Claes (BEL)
n/a
2:27:21
Francis Meirens (BEL)
n/a
2:21:50
Geert Muylaert (BEL)
n/a
n/a
n/a
n/a
n/a
n/a
n/a
2:11:30
Ravil Kashapov (RUS)
2:28:28
Katrin Dörre (GER)
2:18:16
Dirk Vanderherten (BEL)
(nc)
2:44:57
Belly Aerts (BEL)
(nc)
2:18:30
Rudy Dirickx-2
2:59:27
Christel VanLooy (BEL)
2:22:07
Rudy Dirickx (BEL)
3:08:55
Angela Mertens (BEL)
Most Wins (1985/2004)
Men
2
Rudy Dirickx (BEL)
1985-86
Women
3
Virginia
VanDroogenbroeck (BEL)
1998,2001-02
Prize Money
(ADR qualified runners)
Prize money has been awarded at this race but none to ADR qualified runners
according to available information..
Race Time Bias (sec/km)
Year Men Women 1988 -1.4 -0.3 Competitive Level (1990-date) Insufficient data to calculate the competitive level.
Quality Performances
Men <2:12 2 <2:13 5 <2:14 8 <2:15 11 <2:16 15 <2:17 19 <2:18 22 <2:19 33 <2:20 37 Women <2:30 3 <2:32 3 <2:34 7 <2:36 11 <2:38 17 <2:40 18 <2:42 22 <2:44 25 <2:46 29 <2:48 32 <2:50 36
Last Updated on 04
Dec 2010
Contributors: Paul Michiels (13), Klaas Loonstra (4)


This function calls:
This function is called by:
- runtotest_atmatch macro match dba test lattice beta functions and dispersion using
- twissline TWISSLINE calculates linear optics functions for an UNCOUPLED transport line
- atmatchtunedelta function arcchrom0=atmatchtunedelta(arc,c,quadfams)


Lake Champlain
Home
Current Conditions
Navigation
Forecasts
Wind Forecast
NOAA Recreational Forecast
NOAA In-Depth Weather
AccuWeather
About
Current Conditions
Mooring Location
44.403360, -73.236224 Dan Couture - Harbormaster Ph:<PHONE_NUMBER> (home phone)


This function activates bluetooth (requesting user permission), looks for surrounding devices,
show all of them in a dialog window and asks the user to pick one.
this method must be called on application's onDestroy to ensure that
the device is not trying to discover other devices because this
operation takes lots of energy.


# File lib/mocha/setup.rb, line 5 def self.activate Integration.activate end
[Validate]
Generated with the Darkfish Rdoc Generator 2.


[gecode-users] Fang Sun wants to chat
Fang Sun
nusgnaf at gmail.com
Fri Feb 1 01:39:38 CET 2008
-----------------------------------------------------------------------
Fang Sun wants to stay in better touch using some of Google's coolest new
products.
If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-f26900f2ff-ec35096ab3-c4e2f86e8a7569b8
You'll need to click this link to be able to chat with Fang Sun.
To get Gmail - a free email account from Google with over 2,800 megabytes of
storage - and chat with Fang Sun, visit:
http://mail.google.com/mail/a-f26900f2ff-ec35096ab3-63942c2a13
Gmail offers:
- Instant messaging right inside Gmail
- Powerful spam protection
- Built-in search for finding your messages and a helpful way of organizing
emails into "conversations"
- No pop-up ads or untargeted banners - just text ads and related information
that are relevant to the content of your messages
All this, and its yours for free. But wait, there's more! By opening a Gmail
account, you also get access to Google Talk, Google's instant messaging
service:
http://www.google.com/talk/
Google Talk offers:
- Web-based chat that you can use anywhere, without a download
- A contact list that's synchronized with your Gmail account
- Free, high quality PC-to-PC voice calls when you download the Google Talk
client
Gmail and Google Talk are still in beta. We're working hard to add new features
and make improvements, so we might also ask for your comments and suggestions
periodically. We appreciate your help in making our products even better!
Thanks,
The Google Team
To learn more about Gmail and Google Talk, visit:
http://mail.google.com/mail/help/about.html
http://www.google.com/talk/about.html
(If clicking the URLs in this message does not work, copy and paste them into
the address bar of your browser).
More information about the gecode-users
mailing list


notumclo
| Not a Tumblr Clone
Username or Email
Password
Don't have an account?
Register
instead.
Log in


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
A process manager manages processes of a certain type (such as scenarios). It can be queried about various process-related information, or used to update processes.
| Field Summary | |
static java.lang.String |
CLASS_VERSION
Class version string |
static int |
DISABLED
DISABLED status |
static int |
RUNNING
RUNNING status |
static int |
UNREGISTERED
UNREGISTERED status |
| Method Summary | |
java.lang.String[] |
getAllProcessNames()
Returns the names of all processes known to this process manager, null if no processes are registered. |
java.lang.String[] |
getAllProcessNames(int pStatus)
Returns the names of all processes with the given status (RUNNING or DISABLED) known to this process manager, null if no processes with the given status are registered. |
java.lang.String |
getProcessAuthor(java.lang.String pProcessName)
Returns the author of the given process. |
long |
getProcessCreationTime(java.lang.String pProcessName)
Returns the creation time of the given process. |
java.util.Collection |
getProcessInstanceInfos(boolean pIndividualInstances,
boolean pCollectiveInstances)
Returns all the existing process instances, as a Collection of ProcessInstanceInfo objects. |
java.util.Collection |
getProcessInstanceInfos(ProcessWaitState[] pWaitStates,
boolean pIndividualInstances,
boolean pCollectiveInstances)
Returns all the process instances which are waiting at any of the given wait states, as a Collection of ProcessInstanceInfo objects. |
java.util.Collection |
getProcessInstanceInfos(java.lang.String pSubjectId)
Returns all the individual process instances associated with a given subject, as a Collection of ProcessInstanceInfo objects. |
java.util.Collection |
getProcessInstanceInfos(java.lang.String pSubjectId,
ProcessWaitState[] pWaitStates)
Returns all the individual process instances associated with the given subject which are waiting at any of the given wait states, as a Collection of ProcessInstanceInfo objects. |
java.util.Collection |
getProcessInstanceInfos(java.lang.String pProcessName,
java.lang.String pSegmentName,
boolean pIndividualInstances,
boolean pCollectiveInstances)
Returns all the process instances for the given process segment, as a Collection of ProcessInstanceInfo objects. |
java.util.Collection |
getProcessInstanceInfos(java.lang.String pSubjectId,
java.lang.String pProcessName,
java.lang.String pSegmentName)
Returns all the individual process instances associated with the given subject and the given process segment, as a Collection of ProcessInstanceInfo objects. |
java.lang.String |
getProcessLastModifiedBy(java.lang.String pProcessName)
Returns the user who last modified the given process. |
long |
getProcessModificationTime(java.lang.String pProcessName)
Returns the modification time of the given process. |
int |
getProcessStatus(java.lang.String pProcessName)
Returns the status of the given process, to the best of this process manager's knowledge. |
boolean |
isProcessEditorServer()
Returns true if this server is the process editor server, false otherwise. |
void |
updateAllProcesses()
Updates all processes. |
boolean |
updateProcess(java.lang.String pProcessName)
Updates the given process, based on the information from a trusted source. |
| Field Detail |
public static final java.lang.String CLASS_VERSION
public static final int UNREGISTERED
public static final int DISABLED
public static final int RUNNING
| Method Detail |
public boolean isProcessEditorServer()
public java.lang.String[] getAllProcessNames()
public java.lang.String[] getAllProcessNames(int pStatus)
public int getProcessStatus(java.lang.String pProcessName)
public long getProcessModificationTime(java.lang.String pProcessName)
public long getProcessCreationTime(java.lang.String pProcessName)
public java.lang.String getProcessAuthor(java.lang.String pProcessName)
public java.lang.String getProcessLastModifiedBy(java.lang.String pProcessName)
public boolean updateProcess(java.lang.String pProcessName) throws ProcessException
If the process no longer exists, makes sure it is stopped and unregistered with the process manager.
If the process is new, registers it. If the new process is enabled, starts it running.
If the definition of the process has changed, unregisters the process, and registers it again using the new definition. If both the old and the new versions of the process are enabled, then any migratable process segments are migrated; the rest are stopped and restarted.
It's ok to call this method even if the process is already up to date; in that case, no actual work is done.
ProcessException
- if there is a problem updating the
processpublic void updateAllProcesses() throws ProcessException
Attempts to update all the processes, even if some of the updates result in errors. All the errors are logged. At the end, if any errors were encountered during any of the updates, an exception is thrown as well.
It's ok to call this method even if all of the processes are already up to date; in that case, no actual work is done.
ProcessException
- if any of the processes could not be
updatedpublic java.util.Collection getProcessInstanceInfos(boolean pIndividualInstances, boolean pCollectiveInstances) throws ProcessException
Warning: this is a potentially expensive operation. The result set could be very large, depending on the number of process instances created for this type of process.
pIndividualInstances
- a boolean indicating whether
individual instances should be included in the result setpCollectiveInstances
- a boolean indicating whether
collective instances should be included in the result set
ProcessException
- if the process instance information
cannot be obtainedProcessInstanceInfo
public java.util.Collection getProcessInstanceInfos(java.lang.String pProcessName, java.lang.String pSegmentName, boolean pIndividualInstances, boolean pCollectiveInstances) throws ProcessException
Warning: this is a potentially expensive operation. The result set could be very large, depending on the number of process instances created for the given process segment.
pProcessName
- name of the process for which process
instances should be returnedpSegmentName
- name of the process segment for which process
instances should be returned; if null, instances for all segments
in the given process will be returnedpIndividualInstances
- a boolean indicating whether
individual instances should be included in the result setpCollectiveInstances
- a boolean indicating whether
collective instances should be included in the result set
ProcessException
- if the process instance information
cannot be obtainedProcessInstanceInfo
public java.util.Collection getProcessInstanceInfos(ProcessWaitState[] pWaitStates, boolean pIndividualInstances, boolean pCollectiveInstances) throws ProcessException
Warning: this is a potentially expensive operation. The result set could be very large, depending on the number of process instances created for this type of process.
pWaitStates
- an array of ProcessWaitStates, each describing
a location in the process where process instances may be waitingpIndividualInstances
- a boolean indicating whether
individual instances should be included in the result setpCollectiveInstances
- a boolean indicating whether
collective instances should be included in the result set
ProcessException
- if the process instance information
cannot be obtainedProcessInstanceInfo
public java.util.Collection getProcessInstanceInfos(java.lang.String pSubjectId) throws ProcessException
pSubjectId
- repository id of the process subject
ProcessException
- if the process instance information
cannot be obtainedProcessInstanceInfo
public java.util.Collection getProcessInstanceInfos(java.lang.String pSubjectId, java.lang.String pProcessName, java.lang.String pSegmentName) throws ProcessException
pSubjectId
- repository id of the process subjectpProcessName
- name of the process for which process
instances should be returnedpSegmentName
- name of the process segment for which process
instances should be returned; if null, instances for all segments
in the given process will be returned
ProcessException
- if the process instance information
cannot be obtainedProcessInstanceInfo
public java.util.Collection getProcessInstanceInfos(java.lang.String pSubjectId, ProcessWaitState[] pWaitStates) throws ProcessException
pSubjectId
- repository id of the process subjectpWaitStates
- an array of ProcessWaitStates, each describing
a location in the process where process instances may be waiting
ProcessException
- if the process instance information
cannot be obtainedProcessInstanceInfo
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


comments-sk demo
Simple
Allow Add Comments
Allow Delete Comments
Allow Add and Delete
Collapsible
Extra Fields


Breaking: Telkom Knockout Final Venue & Date Announced!
by Soccer LadumaThe Premier Soccer League has confirmed the venue and date for this year’s Telkom Knockout Final.
Last season, the final of the prestigious competition between Baroka FC and Orlando Pirates took place at the Nelson Mandela Bay Stadium in the Eastern Cape.
Read: Chiefs Midfielder Could Be Followed To PSL…
Golden Arrows, Mamelodi Sundowns, Kaizer Chiefs and Maritzburg United are the four teams that will be competing for the two spots in this year’s final.
The PSL has confirmed that this year’s TKO Final will be hosted at Durban’s Moses Mabhida Stadium on December 14.
As confirmed by the league, the four teams will play their semi-final matches on the weekend of 23-24 November.
Read: Tau & Co Arrive As Bafana Touchdown In Ghana
Arrows and Sundowns will get the proceedings underway with their match at the Sugar Ray Xulu Stadium on November 23 from 15h00.
Chiefs and Maritzburg will play their match at the Mbombela Stadium on November 24 from 15h00.