Upload 9 files

corpus/169.254.txt

@@ -0,0 +1,143 @@
+Why can't I connect with a 169.254.x.x IP address?     
+
+Search First! Then browse: Categories | Full Archive | By Date | Newsletter    
+Home � Networking � Network IP Addressing 
+
+
+Summary: 169.254.x.x IP addresses are self-assigned when your computer can't get an address any other way. It's an almost sure sign of a problem.
+
+My IP address was 192.168.x.xx, and somehow it was changed to 169.254.xx.xx. Because of this I can't access the internet. Any ideas?
+
+�
+
+Your IP address wasn't "changed" so much as it was broken.
+
+If you end up with an IP in the 169.254.x.x address range, then something is definitely wrong.
+
+�
+
+For most folks, the IP address of your computer is assigned when you boot your machine. Using DHCP, your computer asks for an IP address, and a DHCP server responds by assigning one:
+
+
+
+If you're behind a NAT router it'll be the one handing out IP addresses and you'll most commonly get an address in the 192.168.x.x range. If you're directly connected to the internet your IP address could be almost anything. Exactly what range it'll be in is defined by which IP address ranges have been assigned to your ISP.
+
+169.254.x.x, however, is special.
+
+Consider: what happens when your computer asks for an IP address and no one responds? Due to a network problem, or maybe not being on a network at all, perhaps there's no DHCP server to hand out IP addresses.
+
+What happens is this: your machine waits for a while and then gives up. But when it gives up it invokes Automatic Private IP Addressing, or APIPA, and makes up its own IP address. And those "made up" IP addresses are in the 169.254.x.x range.
+
+"It's like having an unlisted phone number that's so unlisted that even the phone company doesn't know it."Now, a 169.254.x.x IP address is pretty close to useless. The reason that IP addresses are assigned is so that the upstream networking equipment knows where to send or how to route packets that are destined to reach a machine at a particular address. In other words, when things work that equipment knows that your machine has this address. If your machine makes up its own address, no one else knows. As a result, there's no way to know how to get to your machine.
+
+It's like having an unlisted phone number that's so unlisted that even the phone company doesn't know it. No one can call you.
+
+Even connecting "out" to visit, say, a web site or other server doesn't work because there's no way to know where to send the response.
+
+In fact, the only utility I've ever found with a 169.254.x.x address is if machines are connected directly to each other, then some protocols can be made to work machine-to-machine using the IP addresses. Most, however, do not.
+
+It's frustrating enough that I consider a 169.254.x.x the same as "it's broken" and move on to resolving the underlying cause.
+
+About all you can really say from getting one of those addresses is simply that the machine cannot reach the DHCP server over the network.
+
+�If you're connected via a NAT router, then either your computer is not actually connected on the network to that router, or the router itself isn't responding to the DHCP request. I typically triple-check my cabling, and perhaps reboot the router.
+
+�If you're connected to the internet directly then there's something about that that isn't working. Check the cabling to your broadband modem, and check the cabling from your broadband modem to your telephone or cable line. And, if all else fails, call your ISP - it may be their DHCP server or some other item they control that's at fault.
+
+Bottom line: if you're getting a 169.254.x.x IP address then something about your network setup isn't working, and you probably want to investigate what and why.
+
+Share 
+Related:
+
+Helpful? Get new articles weekly by email in my FREE newsletter!
+
+Your Name: 
+Your Email: 
+
+
+Why Subscribe?
+
+         �Ask Leo! - What is DHCP?
+
+�Ask Leo! - Why doesn't my machine's IP address match what I'm told on the internet?
+
+�Ask Leo! - Why does my home network only work with one computer at a time?
+
+Article C3090 - July 18, 2007 
+
+Was this article helpful? �Yes� �No�
+
+Recent Comments
+29 Comments 
+The best way I have found this issue to be resolved if all wlse fails like 
+netsh winsock reset catalog (vista)
+or netsh winsock reset (XP)
+try resetting the TCP/IP Stack in cmd prompt which is netsh int ip reset resetlog.txt
+see if that works. Sometimes as i have learnt Winsock does not always repair the issue even though it's a last resort cmd. but resetting the tcp/ip stack can sometimes resolve this issue.
+
+Posted by: Mark H at June 23, 2009 11:11 AM 
+Hello 
+I have the same problem, But this occur in my phone 
+recently i updated the software then after i cant access WIFI in my phone . Strange thing is I can access other Wireless network & My own Pc internet is working fine . I req everybodu plz help me . My OS is vista home 
+big thanks in advance 
+
+Posted by: vikram at July 24, 2009 4:25 AM 
+Thank You, Thank You, Thank YOU to "Mark H"!!!
+I've just spend 8 hours in hell (can I say that word?), trying to revive my system from restore points and backups from (fortunately only) a week ago, but keeping track of everything ... well long story short, my problem was this "dead network" connectivity with the 169.254.x.x IP address. 
+Well, Mark H's comments to the rescue, the command: "netsh winsock reset" for my XP did the trick! I'll also look at the other command, "netsh int ip reset resetlog.txt" as I'm curious about that one. 
+Also, does anyone have more info on "WINSOCKFIX" program, is it anything more than just these two commands above? I'm leery of a downloaded program from the web (e.g. the DLL fixers) as you hear such war stories about them.
+Best Regards to all, and again THANK YOU for having a site with such valuable posting, and to Mark H for the "winning" post!
+
+Posted by: John (Andrews) at January 18, 2010 10:05 PM 
+Microsoft offers a utility that will "hard reset" an IP address that has 'defaulted' to a bad \ip address.
+
+Generally you can get the system to reconfigure itself... the issue is caused from a timing issue and static charge.. When you tell the system to reset the IP address it may not work.. do it several times.. then before trying to connect online power cycle your machine.. turn the machine completely off and even unplug it/remove battery. It may take several cycles of this.
+
+The windows utility and directions for a manual stack dump can be found here:
+
+http://support.microsoft.com/kb/299357
+
+Posted by: Ian at January 20, 2010 4:00 AM 
+I have two other laptops connecting fine. Except this one with default ip address of 169.254.145.125.. I tried the above "netsh winsock reset" and "netsh int ip reset resetlog.txt" rebooted and still not able to connect to Wireless Network for 192.168.2.1...using WinXP Svc 1.
+
+Posted by: Rachel at February 26, 2010 6:40 PM 
+See all 29 comments...
+
+
+Post a comment on "Why can't I connect with a 169.254.x.x IP address?":
+  
+Name: (Required)
+
+(Name will be included when your comment is published.)
+
+Email Address: (Required)
+
+(Email Address will not be published.)  
+
+Remember Me? YesNo
+
+ By popular demand...
+my tip jar
+
+Buy Leo a Latte!  
+Comments: (you may use HTML tags for style)
+ 
+  Subscribe to the RSS Feed specifically for comments on this article.
+ 
+
+Before commenting, please... 
+Read the article at the top of this page. If your comment shows you didn't, it'll be deleted and ignored. 
+Comment only on this article. Use the Google search box at the top of the page if you have a question about something else. 
+Don't include personal information in the comment. No email addresses. No phone numbers. No physical addresses. 
+ Don't spam. Excessive links to unrelated sites within a comment or across multiple comments will cause all such comments to be removed. 
+Don't ask me to recover lost passwords or hacked accounts. I can't, and those comments will be deleted. 
+I can't respond to every comment. And I can't vouch for the accuracy of others who do. 
+ Read Why didn't you answer my question? for hints on getting an answer. 
+By posting a comment you agree to the Terms of Service. Don't agree? Don't post. 
+Read the article at the top of this page. If your comment shows you didn't, it'll be deleted and ignored. Yes, I'm saying this twice; you'd be amazed. 
+ 
+
+  
+Please wait. Your comment is being processed ...
+
+

