Array and List won't be both serialized in C#
XmlInclude : List and array
Viruses: Adaptation to a new host through repeated host jumps How to secure Elliptic Curve ElGamal encryption against known plaintext attacks? If I have an encoding function  $f(x)$ that maps a message $m$ to a point $P$ on a suitable Elliptic Curve $E$ . If I have the public key $Q$ of my recepient then I can encrypt the message as follows:  Choosing a random number $k &lt; n -1 $ where $n$ is the order of the curve E .  Calculating $C = [k] G $ where $G$ is the generator point of the curve E   Calculating $R = [k]Q $ where $Q$ is the recipient's public key   Now the message is encrypted by adding $P$ to $R$ to get          $C_e$ $( = R + P)$ which is sent along with $C$ to the recepient.  DECRYPTION:  Now for the recepient to decrypt my message they compute $R = [privatekey] C $ (where $C = [k]G $) and simply subtract $R$ from $C_e$ to get the encoded point $P$ back which is then decoded by an inverse function $f^{-1}(x)$ to recover $m$.  Now , two problems arise : If the attacker knows the plaintext (suppose if I follow a particular format of data while sending messages ) he could encode his guessed plaintext and subtract it from $C_e$ to recover $ R $ back ! . If I used that same $ R  $ to encrypt further "blocks" of my message then the security of the later parts of my message has been breached!   I realize that doing  something like a scalar multiplication over and over again for every block of data, would be a huge drawback in efficiency and speed.   Is there any way to compute a different $ R $ for every block of data, without using much resources and that too quickly ?   Does reusing the same $R$ for another message break security ?  NOTE: This question is for educational purposes only. It's for the sake of expanding my knowledge on Crypto. This question attempts to collect the few pearls among the dozens of bad C++ books that are published every year. Unlike many other programming languages, which are often picked up on the go from tutorials found on the Internet, few are able to quickly pick up C++ without studying a well-written C++ book. It is way too big and complex for doing this. In fact, it is so big and complex, that there are very many very bad C++ books out there. And we are not talking about bad style, but things like sporting glaringly obvious factual errors and promoting abysmally bad programming styles. Please edit the accepted answer to provide quality books and an approximate skill level — preferably after discussing your addition in . (The regulars might mercilessly undo your work if they disagree with a recommendation.) Add a short blurb/description about each book that you have personally read/benefited from. Feel free to debate quality, headings, etc. Books that meet the criteria will be added to the list.  Books that have reviews by the Association of C and C++ Users (ACCU) have links to the review. *Note: FAQs and other resources can be found in the  and under . What's the difference between:  class Child(SomeBaseClass):     def __init__(self):         super(Child, self).__init__()   and:  class Child(SomeBaseClass):     def __init__(self):         SomeBaseClass.__init__(self)   I've seen super being used quite a lot in classes with only single inheritance. I can see why you'd use it in multiple inheritance but am unclear as to what the advantages are of using it in this kind of situation. HP Easy Scan - "HP Scanner 3" will damage your computer How is Faulhaber's formula derived? When should I use a fixed or variable time step? How can I include the cursor in the screenshots created when PrtScr is pressed? I'd like to use JavaScript to calculate the width of a string. Is this possible without having to use a monospace typeface?  If it's not built-in, my only idea is to create a table of widths for each character, but this is pretty unreasonable especially supporting  and different type sizes (and all browsers for that matter). Why $∀x(P(x)→Q)$ is equivalent to $∃xP(x)→Q$ Given $x$ occurs free in $P$. If $x$ does not occur free in $Q$, then $∀x(P(x)→Q)$ is semantically equivalent with $∃xP(x)→Q$. How to understand this statement. And also, need an example to show that the formula will not necessarily be equivalent if $x$ does occur free in $Q$.  I guess what struggles me is I'm not quite understand what does "free" mean in this case. But it would be better to have answer for the above question. Bash-like, non-rotating filename tab completion with PowerShell Under Windows, using PowerShell, is it possible to make the filename suggestion (using the Tab key) work like with bash under Linux?  Let's assume a directory contains 3 directories: example1, example and examination.  On Windows (by default), if you type cd ex and Tab, it will auto-suggest cd .\examination. Subsequent uses of Tab will rotate the suggestion between example1, example and examination.  Using bash (typically under Linux), if you type cd ex and Tab, it will auto-complete until the character where the filenames start to differ: cd exam. Another use of Tab then suggests which directories are available:  $ cd exam examination/ example1/    example2/   Then, if you type p and Tab, it will auto-complete to example, and so on (here, offering a choice between example1 and example2).  Is there a way to make the filename suggestion work in a tree-like search like this, instead of rotating through the names?  (I'm mainly interested in file names. Bash can also refine this selection based on the file type, for example only directories for cd, which would be good, but having the file name selection itself would be enough.) Can't execute terminal commands: "the command 'sudo' is available in '/usr/bin/sudo'" If $m$ divides $n$, find a free resolution of $\mathbb{Z}/m$ as a $\mathbb{Z}/n$-module. If $m$ divides $n$, find a free resolution of $\mathbb{Z}/m$ as a $\mathbb{Z}/n$-module.   I have tried this one and got $0 \leftarrow \mathbb{Z}/m \leftarrow \mathbb{Z}/n \leftarrow \mathbb{Z}/n$.  The map $\mathbb{Z}/n \to \mathbb{Z}/n$ is multiplication by $m$, but I couldn't go further. Please help me. $f(x+1)-f(x)$ converges $\Rightarrow\frac{f(x)}x$ converges Let $f:\mathbb{R}\to\mathbb{R}$ continuous such that $\lim_{x\to\infty}f(x+1)-f(x)=l$.  How can I prove that $\dfrac{f(x)}x$ converges for $x\to+\infty$ ?  I am just trying to prove the convergence, not that it converges to $l$ (that part be deduced immediately by Stolz-Cesaro and the sequential characterization of limits) How do you concatenate matrices? And how do you make block matrices? How do I remove all specific characters at the end of a string in PHP? Access 2007 Work in a separate file using ACCDE Have been working in an Access 2007 application for over 3 weeks and it should be ready now. Anyway, I know (and tried) that "Make ACCDE" can actually split the raw data from the application itself so you can run it using the Access RunTime.  The question is... can I deploy my app for general use and modify a separate copy of the forms/views inside the application to deploy it when it´s ready without touching the data? What to do when I get an "attempt to read or write outside of disk 'hd0'" error and Boot Repair does not solve the problem? How do I load an mp4 video with multiple audio tracks into blender? I'm fitting a regression on the $\log(y)$.  Is it valid to back transform point estimates (and confidence/prediction intervals) by exponentiation?  I don't believe so, since $E[f(X)] \ne f(E[X])$ but wanted other's opinions.  My example below shows conflicts with back transforming (.239 vs .219).  set.seed(123)  a=-5 b=2  x=runif(100,0,1) y=exp(a*x+b+rnorm(100,0,.2)) # plot(x,y)  ### NLS Fit f &lt;- function(x,a,b) {exp(a*x+b)}  fit &lt;- nls(y ~ exp(a*x+b),  start = c(a=-10, b=15))  co=coef(fit) # curve(f(x=x, a=co[1], b=co[2]), add = TRUE,col=2,lwd=1.2)  predict(fit,newdata=data.frame(x=.7)) [1] 0.2393773  ### LM Fit # plot(x,log(y)) # abline(lm(log(y)~x),col=2) fit=lm(log(y)~x) temp=predict(fit,newdata=data.frame(x=.7),interval='prediction') exp(temp)         fit       lwr       upr 1 0.2199471 0.1492762 0.3240752