OpenLLM-France/wikimedia huggingface dataset:
# Microsoft Office/Using and updating a database

Microsoft Access is a Relational Database Management System (RDBMS) From Microsoft Corporation. It is suitable for small to mid-sized database projects, or as a front end to large DBMS, like MS SQL and MySQL.
# Microsoft Office/Windows Version Differences

You might be using Microsoft Office on either Windows 7 or Windows 8 (or possibly Windows Vista or even Windows XP). This book also covers using Microsoft Office on the Mac (specifically, on OS X version 10.9, often referred to as “Mavericks”). Unfortunately, many techniques differ greatly between those operating systems. OS X looks and works nothing like Windows. However, Windows 7 and Windows 8 (or Windows 8.1, which looks and works very much like Windows 8) are very, very different, so much so that this book will sometimes discuss them if they are different operating systems.
In this book, information and instructions that are specific to one operating system will be placed in a subpage named with the appropriate operating system. Pages without an operating system in the name contain only information that applies to all platforms. For example, the page Logging In & Out contains a conceptual discussion of logging in and out, while the pages Logging In & Out (Windows) and Logging In & Out (OS X) contain step-by-step directions specific to Windows and OS X, respectively.
Finally, sometimes step-by-step instructions for Windows 7, Windows 8, and Windows 8.1 are so different that they have separate subpages. Other times, the differences are so minor that the different versions of Windows will be discussed together. In the latter case, look for the boxes at the beginning of each section that say “This section applies only to version 7 of Windows” (or whatever version is being discussed).

### But I Don’t Know Which Version I’m Using!

If you don’t know which version of Windows you’re using, there is a simple way to determine. Open the Run dialog (to do so, press the Windows key and R at the same time) and type winver.exe, then press Enter. This command opens a dialog box that tells you the version of Windows you are using.
# Microsoft Office/Spacing and Special Characters
## Spacing

MS Word has many options for formatting spacing, the most commonly used are for selecting spacing between lines, and the spacing between paragraphs. These options are both on the 'Format → Paragraph' dialog. As you might expect, the 'Line spacing' option sets that spacing between adjacent lines, while the 'Before / After' Spacing sets the space between different paragraphs.
If you have text that belongs on a new line, but is still part of the same paragraph, then you can use 'SHIFT-ENTER' to insert a newline while remaining in the same paragraph.

## Special Symbols

Special symbols (Greek letters, typographic marks, small icons or pictures), can be inserted by using the Menus 'Insert → Symbol...'. Most commonly used symbols are included in the main fonts, while commonly used icons are in the 'Windings' or 'Webdings' fonts.
Locate the symbol you wish to insert and click 'Insert' to place it into your document at the current cursor position (also known as the 'insertion point').
# Microsoft Office/Troubleshooting Excel Errors

Common sources of errors are parentheses that don’t match or missing arguments for functions. If your formula is free from those errors, here are some error values you might get:
| Error | Description |
| ###### | There is nothing wrong with your formula; the cell simply isn’t big enough to display the result. Widen the column. or set "Shrink to fit" under Alignment. |
| #DIV/0 | You are trying to divide by zero Correct the divisor If the divisor is a cell reference, check to make sure the cell isn’t empty |
| #NAME? | There is a name in the formula that Excel doesn’t recognize. If you used a natural language name, check the spelling If you typed in a function, check the spelling or verify that the function exists. If you are performing operations on text, enclose the text in double quotation marks |
| #REF! | A cell reference is not valid. Reenter the formula. |
| #VALUE! | The formula uses the wrong type of operand or argument. Check to see that you’re not performing math operations on labels or that arguments of functions that need to numeric are not referring to cells containing labels. |
A handy function to avoid errors is ISERR. For example, to divide one column by another, where blanks and zeros are present, use this formula (in cell C1): =IF(ISERR(A1/B1),"",A1/B1)
# Group Theory/Groups with structure

