OpenLLM-France/wikimedia huggingface dataset:
# CAT-Tools/DéjàVu X/RTF format (Trados)

You need at least the Demo version of Trados. Here is the solution for Word and RTF files and files processed with S-Tagger (rtf files with a lot of tags).
If you get unsegmented files from your customer (segmented files contain every sentence twice - the source sentence is marked hidden and between the source and the target sentences you have things like <}0{> with varying numbers):
Open Trados WB with the TM from your customer (if you have a proper Trados version) or create a new empty TM in your language pair (if you have the Demo), go Tools, Translate, select the option segment unknown sentences, select the files you need to translate and click on Translate. The result is untranslated, segmented, uncleaned Trados files.
For each file you have now 2 files, one with the original extension (e.g. rtf) and one with the extension BAK, which is a backup of your original.
Close Trados WB.
Create a project in DVX. Select the files you want to import – the ones with the original extension. In the import window of the Wizard highlight all of them and click on the button Properties. Click in the field Filter that shows Microsoft Word or Rich text format (depending on your files). Select Trados Workbench. Now import your files and translate them.
Be careful to check for code errors (CTRL+Shift+F8) before exporting.
After the export, you have uncleaned, translated Trados files.
If you need to clean them, open Trados WB, Tools, Cleanup, select do not update TM and select your translated files, click Cleanup. No you have cleaned files (files with the extension you first had) and uncleaned files with the extension BAK.
If your customer has sent you a TM and you do not have a full Trados version, you need to get the TM as a Trados.txt or TMX export. You cannot do this conversion in the Trados Demo. If you want to import a Trados.txt file into a DVX Database you must select Trados Workbench as import format, even if it is a txt file. If you forget this, you will get a lot of tags you do not want to have in your TM.
If you get Tag Editor files (TTX) and after importing them in to DVX you do not see any segments- the files where not segmented in Trados WB. You need to segment them just as described for the Word files.
<Addition below by Rob Laumen>
After importing the TTX file, you need to use the Rows Selector to switch from All Rows to Unpainted Rows. Then right-click on the translation grid and select Clear All Translations (not to worry: this actually means Clear All Translations *In This View*). Now switch back to All Rows using the Rows Selector. Now that all rows with no matches are empty, Auto-Assemble will work on CTRL/ALT+down (if enabled). On non-empty unpainted rows you would have to press CTRL+A to assemble those segments.
</Addition by Rob Laumen>
# Chemical Sciences: A Manual for CSIR-UGC National Eligibility Test for Lectureship and JRF/Rovibronic coupling

Rovibronic coupling denotes the simultaneous interactions between rotational, vibrational, and electronic degrees of freedom in a molecule. When a rovibronic transition occurs, the rotational, vibrational, and electronic states change simultaneously, unlike in rovibrational coupling. The coupling can be observed spectroscopically and is most easily seen in the Renner-Teller effect in which a linear polyatomic molecule is in a degenerate electronic state and bending vibrations will cause a large Rovibronic coupling.
# Chemical Sciences: A Manual for CSIR-UGC National Eligibility Test for Lectureship and JRF/Robinson oscillator

The Robinson oscillator (or Robinson marginal oscillator) is an electronic circuit used in the field of Nuclear Magnetic Resonance (NMR). The oscillator forms the underlying basis of Magnetic Resonance Imaging (MRI) systems used in many hospitals. It was invented by the British physicist Neville Robinson.

## References

* Deschamps, P., Vaissiére, J. and Sullivan, N. S., Integrated circuit Robinson oscillator for NMR detection, Review of Scientific Instruments, 48(6):664–668, June 1977. DOI 10.1063/1.1135103
* Wilson, K. J. and Vallabhan, C. P. G., An improved MOSFET-based Robinson oscillator for NMR detection, Meas. Sci. Technol., 1(5):458-460, May 1990. DOI 10.1088/0957-0233/1/5/015
# Chemical Sciences: A Manual for CSIR-UGC National Eligibility Test for Lectureship and JRF/Scheme of Examination

The Joint CSIR-UGC JRF/LS (NET) Examination shall comprise 2 papers. Latest Information is available [here]
* [CHEMICAL SCIENCES Scheme of Examination]
* [Syllabus Paper I (A) ]
* [Syllabus Paper I (B) & II ]
* You can download Model questions for Joint CSIR UGC Test for JRF and Eligibility for Lectureship (NET) [Paper I (A) GENERAL SCIENCE ]
[Paper I (B) CHEMICAL SCIENCES ] [Paper II CHEMICAL SCIENCES ]
# Chemical Sciences: A Manual for CSIR-UGC National Eligibility Test for Lectureship and JRF/Rydberg–Ritz combination principle