corpus/LICENSE - Unknown - LICENSE.txt

@@ -0,0 +1,234 @@
+Python 2.1.1 license (http://www.python.org/2.1.1/license.html)
+
+A. HISTORY OF THE SOFTWARE
+==========================
+
+Python was created in the early 1990s by Guido van Rossum at Stichting
+Mathematisch Centrum (CWI) in the Netherlands as a successor of a
+language called ABC.  Guido is Python's principal author, although it
+includes many contributions from others.  The last version released
+from CWI was Python 1.2.  In 1995, Guido continued his work on Python
+at the Corporation for National Research Initiatives (CNRI) in Reston,
+Virginia where he released several versions of the software.  Python
+1.6 was the last of the versions released by CNRI.  In 2000, Guido and
+the Python core development team moved to BeOpen.com to form the
+BeOpen PythonLabs team.  Python 2.0 was the first and only release
+from BeOpen.com.
+
+Following the release of Python 1.6, and after Guido van Rossum left
+CNRI to work with commercial software developers, it became clear that
+the ability to use Python with software available under the GNU Public
+License (GPL) was very desirable.  CNRI and the Free Software
+Foundation (FSF) interacted to develop enabling wording changes to the
+Python license.  Python 1.6.1 is essentially the same as Python 1.6,
+with a few minor bug fixes, and with a different license that enables
+later versions to be GPL-compatible.  Python 2.1 is a derivative work
+of Python 1.6.1, as well as of Python 2.0.
+
+After Python 2.0 was released by BeOpen.com, Guido van Rossum and the
+other PythonLabs developers joined Digital Creations.  All
+intellectual property added from this point on, starting with Python
+2.1 and its alpha and beta releases, is owned by the Python Software
+Foundation (PSF), a non-profit modeled after the Apache Software
+Foundation.  See http://www.python.org/psf/ for more information about
+the PSF.
+
+Thanks to the many outside volunteers who have worked under Guido's
+direction to make these releases possible.
+
+
+B. TERMS AND CONDITIONS FOR ACCESSING OR OTHERWISE USING PYTHON
+===============================================================
+
+PSF LICENSE AGREEMENT
+---------------------
+
+1. This LICENSE AGREEMENT is between the Python Software Foundation
+("PSF"), and the Individual or Organization ("Licensee") accessing and
+otherwise using Python 2.1.1 software in source or binary form and its
+associated documentation.
+
+2. Subject to the terms and conditions of this License Agreement, PSF
+hereby grants Licensee a nonexclusive, royalty-free, world-wide
+license to reproduce, analyze, test, perform and/or display publicly,
+prepare derivative works, distribute, and otherwise use Python 2.1.1
+alone or in any derivative version, provided, however, that PSF's
+License Agreement and PSF's notice of copyright, i.e., "Copyright (c)
+2001 Python Software Foundation; All Rights Reserved" are retained in
+Python 2.1.1 alone or in any derivative version prepared by Licensee.
+
+3. In the event Licensee prepares a derivative work that is based on
+or incorporates Python 2.1.1 or any part thereof, and wants to make
+the derivative work available to others as provided herein, then
+Licensee hereby agrees to include in any such work a brief summary of
+the changes made to Python 2.1.1.
+
+4. PSF is making Python 2.1.1 available to Licensee on an "AS IS"
+basis.  PSF MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR
+IMPLIED.  BY WAY OF EXAMPLE, BUT NOT LIMITATION, PSF MAKES NO AND
+DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS
+FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON 2.1.1 WILL NOT
+INFRINGE ANY THIRD PARTY RIGHTS.
+
+5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON
+2.1.1 FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS
+A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON 2.1.1,
+OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.
+
+6. This License Agreement will automatically terminate upon a material
+breach of its terms and conditions.
+
+7. Nothing in this License Agreement shall be deemed to create any
+relationship of agency, partnership, or joint venture between PSF and
+Licensee.  This License Agreement does not grant permission to use PSF
+trademarks or trade name in a trademark sense to endorse or promote
+products or services of Licensee, or any third party.
+
+8. By copying, installing or otherwise using Python 2.1.1, Licensee
+agrees to be bound by the terms and conditions of this License
+Agreement.
+
+
+BEOPEN.COM TERMS AND CONDITIONS FOR PYTHON 2.0
+----------------------------------------------
+
+BEOPEN PYTHON OPEN SOURCE LICENSE AGREEMENT VERSION 1
+
+1. This LICENSE AGREEMENT is between BeOpen.com ("BeOpen"), having an
+office at 160 Saratoga Avenue, Santa Clara, CA 95051, and the
+Individual or Organization ("Licensee") accessing and otherwise using
+this software in source or binary form and its associated
+documentation ("the Software").
+
+2. Subject to the terms and conditions of this BeOpen Python License
+Agreement, BeOpen hereby grants Licensee a non-exclusive,
+royalty-free, world-wide license to reproduce, analyze, test, perform
+and/or display publicly, prepare derivative works, distribute, and
+otherwise use the Software alone or in any derivative version,
+provided, however, that the BeOpen Python License is retained in the
+Software, alone or in any derivative version prepared by Licensee.
+
+3. BeOpen is making the Software available to Licensee on an "AS IS"
+basis.  BEOPEN MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR
+IMPLIED.  BY WAY OF EXAMPLE, BUT NOT LIMITATION, BEOPEN MAKES NO AND
+DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS
+FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE SOFTWARE WILL NOT
+INFRINGE ANY THIRD PARTY RIGHTS.
+
+4. BEOPEN SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF THE
+SOFTWARE FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS
+AS A RESULT OF USING, MODIFYING OR DISTRIBUTING THE SOFTWARE, OR ANY
+DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.
+
+5. This License Agreement will automatically terminate upon a material
+breach of its terms and conditions.
+
+6. This License Agreement shall be governed by and interpreted in all
+respects by the law of the State of California, excluding conflict of
+law provisions.  Nothing in this License Agreement shall be deemed to
+create any relationship of agency, partnership, or joint venture
+between BeOpen and Licensee.  This License Agreement does not grant
+permission to use BeOpen trademarks or trade names in a trademark
+sense to endorse or promote products or services of Licensee, or any
+third party.  As an exception, the "BeOpen Python" logos available at
+http://www.pythonlabs.com/logos.html may be used according to the
+permissions granted on that web page.
+
+7. By copying, installing or otherwise using the software, Licensee
+agrees to be bound by the terms and conditions of this License
+Agreement.
+
+
+CNRI OPEN SOURCE GPL-COMPATIBLE LICENSE AGREEMENT
+-------------------------------------------------
+
+1. This LICENSE AGREEMENT is between the Corporation for National
+Research Initiatives, having an office at 1895 Preston White Drive,
+Reston, VA 20191 ("CNRI"), and the Individual or Organization
+("Licensee") accessing and otherwise using Python 1.6.1 software in
+source or binary form and its associated documentation.
+
+2. Subject to the terms and conditions of this License Agreement, CNRI
+hereby grants Licensee a nonexclusive, royalty-free, world-wide
+license to reproduce, analyze, test, perform and/or display publicly,
+prepare derivative works, distribute, and otherwise use Python 1.6.1
+alone or in any derivative version, provided, however, that CNRI's
+License Agreement and CNRI's notice of copyright, i.e., "Copyright (c)
+1995-2001 Corporation for National Research Initiatives; All Rights
+Reserved" are retained in Python 1.6.1 alone or in any derivative
+version prepared by Licensee.  Alternately, in lieu of CNRI's License
+Agreement, Licensee may substitute the following text (omitting the
+quotes): "Python 1.6.1 is made available subject to the terms and
+conditions in CNRI's License Agreement.  This Agreement together with
+Python 1.6.1 may be located on the Internet using the following
+unique, persistent identifier (known as a handle): 1895.22/1013.  This
+Agreement may also be obtained from a proxy server on the Internet
+using the following URL: http://hdl.handle.net/1895.22/1013".
+
+3. In the event Licensee prepares a derivative work that is based on
+or incorporates Python 1.6.1 or any part thereof, and wants to make
+the derivative work available to others as provided herein, then
+Licensee hereby agrees to include in any such work a brief summary of
+the changes made to Python 1.6.1.
+
+4. CNRI is making Python 1.6.1 available to Licensee on an "AS IS"
+basis.  CNRI MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR
+IMPLIED.  BY WAY OF EXAMPLE, BUT NOT LIMITATION, CNRI MAKES NO AND
+DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS
+FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON 1.6.1 WILL NOT
+INFRINGE ANY THIRD PARTY RIGHTS.
+
+5. CNRI SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON
+1.6.1 FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS
+A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON 1.6.1,
+OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.
+
+6. This License Agreement will automatically terminate upon a material
+breach of its terms and conditions.
+
+7. This License Agreement shall be governed by the federal
+intellectual property law of the United States, including without
+limitation the federal copyright law, and, to the extent such
+U.S. federal law does not apply, by the law of the Commonwealth of
+Virginia, excluding Virginia's conflict of law provisions.
+Notwithstanding the foregoing, with regard to derivative works based
+on Python 1.6.1 that incorporate non-separable material that was
+previously distributed under the GNU General Public License (GPL), the
+law of the Commonwealth of Virginia shall govern this License
+Agreement only as to issues arising under or with respect to
+Paragraphs 4, 5, and 7 of this License Agreement.  Nothing in this
+License Agreement shall be deemed to create any relationship of
+agency, partnership, or joint venture between CNRI and Licensee.  This
+License Agreement does not grant permission to use CNRI trademarks or
+trade name in a trademark sense to endorse or promote products or
+services of Licensee, or any third party.
+
+8. By clicking on the "ACCEPT" button where indicated, or by copying,
+installing or otherwise using Python 1.6.1, Licensee agrees to be
+bound by the terms and conditions of this License Agreement.
+
+        ACCEPT
+
+
+CWI PERMISSIONS STATEMENT AND DISCLAIMER
+----------------------------------------
+
+Copyright (c) 1991 - 1995, Stichting Mathematisch Centrum Amsterdam,
+The Netherlands.  All rights reserved.
+
+Permission to use, copy, modify, and distribute this software and its
+documentation for any purpose and without fee is hereby granted,
+provided that the above copyright notice appear in all copies and that
+both that copyright notice and this permission notice appear in
+supporting documentation, and that the name of Stichting Mathematisch
+Centrum or CWI not be used in advertising or publicity pertaining to
+distribution of the software without specific, written prior
+permission.
+
+STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO
+THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
+FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE
+FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
+OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.

corpus/What Unix Gets Right.txt

@@ -0,0 +1 @@
+https://homepage.cs.uri.edu/~thenry/resources/unix_art/ch01s05.html

corpus/degrees of freedom.txt

@@ -0,0 +1,48 @@
+Degrees of freedom is a fundamental concept in statistics, and it plays a particularly important role in distributions like the t-distribution. 
+
+In a broad sense, degrees of freedom refers to the number of independent pieces of information available to estimate statistical parameters. When you are estimating parameters from a sample, each data point provides some information that you can use in your estimation. However, as you start estimating more parameters, each one reduces the amount of information available for estimating the next. So, the degrees of freedom in a situation is often the number of data points minus the number of parameters being estimated.
+
+For example, when you calculate the sample mean from n data points, you're estimating one parameter, so you have n-1 degrees of freedom left for estimating the standard deviation or other parameters. This is why the standard deviation formula divides by n-1 instead of n. 
+
+In the context of the t-distribution, the degrees of freedom often refers to the number of independent observations in a sample minus the number of parameters estimated. The t-distribution is used in situations where the population variance is unknown and has to be estimated from the sample data, leaving you with fewer degrees of freedom. The shape of the t-distribution changes depending on the degrees of freedom, with fewer degrees of freedom resulting in heavier tails.
+
+The concept of degrees of freedom is essential in statistical tests like the t-test, where it is used to calculate the critical values. It also affects the confidence intervals around an estimate. Understanding degrees of freedom helps you understand how much information you have for your estimates and how certain you can be about them.
+
+
+
+Sure, let's consider a simple example of a t-test, which uses the t-distribution and the concept of degrees of freedom. Suppose we have a small sample of data and we want to test if the sample mean is significantly different from a hypothesized population mean.
+
+Let's say we have the following five data points, representing the ages of five randomly selected individuals: 21, 23, 24, 22, 26. We want to test if this sample provides evidence that the population mean age is different from 22.
+
+Step 1: Calculate the sample mean (x̄) and the sample standard deviation (s).
+
+x̄ = (21+23+24+22+26)/5 = 23.2
+
+We calculate the variance (s²) first, before finding the standard deviation (s).
+
+s² = [(21-23.2)² + (23-23.2)² + (24-23.2)² + (22-23.2)² + (26-23.2)²] / (5-1)
+= [4.84 + 0.04 + 0.64 + 1.44 + 7.84] / 4
+= 14.8 / 4
+= 3.7
+
+s = sqrt(3.7) ≈ 1.9235
+
+Step 2: Determine the degrees of freedom. 
+
+In a t-test, the degrees of freedom are given by the sample size minus 1. In this case, we have 5 observations, so df = 5 - 1 = 4.
+
+Step 3: Calculate the t-score. 
+
+The t-score is calculated as:
+
+t = (x̄ - μ) / (s / sqrt(n))
+
+where μ is the hypothesized population mean. If we're testing against a population mean of 22:
+
+t = (23.2 - 22) / (1.9235 / sqrt(5)) ≈ 1.118
+
+Step 4: Compare the calculated t-score to the critical t-value.
+
+At this point, you would look up the critical t-value for a specified significance level (e.g., 0.05) and 4 degrees of freedom in a t-distribution table or use statistical software. If the absolute value of your calculated t-score is greater than the critical t-value, you would reject the null hypothesis that the population mean is 22.
+
+Please note that this is a simplified example. Real-world data analysis would typically involve larger sample sizes and could also involve more complex scenarios such as two-sample t-tests, paired t-tests, or adjustments for multiple comparisons.

corpus/doscommands.txt

@@ -0,0 +1,77 @@
+For more information on a specific command, type HELP command-name
+ASSOC    Displays or modifies file extension associations.
+AT       Schedules commands and programs to run on a computer.
+ATTRIB   Displays or changes file attributes.
+BREAK    Sets or clears extended CTRL+C checking.
+CACLS    Displays or modifies access control lists (ACLs) of files.
+CALL     Calls one batch program from another.
+CD       Displays the name of or changes the current directory.
+CHCP     Displays or sets the active code page number.
+CHDIR    Displays the name of or changes the current directory.
+CHKDSK   Checks a disk and displays a status report.
+CHKNTFS  Displays or modifies the checking of disk at boot time.
+CLS      Clears the screen.
+CMD      Starts a new instance of the Windows command interpreter.
+COLOR    Sets the default console foreground and background colors.
+COMP     Compares the contents of two files or sets of files.
+COMPACT  Displays or alters the compression of files on NTFS partitions.
+CONVERT  Converts FAT volumes to NTFS.  You cannot convert the
+         current drive.
+COPY     Copies one or more files to another location.
+DATE     Displays or sets the date.
+DEL      Deletes one or more files.
+DIR      Displays a list of files and subdirectories in a directory.
+DISKCOMP Compares the contents of two floppy disks.
+DISKCOPY Copies the contents of one floppy disk to another.
+DOSKEY   Edits command lines, recalls Windows commands, and creates macros.
+ECHO     Displays messages, or turns command echoing on or off.
+ENDLOCAL Ends localization of environment changes in a batch file.
+ERASE    Deletes one or more files.
+EXIT     Quits the CMD.EXE program (command interpreter).
+FC       Compares two files or sets of files, and displays the differences
+         between them.
+FIND     Searches for a text string in a file or files.
+FINDSTR  Searches for strings in files.
+FOR      Runs a specified command for each file in a set of files.
+FORMAT   Formats a disk for use with Windows.
+FTYPE    Displays or modifies file types used in file extension associations.
+GOTO     Directs the Windows command interpreter to a labeled line in a
+         batch program.
+GRAFTABL Enables Windows to display an extended character set in graphics
+         mode.
+HELP     Provides Help information for Windows commands.
+IF       Performs conditional processing in batch programs.
+LABEL    Creates, changes, or deletes the volume label of a disk.
+MD       Creates a directory.
+MKDIR    Creates a directory.
+MODE     Configures a system device.
+MORE     Displays output one screen at a time.
+MOVE     Moves one or more files from one directory to another directory.
+PATH     Displays or sets a search path for executable files.
+PAUSE    Suspends processing of a batch file and displays a message.
+POPD     Restores the previous value of the current directory saved by PUSHD.
+PRINT    Prints a text file.
+PROMPT   Changes the Windows command prompt.
+PUSHD    Saves the current directory then changes it.
+RD       Removes a directory.
+RECOVER  Recovers readable information from a bad or defective disk.
+REM      Records comments (remarks) in batch files or CONFIG.SYS.
+REN      Renames a file or files.
+RENAME   Renames a file or files.
+REPLACE  Replaces files.
+RMDIR    Removes a directory.
+SET      Displays, sets, or removes Windows environment variables.
+SETLOCAL Begins localization of environment changes in a batch file.
+SHIFT    Shifts the position of replaceable parameters in batch files.
+SORT     Sorts input.
+START    Starts a separate window to run a specified program or command.
+SUBST    Associates a path with a drive letter.
+TIME     Displays or sets the system time.
+TITLE    Sets the window title for a CMD.EXE session.
+TREE     Graphically displays the directory structure of a drive or path.
+TYPE     Displays the contents of a text file.
+VER      Displays the Windows version.
+VERIFY   Tells Windows whether to verify that your files are written
+         correctly to a disk.
+VOL      Displays a disk volume label and serial number.
+XCOPY    Copies files and directory trees.

corpus/precision and recall.txt

@@ -0,0 +1,41 @@
+When trying to understand a model quality, there are two important metrics
+
+- Precision and Recall
+
+To understand them, we first need to understand what is a True Positive, True Negative, False Positive and False Negative.
+
+Imagine a model that classifies plant images as poisonous or not
+
+What are the possible answers? The model predicts:
+
+ - the plant IS poisonous and it really IS. This is a True Positive (TP)👍
+
+ - the plant is NOT poisonous and it really ISN'T. This is a True Negative (TN)👍 
+
+When the model goes wrong and it predicts
+
+- the plant is poisonous but it isn't. Also known as False Positive (FP) or Type 1 error 👎
+
+- the plant is NOT poisonous but it is!!. This is a False Negative (FN) Type 2 error 😱
+
+A FN can lead to intoxication and death ☠️😵
+
+Now, we can calculate Precision and Recall
+
+Definition: Precision measures how many of the model's positive predictions are really correct. 
+
+How: divide the all the TP by all positives (sum of TP and FP) 
+No alt text provided for this image
+
+Definition: Recall answers what proportion of the positives, among all possible, that were really
+
+How: divide TP add all TP (all correct poisonous detected) and also FN (all poisonous detected as ok emoji)
+No alt text provided for this image
+
+Both Precision and Recall are important. 
+
+Improving Precision reduces Recall so you have to take that into account when optimizing
+
+No model is perfect all the time, se we have to have in mind which kind of errors we want to decrease
+
+On our example, FN are a problem, so decrease that and increase Recall

corpus/rj45.txt

@@ -0,0 +1,107 @@
+September newsletter: 
+the X10 Files
+A simple PC Network
+
+ 
+
+ 
+
+I've been asked often enough why I don't do more on data networking - what with the Cisco & Microsoft cert's people usually assume it's my strong point.  Whether that's true or not, I'd have to agree that it deserves more attention, so here goes!
+
+Doing a home-based (or business-based for that matter) PC network is not really that difficult.  While there are different kinds of networks (Token Ring, Thinnet, Ethernet), 99.9% of us will use the latter: Ethernet.
+
+Also called 10/100 Base-T, it's the simplest & least expensive standard you can use.  Actually, it's pretty rare to find a new installation that ISN'T ethernet!  In order to do yours, you'll need good ol' Category 5 (or higher) cabling, data jacks, a punch tool (advisable - or possibly crimpers) and network cards for your computers.  Oh,... if you have more than two computers you'll also need either a hub or switch.  
+
+
+
+--------------------------------------------------------------------------------
+
+Cabling:
+
+Let's start first with the cabling:  If all you want to do is connect two computers, your cabling simply runs from one machine to the other.   Otherwise, you need to run cabling from all your PC's to your hub/switch.  In theory, this is the easiest part!
+
+
+--------------------------------------------------------------------------------
+
+Termination:
+
+You're fired! - just kidding... 
+Termination refers to punching your wiring down into jacks or patch panels, or just using RJ45 connectors (they look like big 8-pin telephone connectors).  You can terminate your cabling in a couple of ways:
+
+The simplest way (if you have the tools) is to just put RJ45 connectors on the ends of your cables.  This eliminates the need for jacks or patch panels & will save you a few dollars.  On the other hand, I think that wires sticking out of your wall (instead of from a jack in the wall) make for a not-so-clean installation - but if you do this you'll need to get your hands on a good set of crimpers.  And if you really want a clean installation and you're installing a lot of drops, you might want to consider actually using a patch panel.
+
+It's better if you use jacks at all your PC locations.  The jacks are all color-coded to make it a little easier.  After all, the big mystery for most people is the order of the wiring pin-outs (what order to punch the wiring down).
+
+Speaking of pin-outs, below are the standards you should use (I'll explain in a moment).  As you look this over, bear in mind that white/green means a wire that's mostly white with green markings;  green/white = green wire with white markings, etc....
+
+
+--------------------------------------------------------------------------------
+
+TW568-A 
+
+pin #1   white/green 
+pin #2   green/white 
+pin #3   white/orange 
+pin #4   blue/white 
+pin #5   white/blue 
+pin #6   orange/white 
+pin #7   white/brown 
+pin #8   brown/white 
+TW568-B 
+
+pin #1   white/orange 
+pin #2   orange/white 
+pin #3   white/green 
+pin #4   blue/white 
+pin #5   white/blue 
+pin #6   green/white 
+pin #7   white/brown 
+pin #8   brown/white 
+
+--------------------------------------------------------------------------------
+
+You don't even need to know this if you're using jacks at both ends, but you will if you're using the RJ45's (F.Y.I. - Ethernet will actually only use pins 1,2,3, and 6.  The other wires are unused).
+
+Unfortunately, things get a little more complicated at this point in the discussion.  Most times you'll terminate your cable with the same standard (either one) at both ends - that's called a "straight-thru" connection - but occasionally you'll need to use 568-A at one end & 568-B at the other (a "cross-over" connection).  
+
+If you're connecting two PC's directly, you'll need a cross-over connection between them.  
+
+If you're connecting everything through a hub/switch, all your cabling will be straight-thru.  
+
+If you have a DSL Router, it will connect to your hub via cross-over & all your other cabling should be straight-thru.  Also, some DSL routers have built-in hubs/switches.  In this case, your PC's connect to it with a straight-thru cable.
+
+
+--------------------------------------------------------------------------------
+
+Now, let's assume that you have an internet connection that you want to share with your entire network.  If you're like most of us, your ISP is going to give you a single IP address - but that's only good for ONE computer!
+
+Fortunately, there are several workarounds which can give all your networked machines access to the internet.  Microsoft introduced in Windows 98 "Internet Connection Sharing" (not my favorite solution).  Better though, if you have a DSL Router it probably has a feature called "NAT" (network address translation) built in to it.
+
+NAT works by taking the IP address given you from your ISP, storing it in memory (sort of), and then allocating other private IP addresses to your machines.  It keeps track of, and translates the IP addresses, ports, etc.
+
+Gets kind of complicated.  If you want to read more, you can go to the networking section for a tutorial on this and IP addressing.  
+
+However, the really important thing about NAT and your DSL Router is that is provides a reasonable degree of "firewall" protection.  Especially important if you have an "always-on" connection, a firewall will help keep hackers out of your PC.  It's incredible how many people there are who are cruising for hacking opportunities....  By the way, you can also get software-based firewalls at pretty reasonable prices.
+
+
+--------------------------------------------------------------------------------
+
+Once you have everything up and running (network cards installed successfully & connected), you're ready to share files & folders.  How you do that depends on your operating system, but I'm going to assume Windows 95/98 for the moment.
+
+Go to "Start|Settings|Control Panel" and double-click the "Network" icon.  Make your primary network logon "Client for Microsoft Networks" in the dropdown window.  If it isn't there, click "Add|Client|Microsoft| Client for Microsoft Networks."  The other thing you'll want to do is click "File and Print Sharing" and check the boxes.   Restart your computer if you need to do so.
+
+Sharing folders on the network is easy. Right-click on "My Computer" on your desktop, select "explore," and navigate to the folder you want to share.  Once you've found it, right-click on the folder and select "sharing."  You now have a dialogue for setting up your network share as you see fit!  You're done!  Within minutes of doing this, your folder will appear under "Network Neighborhood" on other machines with the rights you assigned (read-only or full-access).
+
+And that's just about all you need to know to get up and running.   You'll find an abundance of informational resources on the web if you need to know more.  I've already mentioned networking, but if you're into seriously heavy stuff, check out www.Cisco.com for more than you ever wanted to know about IP addressing, routing, and still way too much more.
+
+Till next time,
+
+Andy Jackson,
+Integratorpro.com
+SmarthomeUSA.com
+Andy@Integratorpro.com
+
+Back
+
+ 
+ 

corpus/splitting in columns - Unknown.txt

@@ -0,0 +1,12 @@
+
+via perl
+
+ls -l | perl -ane 'print "$F[8]\n"' # perl flag -a separate the fields into array F 
+
+via cut
+
+ls -l | cut -d ' ' -f 2-7  # field separator is only ONE space
+
+via awk
+
+ls -l | awk '{print $9}'   

corpus/xpath cheatsheet.txt

@@ -0,0 +1,216 @@
+// XPath CheatSheet
+// To test XPath in your Chrome Debugger: $x('/html/body')
+// http://www.jittuu.com/2012/2/14/Testing-XPath-In-Chrome/
+
+
+// 0. XPath Examples.
+// More: http://xpath.alephzarro.com/content/cheatsheet.html
+
+
+'//hr[@class="edge" and position()=1]'                // every first hr of 'edge' class
+'//table[count(tr)=1 and count(tr/td)=2]'             // all tables with 1 row and 2 cols
+'//div/form/parent::*'                                // all divs that have form
+'./div/b'                                             // a relative path
+'//table[parent::div[@class="pad"] and not(@id)]//a'  // any anchor in a table without id, contained in a div of "pad" class
+'/html/body/div/*[preceding-sibling::h4]'             // give me whatever after h4
+'//tr/td[font[@class="head" and text()="TRACK"]]'     // all td that has font of a "head" class and text "TRACK"
+'./table/tr[last()]'                                  // the last row of a table
+'//rdf:Seq/rdf:li/em:id'                              // using namespaces
+'//a/@href'                                           // hrefs of all anchors
+'//*[count(*)=3]'                                     // all nodes with 3 children
+'//var|//acronym'                                     // all vars and acronyms
+
+
+// 1. General.
+
+
+'/html'                     // whole web page (css: html)
+'/html/body'                // whole web page body (css: body)
+'//text()'                  // all text nodes of web page
+'/html/body/.../.../.../E'  // element <E> by absolute reference (css: body > … > … > … > E)
+
+
+// 2. Tag.
+
+
+'//E'                                        // element <E> by relative reference (css: E)
+'(//E)[2]'                                   // second <E> element anywhere on page
+'//img'                                      // image element (css: img)
+'//E[@A]'                                    // element <E> with attribute A (css: E[A])
+'//E[@A="t"]'                                // element <E> with attribute A containing text 't' exactly (css: E[A='t'])
+'//E[contains(@A,"t")]'                      // element <E> with attribute A containing text 't' (css: E[A*='t'])
+'//E[starts-with(@A, "t")]'                  // element <E> whose attribute A begins with 't' (css: E[A^='t'])
+'//E[ends-with(@A, "t")]'                    // element <E> whose attribute A ends with 't' (css: E[A$='t'])
+'//E[contains(concat(" ", @A, " "), " w ")'  // element <E> with attribute A containing word 'w' (css: E[A~='w'])
+'//E[matches(@A, "r")]'                      // element <E> with attribute A matching regex ‘r’
+'//E1[@id=I1] | //E2[@id=I2]'                // element <E1> with id I1 or element <E2> with id I2 (css: E1#I1, E2#I2)
+'//E1[@id=I1 or @id=I2]'                     // element <E1> with id I1 or id I2 (css: E1#I1, E1#I2)
+
+
+// 3. Attribute.
+
+
+'//E/@A'                    // attribute A of element <E> (css: E@A)
+'//*/@A'                    // attribute A of any element (css: *@A)
+'//E[@A2="t"]/@A1'          // attribute A1 of element <E> where attribute A2 is 't' exactly (css: E[A2='t']@A1)
+'//E[contains(@A,"t")]/@A'  // attribute A of element <E> where A contains 't' (css: E[A*='t']@A)
+
+
+// 4. ID & Name.
+
+
+'//*[@id="I"]'                // element with id I (css: #I)
+'//E[@id="I"]'                // element <E> with id I (css: E#I)
+'//*[@name="N"]'              // element with name (css: [name='N'])
+'//E[@name="N"]'              // element <E> with name (css: E[name='N'])
+'//*[@id="X" or @name="X"]'   // element with id X or, failing that, a name X
+'//*[@name="N"][v+1]'         // element with name N & specified 0-based index ‘v’ (css: [name='N']:nth-child(v+1))
+'//*[@name="N"][@value="v"]'  // element with name N & specified value ‘v’ (css: *[name='N'][value='v’])
+
+
+// 5. Lang & Class.
+
+
+'//E[@lang="L" or starts-with(@lang, concat("L", "-"))]'  // element <E> is explicitly in language L or subcode (css: E[lang|=L])
+'//*[contains(concat(" ", @class, " "), " C ")]'          // element with a class C (css: .C)
+'//E[contains(concat(" ", @class, " "), " C ")]'          // element <E> with a class C (css: E.C)
+
+
+// 6. Text & Link.
+
+
+'//*[.="t"]'                  // element containing text 't' exactly
+'//E[contains(text(), "t")]'  // element <E> containing text 't' (css: E:contains('t'))
+'//a'                         // link element (css: a)
+'//a[.="t"]'                  // element <a> containing text 't' exactly
+'//a[contains(text(), "t")]'  // element <a> containing text 't' (css: a:contains('t'))
+'//a[@href="url"]'            // <a> with target link 'url' (css: a[href='url'])
+'//a[.="t"]/@href'            // link URL labeled with text 't' exactly
+
+
+// 7. Parent & Child.
+
+
+'//E/*[1]'                                                        // first child of element <E> (css: E > *:first-child)
+'//E[1]'                                                          // first <E> child (css: E:first-of-type)
+'//E/*[last()]'                                                   // last child of element E (css: E *:last-child)
+'//E[last()]'                                                     // last <E> child (css: E:last-of-type)
+'//E[2]'                                                          // second <E> child (css: E:nth-of-type(2))
+'//*[2][name()="E"]'                                              // second child that is an <E> element (css: E:nth-child(2))
+'//E[last()-1]'                                                   // second-to-last <E> child (css: E:nth-last-of-type(2))
+'//*[last()-1][name()="E"]'                                       // second-to-last child that is an <E> element (css: E:nth-last-child(2))
+'//E1/[E2 and not( *[not(self::E2)])]'                            // element <E1> with only <E2> children
+'//E/..'                                                          // parent of element <E>
+'//*[@id="I"]/.../.../.../E'                                      // descendant <E> of element with id I using specific path (css: #I > … > … > … > E)
+'//*[@id="I"]//E'                                                 // descendant <E> of element with id I using unspecified path (css: #I E)
+'//E[count(*)=0]'                                                 // element <E> with no children (E:empty)
+'//E[count(*)=1]'                                                 // element <E> with an only child
+'//E[count(preceding-sibling::*)+count(following-sibling::*)=0]'  // element <E> that is an only child (css: E:only-child)
+'//E[count(../E) = 1]'                                            // element <E> with no <E> siblings (css: E:only-of-type)
+'//E[position() mod N = M + 1]'                                   // every Nth element starting with the (M+1)th (css: E:nth-child(Nn+M))
+
+
+// 8. Sibling.
+
+
+'//E2/following-sibling::E1'                 // element <E1> following some sibling <E2> (css: E2 ~ E1)
+'//E2/following-sibling::*[1][name()="E1"]'  // element <E1> immediately following sibling <E2> (css: E2 + E1)
+'//E2/following-sibling::*[2][name()="E1"]'  // element <E1> following sibling <E2> with one intermediary (css: E2 + * + E1)
+'//E/following-sibling::*'                   // sibling element immediately following <E> (css: E + *)
+'//E2/preceding-sibling::E1'                 // element <E1> preceding some sibling <E2>
+'//E2/preceding-sibling::*[1][name()="E1"]'  // element <E1> immediately preceding sibling <E2>
+'//E2/preceding-sibling::*[2][name()="E1"]'  // element <E1> preceding sibling <E2> with one intermediary
+'//E/preceding-sibling::*[1]'                // sibling element immediately preceding <E>
+
+
+// 9. Table Cell.
+
+
+'//*[@id="TestTable"]//tr[3]//td[2]'          // cell by row and column (e.g. 3rd row, 2nd column) (css: #TestTable tr:nth-child(3) td:nth-child(2))
+'//td[preceding-sibling::td="t"]'             // cell immediately following cell containing 't' exactly
+'td[preceding-sibling::td[contains(.,"t")]]'  // cell immediately following cell containing 't' (css: td:contains('t') ~ td)
+
+
+// 10. Dynamic.
+
+
+'//E[@disabled]'       // user interface element <E> that is disabled (css: E:disabled)
+'//*[not(@disabled)]'  // user interface element that is enabled (css: E:enabled)
+'//*[@checked]'        // checkbox (or radio button) that is checked (css: *:checked)
+
+
+// 11. XPath Functions.
+// https://developer.mozilla.org/en-US/docs/Web/XPath/Functions
+
+
+// 11.1. Conversion.
+
+
+boolean(expression)  // evaluates an expression and returns true or false.
+string([object])     // converts the given argument to a string.
+number([object])     // converts an object to a number and returns the number.
+
+
+// 11.2. Math.
+
+
+ceiling(number)  // evaluates a decimal number and returns the smallest integer greater than or equal to the decimal number.
+floor(number)    // evaluates a decimal number and returns the largest integer less than or equal to the decimal number.
+round(decimal)   // returns a number that is the nearest integer to the given number.
+sum(node-set)    // returns a number that is the sum of the numeric values of each node in a given node-set.
+
+
+// 11.3. Logic.
+
+
+true()           // returns a boolean value of true.
+false()          // returns boolean false.
+not(expression)  // evaluates a boolean expression and returns the opposite value.
+
+
+// 11.4. Node.
+
+
+lang(string)               // determines whether the context node matches the given language and returns boolean true or false.
+name([node-set])           // returns a string representing the QName of the first node in a given node-set.
+namespace-uri([node-set])  // returns a string representing the namespace URI of the first node in a given node-set.
+
+
+// 11.5. Context.
+
+
+count(node-set)           // counts the number of nodes in a node-set and returns an integer.
+function-available(name)  // determines if a given function is available and returns boolean true or false.
+last()                    // returns a number equal to the context size from the expression evaluation context.
+position()                // returns a number equal to the context position from the expression evaluation context.
+
+
+// 11.6. String.
+
+
+contains(haystack-string, needle-string)  // determines whether the first argument string contains the second argument string and returns boolean true or false.
+concat(string1, string2 [stringn]*)       // concatenates two or more strings and returns the resulting string.
+normalize-space(string)                   // strips leading and trailing white-space from a string, replaces sequences of whitespace characters by a single space, and returns the resulting string.
+starts-with(haystack, needle)             // checks whether the first string starts with the second string and returns true or false.
+string-length([string])                   // returns a number equal to the number of characters in a given string.
+substring(string, start [length])         // returns a part of a given string.
+substring-after(haystack, needle)         // returns a string that is the rest of a given string after a given substring.
+substring-before(haystack, needle)        // returns a string that is the rest of a given string before a given substring.
+translate(string, abc, XYZ)               // evaluates a string and a set of characters to translate and returns the translated string.
+
+
+// 12. XPath Axes.
+
+ancestor            // indicates all the ancestors of the context node beginning with the parent node and traveling through to the root node.
+ancestor-or-self    // indicates the context node and all of its ancestors, including the root node.
+attribute (@)       // indicates the attributes of the context node. Only elements have attributes. This axis can be abbreviated with the at sign (@).
+child (/)           // indicates the children of the context node. If an XPath expression does not specify an axis, this is understood by default. Since only the root node or element nodes have children, any other use will select nothing.
+descendant (//)     // indicates all of the children of the context node, and all of their children, and so forth. Attribute and namespace nodes are not included - the parent of an attribute node is an element node, but attribute nodes are not the children of their parents.
+descendant-or-self  // indicates the context node and all of its descendants. Attribute and namespace nodes are not included - the parent of an attribute node is an element node, but attribute nodes are not the children of their parents.
+following           // indicates all the nodes that appear after the context node, except any descendant, attribute, and namespace nodes.
+following-sibling   // indicates all the nodes that have the same parent as the context node and appear after the context node in the source document.
+parent(..)          // indicates the single node that is the parent of the context node. It can be abbreviated as two periods (..).
+preceding           // indicates all the nodes that precede the context node in the document except any ancestor, attribute and namespace nodes.
+preceding-sibling   // indicates all the nodes that have the same parent as the context node and appear before the context node in the source document.
+self (.)            // indicates the context node itself. It can be abbreviated as a single period (.).
+