jwezorek.com Report : Visit Site

Technical data of the jwezorek.com

Geo IP provides you such as latitude, longitude and ISP (Internet Service Provider) etc. informations. Our GeoIP service found where is host jwezorek.com. Currently, hosted in United States and its service provider is GoDaddy.com LLC .

HTTP Header Analysis

HTTP Header information is a part of HTTP protocol that a user's browser sends to called Apache containing the details of what the browser wants and will accept back from the web server.

DNS

HtmlToText

basic convex hull in c# transliterated from java found here : class convexhull { public static double cross(point o, point a, point b) { return (a.x - o.x) * (b.y - o.y) - (a.y - o.y) * (b.x - o.x); } public static list<point> getconvexhull(list<point> points) { if (points == null) return null; if (points.count() <= 1) return points; int n = points.count(), k = 0; list<point> h = new list<point>(new point[2 * n]); points.sort((a, b) => a.x == b.x ? a.y.compareto(b.y) : a.x.compareto(b.x)); // build lower hull for (int i = 0; i < n; ++i) { while (k >= 2 && cross(h[k - 2], h[k - 1], points[i]) <= 0) k--; h[k++] = points[i]; } // build upper hull for (int i = n - 2, t = k + 1; i >= 0; i--) { while (k >= t && cross(h[k - 2], h[k - 1], points[i]) <= 0) k--; h[k++] = points[i]; } return h.take(k - 1).tolist(); } } september 12th, 2017 | uncategorized | 0 comments “triangular life” recently i looked through a bunch of triangular cellular automata in which each (1) uses two states, (2) uses the simple alive cell count type of rule, and (3) uses the neighborhood around a cell c that is all the triangles that share a vertex with c ; that is, the 12 shaded triangles below are the neighborhood around the yellow triangle: these cellular automata have state tables that can be thought of as 13 rows of 2 columns: there are 12 possible non-zero alive cell counts plus thee zero count and each of these counts can map to either alive or dead in the next generation depending on whether the cell in the current generation is alive or dead (column 1 or column 2). i looked at each of the 4096 cellular automata you get by filling the third through eighth rows of these state tables with each possible allocations of 0s and 1s and letting all other rows contain zeros. a handful of these 4096 feature the spontaneous generation of gliders but one rule is clearly the triangular analog of conway’s life. i have no idea if this rule has been described before in the literature but it is the following: on a triangular grid if a cell is dead and it has exactly four or six vertex-adjacent alive neighbors then it alive in the next generation. if a cell is alive and it has four to six vertex-adjacent alive neighbors, inclusive, then it remains alive in the next generation. otherwise it is dead in the next generation. the above has a glider shown below that is often randomly generated and exhibits bounded growth. here it running in jack kutilek’s web-based ca player: no iframe support! tri life gliders are slightly rarer than in conway life because they are bigger in terms of number of alive cells in each glider “frame”. if you don’t see a glider in the above, stir it up by dragging in the window. july 25th, 2017 | cellular automata , mathematics | 0 comments rhombo over the past couple of weeks i wrote some code in c# to generate dissections of the rhombic triacontahedron into golden rhombohedrons. george hart discusses these types of dissections here and also talks about the problem of enumerating them in an appendix here — briefly, all this material by hart and others is about how the fact that the rhombic triacontahedron and the rhombic enneacontahedron are zonohedra lead to both having interesting combinatoric properties which can be explored by coloring their dissections. i was, however, more interested in how such dissections could be turned into an interlocking puzzle, akin to a traditional burr puzzle . amd as such needed code to generate 3d models of the dissections. my generation code is a dumb, constructive, brute force approach in which i just traverse the search space adding rhombohedrons to a candidate dissection in progress and backtracking when reaching a state in which it is impossible to add a rhombohedron without intersecting the one that was already added or the containing triacontahedron, keeping track of configurations that have already been explored. dissections of the rhombic triacontahedron into golden rhombohedrons (hereafter “blocks”) turns out to always need 10 and 10 of the two types of blocks that hart refers to in the above as the “pointy” and “flat” varieties (and which i refer to as yellow and blue). further it turns out that in all of these dissections there are four blocks that are completely internal, i.e. sharing no face with the triacontahedron; i also believe that the four internal blocks are always three blue and one yellow, but i’m not sure about that. my strategy for finding an interlocking puzzle was the following: generate a bunch of raw dissections into blocks for each dissection, search the adjacency graph for four pieces, the union of sets of five blocks, such that each piece forms a simple path in the dissection; that is, each block in the piece is either an end block that is face adjacent to a next or previous block in the piece or is a non-end block that is face adjacent to a next block and a previous block. and does not share any edges with other blocks in the piece except for the edges of the face adjacencies. each piece contains at least one fully internal block. each piece is “single axis disentangle-able” from each other piece, where we mean by that that there exists some edge e in the complete construction such that if given piece p1 and piece p2 , if you offset p1 in the direction of e by a small amount p1 does not intersect p2 . each piece is not single axis disentangle-able from the union of the other three pieces. i never managed to succeed in doing a complete enumeration, generating all of the dissections for reasons that i don’t feel like going into. (as i said above, i did not do anything fancy and it would be easier to just be smarter about how i do the generation than to make what i have more efficient; i.e. could have done the george hart algorithm if i had known abouyt that or there are ways of transforming one dissection into another that i don’t do — i do an exhaustive search, period — but i never did the smarter stuff because i found what i was looking for, see below) but from about 10 dissections i found one set of pieces that uniquely satisfies all of the above: here’s some video. (the individual blocks were 3d printed and super glued together) http://jwezorek.com/wp-content/uploads/2017/07/rhombo.mp4 i’m calling the above “rhombo”. those pieces are rough because i only 3d printed the individual rhombohedrons and then superglued them together into the pieces, which is imprecise. i had to sand them heavily to get them to behave nicely. i’ll eventually put full piece models up on shapeways. in the course of doing this work, it became apparent that there is no good computational geometry library for c# to use for something like this. there is one called math.net numerics along with math.net spatial that will get you vectors and matrices but not with all the convenience routines you’d expect to treat vectors like 3d points and so forth. what i ended up doing was extracting the vectors and matrices out of monogame and search-and-replacing “float” to “double” to get double precision. here is that code on github . i also included in there 3d line segment/line segment intersection code and 3d triangle/triangle intersection code which i transliterated to c#. the line segment intersection code came from paul bourke’s web site. and the triangle intersection code came from running tomas moller’s c code through just a c preprocessor to resolve all the macros and then transliterating the result to c#. july 5th, 2017 | algorithms , c# , computational geometry , mathematics , programming | 0 comments basic signals & slots in c++ i put up some code on github that implements basic signals and slots functionality using standards compliant c++. it’s one header file “signals.hpp”. see here: link to github this implementation of signals is a re-work of some code by a user _pi on the forums for the cross-platform application framework juce — that thread is here — which was