The Rydberg-Ritz Combination Principle is the theory proposed by Walter Ritz in 1908 to explain relationship of the spectral lines for all atoms. The principle states that the spectral lines of any element include frequencies that are either the sum or the difference of the frequencies of two other lines.
An atom can be excited to higher energy either spontaneously or via absorption of a photon. However, according to the principles of Quantum mechanics, these excitations can only occur at certain energy intervals. The Rydberg–Ritz combination principle helps explain this process.

## History

The spectral lines of hydrogen had been analyzed and found to have a mathematical relationship in the Balmer series. This was later extended to a general formula called the Rydberg formula. This could only be applied to hydrogen-like atoms. In 1908 Ritz derived a relationship that could be applied to all atoms. This principle, the Rydberg–Ritz combination principle, is used today in identifying the transition lines of atoms.
# Chemical Sciences: A Manual for CSIR-UGC National Eligibility Test for Lectureship and JRF/SIRCAMS

The Scottish Instrumentation and Research Centre for Advanced Mass Spectrometry (SIRCAMS) is a facility for ultra-high resolution mass spectrometry of biomolecules, based at the University of Edinburgh.
SIRCAMS is part of the RCUK Interdisciplinary Research Collaboration in Proteomic Technologies (RASOR; Radical Solutions for Researching the Proteome), a consortium of the Universities of Glasgow, Edinburgh and Dundee. Much of its research activity is focused toward the development and application of mass spectrometry for the analysis of intact peptides, proteins, protein-protein and protein-RNA/DNA complexes. Recent studies have included: identification of platination sites in peptides (bombesin, substance P, angiotensin, bradykinin) using IRMPD, CID and ECD, accurate mass measurements on intact proteins (YdaE 6.5kDa, ubiquitin 8.6kDa, trypsinogen 24kDa, carbonic anhydrase 28kDa, beSOD 31kDa, FbpA 33kDa, BSA 66kDa) under native and denaturing conditions, identification of dynamic post-translational modifications in intact human histones using top-down ECD, top-down identification of proteins from complex mixtures, as well as accurate mass analysis of oligonucleotide DNA strands (40 bp).
The capital cost of FTICR instruments operating at field strengths higher than 9.4 T are such that few University institutions world-wide can offer access. SIRCAMS offers user access to both the APEX III 9.4T and APEX Qe 12T FTICR mass spectrometers within the facility. By taking advantage of the research expertise that has been developed by staff within the facility, users have access to techniques for accurate mass measurement of intact proteins with isotope peak fitting, top-down protein sequencing from complex mixtures (such as biomarker identification) solution and gas-phase HDX for protein conformational studies, mapping of post-translational modifications in peptides and proteins, and identification of DNA modifications.

## References

* ↑ University of Glasgow :: Biomedical & Life Sciences :: RASOR
# Conversational bots/A simple echo bot

How to build a conversational bot? Bots are server apps that provide an API so you will need a publicly accessible server to host your bot(s). If you have none, you can use for example Amazon's EC2 which provides a free tier. In general, any server on which one can run apps written in Go can be used. You may also want to download this free iOS app in order to test out your code.
Below is the code of a simple echo bot that just outputs Echo: followed but the user's input. After saving it to echobot.go, run the code using go run echobot.go.
# Convexity

This book discusses convexity, the properties of convex sets.

## Contents

* What is a convex set?
* The intersection of convex sets is convex
* Examples of convex sets
* The convex hull
* The diameter of a set
* Convex polytopes
* Helly's theorem
* Caratheodory's theorem
* Kirchberger's theorem
* Convex functions
* The Blaschke selection theorem
# Convex Analysis/Convex sets and convex functions

Definition:
Let $V$ be a vector space and $f:V\to [-\infty ,\infty ]$ be a function. $f$ is called convex if and only if for all $v,w\in V$ and $t\in [0,1]$ the following identity holds:
    $f(tv+(1-t)w)\leq tf(v)+(1-t)f(v)$