Definition (group with structure):
Let ${\mathcal {C}}$ be a concrete category. Then the category of groups with structure is the subcategory of ${\mathcal {C}}$ which is defined as follows:
* Its objects are the objects $G$ of ${\mathcal {C}}$ such that the categorical product $G\times G$ exists (and, on a set level, equals the set-theoretic product of $G$ with itself, projections included) and whose underlying sets bear a group structure such that the group law is a morphism $G\times G\to G$ in ${\mathcal {C}}$ and inversion is a morphism $G\to G$ in ${\mathcal {C}}$.
* Its morphisms are morphisms $f:G\to G'$ in ${\mathcal {C}}$ that, on the set level, are also group homomorphisms.
Proposition (multipication by an element is an automorphism in the underlying concrete category for every group with structure in a category admitting enough constant morphisms):
Let $G$ be a group with structure whose additional structure is given by the concrete category ${\mathcal {C}}$, such that every constant morphism $G\to G$ is a morphism of ${\mathcal {C}}$. Further, suppose that $g\in G$. Then the function
    $G\to G,h\mapsto gh$
is an automorphism of $G$ in the category ${\mathcal {C}}$.
Proof: If we show that the given function is a morphism, we've completed the proof, since an inverse is given by left multiplication by $g^{-1}$.
Thus, consider the morphism $G\to G\times G$ whose first component is given by the constant function associated to $g$ and whose second component is given by the identity on $G$: Postcomposing it with the group law yields the morphism in the theorem statement, which is hence a morphism of ${\mathcal {C}}$. $\Box$
# Group Theory/Abelian groups and the Grothendieck group of a monoid

Definition (abelian):
Let $G$ be a group. We call $G$ an abelian group if and only if for all $g,h\in G$, we have $gh=hg$ (where we denote the group operation by juxtaposition).
Definition (cyclic group):
A cyclic group is a group that is generated by a single of its elements, ie. $G=\langle g\rangle$ for a certain $g\in G$.
Proposition (cyclic group is abelian):
Let $G$ be a cyclic group. Then $G$ is abelian.
Proof: Indeed, write any two elements $h,j\in G$ as $h=g^{n}$, $j=g^{m}$, where $g\in G$ is such that $G=\langle g\rangle$. Then $hg=g^{n}g^{m}=g^{m}g^{n}=gh$, using associativity. $\Box$
# Group Theory/Free products and amalgamated sums

Definition (reduced word):
Let $S$ be any set, and define the set $S^{-1}$ to be the set of formal inverses to the elements of $S$; that is, $S^{-1}:=\{s^{-1}|s\in S\}$, so that $S\cap S^{-1}=\emptyset$; for example, we could define $s^{-1}:=\{\emptyset ,s\}$. Let $\varepsilon$ denote the empty tuple. Then a reduced word over $S$ is either
* the empty tuple $\varepsilon$, or
* a finite tuple $(r_{1},\ldots ,r_{n})$ of elements of $S\cup S^{-1}$ such that whenever $r_{j-1},r_{j}$ are two adjacent elements, then neither $r_{j-1}\in S$ and $r_{j-1}=r_{j}^{-1}$ nor $r_{j-1}\in S^{-1}$ and $r_{j-1}^{-1}=r_{j}$.
Definition (empty word):
The empty tuple $\varepsilon =$ is also called the empty word
Proposition (reduction of tuples to reduced words):
Let $S$ be any set, and let $S^{-1}$ be the set of formal inverses. Suppose that $(r_{1},\ldots ,r_{n})$ is any tuple (not necessarily a reduced word). Then in finitely many steps, one may obtain a reduced word from $(r_{1},\ldots ,r_{n})$ by removing adjacent elements $r_{j-1},r_{j}$ such that either $r_{j-1}\in S$ and $r_{j-1}=r_{j}^{-1}$ or $r_{j-1}\in S^{-1}$ and $r_{j-1}^{-1}=r_{j}$.
Proof: This follows immediately since the length of the tuple $(r_{1},\ldots ,r_{n})$ is an integer, which is reduced by 2 whenever adjacent elements that contradict the definition of a reduced word are eliminated. Doing this elimination repeatedly until it is no longer possible will hence lead to a reduced word in a finite number of steps. $\Box$
Note that when $n$ is odd, then the reduced word obtained in this way will not be the empty tuple. Otherwise, the empty tuple may result.
Definition (free group):
Let $S$ be any set. Then the free group over $S$ is defined to be the group $F\langle S\rangle$ whose elements are the reduced words over $S$ and whose group operation is given by first concatenation and then reduction to a reduced word.
Proposition (the free group is a group):
Let $S$ be a set. Then $F\langle S\rangle$ is a group.
Proof: The empty tuple $\varepsilon$ serves as an identity. Associativity holds because if $(r_{1},\ldots ,r_{n}),(t_{1},\ldots ,t_{m}),(u_{1},\ldots ,u_{k})$ are three reduced words, then
Finally, whenever $(r_{1},\ldots ,r_{n})$ is a reduced word, we claim by induction on $n$ that it has an inverse. Certainly the empty word has Indeed, suppose that $r_{n}\in S$; then $(r_{1},\ldots ,r_{n})(r_{n}^{-1})=(r_{1},\ldots ,r_{n-1})$, which has an inverse $(t_{1},\ldots ,t_{m})$ by the induction hypothesis, so that by associativity $(r_{n}^{-1})(t_{1},\ldots ,t_{m})$ is an inverse of $(r_{1},\ldots ,r_{n})$. $\Box$