URL analysis for jwezorek.com

http://jwezorek.com/zzazzy/
http://jwezorek.com/2016/07/mean-shift-segmentation-in-opencv/
http://jwezorek.com/topics/uncategorized/
http://jwezorek.com/topics/trivia/
http://jwezorek.com/2017/09/
http://jwezorek.com/2017/07/
http://jwezorek.com/topics/cellular-automata/
http://jwezorek.com/2016/05/
http://jwezorek.com/2016/05/jesus-christ-internet/#respond
http://jwezorek.com/topics/computational-geometry/
http://jwezorek.com/2016/05/floodfilling-in-opencv-with-multiple-seeds/
http://jwezorek.com/topics/origami/
http://jwezorek.com/sample-page/
http://jwezorek.com/2017/05/basic-signals-slots-in-c/
http://jwezorek.com/2016/07/

Whois Information

Whois is a protocol that is access to registering information. You can reach when the website was registered, when it will be expire, what is contact details of the site with the following informations. In a nutshell, it includes these informations;

Domain Name: JWEZOREK.COM
Registry Domain ID: 1699181185_DOMAIN_COM-VRSN
Registrar WHOIS Server: whois.godaddy.com
Registrar URL: http://www.godaddy.com
Updated Date: 2019-01-29T12:09:30Z
Creation Date: 2012-01-28T17:36:33Z
Registry Expiry Date: 2020-01-28T17:36:33Z
Registrar: GoDaddy.com, LLC
Registrar IANA ID: 146
Registrar Abuse Contact Email: [email protected]
Registrar Abuse Contact Phone: 480-624-2505
Domain Status: clientDeleteProhibited https://icann.org/epp#clientDeleteProhibited
Domain Status: clientRenewProhibited https://icann.org/epp#clientRenewProhibited
Domain Status: clientTransferProhibited https://icann.org/epp#clientTransferProhibited
Domain Status: clientUpdateProhibited https://icann.org/epp#clientUpdateProhibited
Name Server: NS15.DOMAINCONTROL.COM
Name Server: NS16.DOMAINCONTROL.COM
DNSSEC: unsigned
URL of the ICANN Whois Inaccuracy Complaint Form: https://www.icann.org/wicf/
>>> Last update of whois database: 2019-05-08T22:25:43Z <<<