Intuitively, this means if two points $v,w\in V$ are given, then the line connecting $(v,f(v))$ to $(w,f(w))$ lies above the path $t\mapsto (tv+(1-t)w,f(tv+(1-t)w))$.
# Conversational bots

Conversational bots are programs that carry out a conversation with users. This tutorial will guide you through the basics of creating a simple conversational bot that analyses natural language input.
In what follows we will use the Go programming language in code examples.
To test out your code, you can use this free iOS app in conjunction with a server on which your code is running.
* A simple echo bot
* Natural language processing
* Natural language understanding
# Convex Analysis/Strong convexity

Definition (strongly convex function):
Let $X$ be a Banach space over $\mathbb {K} =\mathbb {R} ,\mathbb {C}$. A function $f:X\to (-\infty ,\infty ]$ is called strongly convex with parameter $\Lambda >0$ iff the following equation holds for all $x,y\in X$ and $t\in [0,1]$:
    $f\left(tx+(1-t)y\right)\leq tf(x)+(1-t)f(y)-{\frac {t(1-t)}{2}}\Lambda \|x-y\|$
Proposition (existence and uniqueness of minimizers of strongly convex functions):
Let $X$ be a Banach space over $\mathbb {K} =\mathbb {R} ,\mathbb {C}$ and let $f:X\to \mathbb {R}$ be a strongly convex function with parameter $\Lambda >0$, which additionally is bounded below (say by $b\in \mathbb {R}$) and continuous. Then $f$ admits a unique minimizer (ie. an element which realizes the infimum of $f(x)$, where $x$ ranges over $X$).
Proof: Since $\forall x\in X:f(x)\geq b$, the value $\mu :\inf _{x\in X}f(x)\in \mathbb {R}$ exists. Choose a sequence $(x_{n})_{n\in \mathbb {N} }$ in $X$ such that
    $f(x_{n})\leq \mu +{\frac {1}{n}}$.
$(x_{n})_{n\in \mathbb {N} }$ is a Cauchy sequence because if $z\in X$ is such that $f(z)\leq \mu +{\frac {1}{n}}$ and $w\in X$ is such that $f(w)\leq \mu +{\frac {1}{m}}$, then
    $\mu \leq f\left({\frac {z+w}{2}}\right)\leq {\frac {1}{2}}\left(f(z)+f(w)\right)-{\frac {1}{8}}\Lambda \|z-w\|\leq \mu +{\frac {1}{2}}\left({\frac {1}{n}}+{\frac {1}{m}}\right)-{\frac {1}{8}}\Lambda \|z-w\|$,
whence
    $\|z-w\|\leq {\frac {4}{\Lambda }}\left({\frac {1}{n}}+{\frac {1}{m}}\right)$;
in particular, if we show that a minimizer $x_{\infty }$ exists, then it will be unique, for if we set $z=x_{\infty }$ and call any other minimizer $w$, the above estimate holds for $m,n$ arbitrary. Since $X$ is Banach, $(x_{n})_{n\in \mathbb {N} }$ is convergent, say to $x_{\infty }\in X$. If we show that
    $f(x_{\infty })<\mu +\epsilon$
for all $\epsilon >0$, then $f(x_{\infty })=\mu$. By the continuity of $f$, choose $\delta >0$ such that $\|x_{\infty }-y\|<\delta$ implies $|f(x_{\infty })-f(y)|<\epsilon /2$. By convergence of $(x_{n})_{n\in \mathbb {N} }$ pick $N\in \mathbb {N}$ sufficiently large so that for all $m\geq N$ $\|x_{\infty }-x_{m}\|<\delta$. Then choose $k\geq N$ such that ${\frac {1}{k}}\leq {\frac {\epsilon }{2}}$. Then the triangle inequality implies
    $f(x_{\infty })-\mu =|f(x_{\infty })-\mu |\leq |f(x_{\infty })-f(x_{k})|+|f(x_{k})-\mu |<{\frac {\epsilon }{2}}+{\frac {\epsilon }{2}}=\epsilon$. $\Box$
# Conversational Subiya/Suviya

ABOUT THIS BOOK
After a friend asked me to teach him the language of Masubiya people. I told him that I did not have enough time and promised him that I will put it on wikibooks.
Without delving into history I will work on how the language basically works
SUBIYA LANGUAGE
Subiya has the following personalities.
Subiya. -> English Ime . -> I Iwe . -> You Iswe . -> We
Iye . -> Him/Her Abo. -> Them Inwe . -> You (pl)
# Convex Analysis
## Contents

