Elements that are linked to the name in the original treatment of a taxon as designated by the authors of the respective original publication. ~ ~
( #PCDATA | object-id | tp:taxon-authority-part )*
This can be anything from a single author to a whole string including author, year, publication page, etc.. Formica rufa L. or Formica rufa Linnaeus 1758:580 ~ ~~
May Contain:


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
1 IN THE HIGH COURT OF KARNATAKA AT BANGALORE DATED THIS THE 23RD DAY OF JULY 2013 PRESENT THE HON'BLE MR.D.H.WAGHELA, CHIEF JUSTICE AND THE HON'BLE MR.JUSTICE A.S.BOPANNA WRIT PETITION NO.8106/2013 & WRIT PETITION NOS.8272-8274/2013(GM-POL) BETWEEN SRI SAI SAPTAGIRI SPONGE PVT. LTD., HAVING REGISTERED OFFICE AT SY.NO.83/A TUMTI ROAD, BELAGAL VILLAGE BELLARY DISTRICT - 583115 REP BY ITS DIRECTOR SMT. P. SAILEELA ... PETITIONER (BY SRI ASHOK HARANAHALLI, SENIOR COUNSEL FOR SRI B L ACHARYA, ADV.,) AND 1. STATE OF KARNATAKA DEPARTMENT OF FOREST, ECOLOGY & ENVIRONMENT, M.S. BUILDING BANGALORE-560001 REP BY SECRETARY 2. KARNATAKA STATE POLLUTION CONTROL BOARD, PARISARA BHAVAN, NO.49 CHURCH STREET, BANGALORE-560001 REP BY ITS MEMBER SECRETARY ... RESPONDENTS (BY SRI R G KOLLE, AGA FOR R-1; SRI D NAGARAJ, ADV., FOR R-2) 2 THESE WRIT PETITIONS ARE FILED UNDER ARTICLES 226 AND 227 OF THE CONSTITUTION OF INDIA PRAYING TO QUASH THE JUDGMENT PASSED BY THE APPELLATE AUTHORITY IN APPEAL NOS.16/12 C/W 17/12 C/W 42/12, C/W 43/12 DATED 30.01.2013 PRODUCED AT ANNEXURE-P AND ETC., THESE WRIT PETITIONS COMING ON FOR PRELIMINARY HEARING THIS DAY, CHIEF JUSTICE MADE THE FOLLOWING: ORDER
D.H.WAGHELA, CJ (Oral)
1. The petitioner has called into question judgment dated 30.01.2013 of the Appellate Authority under Water and Air (Prevention and Control of Pollution) Acts, 1974 and 1981, in Appeal Nos.16-17/2012 and 42-43/2012 and prayed for quashing the orders dated 02.07.2012 and 09.10.2012, refusing consent for operation of the petitioner's plant under the Water (Prevention and Control of Pollution) Act, 1974. When these orders refusing consent and directing the petitioner to close down its industrial operation and processes as also directing the electricity company to cut off power supply to the petitioner were carried in appeals before the Karnataka State Appellate Authority in the aforesaid appeals, the appellate authority was pleased to hold that Appeal No.16/2012 was not maintainable and the connected Appeal No.17/2012 3 could not survive for consideration, for the reason briefly recorded in the impugned judgment.
2. Having regard to the facts and circumstance and the futility of carrying the matter further, it was fairly submitted on behalf of the petitioner by learned senior advocate Mr.Ashok Haranahalli that the petitioner proposes to follow the positive and constructive course of applying afresh for necessary permission and consent under the provisions of the Water (Prevention and Control of Pollution) Act and the Air (Prevention and Control of Pollution) Act with fees and submission of necessary documents.
3. Responding to that, it was fairly stated at the bar on behalf of the Karnataka State Pollution Control Board by learned counsel Mr.D.Nagaraj that, if and when the proposed applications were made by the petitioner, they will be expeditiously processed in accordance with law, without being influenced by the orders impugned herein or before the Appellate Authority. He also stated that the consequential orders issued under Section 33A of the Water (Prevention and Control of Pollution) Act would not survive, if and when consent under the relevant Acts is 4 granted; and if such consent were granted, the pollution control board would itself issue direction to reconnect power supply to the petitioner for early commencement of production.
4. The petitioner having been satisfied with the recording of the above statements in this order, the petitions were not pressed for any further relief or decision on merits regarding the contentions contained in the petitions. Therefore, by consent, the petitions are disposed after recording the above observations and statements, with no order as to costs.
Sd/-
CHIEF JUSTICE Sd/-
JUDGE bkv


What would you like to do today?
This Application is written in JSP and Java Servlets.
MANAGE CUSTOMERS
MANAGE PRODUCTS
MANAGE ORDERS


0
-
0
Instructions
- Paint as many squares as you can in 30 seconds.
- Paint a square by moving over it.
- Player one moves with WASD.
- Player two moves with the arrow keys.
- Whoever has more squares at the end of 30 seconds wins.
- However, if you tag your opponent while they're intruding on your side, you win.
- Press space to begin, and to restart.


The gosset package provides the toolkit and a workflow to analyse metadata and experimental citizen science data, from collating data of different sources to model sellection and visualisation. The package is named after W.S. Gosset aka ‘Student’, a pioneer of modern statistics in small sample experimental design and analysis.
The development version can be installed via
library("devtools")
devtools::install_github("agrobioinfoservices/gosset", build_vignettes = TRUE)
The full functionality of gosset is illustrated in the package vignette. The vignette can be found on the package website or from within R
once the package has been installed, e.g. via
vignette("Overview", package = "gosset")
Please report any issues or bugs.
License: MIT
Get citation information for gosset in R by typing citation(package = "gosset")
.
You are welcome to contribute to the gosset project. Please read our contribution guide lines.
Please note that the gosset project is released with a Contributor Code of Conduct. By participating in the gosset project you agree to abide by its terms.


View and Download HONDA WH15X owner's manual online. WH15X Water Pump pdf manual download. Also for: Wh20x. Honda Wt20X Bedienungsanleitung.HONDA WH15X OWNER'S MANUAL Pdf Download.
Honda Wt20X Bedienungsanleitung and Konica minolta bizhub 3320 Handbücher.


MOVIE FLIX
Basic
$ 7.99
/MONTH
Watch on Laptop/Mobile
Free Cancellation
First Month Free
Screen Watchable at a time : 1
Unlimited access
Select
RECOMMENDED
Standard
$9.99
/MONTH
HD Available
Free Cancellation
First Month Free
Screen Watchable at a time : 2
Unlimited access
Select
Premium
$11.99
/MONTH
Ultra HD Available
Free Cancellation
First Month Free
Screen Watchable at a time : 3+
Unlimited access
Select
Sign up to begin Free Trial
Register
Sign In


Weighted object version of k-means algorithm, robust against outlier data.
| Version: | 1.1.0 |
| Depends: | R (≥ 3.0), fpc, clusterCrit |
| Published: | 2018-10-26 |
| Author: | Alexandre Gondeau [aut, cre] |
| Maintainer: | Alexandre Gondeau <alexandre.gondeau at gmail.com> |
| License: | GPL-3 |
| NeedsCompilation: | yes |
| CRAN checks: | RWeightedKmeans results |
| Reference manual: | RWeightedKmeans.pdf |
| Package source: | RWeightedKmeans_1.1.0.tar.gz |
| Windows binaries: | r-devel: RWeightedKmeans_1.1.0.zip, r-release: RWeightedKmeans_1.1.0.zip, r-oldrel: RWeightedKmeans_1.1.0.zip |
| OS X binaries: | r-release: RWeightedKmeans_1.1.0.tgz, r-oldrel: RWeightedKmeans_1.1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=RWeightedKmeans to link to this page.


Enter the amount of people in each photograph next to its image. Please answer carefully and thoughtfully, we appreciate your work! When you are done, click submit!


{% extends '_layouts/layout.html' %} {% block page_title %}{% endblock %} {% block body_css_classes %}nhs-redesign{% endblock %} {% block content %}
You may need urgent medical help because you answered “{% if session.disposition %}{{ session.disposition.answer }}{% else %}Yes{% endif %}” to this question:
{% if session.disposition %} {{ session.disposition.question }} {% if session.disposition.help !== '' %} {{ session.disposition.help }} {% endif %} {% else %} Do you have new spots or blotches that look like blood blisters or bleeding under the skin? This can be a sign of meningitis or sepsis. On light skin the marks won't fade if you press a glass on them. On dark skin it’s easier to see on paler areas like inside the mouth, on palms or soles. {% endif %}


|
| | ClassPruner (int max_classes) |
| |
| | ~ClassPruner () |
| |
| void | ComputeScores (const INT_TEMPLATES_STRUCT *int_templates, int num_features, const INT_FEATURE_STRUCT *features) |
| |
| void | AdjustForExpectedNumFeatures (const uint16_t *expected_num_features, int cutoff_strength) |
| |
| void | DisableDisabledClasses (const UNICHARSET &unicharset) |
| |
| void | DisableFragments (const UNICHARSET &unicharset) |
| |
| void | NormalizeForXheight (int norm_multiplier, const uint8_t *normalization_factors) |
| |
| void | NoNormalization () |
| |
| void | PruneAndSort (int pruning_factor, int keep_this, bool max_of_non_fragments, const UNICHARSET &unicharset) |
| |
| void | DebugMatch (const Classify &classify, const INT_TEMPLATES_STRUCT *int_templates, const INT_FEATURE_STRUCT *features) const |
| |
| void | SummarizeResult (const Classify &classify, const INT_TEMPLATES_STRUCT *int_templates, const uint16_t *expected_num_features, int norm_multiplier, const uint8_t *normalization_factors) const |
| |
| int | SetupResults (GenericVector< CP_RESULT_STRUCT > *results) const |
| |
Definition at line 146 of file intmatcher.cpp.
◆ ClassPruner()
| tesseract::ClassPruner::ClassPruner |
( |
int |
max_classes | ) |
|
|
inline |
Definition at line 148 of file intmatcher.cpp.
156 max_classes_ = max_classes;
159 class_count_ =
new int[rounded_classes_];
160 norm_count_ =
new int[rounded_classes_];
161 sort_key_ =
new int[rounded_classes_ + 1];
162 sort_index_ =
new int[rounded_classes_ + 1];
163 for (
int i = 0; i < rounded_classes_; i++) {
166 pruning_threshold_ = 0;
◆ ~ClassPruner()
| tesseract::ClassPruner::~ClassPruner |
( |
| ) |
|
|
inline |
Definition at line 170 of file intmatcher.cpp.
172 delete []class_count_;
173 delete []norm_count_;
175 delete []sort_index_;
◆ AdjustForExpectedNumFeatures()
| void tesseract::ClassPruner::AdjustForExpectedNumFeatures |
( |
const uint16_t * |
expected_num_features, |
|
|
int |
cutoff_strength |
|
) |
| |
|
inline |
Adjusts the scores according to the number of expected features. Used in lieu of a constant bias, this penalizes classes that expect more features than there are present. Thus an actual c will score higher for c than e, even though almost all the features match e as well as c, because e expects more features to be present.
Definition at line 250 of file intmatcher.cpp.
253 for (
int class_id = 0; class_id < max_classes_; ++class_id) {
254 if (num_features_ < expected_num_features[class_id]) {
255 int deficit = expected_num_features[class_id] - num_features_;
256 class_count_[class_id] -= class_count_[class_id] * deficit /
257 (num_features_ * cutoff_strength + deficit);
◆ ComputeScores()
Computes the scores for every class in the character set, by summing the weights for each feature and stores the sums internally in class_count_.
Definition at line 179 of file intmatcher.cpp.
182 num_features_ = num_features;
184 for (
int f = 0; f < num_features; ++f) {
193 for (
int pruner_set = 0; pruner_set < num_pruners; ++pruner_set) {
196 const uint32_t* pruner_word_ptr =
199 uint32_t pruner_word = *pruner_word_ptr++;
◆ DebugMatch()
Prints debug info on the class pruner matches for the pruned classes only.
Definition at line 339 of file intmatcher.cpp.
344 int max_num_classes = int_templates->
NumClasses;
345 for (
int f = 0; f < num_features_; ++f) {
347 tprintf(
"F=%3d(%d,%d,%d),", f, feature->
X, feature->
Y, feature->
Theta);
353 for (
int pruner_set = 0; pruner_set < num_pruners; ++pruner_set) {
356 const uint32_t* pruner_word_ptr =
359 uint32_t pruner_word = *pruner_word_ptr++;
360 for (
int word_class = 0; word_class < 16 &&
361 class_id < max_num_classes; ++word_class, ++class_id) {
362 if (norm_count_[class_id] >= pruning_threshold_) {
364 classify.ClassIDToDebugStr(int_templates,
365 class_id, 0).c_str(),
◆ DisableDisabledClasses()
| void tesseract::ClassPruner::DisableDisabledClasses |
( |
const UNICHARSET & |
unicharset | ) |
|
|
inline |
Zeros the scores for classes disabled in the unicharset. Implements the black-list to recognize a subset of the character set.
Definition at line 263 of file intmatcher.cpp.
265 for (
int class_id = 0; class_id < max_classes_; ++class_id) {
267 class_count_[class_id] = 0;
◆ DisableFragments()
| void tesseract::ClassPruner::DisableFragments |
( |
const UNICHARSET & |
unicharset | ) |
|
|
inline |
Zeros the scores of fragments.
Definition at line 271 of file intmatcher.cpp.
273 for (
int class_id = 0; class_id < max_classes_; ++class_id) {
277 class_count_[class_id] = 0;
◆ NoNormalization()
| void tesseract::ClassPruner::NoNormalization |
( |
| ) |
|
|
inline |
The nop normalization copies the class_count_ array to norm_count_.
Definition at line 294 of file intmatcher.cpp.
296 for (
int class_id = 0; class_id < max_classes_; class_id++) {
297 norm_count_[class_id] = class_count_[class_id];
◆ NormalizeForXheight()
| void tesseract::ClassPruner::NormalizeForXheight |
( |
int |
norm_multiplier, |
|
|
const uint8_t * |
normalization_factors |
|
) |
| |
|
inline |
Normalizes the counts for xheight, putting the normalized result in norm_count_. Applies a simple subtractive penalty for incorrect vertical position provided by the normalization_factors array, indexed by character class, and scaled by the norm_multiplier.
Definition at line 285 of file intmatcher.cpp.
288 for (
int class_id = 0; class_id < max_classes_; class_id++) {
289 norm_count_[class_id] = class_count_[class_id] -
290 ((norm_multiplier * normalization_factors[class_id]) >> 8);
◆ PruneAndSort()
| void tesseract::ClassPruner::PruneAndSort |
( |
int |
pruning_factor, |
|
|
int |
keep_this, |
|
|
bool |
max_of_non_fragments, |
|
|
const UNICHARSET & |
unicharset |
|
) |
| |
|
inline |
Prunes the classes using <the maximum count> * pruning_factor/256 as a threshold for keeping classes. If max_of_non_fragments, then ignore fragments in computing the maximum count.
Definition at line 303 of file intmatcher.cpp.
307 for (
int c = 0; c < max_classes_; ++c) {
308 if (norm_count_[c] > max_count &&
314 (!max_of_non_fragments || !unicharset.
get_fragment(c))) {
315 max_count = norm_count_[c];
319 pruning_threshold_ = (max_count * pruning_factor) >> 8;
321 if (pruning_threshold_ < 1)
322 pruning_threshold_ = 1;
324 for (
int class_id = 0; class_id < max_classes_; class_id++) {
325 if (norm_count_[class_id] >= pruning_threshold_ ||
326 class_id == keep_this) {
328 sort_index_[num_classes_] = class_id;
329 sort_key_[num_classes_] = norm_count_[class_id];
334 if (num_classes_ > 1)
335 HeapSort(num_classes_, sort_key_, sort_index_);
◆ SetupResults()
Copies the pruned, sorted classes into the output results and returns the number of classes.
Definition at line 399 of file intmatcher.cpp.
403 for (
int c = 0; c < num_classes_; ++c) {
404 (*results)[c].Class = sort_index_[num_classes_ - c];
405 (*results)[c].Rating = 1.0f - sort_key_[num_classes_ - c] /
◆ SummarizeResult()
| void tesseract::ClassPruner::SummarizeResult |
( |
const Classify & |
classify, |
|
|
const INT_TEMPLATES_STRUCT * |
int_templates, |
|
|
const uint16_t * |
expected_num_features, |
|
|
int |
norm_multiplier, |
|
|
const uint8_t * |
normalization_factors |
|
) |
| const |
|
inline |
Prints a summary of the pruner result.
Definition at line 376 of file intmatcher.cpp.
382 tprintf(
"CP:%d classes, %d features:\n", num_classes_, num_features_);
383 for (
int i = 0; i < num_classes_; ++i) {
384 int class_id = sort_index_[num_classes_ - i];
385 STRING class_string = classify.ClassIDToDebugStr(int_templates,
387 tprintf(
"%s:Initial=%d, E=%d, Xht-adj=%d, N=%d, Rat=%.2f\n",
388 class_string.
c_str(),
389 class_count_[class_id],
390 expected_num_features[class_id],
391 (norm_multiplier * normalization_factors[class_id]) >> 8,
392 sort_key_[num_classes_ - i],
393 100.0 - 100.0 * sort_key_[num_classes_ - i] /
The documentation for this class was generated from the following file:


Default Events
A tabs widget that doesn't let you continue until the first part is complete.
Part 1
Part 2
Check to complete this part.
You completed part 1


{% extends "form2/account_form.html" %} {% block formsize %} is-8 {% endblock %} {% block form %}
Please complete your profile before editing your team.
{{account.profile.adv_course}}


--- title: 'Conferences' date: "2019-04-11T00:00:00Z" lastmod: "2019-04-11T00:00:00Z" reading_time: false # Show estimated reading time? share: false # Show social sharing links? profile: false # Show author profile? comments: false # Show comments? ---
I’m always looking for opportunities to share my work and see what others are doing in my research fields - here’s a map of where I’ve been so far, and where I’ll be going.
If you’re interested in what I presented at these conferences, please feel free to contact me !


public class Message extends Part
| Modifier and Type | Class and Description |
|---|---|
static interface |
Message.RecipientType |
| Modifier and Type | Field and Description |
|---|---|
String |
subject
The subject of this message
|
String |
uidl |
protected Vector |
vFrom |
protected Vector[] |
vRecipients |
ATTACHMENT, BINARY, content, contentHandler, disposition, fileName, headers, HTML, INLINE, mimeType, PLAIN
| Constructor and Description |
|---|
Message()
Creates a new empty message.
|
| Modifier and Type | Method and Description |
|---|---|
void |
addFrom(Address[] addresses)
Add these addresses to the existing "From" attribute.
|
void |
addHeader(String name,
String value)
Add this value to the existing values for this header name.
|
void |
addRecipient(int type,
Address address)
Add this recipient address to the existing ones of the given type.
|
void |
addRecipients(int type,
Address[] addresses)
Add these recipient addresses to the existing ones of the given type.
|
void |
delete()
Mark this message as deleted, removing it from the parent folder.
|
Address[] |
getFrom()
Returns the "From" attribute.
|
Message |
reply(boolean replyToAll)
Get a new Message suitable for a reply to this message.
|
void |
setFrom(Address address)
Set the "From" attribute in this Message.
|
void |
writeTo(Stream stream)
Writes this part to the given Stream.
|
getContent, getContentType, setContent, setContent, setContent, setText
public String subject
protected Vector vFrom
protected Vector[] vRecipients
public String uidl
public void addHeader(String name, String value)
Part
public void addRecipient(int type, Address address)
type
- the recipient typeaddress
- the addresstotalcross.lang.IllegalArgumentException
- If the given recipient type is not validtotalcross.lang.NullPointerException
- if the given address is nullpublic void addRecipients(int type, Address[] addresses)
type
- the recipient typeaddresses
- the addressestotalcross.lang.IllegalArgumentException
- If the given recipient type is not validtotalcross.lang.NullPointerException
- if addresses is null, or has a null valuepublic void addFrom(Address[] addresses)
addresses
- the senderspublic void setFrom(Address address)
address
- the senderpublic Address[] getFrom()
public void writeTo(Stream stream) throws MessagingException
Part
writeTo
in class Part
stream
- the output stream that will receive this part's encoded representationMessagingException
- if an error occurs fetching the data to be writtenpublic void delete() throws MessagingException
MessagingException
public Message reply(boolean replyToAll) throws AddressException
replyToAll
- reply should be sent to all recipients of this messageAddressException


Like most of us, you work for a company where you are required to build Microsoft Power BI reports. The data resides in several different databases and files. These data repositories are different from each other, some are in Microsoft SQL Server, some are in Microsoft Excel, but all the data is related.
In this module’s scenario you work for Tailwind Traders. You’ve been tasked by senior leadership to create a suite of reports that are dependent on data in several different locations. The database that tracks sales transactions is in SQL Server, a relational database contains which customer bought which items and when. It also tracks which employee made the sale, along with the employee name and employee ID. However, that database doesn’t contain the employee’s hire date, their title, or who their manager is. For that information, you need to access files that Human Resources keeps in Excel. You've been consistently requesting that they use an SQL database, but they haven't yet had the chance to implement it.
When an item ships, the shipment is recorded in the warehousing application, which is new to the company. The developers chose to store data in CosmosDB, as a set of JSON documents.
Tailwind Traders has an application that helps with financial projections, so that they can predict what their sales will be in future months and years, based on past trends. Those projections are stored in Microsoft Azure Analysis Services. Here’s a view of the many data sources you are asked to combine data from.
Before you can create reports, you must first extract data from the various data sources. Interacting with SQL Server is different from Excel, so you should learn the nuances of both systems. After you’ve learned the particulars of each system, you can use Power Query (the query engine used by Power BI and Excel) to help you clean the data, such as renaming columns, replacing values, removing errors, and combining query results. After the data has been cleaned and organized, you are ready to build reports in Power BI. Finally, you will publish your combined dataset and reports to Power BI service (PBIS). From there, other people can use your dataset and build their own reports or they can use the reports that you’ve already built. Additionally, if someone else built a dataset that you'd like to use, you can build reports from that, too!
This module will focus on the first step, of getting the data from the different data sources and importing it into Power BI by using Power Query.
By the end of this module, you’ll be able to:


This is the HTML connector for the Power-Up. It will be loaded into a hidden iframe when your Power-Up is enabled.
Head over to trello.com/power-ups/admin to create a new power-up, and enter the URL for this page as the Iframe connector URL.
Then, you'll need to enable the following capabilities:


{% include 'includes/head.html' %}
{% include 'includes/navbar.html' %} {% include 'includes/header.html' %}You may give Pref personal information about you, such as your name, your contact email, and other details on various places on Pref. This privacy policy describes how Pref collects and uses your personal information.
How and where Pref collects personal information:
- user registration
- profile settings
- etc ...
How Pref uses your personal information:
The information you give Pref is absolutely safe. Pref will never rent, sell, share, or otherwise disclose your personal information to third parties. Pref might contact you from time to time regarding updates to the site.
You may also opt out from receiving information from Pref at any time and remove your contact information from Pref databases by deleting your profile or changing your email.
{% url "webapp.views.site.about" as about_url %}Use of the term Pref on this page refers to the owners and operators of Pref found here.
{% include 'includes/footer.html' %}


Current path:
/
General/
CommonSnippets/
search inside code snippets
[.]
[..]
[C]
gigi.pl
francois.py


ICP registration¶
This tutorial demonstrates the ICP (Iterative Closest Point) registration algorithm. It has been a mainstay of geometric registration in both research and industry for many years. The input are two point clouds and an initial transformation that roughly aligns the source point cloud to the target point cloud. The output is a refined transformation that tightly aligns the two point clouds. A helper function draw_registration_result
visualizes the alignment during the registration process. In this tutorial, we show two ICP variants, the point-to-point ICP and the point-to-plane ICP [Rusinkiewicz2001].
5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 | # examples/Python/Basic/icp_registration.py
import open3d as o3d
import numpy as np
import copy
def draw_registration_result(source, target, transformation):
source_temp = copy.deepcopy(source)
target_temp = copy.deepcopy(target)
source_temp.paint_uniform_color([1, 0.706, 0])
target_temp.paint_uniform_color([0, 0.651, 0.929])
source_temp.transform(transformation)
o3d.visualization.draw_geometries([source_temp, target_temp])
if __name__ == "__main__":
source = o3d.io.read_point_cloud("../../TestData/ICP/cloud_bin_0.pcd")
target = o3d.io.read_point_cloud("../../TestData/ICP/cloud_bin_1.pcd")
threshold = 0.02
trans_init = np.asarray([[0.862, 0.011, -0.507, 0.5],
[-0.139, 0.967, -0.215, 0.7],
[0.487, 0.255, 0.835, -1.4], [0.0, 0.0, 0.0, 1.0]])
draw_registration_result(source, target, trans_init)
print("Initial alignment")
evaluation = o3d.registration.evaluate_registration(source, target,
threshold, trans_init)
print(evaluation)
print("Apply point-to-point ICP")
reg_p2p = o3d.registration.registration_icp(
source, target, threshold, trans_init,
o3d.registration.TransformationEstimationPointToPoint())
print(reg_p2p)
print("Transformation is:")
print(reg_p2p.transformation)
print("")
draw_registration_result(source, target, reg_p2p.transformation)
print("Apply point-to-plane ICP")
reg_p2l = o3d.registration.registration_icp(
source, target, threshold, trans_init,
o3d.registration.TransformationEstimationPointToPlane())
print(reg_p2l)
print("Transformation is:")
print(reg_p2l.transformation)
print("")
draw_registration_result(source, target, reg_p2l.transformation)
|
Helper visualization function¶
12 13 14 15 16 17 18 | def draw_registration_result(source, target, transformation):
source_temp = copy.deepcopy(source)
target_temp = copy.deepcopy(target)
source_temp.paint_uniform_color([1, 0.706, 0])
target_temp.paint_uniform_color([0, 0.651, 0.929])
source_temp.transform(transformation)
o3d.visualization.draw_geometries([source_temp, target_temp])
|
This function visualizes a target point cloud, and a source point cloud transformed with an alignment transformation. The target point cloud and the source point cloud are painted with cyan and yellow colors respectively. The more and tighter the two point clouds overlap with each other, the better the alignment result is.
Note
Since functions transform
and paint_uniform_color
change the point cloud, we call copy.deepcopy
to make copies and protect the original point clouds.
Input¶
22 23 24 25 26 27 28 | source = o3d.io.read_point_cloud("../../TestData/ICP/cloud_bin_0.pcd")
target = o3d.io.read_point_cloud("../../TestData/ICP/cloud_bin_1.pcd")
threshold = 0.02
trans_init = np.asarray([[0.862, 0.011, -0.507, 0.5],
[-0.139, 0.967, -0.215, 0.7],
[0.487, 0.255, 0.835, -1.4], [0.0, 0.0, 0.0, 1.0]])
draw_registration_result(source, target, trans_init)
|
This script reads a source point cloud and a target point cloud from two files. A rough transformation is given.
Note
The initial alignment is usually obtained by a global registration algorithm. See Global registration for examples.
29 30 31 32 | print("Initial alignment")
evaluation = o3d.registration.evaluate_registration(source, target,
threshold, trans_init)
print(evaluation)
|
Function evaluate_registration
calculates two main metrics. fitness
measures the overlapping area (# of inlier correspondences / # of points in target). Higher the better. inlier_rmse
measures the RMSE of all inlier correspondences. Lower the better.
Initial alignment
RegistrationResult with fitness = 0.174723, inlier_rmse = 0.011771,
and correspondence_set size of 34741
Access transformation to get result.
Point-to-point ICP¶
In general, the ICP algorithm iterates over two steps:
Find correspondence set \(\mathcal{K}=\{(\mathbf{p}, \mathbf{q})\}\) from target point cloud \(\mathbf{P}\), and source point cloud \(\mathbf{Q}\) transformed with current transformation matrix \(\mathbf{T}\).
Update the transformation \(\mathbf{T}\) by minimizing an objective function \(E(\mathbf{T})\) defined over the correspondence set \(\mathcal{K}\).
Different variants of ICP use different objective functions \(E(\mathbf{T})\) [BeslAndMcKay1992] [ChenAndMedioni1992] [Park2017].
We first show a point-to-point ICP algorithm [BeslAndMcKay1992] using an objective
34 35 36 37 38 39 40 41 42 | print("Apply point-to-point ICP")
reg_p2p = o3d.registration.registration_icp(
source, target, threshold, trans_init,
o3d.registration.TransformationEstimationPointToPoint())
print(reg_p2p)
print("Transformation is:")
print(reg_p2p.transformation)
print("")
draw_registration_result(source, target, reg_p2p.transformation)
|
Class TransformationEstimationPointToPoint
provides functions to compute the residuals and Jacobian matrices of the point-to-point ICP objective. Function registration_icp
takes it as a parameter and runs point-to-point ICP to obtain results.
Apply point-to-point ICP
RegistrationResult with fitness = 0.372450, inlier_rmse = 0.007760,
and correspondence_set size of 74056
Access transformation to get result.
Transformation is:
[[ 0.83924644 0.01006041 -0.54390867 0.64639961]
[-0.15102344 0.96521988 -0.21491604 0.75166079]
[ 0.52191123 0.2616952 0.81146378 -1.50303533]
[ 0. 0. 0. 1. ]]
The fitness
score increases from 0.174723 to 0.372450. The inlier_rmse
reduces from 0.011771 to 0.007760. By default, registration_icp
runs until convergence or reaches a maximum number of iterations (30 by default). It can be changed to allow more computation time and to improve the results further.
reg_p2p = registration_icp(source, target, threshold, trans_init,
TransformationEstimationPointToPoint(),
ICPConvergenceCriteria(max_iteration = 2000))
Outputs:
Apply point-to-point ICP
RegistrationResult with fitness = 0.621123, inlier_rmse = 0.006583,
and correspondence_set size of 123501
Access transformation to get result.
Transformation is:
[[ 0.84024592 0.00687676 -0.54241281 0.6463702 ]
[-0.14819104 0.96517833 -0.21706206 0.81180074]
[ 0.52111439 0.26195134 0.81189372 -1.48346821]
[ 0. 0. 0. 1. ]]
The ICP algorithm took 144 iterations until convergence. The final alignment is tight. The fitness
score improves to 0.621123. The inlier_rmse
reduces to 0.006583.
Point-to-plane ICP¶
The point-to-plane ICP algorithm [ChenAndMedioni1992] uses a different objective function
where \(\mathbf{n}_{\mathbf{p}}\) is the normal of point \(\mathbf{p}\). [Rusinkiewicz2001] has shown that the point-to-plane ICP algorithm has a faster convergence speed than the point-to-point ICP algorithm.
44 45 46 47 48 49 50 51 52 | print("Apply point-to-plane ICP")
reg_p2l = o3d.registration.registration_icp(
source, target, threshold, trans_init,
o3d.registration.TransformationEstimationPointToPlane())
print(reg_p2l)
print("Transformation is:")
print(reg_p2l.transformation)
print("")
draw_registration_result(source, target, reg_p2l.transformation)
|
registration_icp
is called with a different parameter TransformationEstimationPointToPlane
. Internally, this class implements functions to compute the residuals and Jacobian matrices of the point-to-plane ICP objective.
Note
The point-to-plane ICP algorithm uses point normals. In this tutorial, we load normals from files. If normals are not given, they can be computed with Vertex normal estimation.
Apply point-to-plane ICP
RegistrationResult with fitness = 0.620972, inlier_rmse = 0.006581,
and correspondence_set size of 123471
Access transformation to get result.
Transformation is:
[[ 0.84023324 0.00618369 -0.54244126 0.64720943]
[-0.14752342 0.96523919 -0.21724508 0.81018928]
[ 0.52132423 0.26174429 0.81182576 -1.48366001]
[ 0. 0. 0. 1. ]]
The point-to-plane ICP reaches tight alignment within 30 iterations (fitness
0.620972 and inlier_rmse
0.006581).


POSIX_OPENPT
Section: Linux Programmer's Manual (3)
Updated: 2014-06-03
Index
Return to Main Contents
NAME
posix_openpt - open a pseudoterminal device
SYNOPSIS
#include <stdlib.h>
#include <fcntl.h>
int posix_openpt(int flags);
Feature Test Macro Requirements for glibc (see
feature_test_macros(7)):
posix_openpt():
_XOPEN_SOURCE >= 600
DESCRIPTION
The
posix_openpt()
function opens an unused pseudoterminal master device, returning a
file descriptor that can be used to refer to that device.
The
flags
argument is a bit mask that ORs together zero or more of
the following flags:
- O_RDWR
-
Open the device for both reading and writing.
It is usual to specify this flag.
- O_NOCTTY
-
Do not make this device the controlling terminal for the process.
RETURN VALUE
On success,
posix_openpt()
returns a nonnegative file descriptor which is the lowest
numbered unused descriptor.
On failure, -1 is returned, and
errno
is set to indicate the error.
ERRORS
See
open(2).
VERSIONS
Glibc support for
posix_openpt()
has been provided since version 2.2.1.
ATTRIBUTES
Multithreading (see pthreads(7))
The
posix_openpt()
function is thread-safe.
CONFORMING TO
posix_openpt()
is part of the UNIX 98 pseudoterminal support (see
pts(4)).
This function is specified in POSIX.1-2001.
NOTES
The
posix_openpt()
function is a recent invention in POSIX.
Some UNIX implementations that support System V
(aka UNIX 98) pseudoterminals don't have this function, but it
is easy to implement:
int
posix_openpt(int flags)
{
return open("/dev/ptmx", flags);
}
Calling
posix_openpt()
creates a pathname for the corresponding pseudoterminal slave device.
The pathname of the slave device can be obtained using
ptsname(3).
The slave device pathname exists only as long as the master device is open.
SEE ALSO
open(2),
getpt(3),
grantpt(3),
ptsname(3),
unlockpt(3),
pts(4),
pty(7)
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- RETURN VALUE
-
- ERRORS
-
- VERSIONS
-
- ATTRIBUTES
-
- Multithreading (see pthreads(7))
-
- CONFORMING TO
-
- NOTES
-
- SEE ALSO
-
This document was created by
man2html,
using the manual pages.
Time: 02:55:04 GMT, September 18, 2014


Name: {{profile.name}}
Username: {{profile.login}}
Bio: {{profile.bio}}
Public Repos: {{profile.public_repos}}
Followers: {{profile.followers}}
Following: {{profile.following}}
Location: {{profile.location}}
Join Date: {{profile.created_at |date}}
View Profile on Github


Help
Execution limit:
Normal form
Do one beta reduction
Get normal form
Intermediate steps
Named output


Generate continuous (normal, non-normal, or mixture distributions), binary, ordinal, and count (regular or zero-inflated, Poisson or Negative Binomial) variables with a specified correlation matrix, or one continuous variable with a mixture distribution. This package can be used to simulate data sets that mimic real-world clinical or genetic data sets (i.e., plasmodes, as in Vaughan et al., 2009 <doi:10.1016/j.csda.2008.02.032>). The methods extend those found in the 'SimMultiCorrData' R package. Standard normal variables with an imposed intermediate correlation matrix are transformed to generate the desired distributions. Continuous variables are simulated using either Fleishman (1978)'s third order <doi:10.1007/BF02293811> or Headrick (2002)'s fifth order <doi:10.1016/S0167-9473(02)00072-5> polynomial transformation method (the power method transformation, PMT). Non-mixture distributions require the user to specify mean, variance, skewness, standardized kurtosis, and standardized fifth and sixth cumulants. Mixture distributions require these inputs for the component distributions plus the mixing probabilities. Simulation occurs at the component level for continuous mixture distributions. The target correlation matrix is specified in terms of correlations with components of continuous mixture variables. These components are transformed into the desired mixture variables using random multinomial variables based on the mixing probabilities. However, the package provides functions to approximate expected correlations with continuous mixture variables given target correlations with the components. Binary and ordinal variables are simulated using a modification of ordsample() in package 'GenOrd'. Count variables are simulated using the inverse CDF method. There are two simulation pathways which calculate intermediate correlations involving count variables differently. Correlation Method 1 adapts Yahav and Shmueli's 2012 method <doi:10.1002/asmb.901> and performs best with large count variable means and positive correlations or small means and negative correlations. Correlation Method 2 adapts Barbiero and Ferrari's 2015 modification of the 'GenOrd' package <doi:10.1002/asmb.2072> and performs best under the opposite scenarios. The optional error loop may be used to improve the accuracy of the final correlation matrix. The package also contains functions to calculate the standardized cumulants of continuous mixture distributions, check parameter inputs, calculate feasible correlation boundaries, and summarize and plot simulated variables.
| Version: | 0.1.1 |
| Depends: | R (≥ 3.4.0), SimMultiCorrData (≥ 0.2.1) |
| Imports: | BB, nleqslv, MASS, mvtnorm, Matrix, VGAM, triangle, ggplot2, grid, stats, utils |
| Suggests: | knitr, rmarkdown, printr, bookdown, testthat |
| Published: | 2018-07-01 |
| Author: | Allison Cynthia Fialkowski |
| Maintainer: | Allison Cynthia Fialkowski <allijazz at uab.edu> |
| License: | GPL-2 |
| URL: | https://github.com/AFialkowski/SimCorrMix |
| NeedsCompilation: | no |
| Materials: | README NEWS |
| CRAN checks: | SimCorrMix results |
| Reference manual: | SimCorrMix.pdf |
| Vignettes: |
Continuous Mixture Distributions Expected Cumulants and Correlations for Continuous Mixture Variables Comparison of Correlation Methods 1 and 2 Variable Types Overall Workflow for Generation of Correlated Data |
| Package source: | SimCorrMix_0.1.1.tar.gz |
| Windows binaries: | r-devel: SimCorrMix_0.1.1.zip, r-release: SimCorrMix_0.1.1.zip, r-oldrel: SimCorrMix_0.1.1.zip |
| OS X binaries: | r-release: SimCorrMix_0.1.1.tgz, r-oldrel: SimCorrMix_0.1.1.tgz |
| Old sources: | SimCorrMix archive |
| Reverse depends: | SimRepeat |
Please use the canonical form https://CRAN.R-project.org/package=SimCorrMix to link to this page.


KTTableViewController Class Reference
| Inherits from | UITableViewController |
| Conforms to | UIScrollViewDelegate |
| Declared in | KTTableViewController.h KTTableViewController.m |
Overview
This class is a subclass of UITableViewController which allows you to define a KiiQuery object and the view controller will automatically populate the results based on the query. This class includes attributes such as pull-to-refresh (pre-iOS6), pagination and more.
To learn more or see an example, check out the GitHub wiki here: https://github.com/KiiPlatform/KiiToolkit-iOS/wiki/kttableviewcontroller
Tasks
-
query
property -
bucket
property -
pageSize
property -
paginationEnabled
property -
refreshControlEnabled
property -
autoHandleErrors
property -
refreshNoticeView
property -
refreshNoticeLabel
property -
loadingArrow
property -
refreshSpinner
property -
– refreshQuery
-
– kiiObjectAtIndex:
-
– tableView:cellForKiiObject:atIndexPath:
Properties
autoHandleErrors
When enabled, the view will display errors when the data can’t be loaded.  Default = YES
@property (nonatomic, assign) BOOL autoHandleErrors
Discussion
When enabled, the view will display errors when the data can’t be loaded.  Default = YES
Declared In
KTTableViewController.h
bucket
The bucket to execute the query on in order to retrieve the data. Must be either a KiiBucket or a KiiFileBucket object
@property (nonatomic, strong) id bucket
Discussion
The bucket to execute the query on in order to retrieve the data. Must be either a KiiBucket or a KiiFileBucket object
Declared In
KTTableViewController.h
loadingArrow
A subview of refreshNoticeView, this is the arrow that displays alongside the pull-to-refresh text. Manipulate this view to customize the look of the pull-to-refresh mechanism
@property (nonatomic, strong) CKRefreshArrowView *loadingArrow
Discussion
A subview of refreshNoticeView, this is the arrow that displays alongside the pull-to-refresh text. Manipulate this view to customize the look of the pull-to-refresh mechanism
Declared In
KTTableViewController.h
pageSize
The page size of the tableview. Default is undefined and determined by how many results are returned by the server
@property (nonatomic, assign) int pageSize
Discussion
The page size of the tableview. Default is undefined and determined by how many results are returned by the server
Declared In
KTTableViewController.h
paginationEnabled
If pagination is enabled, when the user scrolls to the bottom of the page and more results exist, they will be loaded automatically. Default = YES
@property (nonatomic, assign) BOOL paginationEnabled
Discussion
If pagination is enabled, when the user scrolls to the bottom of the page and more results exist, they will be loaded automatically. Default = YES
Declared In
KTTableViewController.h
query
The query to be executed when the table view is loaded/refreshed
@property (nonatomic, strong) KiiQuery *query
Discussion
The query to be executed when the table view is loaded/refreshed
Declared In
KTTableViewController.h
refreshControlEnabled
When enabled, pull-to-refresh will be available. This is available pre-iOS6 and the view is customizable via refreshNoticeView. Default = YES
@property (nonatomic, assign) BOOL refreshControlEnabled
Discussion
When enabled, pull-to-refresh will be available. This is available pre-iOS6 and the view is customizable via refreshNoticeView. Default = YES
Declared In
KTTableViewController.h
refreshNoticeLabel
A subview of refreshNoticeView, this label displays the pull-to-refresh text. Manipulate this view to customize the look of the pull-to-refresh mechanism
@property (nonatomic, strong) UILabel *refreshNoticeLabel
Discussion
A subview of refreshNoticeView, this label displays the pull-to-refresh text. Manipulate this view to customize the look of the pull-to-refresh mechanism
Declared In
KTTableViewController.h
refreshNoticeView
This view displays the pull-to-refresh arrow and text labels. Manipulate this view to customize the look of the pull-to-refresh mechanism
@property (nonatomic, strong) UIView *refreshNoticeView
Discussion
This view displays the pull-to-refresh arrow and text labels. Manipulate this view to customize the look of the pull-to-refresh mechanism
Declared In
KTTableViewController.h
Instance Methods
kiiObjectAtIndex:
Get the associated KiiObject at the given index
- (KiiObject *)kiiObjectAtIndex:(NSUInteger)index
Parameters
- index
The index of the item you’d like to retrieve
Return Value
A KiiObject that represents the given index
Discussion
Get the associated KiiObject at the given index
Declared In
KTTableViewController.h
refreshQuery
Will refresh the table view, reloading the original query and populating the table’s results once complete
- (void)refreshQuery
Discussion
Will refresh the table view, reloading the original query and populating the table’s results once complete
Declared In
KTTableViewController.h
tableView:cellForKiiObject:atIndexPath:
This method must be overridden by your subclass!
- (UITableViewCell *)tableView:(UITableView *)tableView cellForKiiObject:(id)object atIndexPath:(NSIndexPath *)indexPath
Parameters
- tableView
The tableview to which the cell will belong
- object
The KiiObject or KiiFile that the cell will represent. Use the contents within this object to create the cell appropriately
- indexPath
The index path where this cell will reside
Return Value
A UITableViewCell object
Discussion
This method must be overridden by your subclass!
Declared In
KTTableViewController.h


Name
Email
Message
Please do not conduct malicious actvities on this website.
You are now successfully registered with Talent Network!


Module gui
Use gui to define your script's custom graphical user interface.
Custom GUI example : sinemouse-demo.lua
The gui global is available to every protoplug script after including the main protoplug header :
require "include/protoplug"
Functions
| gui.addHandler (event, handler) | Add a handler for a GUI event. |
| gui.paint (g) | Override to paint a custom GUI. |
| gui.getComponent () | Get GUI Component. |
Tables
| gui.FocusCause | Focus change causes. |
| gui.ModifierKeys | Keyboard and mouse modifiers. |
Class gui.MouseEvent
| gui.MouseEvent.x | X. |
| gui.MouseEvent.y | Y. |
| gui.MouseEvent.mods | Modifier keys. |
| gui.MouseEvent.eventComponent | Event component. |
| gui.MouseEvent.originalComponent | Original component. |
| gui.MouseEvent.eventTime | Time. |
| gui.MouseEvent.mouseDownTime | Mouse down time. |
| gui.MouseEvent.mouseDownPos | Mouse down position. |
| gui.MouseEvent.numberOfClicks | Number of clicks. |
| gui.MouseEvent.wasMovedSinceMouseDown | Was moved since mouse down. |
Class gui.MouseWheelDetails
| gui.MouseWheelDetails.deltaX | X delta. |
| gui.MouseWheelDetails.deltaY | Y delta. |
| gui.MouseWheelDetails.isReversed | Is reversed. |
| gui.MouseWheelDetails.isSmooth | Is smooth. |
Class gui.KeyPress
| gui.KeyPress.keyCode | Key code. |
| gui.KeyPress.mods | Modifier Keys. |
| gui.KeyPress.textCharacter | Text character. |
Functions
- gui.addHandler (event, handler)
-
Add a handler for a GUI event.
Here's a list of the events and their parameters, showing how they should be received :
gui.addHandler("resized", function() ... end) gui.addHandler("focusGained", function(focusCause) ... end) gui.addHandler("focusLost", function(focusCause) ... end) gui.addHandler("modifierKeysChanged", function(modifierKeys) ... end) gui.addHandler("mouseMove", function(mouseEvent) ... end) gui.addHandler("mouseEnter", function(mouseEvent) ... end) gui.addHandler("mouseExit", function(mouseEvent) ... end) gui.addHandler("mouseDown", function(mouseEvent) ... end) gui.addHandler("mouseDrag", function(mouseEvent) ... end) gui.addHandler("mouseUp", function(mouseEvent) ... end) gui.addHandler("mouseDoubleClick", function(mouseEvent) ... end) gui.addHandler("mouseWheelMove", function(mouseEvent, mouseWheelDetails) ... end) gui.addHandler("keyPressed", function(keyPress, srcComponent) ... end) gui.addHandler("keyStateChanged", function(keyPress, srcComponent) ... end)
Parameters received by the event handlers are of type FocusCause, ModifierKeys, MouseEvent, MouseWheelDetails, and KeyPress.
Parameters:
- event string the event to handle
- handler function a function to add the event's handlers
See also:
- gui.paint (g)
-
Override to paint a custom GUI.
Define this function to paint something in the custom GUI space.
Parameters:
- g juce.Graphics a JUCE graphics target
- gui.getComponent ()
-
Get GUI Component.
Returns:
-
the current GUI component, or
nil
if the GUI has not been opened yet.
Tables
- gui.FocusCause
-
Focus change causes.
Values received by the
focusGained
andfocusLost
handlers.Fields:
- focusChangedByMouseClick 0
- focusChangedByTabKey 1
- focusChangedDirectly 2
See also:
- gui.ModifierKeys
-
Keyboard and mouse modifiers.
Contained in every gui.MouseEvent and received by the
modifierKeysChanged
handler.Fields:
- noModifiers 0
- shiftModifier 1
- ctrlModifier 2
- altModifier 4
- leftButtonModifier 16
- rightButtonModifier 32
- middleButtonModifier 64
- commandModifier 8
- ctrlAltCommandModifiers 14
Class gui.MouseEvent
A mouse event as received by GUI handlers (see gui.addHandler)- gui.MouseEvent.x
- X.
- gui.MouseEvent.y
- Y.
- gui.MouseEvent.mods
- Modifier keys. Values defined in gui.ModifierKeys
- gui.MouseEvent.eventComponent
- Event component.
- gui.MouseEvent.originalComponent
- Original component.
- gui.MouseEvent.eventTime
- Time.
- gui.MouseEvent.mouseDownTime
- Mouse down time.
- gui.MouseEvent.mouseDownPos
- Mouse down position.
- gui.MouseEvent.numberOfClicks
- Number of clicks.
- gui.MouseEvent.wasMovedSinceMouseDown
- Was moved since mouse down.
Class gui.MouseWheelDetails
As received by themouseWheelMove
handler (see gui.addHandler)
- gui.MouseWheelDetails.deltaX
- X delta.
- gui.MouseWheelDetails.deltaY
- Y delta.
- gui.MouseWheelDetails.isReversed
- Is reversed.
- gui.MouseWheelDetails.isSmooth
- Is smooth.
Class gui.KeyPress
As received by thekeyPressed
and keyStateChanged
handlers (see gui.addHandler)


“Always wanted to create your innovative attire?
Well, here's your chance, but the items are useless and dire
It’s not about the brand, it’s about the style
Walk down the ramp and slay it with a smile.”
Rules:
“Are you a snapchat fanatic?
So get ready for something dramatic
Innovate, create and design a new filter
Something unique, stunning and absolutely killer!”
Rules:
“Time to uncork and unwind
So design something detailed and outlined
Spill your emotions, spontaneous and natural
Use your colors and create something magical.”
Rules:
“Forget your brush and palette,
You can even do some Salsa or Ballet
Grab some paint and set your imagination free,
Create a masterpiece for everyone to see.”
Rules:
“Chocolate goes straight to the heart,
Whether it is cheesecake or a truffle tart
Explore your imagination and let your creativity flow,
Draw, paint or sketch, just put on a good show.”
Rules:
“Good design is obvious, great design is transparent
So put your thinking caps on and display your talent
Make your poster fresh and unconventional,
Present before us something remarkable and sensational.”
Rules:
Group Dance event. Teams must DEPICT A STORY through their dance.
Rules:
Solo drama event. People who are able to act like they are paying attention in an 8 a.m lecture on a Monday morning are urged to participate in this event.
Round 1: Elimination
The participants have to perform any monologue, original or otherwise.
Rules:
Round 2 - Finals
You will be given an emotion you need to portray. Then you will be allotted acting area or ‘block.’  Then, The Judge will walk up to you or any other performer and signal to start performing through a bell. At any point in the performance The Judge will signal you to stop, through the same bell and you must freeze in that position.
The Judge could move on to another performer where he might do the same and ‘pause’ the performer halfway through and return to you. You must then continue the piece from where it was left off.
Rules:
Band event. You will have to take any pop song and change the genre of the song to any other distinctly different genre. (For example from pop to jazz)
Rules:
Duration: 2-2.5 hours
Description: Improv comedy event
Rules:Solo singing event
Round 1: Elimination
For reasons we can't explain, Round 1 is a non-karaoke round. Singers can sing any song of their choice.
Rules:
Round 2:
Can you block possible defences of your opponent and then tackle the very defences you built? This event spells trouble so prep your languages, arguments and get ready to take down the very defences you build!
Rules:
It’s the day of final verdict. Words is all it will take to decide between glory and a lifetime of shunning. Can you convince and tilt the last judgement in your favour despite your coloured past?
Rules:
It’s the day every fan awaits. In a race against time and competitive fans, enjoy the thrill of an auction of your favourite superheroes and legendary comic characters along with contemporary present day favourites like Joey, Harvey, Donna, Cersie Lannister and lots more.
Rules:
Look. You have one word to write the funniest/sweetest/creepiest/bravest fictional tale. One shot. One opportunity. To seize everything you ever wanted. In one moment. Would you capture it? Or just let it slip?
Rules:
A mere race against the clock is so passé! Try racing your grey cells and those of your partner while spinning threads of your thoughts and racing against time.
Rules:
No deviation. No repetition. No hesitation. No taxation without representation. So, don't jumble ideas, or drag the point, or pause too much, or shy away from expressing your ideas.
You will not be given any time to prep. It is purely spontaneous. Therefore, any participant found using time stopping/time-travelling machines will be negatively marked, after a fist bump.
Rules:
This is an authentic poetry slam event where poets will congregate and share their original works with the esteemed judges and the best 3 poems will be awarded.
Rules:
FIFA 17
Rules:
Call of Duty
Rules:
Mini Militia 2
Rules:
Ever wanted to play pool using your feet when not on questionable substances? Here's your chance.
Rules:


17: Redirection
Try the echo command. It simply echoes back its argument as output.
learner@:learning_unix$ echo "Bilbo"
All of the commands we have used so far have printed their output directly in the terminal window. What if we wanted to capture that output in a file? We can do that using file redirection. For example;
learner@:learning_unix$ echo "Bilbo" > hobbits.txt
Notice that when you ran the command above it didn't print any output to the screen. All of the output was captured and printed into a file called hobbits.txt
.
You can view the first few entries in this file using the head
command like this
learner@:learning_unix$ head hobbits.txt
learner@:learning_unix$ echo "Merry" >> hobbits.txt
Notice that we use >>
and not just >
. This operator will append to a file. If we only used >
, we would end up overwriting the file.
*** If you want to see the change you made to the file above in the editor you will need to click its name again in the file browser to refresh the editor.
Careful when using file redirection (>), it will overwrite any existing file of the same name


We're sorry but <%= htmlWebpackPlugin.options.title %> doesn't work properly without JavaScript enabled. Please enable it to continue.
This app requires JavaScript. Please enable it and refresh.


This was my first real experiance with Salvia. I had tried it before with little hallucinogenic effect, but this time I had tried to prepare myself, and it worked. I fasted for 24 hours to cleanse my mind, body, and spirit. I spent the day in meditation and prayer. It is important to note that I was slightly fearful due to my psychological disorders and possible consequences of the use of hallucinogens. I have obsessive-compulsive disorder, and bi-polar disorder [30mg prozac daily, 15mg abilify daily, 25mg seroquel daily, depakote 1500mg daily, and trilepta].
Well, as night came on I began to listen to some strange, thought provoking music and at 10:30 I smoked a small bowl of cannabis. I took a seat on my porch and discussed what was to come with a friend of mine, who was sitting for me. At about 11:00 I smoked a second larger bowl of cannabis. Then at 11:25 I turned off the lights and began listening to the Lords Prayer in latin set to song. I packed a quarter of a gram of the extract onto a base of cannabis, said a quick final prayer, closed my eyes and hit the bowl. I held my first hit down and waited about 15 seconds before I released it. I continued to smoke the rest in a similar manner.
Within 20 seconds of my first hit, I began to feel a strange sensation of gravity, and after a moment I felt compelled to lie on the floor. I lay down, facing the floor and I knew I was in for an interesting expieriance. I was not scared, but I felt that every breath was a struggle, because every breath was being sucked into the earth. I stared down with eyes closed and I began to think that I had already reached my peak. I was incorrect. I began to think about the music and a series of images appeared before me, rapidly moving and quick to disapear. I rather enjoyed that. I chose at this point to open my eyes, and I looked left. As I stared at the trees, I felt the pressure dissipate, and I began to see a figure of an alien nature. It passed while I stared and morphed into a ceremony. I saw the Mazatecs partaking of salvia and some dancing beside a fire. The ceremony was beutiful and filled with earthy colors. I saw with great clarity at this moment.
At this point I saw them turn and look at me. I knew I was invading Mazatec territory, and I realized I was wrong to do so. Those who stared at me shot a single arrow at me. I was hit but the arrow was not in me. I could feel pain in my lower rib cage, but it was not there when I looked. I looked back to the ceremony but it had ceased to be. In the place of beuty was the head of Medusa. I stared awestruck. The snakes moved in a circular pattern. It was at this point an image flashed in my head. I saw my legs turn to stone, but I had not turned my head. My body felt like a rock and I lay still.
I was confused, because I was still able to know that Medusa did not exist. I heard a vioce tell me to turn over, so I did, and was not stone anymore. I closed my eyes once more and when I did I saw clouds moving and pulling apart. An image appeared within the clouds. I saw heaven. It was at this point I began to come down. I was still very much under the influence. My brother told me it was 11:59. I sat in a chair and began to think and occasionally speak.
I now know that hallucenagens are in no way a toy. I realized that Salvia is meant only for the strong of mind and those close to God.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Completely failed files: 2; Completely failed subtests: 21; Failure level: 21/106 (19.81%)
| Test | Ch45 | FF39 | Sa08 |
|---|---|---|---|
| /notifications/lang.html (21/37, 56.76%, 19.81% of total) | OK | OK | OK |
| Roundtripping lang "Latn-de". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "Latf-de". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "tic-tac-tac-toe". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "cocoa-1-bar". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "cocoa-a-bar". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "en-". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "en--". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "foo--bar". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "id---Java". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "fr-x". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "fr-xenomorph". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "fr-x-xenomorph". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "a". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "a-fr-lang". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "b-fr-lang". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "es1-KK-aa-bb-cc-dd". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "es2-KL-aa-bb-cc-dd". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "es3-KM-aa-bb-cc-dd". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "fooÉ". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "foöÉ-bÁr". Expecting "". | FAIL | FAIL | FAIL |
| Roundtripping lang "foöÉbÁr". Expecting "". | FAIL | FAIL | FAIL |


Policeman Rapes Nine-year-old Daughter Of Policewoman In Lagos Barracks
According to the woman, Alidu was also at the police station begging and telling the Divisional Police Officer that it was the work of the devil.
by SaharaReporters, New York
A 45-year-old policewoman has narrated to an Ikeja Sexual Offences and Domestic Violence Court how a policeman named Mohammed Alidu allegedly defiled her nine-year-old daughter inside a police barracks in Lagos.
The News Agency of Nigeria reports that the policewoman was the second prosecution witness in the trial of Alidu, a police sergeant, for defilement.
She said the defendant accosted her daughter on her way home from school, dragged her into his apartment and defiled her.
She stated, “We live at Makinde Barracks, Mafoluku, Oshodi, Lagos.
“On June 29, 2018, I was at work when my husband, who was out of Lagos, called to inform me that Sgt. Mohammed had defiled our daughter.
“I went to the police station which is within the same compound of the barracks and my daughter was there.
“My daughter told me that when she was coming back from school, Mohammed called her but she ignored him.
“She said he forcefully took her to his apartment, put her on a bed, tore her underwear and defiled her.”
According to the woman, Alidu was also at the police station begging and telling the Divisional Police Officer that it was the work of the devil.
The policewoman said her daughter was taken to the Mirabel Centre (a sexual assault referral centre) for medical examination, and doctors confirmed that she had been defiled.
During cross-examination by defence counsel, Mr Sunday Odise, the policewoman told the court that the defendant lived near her residence.
She said, “He did not have a house within the barracks. He was sleeping in a shop opposite our home.”


FROM THE DESK OF DR.MICHAEL AFOLABI.  WE BELIEVE THAT YOU WOULD BE IN A POSITION TO HELP US IN OUR BID TO TRANSFER THE SUM OF FORTY-0NE MILLION, FIVE HUNDRED THOUSAND DOLLARS ($41.5M USD) INTO A FOREIGN ACCOUNT. WE ARE MEMBERS OF THE SPECIAL COMMITTEE FOR BUDGET AND PLANNING OF THE MINISTRY OF PETROLEUM, THIS COMMITTEE IS PRINCIPALLY CONCERNED WITH CONTRACT APPRAISALS AND APPROVAL OF CONTRACTS IN ORDER OF PRIORITIES AS REGARDS CAPITAL PROJECT OF THE FEDERAL GOVERNMENT OF NIGERIA.   IT HAS BEEN AGREED THAT THE OWNER OF THE ACCOUNT WILL BE COMPENSATED WITH US$8.3 MILLION OF THE REMITTED FUNDS, WE KEEP US$31.125MILLION WHILE US$2.075MILLION WILL BE SET ASIDE TO OFFSET EXPENSES AND PAY THE NECESSARY TAXES. IT MAY INTEREST YOU TO KNOW THAT TWO YEARS AGO A SIMILAR TRANSACTION WAS CARRIED OUT WITH ONE MR. PATRICE MILLER, THE PRESIDENT OF CRAINE INTERNATIONAL TRADING CORPORATION AT NUMBER 135, EAST 57TH STREET, 28TH FLOOR, NEW YORK 10022 WITH TELEPHONE<PHONE_NUMBER> AND TELEX NUMBER 6731689, AFTER THE AGREEMENT BETWEEN BOTH PARTNERS IN WHICH HE WAS TO TAKE 25% THE MONEY WAS DULY TRANSFERRED INTO HIS ACCOUNT ONLY TO BE DISAPPOINTED ON OUR ARRIVAL IN NEW YORK AS WE WERE RELIABLY INFORMED THAT MR.    IF THIS PROPOSAL SATISFIES YOU, PLEASE CONTACT ME THROUGH E-MAIL STATED ABOVE SO WE CAN ADVICE YOU ON THE MODALITIES OF THE TRANSACTION. ALL MODALITIES OF THE TRANSFER HAVE BEEN WORKED OUT AND ONCE STARTED WILL NOT TAKE MORE THAN 14 WORKING DAYS WITH THE ABSOLUTE SUPPORT OF ALL CONCERNED. THIS TRANSACTION IS 100% SAFE. PLEASE TREAT AS URGENT AND VERY CONFIDENTIAL.  BEST REGARDS. DR.MICHAEL AFOLABI .


|
SimpleSmtp Pile
version 0.0.1
SimpleSmtp pile.
|
send an email using an smtp server More...
#include <smtp.h>
Public Types | |
| enum | states { Tls, HandShake, Auth, User, Pass, Rcpt, Mail, Data, Init, Body, Quit, Close } |
| the states that we can have | |
Signals | |
| void | status (const QString &) |
| the user can get notifications of the progress | |
Public Member Functions | |
| Smtp (const QString &user, const QString &pass, const QString &host, int port=465, int timeout=30000) | |
| constructor | |
| Smtp (const Smtp &other) | |
| constructor | |
| virtual | ~Smtp () |
| destructor | |
| bool | sendMail (UserMsg &um, const QString &to, const QString &subject, const QString &body, bool body_is_html=false, QStringList files=QStringList()) |
| send the mail | |
send an email using an smtp server


In this step you need to create your data streams and their columns. You can
always delete any created data stream or column by selecting it in the list and
press button "Delete".
Each Data Stream needs at least one column to be
valid. So you will not be able to continue to next step unless everything is set
up correctly.
After you done press button "Next >>".


public class Geometry
extends java.lang.Object
| Modifier and Type | Field and Description |
|---|---|
static double |
TWO_PI
2 * PI constant
|
| Constructor and Description |
|---|
Geometry() |
| Modifier and Type | Method and Description |
|---|---|
static java.util.List<Vector2> |
cleanse(java.util.List<Vector2> points)
Returns a new list containing the 'cleansed' version of the given listing of polygon points.
|
static Vector2[] |
cleanse(Vector2... points)
Returns a new array containing the 'cleansed' version of the given array of polygon points.
|
static Capsule |
createCapsule(double width,
double height)
Creates a new
Capsule bounded by the given rectangle width and height. |
static Circle |
createCircle(double radius)
Returns a new
Circle with the given radius centered on the origin. |
static Ellipse |
createEllipse(double width,
double height)
Creates a new
Ellipse bounded by the given rectangle width and height. |
static Triangle |
createEquilateralTriangle(double height)
Creates an equilateral
Triangle with the center at the origin. |
static HalfEllipse |
createHalfEllipse(double width,
double height)
Creates a new
HalfEllipse bounded by the given rectangle width and height. |
static HalfEllipse |
createHalfEllipseAtOrigin(double width,
double height)
Creates a new
HalfEllipse bounded by the given rectangle width and height. |
static Segment |
createHorizontalSegment(double length)
Creates a new
Segment with the given length with the center
at the origin. |
static Triangle |
createIsoscelesTriangle(double width,
double height)
Creates an isosceles
Triangle with the center at the origin. |
static Polygon |
createPolygon(Vector2... vertices)
Returns a new
Polygon with the given vertices. |
static Polygon |
createPolygonalCapsule(int count,
double width,
double height)
Creates a new
Polygon in the shape of a capsule using count number of vertices on each
cap, centered on the origin. |
static Polygon |
createPolygonalCircle(int count,
double radius)
Creates a new
Polygon in the shape of a circle with count number of vertices centered
on the origin. |
static Polygon |
createPolygonalCircle(int count,
double radius,
double theta)
Creates a new
Polygon in the shape of a circle with count number of vertices centered
on the origin. |
static Polygon |
createPolygonalEllipse(int count,
double width,
double height)
Creates a new
Polygon in the shape of an ellipse with count number of vertices centered
on the origin. |
static Polygon |
createPolygonalHalfEllipse(int count,
double width,
double height)
Creates a new
Polygon in the shape of a half ellipse with count number of vertices with the
base at the origin. |
static Polygon |
createPolygonalHalfEllipseAtOrigin(int count,
double width,
double height)
Creates a new
Polygon in the shape of a half ellipse with count number of vertices centered
on the origin. |
static Polygon |
createPolygonalSlice(int count,
double radius,
double theta)
|
static Polygon |
createPolygonalSliceAtOrigin(int count,
double radius,
double theta)
|
static Polygon |
createPolygonAtOrigin(Vector2... vertices)
Returns a new
Polygon , using the given vertices, centered at the origin. |
static Rectangle |
createRectangle(double width,
double height)
Creates a new
Rectangle with the given width and height centered at the origin. |
static Triangle |
createRightTriangle(double width,
double height)
Creates a right
Triangle with the center at the origin. |
static Triangle |
createRightTriangle(double width,
double height,
boolean mirror)
Creates a right
Triangle with the center at the origin. |
static Segment |
createSegment(Vector2 end)
Creates a new
Segment from the origin to the given end point |
static Segment |
createSegment(Vector2 p1,
Vector2 p2)
Creates a new
Segment with the given points. |
static Segment |
createSegmentAtOrigin(Vector2 p1,
Vector2 p2)
Creates a new
Segment with the given points. |
static Slice |
createSlice(double radius,
double theta)
Creates a new
Slice with the given circle radius and arc length theta. |
static Slice |
createSliceAtOrigin(double radius,
double theta)
Creates a new
Slice with the given circle radius and arc length theta. |
static Rectangle |
createSquare(double size)
Creates a square (equal height and width
Rectangle ) with the given size
centered at the origin. |
static Triangle |
createTriangle(Vector2 p1,
Vector2 p2,
Vector2 p3)
Creates a new
Triangle , using the given points. |
static Triangle |
createTriangleAtOrigin(Vector2 p1,
Vector2 p2,
Vector2 p3)
Creates a new
Triangle with the given points centered at the origin. |
static Polygon |
createUnitCirclePolygon(int count,
double radius)
Returns a new
Polygon object with count number of points, where the
points are evenly distributed around the unit circle. |
static Polygon |
createUnitCirclePolygon(int count,
double radius,
double theta)
Returns a new
Polygon object with count number of points, where the
points are evenly distributed around the unit circle. |
static Segment |
createVerticalSegment(double length)
Creates a new
Segment with the given length with the center
at the origin. |
static Polygon |
flip(Polygon polygon,
Vector2 axis)
Flips the given polygon about the given line and returns the result
as a new polygon.
|
static Polygon |
flip(Polygon polygon,
Vector2 axis,
Vector2 point)
Flips the given polygon about the given line and returns the result
as a new polygon.
|
static Polygon |
flipAlongTheXAxis(Polygon polygon)
Flips the given polygon about its center along the x-axis and
returns the result as a new polygon.
|
static Polygon |
flipAlongTheXAxis(Polygon polygon,
Vector2 point)
Flips the given polygon about the given point along the x-axis and
returns the result as a new polygon.
|
static Polygon |
flipAlongTheYAxis(Polygon polygon)
Flips the given polygon about its center along the y-axis and
returns the result as a new polygon.
|
static Polygon |
flipAlongTheYAxis(Polygon polygon,
Vector2 point)
Flips the given polygon about the given point along the y-axis and
returns the result as a new polygon.
|
static Vector2 |
getAreaWeightedCenter(java.util.List<Vector2> points)
Returns the area weighted centroid for the given points.
|
static Vector2 |
getAreaWeightedCenter(Vector2... points)
Returns the area weighted centroid for the given points.
|
static Vector2 |
getAverageCenter(java.util.List<Vector2> points)
Returns the centroid of the given points by performing an average.
|
static Vector2 |
getAverageCenter(Vector2... points)
Returns the centroid of the given points by performing an average.
|
static double |
getWinding(java.util.List<Vector2> points)
Returns the winding, Clockwise or Counter-Clockwise, for the given
list of points of a polygon.
|
static double |
getWinding(Vector2... points)
Returns the winding, Clockwise or Counter-Clockwise, for the given
array of points of a polygon.
|
static Polygon |
minkowskiSum(Circle circle,
Polygon polygon,
int count)
|
static <E extends Wound & Convex> |
minkowskiSum(E convex1,
E convex2)
Returns the Minkowski Sum of the given convex shapes.
|
static Polygon |
minkowskiSum(Polygon polygon,
Circle circle,
int count)
|
static Polygon |
minkowskiSum(Polygon polygon,
double radius,
int count)
Returns a new polygon that has been radially expanded.
|
static void |
reverseWinding(java.util.List<Vector2> points)
Reverses the order of the polygon points within the given list.
|
static void |
reverseWinding(Vector2... points)
Reverses the order of the polygon points within the given array.
|
static Capsule |
scale(Capsule capsule,
double scale)
Returns a scaled version of the given capsule.
|
static Circle |
scale(Circle circle,
double scale)
Returns a scaled version of the given circle.
|
static Ellipse |
scale(Ellipse ellipse,
double scale)
Returns a scaled version of the given ellipse.
|
static HalfEllipse |
scale(HalfEllipse halfEllipse,
double scale)
Returns a scaled version of the given half-ellipse.
|
static Polygon |
scale(Polygon polygon,
double scale)
Returns a scaled version of the given polygon.
|
static Segment |
scale(Segment segment,
double scale)
Returns a scaled version of the given segment.
|
static Slice |
scale(Slice slice,
double scale)
Returns a scaled version of the given slice.
|
public static final double TWO_PI
public static final double getWinding(java.util.List<Vector2> points)
This method determines the winding by computing a signed "area".
points
- the points of a polygonjava.lang.NullPointerException
- if points is null or an element of points is nulljava.lang.IllegalArgumentException
- if points contains less than 2 elementspublic static final double getWinding(Vector2... points)
points
- the points of a polygonjava.lang.NullPointerException
- if points is null or an element of points is nulljava.lang.IllegalArgumentException
- if points contains less than 2 elementspublic static final void reverseWinding(Vector2... points)
This method performs a simple array reverse.
points
- the polygon pointsjava.lang.NullPointerException
- if points is nullpublic static final void reverseWinding(java.util.List<Vector2> points)
This method performs a simple list reverse.
points
- the polygon pointsjava.lang.NullPointerException
- if points is nullpublic static final Vector2 getAverageCenter(java.util.List<Vector2> points)
points
- the list of pointsVector2
the centroidjava.lang.NullPointerException
- if points is null or an element of points is nulljava.lang.IllegalArgumentException
- if points is an empty listpublic static final Vector2 getAverageCenter(Vector2... points)
points
- the array of pointsVector2
the centroidjava.lang.NullPointerException
- if points is null or an element of points is nulljava.lang.IllegalArgumentException
- if points is an empty arraygetAverageCenter(List)
public static final Vector2 getAreaWeightedCenter(java.util.List<Vector2> points)
A Polygon
's centroid must be computed by the area weighted method since the
average method can be bias to one side if there are more points on that one
side than another.
Finding the area of a Polygon
can be done by using the following
summation:
0.5 * ∑(xi * yi + 1 - xi + 1 * yi)Finding the area weighted centroid can be done by using the following summation:
1 / (6 * A) * ∑(pi + pi + 1) * (xi * yi + 1 - xi + 1 * yi)
public static final Vector2 getAreaWeightedCenter(Vector2... points)
points
- the Polygon
pointsVector2
the area weighted centroidjava.lang.NullPointerException
- if points is null or an element of points is nulljava.lang.IllegalArgumentException
- if points is emptygetAreaWeightedCenter(List)
public static final Circle createCircle(double radius)
Circle
with the given radius centered on the origin.radius
- the radius in metersCircle
java.lang.IllegalArgumentException
- if radius is less than or equal to zeropublic static final Polygon createPolygon(Vector2... vertices)
Polygon
with the given vertices.
This method makes a copy of both the array and the vertices within the array to
create the new Polygon
.
The center of the Polygon
will be computed using the area weighted method.
vertices
- the array of verticesPolygon
java.lang.NullPointerException
- if vertices is null or an element of vertices is nulljava.lang.IllegalArgumentException
- if vertices contains less than 3 non-null verticesto create a new {@link Polygon} that is centered on the origin
public static final Polygon createPolygonAtOrigin(Vector2... vertices)
Polygon
, using the given vertices, centered at the origin.
This method makes a copy of both the array and the vertices within the array to
create the new Polygon
.
This method translates the Polygon
vertices so that the center is at the origin.
vertices
- the array of verticesPolygon
java.lang.NullPointerException
- if vertices is null or an element of vertices is nulljava.lang.IllegalArgumentException
- if vertices contains less than 3 non-null verticespublic static final Polygon createUnitCirclePolygon(int count, double radius)
Polygon
object with count number of points, where the
points are evenly distributed around the unit circle. The resulting Polygon
will be centered on the origin.
The radius parameter is the distance from the center of the polygon to each vertex.
count
- the number of verticesradius
- the radius from the center to each vertex in metersPolygon
java.lang.IllegalArgumentException
- if count is less than 3 or radius is less than or equal to zerocreateUnitCirclePolygon(int, double, double)
,
createPolygonalCircle(int, double)
,
createPolygonalCircle(int, double, double)
public static final Polygon createUnitCirclePolygon(int count, double radius, double theta)
Polygon
object with count number of points, where the
points are evenly distributed around the unit circle. The resulting Polygon
will be centered on the origin.
The radius parameter is the distance from the center of the polygon to each vertex.
The theta parameter is a vertex angle offset used to rotate all the vertices by the given amount.
count
- the number of verticesradius
- the radius from the center to each vertex in meterstheta
- the vertex angle offset in radiansPolygon
java.lang.IllegalArgumentException
- if count is less than 3 or radius is less than or equal to zerocreatePolygonalCircle(int, double, double)
public static final Rectangle createSquare(double size)
Rectangle
) with the given size
centered at the origin.size
- the size in metersRectangle
java.lang.IllegalArgumentException
- if size is less than or equal to zeropublic static final Rectangle createRectangle(double width, double height)
Rectangle
with the given width and height centered at the origin.width
- the width in metersheight
- the height in metersRectangle
java.lang.IllegalArgumentException
- if width or height is less than or equal to zeropublic static final Triangle createTriangle(Vector2 p1, Vector2 p2, Vector2 p3)
Triangle
, using the given points.
This method makes a copy of the given points to create the Triangle
.
The center of the Triangle
will be computed using the area weighted method.
p1
- the first pointp2
- the second pointp3
- the third pointTriangle
java.lang.NullPointerException
- if p1, p2, or p3 is nullto create a new {@link Triangle} that is centered on the origin
public static final Triangle createTriangleAtOrigin(Vector2 p1, Vector2 p2, Vector2 p3)
Triangle
with the given points centered at the origin.
This method makes a copy of the given points to create the Triangle
.
p1
- the first pointp2
- the second pointp3
- the third pointTriangle
java.lang.NullPointerException
- if p1, p2, or p3 is nullpublic static final Triangle createRightTriangle(double width, double height)
Triangle
with the center at the origin.width
- the width of the base in metersheight
- the height in metersTriangle
java.lang.IllegalArgumentException
- if width or height is less than or equal to zeropublic static final Triangle createRightTriangle(double width, double height, boolean mirror)
Triangle
with the center at the origin.width
- the width of the base in metersheight
- the height in metersmirror
- true if the triangle should be mirrored along the y-axisTriangle
java.lang.IllegalArgumentException
- if width or height is less than or equal to zeropublic static final Triangle createEquilateralTriangle(double height)
Triangle
with the center at the origin.height
- the height of the triangle in metersTriangle
java.lang.IllegalArgumentException
- if height is less than or equal to zeropublic static final Triangle createIsoscelesTriangle(double width, double height)
Triangle
with the center at the origin.width
- the width of the base in metersheight
- the height in metersTriangle
java.lang.IllegalArgumentException
- if width or height is less than or equal to zeropublic static final Segment createSegment(Vector2 p1, Vector2 p2)
Segment
with the given points.
This method makes a copy of the given points to create the Segment
.
The center of the Segment
will be the average of the two points.
p1
- the first pointp2
- the second pointSegment
java.lang.NullPointerException
- if p1 or p2 is nullto create a {@link Segment} centered on the origin
public static final Segment createSegmentAtOrigin(Vector2 p1, Vector2 p2)
Segment
with the given points.
This method makes a copy of the given points to create the Segment
.
This method translates the Segment
vertices so that the center is at the origin.
p1
- the first pointp2
- the second pointSegment
java.lang.NullPointerException
- if p1 or p2 is nullpublic static final Segment createSegment(Vector2 end)
Segment
from the origin to the given end point
This method makes a copy of the given point to create the Segment
.
end
- the end pointSegment
java.lang.NullPointerException
- if end is nullpublic static final Segment createHorizontalSegment(double length)
Segment
with the given length with the center
at the origin.
Renamed from createSegment(double).
length
- the length of the segment in metersSegment
java.lang.IllegalArgumentException
- if length is less than or equal to zeropublic static final Segment createVerticalSegment(double length)
Segment
with the given length with the center
at the origin.length
- the length of the segment in metersSegment
java.lang.IllegalArgumentException
- if length is less than or equal to zeropublic static final Capsule createCapsule(double width, double height)
Capsule
bounded by the given rectangle width and height.
The capsule will be axis-aligned and centered on the origin with the caps on the ends of the largest dimension.
If width and height are equal use a Circle
shape instead.
width
- the bounding rectangle widthheight
- the bounding rectangle heightCapsule
java.lang.IllegalArgumentException
- if width or height are less than or equal to zeropublic static final Slice createSlice(double radius, double theta)
Slice
with the given circle radius and arc length theta.
A Slice
is an arbitrary slice of a circle. The specified radius is the radius
of the circle. The slice will be positioned with the circle center on the origin.
Theta is the total arc length of the slice specified in radians. Theta is halved, putting half the arc length below the x-axis and half above.
Theta cannot be greater than π.
radius
- the circle radiustheta
- the total arc length in radiansSlice
java.lang.IllegalArgumentException
- if radius is less than or equal to zero; if theta is less than or equal to zero or is greater than πpublic static final Slice createSliceAtOrigin(double radius, double theta)
Slice
with the given circle radius and arc length theta.
A Slice
is an arbitrary slice of a circle. The specified radius is the radius
of the circle. The slice will be positioned with the centroid at the origin.
Theta is the total arc length of the slice specified in radians. Theta is halved, putting half the arc length below the x-axis and half above.
Theta cannot be greater than π.
radius
- the circle radiustheta
- the total arc length in radiansSlice
java.lang.IllegalArgumentException
- if radius is less than or equal to zero; if theta is less than or equal to zero or is greater than πpublic static final Ellipse createEllipse(double width, double height)
Ellipse
bounded by the given rectangle width and height.
The ellipse will be axis-aligned and centered on the origin.
If width and height are equal use a Circle
shape instead.
width
- the bounding rectangle widthheight
- the bounding rectangle heightEllipse
java.lang.IllegalArgumentException
- if width or height are less than or equal to zeropublic static final HalfEllipse createHalfEllipse(double width, double height)
HalfEllipse
bounded by the given rectangle width and height.
The ellipse will be axis-aligned with the base of the half ellipse on the x-axis. The given height is the height of the half, not the height of the full ellipse.
If width and height are equal use a Slice
shape with theta = Math.PI
instead.
width
- the bounding rectangle widthheight
- the bounding rectangle heightHalfEllipse
java.lang.IllegalArgumentException
- if width or height are less than or equal to zeropublic static final HalfEllipse createHalfEllipseAtOrigin(double width, double height)
HalfEllipse
bounded by the given rectangle width and height.
The ellipse will be axis-aligned with the base of the half ellipse on the x-axis. The given height is the height of the half, not the height of the full ellipse.
If width and height are equal use a Slice
shape with theta = Math.PI
instead.
width
- the bounding rectangle widthheight
- the bounding rectangle heightHalfEllipse
java.lang.IllegalArgumentException
- if width or height are less than or equal to zeropublic static final Polygon createPolygonalCircle(int count, double radius)
Polygon
in the shape of a circle with count number of vertices centered
on the origin.count
- the number of vertices to use; must be greater than 2radius
- the radius of the circle; must be greater than zeroPolygon
java.lang.IllegalArgumentException
- thrown if count is less than 3 or the radius is less than or equal to zeropublic static final Polygon createPolygonalCircle(int count, double radius, double theta)
Polygon
in the shape of a circle with count number of vertices centered
on the origin.count
- the number of vertices to use; must be greater than or equal to 3radius
- the radius of the circle; must be greater than zerotheta
- the radial offset for the points in radiansPolygon
java.lang.IllegalArgumentException
- thrown if count is less than 3 or the radius is less than or equal to zeropublic static final Polygon createPolygonalSlice(int count, double radius, double theta)
Polygon
in the shape of a Slice
with count number of vertices with the
circle center centered on the origin.
This method returns a polygon with count + 3 vertices.
count
- the number of vertices to use; must be greater than or equal to 1radius
- the radius of the circle; must be greater than zerotheta
- the arc length of the slice in radians; must be greater than zeroPolygon
java.lang.IllegalArgumentException
- thrown if count is less than 1 or the radius is less than or equal to zero or theta is less than or equal to zeropublic static final Polygon createPolygonalSliceAtOrigin(int count, double radius, double theta)
Polygon
in the shape of a Slice
with count number of vertices centered on the origin.
This method returns a polygon with count + 3 vertices.
count
- the number of vertices to use; must be greater than or equal to 1radius
- the radius of the circle; must be greater than zerotheta
- the arc length of the slice in radians; must be greater than zeroPolygon
java.lang.IllegalArgumentException
- thrown if count is less than 1 or the radius is less than or equal to zero or theta is less than or equal to zeropublic static final Polygon createPolygonalEllipse(int count, double width, double height)
Polygon
in the shape of an ellipse with count number of vertices centered
on the origin.
The count should be greater than or equal to 4 and a multiple of 2. If not, the returned polygon will have count - 1 vertices.
count
- the number of vertices to use; must be greater than or equal to 4; should be even, if not, count - 1 vertices will be generatedwidth
- the width of the ellipseheight
- the height of the ellipsePolygon
java.lang.IllegalArgumentException
- thrown if count is less than 4 or the width or height are less than or equal to zeropublic static final Polygon createPolygonalHalfEllipse(int count, double width, double height)
Polygon
in the shape of a half ellipse with count number of vertices with the
base at the origin.
Returns a polygon with count + 2 vertices.
The height is the total height of the half not the half height.
count
- the number of vertices to use; must be greater than or equal to 1width
- the width of the half ellipseheight
- the height of the half ellipse; should be the total heightPolygon
java.lang.IllegalArgumentException
- thrown if count is less than 1 or the width or height are less than or equal to zeropublic static final Polygon createPolygonalHalfEllipseAtOrigin(int count, double width, double height)
Polygon
in the shape of a half ellipse with count number of vertices centered
on the origin.
Returns a polygon with count + 2 vertices.
The height is the total height of the half not the half height.
count
- the number of vertices to use; should be even, if not, count - 1 vertices will be generatedwidth
- the width of the half ellipseheight
- the height of the half ellipse; should be the total heightPolygon
java.lang.IllegalArgumentException
- thrown if count is less than 1 or the width or height are less than or equal to zeropublic static final Polygon createPolygonalCapsule(int count, double width, double height)
Polygon
in the shape of a capsule using count number of vertices on each
cap, centered on the origin. The caps will be on the ends of the largest dimension.
The returned polygon will have 4 + 2 * count number of vertices.
count
- the number of vertices to use for one cap; must be greater than or equal to 1width
- the bounding rectangle widthheight
- the bounding rectangle heightPolygon
public static final java.util.List<Vector2> cleanse(java.util.List<Vector2> points)
This method ensures the polygon has CCW winding, removes colinear vertices, and removes coincident vertices.
If the given list is empty, the list is returned.
points
- the list polygon pointsVector2
>java.lang.NullPointerException
- if points is null or if points contains null elementspublic static final Vector2[] cleanse(Vector2... points)
This method ensures the polygon has CCW winding, removes colinear vertices, and removes coincident vertices.
points
- the list polygon pointsVector2
[]java.lang.NullPointerException
- if points is null or points contains null elementspublic static final Polygon flipAlongTheXAxis(Polygon polygon)
This method assumes that the line is through the origin.
polygon
- the polygon to flipPolygon
java.lang.NullPointerException
- if the given polygon is nullflip(Polygon, Vector2)
,
flip(Polygon, Vector2, Vector2)
public static final Polygon flipAlongTheYAxis(Polygon polygon)
This method assumes that the line is through the origin.
polygon
- the polygon to flipPolygon
java.lang.NullPointerException
- if the given polygon is nullflip(Polygon, Vector2)
,
flip(Polygon, Vector2, Vector2)
public static final Polygon flipAlongTheXAxis(Polygon polygon, Vector2 point)
polygon
- the polygon to flippoint
- the point to flip aboutPolygon
java.lang.NullPointerException
- if the given polygon is nullflip(Polygon, Vector2)
,
flip(Polygon, Vector2, Vector2)
public static final Polygon flipAlongTheYAxis(Polygon polygon, Vector2 point)
polygon
- the polygon to flippoint
- the point to flip aboutPolygon
java.lang.NullPointerException
- if the given polygon is nullflip(Polygon, Vector2)
,
flip(Polygon, Vector2, Vector2)
public static final Polygon flip(Polygon polygon, Vector2 axis)
This method assumes that the line is through the origin.
polygon
- the polygon to flipaxis
- the axis to flip aboutPolygon
java.lang.NullPointerException
- if the given polygon or axis is nulljava.lang.IllegalArgumentException
- if the given axis is the zero vectorflip(Polygon, Vector2, Vector2)
public static final Polygon flip(Polygon polygon, Vector2 axis, Vector2 point)
polygon
- the polygon to flipaxis
- the axis to flip aboutpoint
- the point to flip about; if null, the polygon center is usedPolygon
java.lang.NullPointerException
- if the given polygon or axis is nulljava.lang.IllegalArgumentException
- if the given axis is the zero vectorpublic static final <E extends Wound & Convex> Polygon minkowskiSum(E convex1, E convex2)
This method computes the Minkowski Sum in O(n + m) time where n and m are the number of vertices of the first and second convex respectively.
This method accepts any Convex
Wound
shape which basically means
Polygon
s or Segment
s.
This method throws an IllegalArgumentException if two Segment
s are supplied
that are colinear (in this case the resulting Minkowski Sum would be another segment
rather than a polygon).
public static final Polygon minkowskiSum(Circle circle, Polygon polygon, int count)
Polygon
and Circle
.
Use the count parameter to specify the number of vertices to use per round corner.
If the given polygon has n number of vertices, the returned polygon will have n * 2 + n * count number of vertices.
This method is O(n) where n is the number of vertices in the given polygon.
polygon
- the polygoncircle
- the circle to add to the polygoncount
- the number of vertices to add for each rounded corner; must be greater than zeroPolygon
java.lang.NullPointerException
- if the given polygon or circle is nulljava.lang.IllegalArgumentException
- if the given radius or count is less than or equal to zerominkowskiSum(Polygon, double, int)
public static final Polygon minkowskiSum(Polygon polygon, Circle circle, int count)
Polygon
and Circle
.
Use the count parameter to specify the number of vertices to use per round corner.
If the given polygon has n number of vertices, the returned polygon will have n * 2 + n * count number of vertices.
This method is O(n) where n is the number of vertices in the given polygon.
polygon
- the polygoncircle
- the circle to add to the polygoncount
- the number of vertices to add for each rounded corner; must be greater than zeroPolygon
java.lang.NullPointerException
- if the given polygon or circle is nulljava.lang.IllegalArgumentException
- if the given radius or count is less than or equal to zerominkowskiSum(Polygon, double, int)
public static final Polygon minkowskiSum(Polygon polygon, double radius, int count)
Use the count parameter to specify the number of vertices to use per round corner.
If the given polygon has n number of vertices, the returned polygon will have n * 2 + n * count number of vertices.
This method is O(n) where n is the number of vertices in the given polygon.
polygon
- the polygon to expand radiallyradius
- the radial expansion; must be greater than zerocount
- the number of vertices to add for each rounded corner; must be greater than zeroPolygon
java.lang.NullPointerException
- if the given polygon is nulljava.lang.IllegalArgumentException
- if the given radius or count is less than or equal to zeropublic static final Circle scale(Circle circle, double scale)
circle
- the circlescale
- the scale; must be greater than zeroCircle
java.lang.NullPointerException
- if the given circle is nulljava.lang.IllegalArgumentException
- if the given scale is less than or equal to zeropublic static final Capsule scale(Capsule capsule, double scale)
capsule
- the capsulescale
- the scale; must be greater than zeroCapsule
java.lang.NullPointerException
- if the given capsule is nulljava.lang.IllegalArgumentException
- if the given scale is less than or equal to zeropublic static final Ellipse scale(Ellipse ellipse, double scale)
ellipse
- the ellipsescale
- the scale; must be greater than zeroEllipse
java.lang.NullPointerException
- if the given ellipse is nulljava.lang.IllegalArgumentException
- if the given scale is less than or equal to zeropublic static final HalfEllipse scale(HalfEllipse halfEllipse, double scale)
halfEllipse
- the half-ellipsescale
- the scale; must be greater than zeroHalfEllipse
java.lang.NullPointerException
- if the given half-ellipse is nulljava.lang.IllegalArgumentException
- if the given scale is less than or equal to zeropublic static final Slice scale(Slice slice, double scale)
slice
- the slicescale
- the scale; must be greater than zeroSlice
java.lang.NullPointerException
- if the given slice is nulljava.lang.IllegalArgumentException
- if the given scale is less than or equal to zeropublic static final Polygon scale(Polygon polygon, double scale)
polygon
- the polygonscale
- the scale; must be greater than zeroPolygon
java.lang.NullPointerException
- if the given polygon is nulljava.lang.IllegalArgumentException
- if the given scale is less than or equal to zeropublic static final Segment scale(Segment segment, double scale)
segment
- the segmentscale
- the scale; must be greater than zeroSegment
java.lang.NullPointerException
- if the given segment is nulljava.lang.IllegalArgumentException
- if the given scale is less than or equal to zero


Open message window
This is the partial for view 2.
Showing of 'interpolate' filter: {{ 'Current version is v%VERSION%.' | interpolate }}


Making things, improving things and learning skills are my main hobbies. Whether I am building applications, designing visual imagery and graphic design projects, or making clothes for my friends dogs, I love giving people that moment of suprise with what I deliver.


Jacopo De Stefani
"Science is what we understand well enough to explain to a computer. Art is everything else we do." -- D.Knuth
I am a Lecturer in the Faculty of Technology, Policy and Management, Departement Engineering, Systems and Services, ICT section at TUDelft and PhD student in the Machine Learning Group of the ULB under the supervision of Prof. Gianluca Bontempi.
Currently working on the multivariate and multistep ahead forecasting of time series employing different strategies combining statistical and machine learning techniques.
Research interests
- Time series analysis
- Performance scalability
- Computing efficiency / Forecast quality tradeoff
- Data visualization
- Big Data, Hadoop, Spark
- Deep learning
- Open data
- Internet of things


ABOUT ME
My name is Eshita Gupta. I am an Engineering Student and a sucker for Creativity. I am pursuing B.E in Computer Science and i like to code and make stuff look good.
MY EXPERIENCE
I've been actively participating in various college technical events, and have gained a lot of experience and confidence during the process. Also, besides being involved in technical stuff, i have gained acting and drumming experience in SWASTIK theatre group for 2 years and bought laurels to our college. i've been a member of YANTRIX, technical club of our college and a co-founder of PLATFORM TECH SOLN. In addition to all this, i've worked with NSS and been a active member of RHA india NGO. I conducted workshops for my juniors for keeping them updated with new softwares.
Web Development
Started as website designer with platform. Eventually shifted towards developing websites and web apps.
Photography
My passion, interest and hobby and also a skill which i am proud of.
Video Editing
Made some of video editing samples for college events, teasers and intro videos for events, which people liked a lot.
Graphic Design
Since childhood, art has inspired and mesmerised me. I appreciate art and artists of all kind. And i like producing art too. Worked for around 2 years as a graphic designer and learnt a lot during the process.
Freelance Illustrator
A new start with old hobby, i now create art for others too.
Actor
Worked as an actor in SWASTIK theatre group, one of the best theatre groups of north ( now known as SHOR ), this is the official theatre group of our college. During this time, i learned a lot many skills, won trophies and hearts. Worked as part-time drummer too.
MY PORTFOLIO
- All
- Web Development and Web Apps
- Photography
- Video Editing
- Graphic Designing
- Freelance Illustrator
- Swastik
WANNA KNOW MORE?
CONTACT ME
In case you liked my portfolio, ping me! you can find me here..
Sector-18,Panchkula,Haryana IN
+91<PHONE_NUMBER>
+91<PHONE_NUMBER>
geshita03@gmail.com