For more information on Whois status codes, please visit https://icann.org/epp

NOTICE: The expiration date displayed in this record is the date the
registrar's sponsorship of the domain name registration in the registry is
currently set to expire. This date does not necessarily reflect the expiration
date of the domain name registrant's agreement with the sponsoring
registrar. Users may consult the sponsoring registrar's Whois database to
view the registrar's reported date of expiration for this registration.

TERMS OF USE: You are not authorized to access or query our Whois
database through the use of electronic processes that are high-volume and
automated except as reasonably necessary to register domain names or
modify existing registrations; the Data in VeriSign Global Registry
Services' ("VeriSign") Whois database is provided by VeriSign for
information purposes only, and to assist persons in obtaining information
about or related to a domain name registration record. VeriSign does not
guarantee its accuracy. By submitting a Whois query, you agree to abide
by the following terms of use: You agree that you may use this Data only
for lawful purposes and that under no circumstances will you use this Data
to: (1) allow, enable, or otherwise support the transmission of mass
unsolicited, commercial advertising or solicitations via e-mail, telephone,
or facsimile; or (2) enable high volume, automated, electronic processes
that apply to VeriSign (or its computer systems). The compilation,
repackaging, dissemination or other use of this Data is expressly
prohibited without the prior written consent of VeriSign. You agree not to
use electronic processes that are automated and high-volume to access or
query the Whois database except as reasonably necessary to register
domain names or modify existing registrations. VeriSign reserves the right
to restrict your access to the Whois database in its sole discretion to ensure
operational stability. VeriSign may restrict or terminate your access to the
Whois database for failure to abide by these terms of use. VeriSign
reserves the right to modify these terms at any time.

The Registry database contains ONLY .COM, .NET, .EDU domains and
Registrars.

  REGISTRAR GoDaddy.com, LLC

SERVERS

  SERVER com.whois-servers.net

  ARGS domain =jwezorek.com

  PORT 43

  TYPE domain

DOMAIN

  NAME jwezorek.com

  CHANGED 2019-01-29

  CREATED 2012-01-28

STATUS
clientDeleteProhibited https://icann.org/epp#clientDeleteProhibited
clientRenewProhibited https://icann.org/epp#clientRenewProhibited
clientTransferProhibited https://icann.org/epp#clientTransferProhibited
clientUpdateProhibited https://icann.org/epp#clientUpdateProhibited

NSERVER

  NS15.DOMAINCONTROL.COM 97.74.107.8

  NS16.DOMAINCONTROL.COM 173.201.75.8

  REGISTERED yes

Mistakes

The following list shows you to spelling mistakes possible of the internet users for the website searched .