* Convex sets and convex functions
* Strong convexity
# Latvian Gambit, Leonhardt Variation
## 5...Qf7

Black is planning ...d5 again. Now comes perhaps the only "unnatural" move with which a White player facing the Latvian must be familiar: 6. Ne3. There's no other way to defend against ...d5.
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Latvian Gambit
### 2...f5?!

    The Latvian Gambit is sometimes known as the Greco Counter Gambit.
    The Latvian Gambit only works at club level, where unsuspecting White players find themselves falling to traps. However, if White knows all the traps and pitfalls, Black will be not be able to compensate for being one pawn down in material. As such, the Latvian Gambit is usually considered unsound.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation.
1. e4 e5 2. Nf3 f5?!
| | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
| 1 | d4 fxe4 | Nxe5 Nf6 | Be2 d6 | Ng4 Be7 | | | | | | | | | | | = |
| 2 | Bc4 fxe4 | Nxe5 Qg5?! | d4! Qxg2 | Qh5+ g6 | Bf7+ Kd8 | Bxg6 Qxh1 | Ke2 Qxc1 | Nf7+ Ke8 | Nxh8+ hxg6 | Qxg6+ Kd8 | Nf7+ Ke7 | Nc3 Qxc2+ | Ke1 d6 | Nd5+ | ± |
| | ... ... | ... d5! | Qh5+ g6 | Nxg6 hxg6 | Qxg6+ Ke7 | d4 e3 | Bxe3 Qd6 | Bg5+ Kd7 | Qf7+ Ne7 | | | | | | = |
| 3 | Nc3 fxe4 | Nxe5 Qf6 | d4 exd3 | Nxd3 c6 | | | | | | | | | | | +/= |
| 4 | exf5 e4 | Ne5 Nf6 | Be2 d6 | Bh5+ Ke7 | | | | | | | | | | | +/= |
| Main Line 5 | Nxe5 Qf6 | d4 d6 | Nc4 fxe4 | Nc3 Qg6 | | | | | | | | | | | +/= |
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Latvian Gambit
## 3...Qf6

Black's queen has come lumbering out to poke the e5-knight in the ribs. Should White hold the line, or retreat?
4. d4 is the (old) main line. It temporarily establishes a classical pawn centre (d4+e4) allowing easy development of the remaining White pieces. If Black now wants to shift the knight from e5, she will have to play …d6 shutting in the f8-bishop.
4. Nc4 is the Leonhardt Variation, recommended by Latvian Gambiteer Tony Kosten and now considered a more critical test of the Latvian than d4. White knows she can't prevent …fxe4, so reserves the option of confronting that pawn with a d2-d3 advance when it arrives on e4.
Other knight retreats (to d3 or f3) allow ...fxe4 with an attack on the knight, giving Black time to follow up with …d5 to great advantage.
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Latvian Gambit, Leonhardt Variation
## 4...fxe4

Black threatens to play ...d5 with beautiful development and only a slightly misplaced queen to worry about. But 5. Nc3 covers d5 and gains further time by hitting the e4-pawn. Rarely do such delicate works as Black's encounter such a robust spanner as 5. Nc3.
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Philidor Counter-Gambit

The situation is unclear. Black can play 4...fxe4, forcing the white knight move. Also to be considered is 4...Nc6 controlling the d4 and e5 squares.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation.
1. e4 e5 2. Nf3 d6 3.d4 f5 4.dxe5
| 4 | 5 | 6 | 7 |
| dxe5 fxe4 | Ng5 d5 | e6 Nh6 | Nc3 c6 | += |
| ... Nc6 | Bd3 dxe5 | exf6 Nf6 | Nc3 Bb4 | += |
When contributing to this Wikibook, please follow the Conventions for organization.
# Latvian Gambit
## 3. Nxe5