## Exercises

* Prove that when $S$ is a set such that $|S|\geq 2$, then $F\langle S\rangle$ is not an abelian group.
# Group Theory
## Table of Contents

* Groups, subgroups and constructions
* Representations
* Cosets and Lagrange's theorem
* Normal subgroups and the Noether isomorphism theorems
* Cardinality identities for finite representations
* Free products and amalgamated sums
* The category of groups
* Abelian groups and the Grothendieck group of a monoid
* The action by conjugation and p-groups
* Simple groups and Sylow's theorem
* Subnormal subgroups and series
* Commutators, solvable and nilpotent groups
* Characteristic subgroups
* The symmetric group
* The Cayley graph and group actions on trees
* The Bass‒Serre theorems
* Splittings and the semidirect product
* Groups with hyperbolic Cayley graphs
* Group cohomology
* Group objects
* Groups with structure
* Topological groups

## References

* Aschbacher, Finite Group Theory
* M. Artin, Algebra
* Serre, Trees
# Group Theory/Commutators, solvable and nilpotent groups

Definition (commutator):
Let $G$ be a group and let $a,b\in G$. Then the commutator of $a$ and $b$ is defined to be the element
    $[a,b]:=a^{-1}b^{-1}ab\in G$.
{{definition|commutator
Proposition (commutators form a subgroup):
Let $G$ be a group. Then the set $\{[a,b]|a,b\in G\}$ forms a subgroup of $G$.
Proof: By the subgroup criterion, it is sufficient to show that for $a,b,c,d\in G$, the element $[a,b][c,d]^{-1}$ is of the form $[e,f]$ for suitable $e,f\in G$. Indeed,
    Failed to parse (syntax error): {\displaystyle \begin{equation*} t \end{equation*}} $\Box$
Definition (commutator subgroup):
Let $G$ be a group. Then the commutator subgroup of $G$ is defined to be $[G,G]$.
Definition (perfect):
A group $G$ is called perfect if and only if $[G,G]=G$.
Proposition (subdirect normal product of perfect groups is direct):
Let $H_{1},\ldots ,H_{n}$ be perfect groups, and let
    $N\trianglelefteq H_{1}\times \cdots \times H_{n}$
be a subdirect product which is simultaneously a normal subgroup of their outer direct product. Then in fact $N=H_{1}\times \cdots \times H_{n}$.
Proof: It suffices to show that whenever $k\in \{1,\ldots ,n\}$ and $g,h\in H_{k}$, then
    $(1,\ldots ,{\overset {\overset {k{\text{-th entry}}}{\downarrow }}{g^{-1}h^{-1}gh}},1\ldots ,1)\in N$,
since $H_{k}$ is a perfect group. Thus, let $h\in H_{k}$ be arbitrary, and pick $(h_{1},\ldots ,h_{n})\in N$, where $h_{j}\in H_{j}$ for all $j\in \{1,\ldots ,n\}$, such that $h_{k}=h$. Since $N$ is a subgroup and normal, the element
    $(1,\ldots ,1,{\overset {\overset {k{\text{-th entry}}}{\downarrow }}{g^{-1}}},1,\ldots ,1)(h_{1}^{-1},\ldots ,h_{n}^{-1})(1,\ldots ,1,{\overset {\overset {k{\text{-th entry}}}{\downarrow }}{g}},1,\ldots ,1)(h_{1},\ldots ,h_{n})=(1,\ldots ,{\overset {\overset {k{\text{-th entry}}}{\downarrow }}{g^{-1}h^{-1}gh}},1\ldots ,1)$
is in $N$. $\Box$
Definition (solvable):
Proposition (group is solvable iff maximal normal subgroup is solvable):
Let $G$ be a group, and let $H\triangleleft G$ be a maximal normal subgroup. Then $G$ is solvable if and only if $H$ is solvable.
# Group Theory/Group objects and torsors

Definition (group object):
Let ${\mathcal {C}}$ be a category that has a terminal object, which we shall denote by $I$. A group object of ${\mathcal {C}}$ consists of
* an object $G$ of ${\mathcal {C}}$ such that the categorical products $G\times G$, $G\times (G\times G)$ and $(G\times G)\times G$ exist
* a morphism $\mu :G\times G\to G$, thought of as the multiplication morphism,
* a morphism $\eta :T\to G$, thought of as the constant identity map (even though $G$ may not even be a set)
* and a morphism $\iota :G\to G$, thought of as the inversion morphism
which satisfy the following equations:
* $\mu \circ (\iota ,\operatorname {Id} _{G})=\mu \circ (\operatorname {Id} _{G},\iota )=\operatorname {Id} _{G}$ (identity law)
* $\mu \circ (\operatorname {Id} _{G},\iota )\circ \Delta =\mu \circ (\iota ,\operatorname {Id} _{G})\circ \Delta =\eta \circ t$, where $\Delta$ shall denote the diagonal of $G$ and $t:G\to T$ is the unique morphism given by the definition of a terminal object (inverse law)
* $\eta \circ (\eta ,\operatorname {Id} _{G})=\eta \circ (\operatorname {Id} _{G},\eta )\circ \alpha$, where $\alpha :(G\times G)\times G\to G\times (G\times G)$ is the canonical isomorphism (associative law)
Here, we wrote $(f,g):A\times B\to C\times D$ for the morphism that is induced by two maps $f:A\to C$ and $g:B\to D$ and the universal property of the product, by specifying that the map from $A\times B$ to $C$ shall be given by $f\circ \pi _{A}$, and that the map from $A\times B$ to $D$ shall be given by $g\circ \pi _{B}$.
Definition (action of a group object):
Let ${\mathcal {C}}$ be a category which possesses a terminal object, and let $G$ be a group object of ${\mathcal {C}}$. Let $X$ be another object of ${\mathcal {C}}$. An action of $G$
# Habermas Commentary/Books/TCA1/p11
## Distinction between Realist and Phenomenological Approaches (11.2.mid.)

In the realist perspective, objects are assumed to exist as givens, without explanation. Goal-oriented action, and associated kinds of knowledge, build upon these givens. The phenomenological perspective begins, rather, with communication, and treats the putatively objective world as something whose raw reality is not questioned but whose import is determined in communication.
# Habermas Commentary

Welcome to the wiki-based commentary Wikibook on the writings of Jürgen Habermas.

## Organization

This Wikibook approaches Habermas's writings in three different ways:
* Topics that arise repeatedly throughout his works
* Books and articles, analyzed on a page-by-page basis
* Discussions presenting critiques of or extended elaborations upon Habermas, going beyond individual pages or topics.

## Introductory Remarks

Note: do not post excerpts directly from Habermas's writings. They will continue to be protected by copyright for some years to come. Instead, just refer to specific pages and indicate the text on which you are offering commentary.
Please feel free to add your papers, notes, or anything else that will help to clarify the meaning of Habermas's writings!

## Other Sources of Habermas Commentary

Habermas Yahoo Group
# Habermas Commentary/Books
## Books by Jürgen Habermas

Theory of Communicative Action vol. 1: Reason and the Rationalization of Society vol. 2: Lifeworld and System
Philosophical Discourse of Modernity
# HTML 5 Programming and Web development/Links and External Documents

HTML Documents are usually linked together. Links can be formed by clickable texts called Hyperlinks. A document can also be linked to external documents such as stylesheets using the <link> tag.

## Hyperlinks

Hyperlinks are formed by using the <a> tag, The a tag has an attributed href, which is the URL of the link.
The code above provides a link to the Wikipedia page. It will display a link as follows. Wikipedia, the free encyclopedia The text with the tag is displayed on screen and the href has the URL.
# Habermas Commentary/Books/PDM/p408

N. 28. In “Habermas and the Unfinished Project of Modernity: Critical Essays on The Philosophical Discourse of Modernity (Maurizio Passerin d'Entrèves, Ed.), Jay M. Bernstein offers an article entitled “The Causality of Fate: Modernity and Modernism in Habermas.” On page 248 of that article, Bernstein discusses what he calls this “long and nervous footnote.” See http://books.google.com/books?id=P4kg3t6j5FgC&pg=PA248&lpg=PA248&dq=%22philosophical+discourse+of+modernity%22+excursus+%22leveling+the+genre+distinction%22&source=web&ots=tAtqD7NwNS&sig=UNNZofP2UUPqsJJ7XPyeUep52GE#PPA248,M1
# Habermas Commentary/Books/TCA1/p1
## Introduction to Habermas's Writing Style

What philosophical theories have in common is "the intention of thinking being or the unity of the world by way of explicating reason's experience of itself."
The premise that reason can have experiences is not intuitively obvious. Nor is the premise that reason would be able to directly experience itself -- as distinct from, say, its interpretation of itself.
We set the tone, here, for a hard slog.
# IGNOU Question Paper Solutions/MCA/Semester 5/MCSE-011 Parallel Computing/june 2010

* MCA (Revised) Term-End Examination
* June, 2010
* MCS-011: PROBLEM SOLVING AND PROGRAMMING
* Time 3 hours
* Maximum Marks
* weightage 75%
* Note: Question number 1 is compulsory and carries 40 marks. Attempt any three questions from the rest.
* 1.(a) write a program in C to search a record in an existing file and to update it. (10)
* 1.(b) explain the concept of array of pointers using pointers write a program to test whether the given string is a palindrome or not.
* 1(c) Differentiate between:
* 1(d) Why C is called a middle level language ? Give execution process. explain each step in detail.
* 2.(a) write a program to search an element in a given list of elements using linear search.
* 2 (b) write a recursive program to calculate the factorial of a given number.
* 2(c) Give an example to explain null pointer assignment.
* 3.(a) Write a program in C to find the multiplication of 2 matrices of size (3×3).
* 3(b) Write a macro for the following:
* 3(c) write a program in C, using structures to generate a report for students which displays Roll No. and Name of Student, total marks obtained by the student. assumptions can be made wherever necessary.
* 4(a) Write a program and flowchart to display the following pattern:
H He HeL HeLL HeLLO HeLL HeL He H
* 5(a). Write a program to append the contents of second file to the contents of first file.
* 5(b). explain the difference between a top-down approach and a bottom-up approach in programming.
# IIS and FastCGI/Configuring

A default fcgiext.ini file:
# IIS and FastCGI/Obtaining FastCGI
## Downloading FastCGI

FastCGI for IIS can be downloaded from the official Microsoft Website for FastCGI, iis.net/fastcgi.
# IIS and FastCGI/Package Components

Some of the key files installed by FastCGI for IIS are

## fcgiconfig.js

    Configuration assistant script

## fcgiext.dll

    The ISAPI extension, CGI Glue

## fcgiext.ini

    Configuration file
These files can often be located in the default C:\WINDOWS\system32\inetsrv

## Footnotes

* Much of the information on this page is referenced from "Karnure, Vijayshinva (2007-11-16). "IIS 6.0 - FastCGI". The Way I See It. Retrieved 2009-02-26."
# IIS and FastCGI/Registering interpreter

This page is largely a wiki-mirror of the official Microsoft docs.

## Configuring FCGI.ini

To register an extension globally:
To register a site-specific extension simply add the -site=<sitenum> flag. (No angle brackets)
On success you should see:

### Finishing fcgiext.ini

Documented is located by default in: C:\WINDOWS\system32\inetsrv\fcgiext.ini
The FastCGI document is formatted with a Types section that maps the FastCGI application onto the IIS site (vhost) using the specific IIS ids. And, a section that describes the application:

## Registering FCGI with IIS

To add the FastCGI to a site follow these steps: Start → Administrative Tools → Internet Information Services (IIS) Manager → Right Mouse click on Web Sites folder Properties → Home Directory → Configuration → Select extension you installed → Edit → you should see C:\WINDOWS\system32\inetsrv\fcgiext.dll or the like in the executable field. Uncheck verify file exists.

## Troubleshooting

ScriptMap already exists
* Example:
* Cause: Often old Active State CGI garbage
* Solution: Start → Administrative Tools → Internet Information Services (IIS) Manager → Right Mouse click on Web Sites folder Properties → Home Directory → Configuration → Delete all conflicting extensions i.e. .pl, .plex, .plx, .php, .rb etc. → OK / Confirm

## Footnotes

* ^ Information based on examples graciously provided by Microsoft: "Using FastCGI to Host PHP Applications on IIS 6.0 and IIS 5.1". IIS And FastCG. Microsoft. 2007-09-24. Retrieved 2008-02-05.
# IGNOU Question Paper Solutions/MCA/Semester 5/MCSL-054 Lab (based on MCS-051 & 053)

* june 2006
* December 2006
* june 2007
* December 2007
* june 2008
* December 2008
* june 2009
* December 2009
* june 2010
* December 2010
* june 2011
# IIS and FastCGI

Internet Information Services 6.0 (herein IIS6) is Microsoft's web-server application, it runs only on Microsoft Windows 2003. FastCGI permits properly designed scripts to execute without the overhead of starting up the interpreter on each HTTP request. This wikibook functions to teach the user how to configure IIS6 with FastCGI.
IIS does some non-http serving stuff as well, it bundles in FTP, and SMTP server applications (which can be uninstalled or disabled) and it largely relies on Windows or WINS servers for authentication. As an alternative to IIS-as-a-webserver on Windows, one can migrate away from IIS, and install Apache 2.x; or, the newer Lighttpd 1.4x or greater. Both, of the above web-servers also run on *nix and are freely available under more liberal licenses.

## Table of Contents

* Steps to getting it operational
** Obtaining FastCGI
** Registering interpreter
** Language Specific Guides
*** Scripting languages/Perl
*** Scripting languages/Perl/Catalyst
* Appendix
** Configuring
** Trouble shooting
** Package Components
# IGNOU Question Paper Solutions/MCA/Semester 5/MCSE-011 Parallel Computing

* june 2006
* December 2006
* june 2007
* December 2007
* june 2008
* December 2008
* june 2009
* December 2009
* june 2010
* December 2010
* june 2011
# IIS and FastCGI/Scripting languages/Perl

This tutorial will teach you how to get IIS working with FastCGI, and Perl. We will be using FCGI::IIS. These steps should be followed in order. Further documentation on FCGI::IIS, can be found directly on CPAN.

## Install FCGI::IIS
### Strawberry Perl

    perl -MCPAN -e'install FCGI::IIS'

### ActiveState

    ppm install FCGI
    ppm install http://www.cosmicscripts.com/modules/perl/FCGI-IIS.ppd

## Additions to fcgiext.ini

Add the following to the [Perl] stanza:
Which should make the .ini file read something like:
Notice FCGI::IIS=test: this gets a test up and running. To develop or run production with FCGI::IIS, or after your test succeeds remove the FCGI::IIS. Further information can be found in FCGI::IIS docs.

## Restart website

To restart a website: Start → Administrative Tools → IIS → Expand left panel to Websites → Right click website Stop → Right click website Start.
From this point it should be easily to install Catalyst or whatever other perl framework you'd like.

## Footnotes

* Much of the information was sourced from ""FastCGI with Perl on IIS 5.1, 6". FastCGI and Perl. CosmicScripts.com."
* ^ http://cosmicscripts.com is a non-official ppm hosting site, hope it is still active.