White is threatening a fearsome queen check on h5, with the e5-knight ready to pounce on the g-pawn should Black advance it to g6. There's also the incidental threat of exf5. So that's the Latvian Gambit refuted then? Most top players would say "yes". But there is a particularly optimistic breed of chess player that looks at the pawns on f5 and e4 and thinks that if the knight could just be driven away from e5, it's Black who will be capturing a pawn (fxe4), and possibly even defending it with ...d5.
And so the move 3...Qf6 was invented. Yes, it's not usual to move the queen so early, but then again, following up a wild lunge like 2…f5 with solid-looking moves is a recipe for disaster.
There's also 3...Nc6, the Fraser Variation. "You're threatening to win the exchange? Coward! I shall FORCE you to win the exchange!"
3...Nf6 has recently been suggested, preventing Qh5+ but allowing exf5. This may or may not be suicidal.
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Latvian Gambit, Leonhardt Variation
## 6. Ne3

White has seemingly thwarted ...d5 yet again, and is now asking the Black army how they're going to save Private Ryan on e4.
There are two options for Black: abandon e4 and make another non-developing move with 6...c6 to finally establish an iron grip over d5, or continue the charge with 6...d5, the Atars Gambit, accepting the loss of the d-pawn and saddling White with only the minor inconvenience of having to come and capture it.
It should be pointed out here that, in fact, the suicidal-looking 6...d5 is one of Black's last remaining attempts to revive the Latvian Gambit. If it doesn't work, the swashbuckling old opening will likely be tucked away on a shelf with a label "suitable only for unprepared opponents".
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Latvian Gambit, Leonhardt Variation
## 4. Nc4

Black remains a pawn down, but White's knight has run off, so Black may now dream of playing …d5 in one move. That pawn on e4 will have to be cleared out of the way first, with 4...fxe4. (If Black delays, White will play exf5 and retain the extra pawn.)
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Latvian Gambit, Leonhardt Variation
## 5. Nc3

White's c3-knight is threatening to capture on e4 hitting the queen on f6, and taking advantage of this diversion to retreat safely to c3. Were the queen not on f6, Black could turn the tables after Nxe4 with ...d5! picking up a knight. So the queen must move again. In the old days of the Leonhardt Variation, 5...Qg6 was the move, defending e4 and pressuring g2. The modern preference is 5...Qf7, renewing the threat of ...d5.
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Clojure Programming/Examples

This page is a collection of examples of clojure code. It's living list, so feel free to contribute. In order to make this as relevant as possible, please observe the following guidelines
* Create a separate page for your entry. Place it in Clojure_Programming/Examples/Your_Example_Name
* Create a one paragraph summary of your example, and place it in this page.
* Remember to link to your example
Thanks for doing your part to help the Clojure community!

## Using JDBC

JDBC information can be found here. The page is still a work in progress.

## Norvig's Spelling Corrector

Peter Norvig wrote an excellent example of a spelling corrector. You can see How to Write a Spelling Corrector for a more detailed explanation.
You can see the Clojure example here

## Simple REPL on a Socket

Accessing a REPL over network is a very useful feature for many situations, from designing a web site to debugging a satellite in space. Here is an example how.

## Simple GUI : Temperature Converter

Simple example GUI application (from discussion group, updated for 20080329 release). It is based on Swing, and you can find it here

## Lazy Fibonacci

Fibonacci numbers are a classic example of an infinite recursive sequence. Clojure's Lazy functions are an excellent way to implement this mathematical construct. You can see a detailed example here.

## Talking to Excel

Interfacing to other programs via COM can be easily done in Java using the JACOB library. However coping with all the low-level interface when talking to an application is quite tedious. Especially since the interface is designed for C not for Java, not to mention Clojure. So we will try to improve the situation a little bit using the power of Clojure.
A detailed explanation is here.

## Creating an Applet

This tutorial explains how to create a simple "Hello World!"-applet. The article also explains how you can sign your applet (if Reflection is needed).

## genclass and finalize

The gen-class functions provide the most general and powerful mechanism in Clojure for defining new Java classes. If you need to implement an existing interface you can probably use the simpler proxy function instead, but if you need to define new Java instance methods you may need to use gen-and-load-class or gen-and-save-class.
By way of a quick introduction, here is an example of a new class named MyClass in a package named foo. This class has two methods: mymethod, a standard Java finalize:
At this point the class exists and is loaded into the JVM, but isn't useful yet as the methods do not have definitions. Define them like this:
This class can now be used like any Java class in Clojure:
That example creates a new instance, calls mymethod, and prints the return value. The finalize method will probably not be called yet, but an explicit call to the garbage collector may trigger it:

## Invoking Java method through method name as a String

See Google Groups original thread for a more conversational approach.
Credit goes to Timothy Pratley, pmf, and Michael Wood for helping figure this out.