I want to use Unicode text (a mixture of cyrillic and japanese characters) in a code listing that uses default LaTeX fonts (in other words, source code fonts are left to default). However, for all non-ASCII characters I get empty spaces instead.  I've tried adding the utf8 package, but to no avail. How can I get the Unicode characters to show up?

I'm having some problems with listings and UTF-8 in my document. Maybe someone can help me? Some characters work, like é and ó, but á and others appear at the beginning of words...  \documentclass[12pt,a4paper]{scrbook} \KOMAoptions{twoside=false,open=any,chapterprefix=on,parskip=full,fontsize=14pt}  \usepackage[portuguese]{babel} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{listingsutf8}  \usepackage{inconsolata} \lstset{     language=bash, %% Troque para PHP, C, Java, etc... bash é o padrão     basicstyle=\ttfamily\small,     numberstyle=\footnotesize,     numbers=left,     backgroundcolor=\color{gray!10},     frame=single,     tabsize=2,     rulecolor=\color{black!30},     title=\lstname,     escapeinside={\%*}{*)},     breaklines=true,     breakatwhitespace=true,     framextopmargin=2pt,     framexbottommargin=2pt,     extendedchars=false,     inputencoding=utf8 }  \begin{document} \begin{lstlisting} <?php  echo 'Olá mundo!'; print 'Olá mundo!'; \end{lstlisting}  \end{document} \end{lstlisting}


Let $0 \to M_1 \to M \to M_2 \to 0$ be an exact sequence of $A$-modules.  i) Prove: If $M_1$ and $M_2$ are finitely generated, then $M$ is too.  ii) Let $M$ and $N$ be sub-modules of an $A$-module $L$. Assume that $M+N$ and $M\cap N$  are finitely generated $A$-modules. Prove that $M$ and $N$ are finitely generated $A$-modules.  If have proved the first part, but i don't see how to do the second part. I tried to use the first part, so to find an exact sequence with $M$ in the middle and finitely generated modules in place of $M_1$ and $M_2$, but I can't find a surjective map $M \to P$ (for some f.g. $A$-module) in the sequence:  $$0 \to M\cap N \to M \to P \to 0$$  any hints/help would be appreciated.

The question asks to prove that if $M+N$ and $M \cap N$ are finitely generated modules, then M and N are also finitely generated.  I've tried to use basic definitions, but all failed.   I set some examples to study how I can find a generating set for M (or N) when I have the generators of $M+N$ and $M \cap N$ but then I realized that there's no simple way to do so because $3\mathbb{Z}+5\mathbb{Z}=\mathbb{Z}$ is a finitely generated $\mathbb{Z}$-module generated by $\{1\}$ and $3\mathbb{Z} \cap 5\mathbb{Z}=15 \mathbb{Z}$ is also a finitely generated $\mathbb{Z}$-module generated by $\{15\}$ but $M=3\mathbb{Z}$ is generated by $\{3\}$ which doesn't tell me anything conclusive.   I then set $M=\{(x,y,0): x,y \in \mathbb{R} \}$ and $N=\{(x,0,z): x,z \in \mathbb{R} \}$. Then $M+N=\mathbb{R}^3$ and $M \cap N = \{ (x,0,0): x \in \mathbb{R} \}$ both are finitely generated modules. The set $\{(0,1,1),(0,-1,1),(1,0,-1)\}$  is a generator for $M+N=\mathbb{R}^3$ and $\{(1,0,0)\}$ is a generator for $M \cap N$ but again there's no obvious way of obtaining generators for M or N.  Any insightful ideas will be appreciated.  EDIT:  I have to add  that this question is an exercise in the chapter 1 of the book I'm reading. Chapter 1 covers only basic definitions of modules, examples of modules, sub-modules, quotient modules and generating sets for modules. R-homomorphisms, exact sequences, Isomorphism theorems extended for modules, all are discussed in chapter 2. So I think I'm not allowed to use the materials covered in chapter 2 to solve exercises in chapter 1.


I would like to log all interactive shell output. Whenever I use a terminal everything printed to the terminal would also be put in a file.  I tried  bash|tee log.txt   Which mostly worked. The only problem is that some commands such as man pages don't display correctly. I would guess that they test for an interactive shell and don't find one?  Any way to do what I want?

Is there an easy way to log all activity that occurs from a shell script to a file?  I have a script.  It outputs things like echo "instructions", as well as other program output. I know the commands:  command | tee -a "$log_file"   and   command >> logifle.log   What I'm asking is whether there is a shell parameter for logging, or a set command I can use or something like that. I don't necessarily want to add dozens of redirects or tee to files if I don't have to. I still want to get std output though - I just also want it to be logged.:wq


For 1 specific citation (and only for that one) with many authors, biblatex keeps on using "author1, author2, et al" even though for everything else it is correctly using only 1 author when there are more than 2 authors (i.e. "author1, et al")  edit: So I've found the culprit. I have two citations with the same first author, and biblatex isn't liking it. Since the publications are on different years though, I'm not sure why this is causing an issue.  MWE:   \documentclass[letterpaper, 10pt]{article} % Using BIBER \usepackage[backend=biber,sorting=nyt,style=authoryear,maxnames=2]{biblatex} \usepackage{placeins} \addbibresource{bibblio.bib} \renewcommand{\bibfont}{\small} \begin{document} I want to cite \cite{hutter2012starleth} and \cite{hutter2010slip}. \printbibliography \end{document}   And the bib file is:  @book{hutter2012starleth,   title={StarlETH: A compliant quadrupedal robot for fast, efficient, and versatile locomotion},   author={Hutter, Marco and Gehring, Michael and Bloesch, Michael and Mark, A Hoepflinger and Remy, C David and Siegwart, Roland Yves},   year={2012},   publisher={World Scientific} }  @inproceedings{hutter2010slip,   title={Slip running with an articulated robotic leg},   author={Hutter, Marco and Remy, C David and Hopflinger, MA and Siegwart, Roland},   booktitle={Intelligent Robots and Systems (IROS), 2010 IEEE/RSJ International Conference on},   pages={4934--4939},   year={2010},   organization={IEEE} }

In the header of my document I set the maximal author names to 2:  \usepackage[style=authoryear-icomp, maxbibnames=9, maxcitenames=2, backend=biber]{biblatex}   Now, when I cite texts with two authors, LaTeX gives me the following:     (Author_A/ Author_B 2012: 232)   When I have three authors or more, LaTeX makes it:     (Author_A/ Author_B et al. 2012: 232)   But I want LaTeX to just name the first author if there are more than two authors ... like this:     (Author_A et al. 2012: 232)   Any tips on how to achieve this ?


I have a list which contains file names. How can I get create a new list which contains only the first 4 characters of every line?

I would like to cat file, but with limit to max length to each line. For example I a have file with 10 lines each have 10000 characters and I would like to print first 100 characters from each line. Is something like that possible with cat or some alternative? thx.


Basically I went into disk management in windows, right clicked on the Ubuntu partition and clicked delete. It was lazy and stupid and now I've lost access to my windows and all I get is   error: no such device: 9a952691..... entering rescue mode... Grub rescue>   I've tried various fixes and I can't get them to work.. Help please? Preferably without need for a USB stick or windows disk or anything, can I do it from this screen?

I have installed Ubuntu as dualboot with Windows 7. Now I'm no longer using Ubuntu so i removed the Ubuntu partition and added the unallocated space to my Windows 7 partition. But after I restart my computer it goes directly to the error:   error: unknown filesystem grub rescue >   I don't have the original Windows CD to fix the MBR. Is there a way to fix this error without using the Windows CD?


Prove that $I=(xy-1)$ is prime but not maximal in $\mathbb{C}[x,y]$. Prove also that $\mathbb{C}[x,y]/I$ has infinitely many prime ideals. I must prove that the quotient Ring is an Integral domain and not a Field. No idea whatsoever. Any help please.

I learnd that the maximal ideals in $\mathbb C[x,y]$ have the form $(x-z_1, y-z_2)$ by the Nullstellensatz. But if we set $I=(xy-1)$ then $\mathbb C[x,y]/I$ is isomorphic to $\mathbb C[x,1/x]$ which is in my opinion a field, thus $(xy-1)$ is maximal. Where did I make a mistake?


I'm new in java and android. Trying to make some app and got NullPointerException. Please see my code below:  import android.app.Activity; import android.hardware.Sensor; import android.hardware.SensorEvent; import android.hardware.SensorEventListener; import android.hardware.SensorManager; import android.os.Bundle; import android.widget.TextView; import android.widget.Toast;  public class PoziomicaActivity extends Activity implements SensorEventListener {      TextView t1;     TextView t2;     TextView t3;     TextView t4;      @Override     protected void onCreate(Bundle savedInstanceState) {         super.onCreate(savedInstanceState);         setContentView(R.layout.activity_poziomica);          t1 = (TextView)findViewById(R.id.textView1);         t2 = (TextView)findViewById(R.id.textView2);         t3 = (TextView)findViewById(R.id.textView3);         t4 = (TextView)findViewById(R.id.textView4);          SensorManager sensor = (SensorManager) getSystemService(SENSOR_SERVICE);         sensor.registerListener(this,sensor.getDefaultSensor(Sensor.TYPE_ORIENTATION),0,null);      }      @Override     public void onAccuracyChanged(Sensor arg0, int arg1) {         // TODO Auto-generated method stub      }      @Override     public void onSensorChanged(SensorEvent event) {         t1.setText("event.values[0]="+event.values[0]+"\n" +                 "event.values[1]="+event.values[1]+"\n"+                 "event.values[2]="+event.values[2]+"\n");          String kierunek="";         if(event.values[0]==0){             kierunek="Północ (N)";         }else if(event.values[0]<90){             kierunek="Północny-wschód (NE)";         }else if(event.values[0]==90){             kierunek="Wschód (E)";         }else if(event.values[0]<180){             kierunek="Południowy-wschód (SE)";         }else if(event.values[0]==180){             kierunek="Południe (S)";         }else if(event.values[0]<270){             kierunek="Południowy-zachód (SW)";                   }else if(event.values[0]==270){             kierunek="Zachód (W)";         }else if(event.values[0]<360){             kierunek="Północny-zachód (NW)";         }                                t2.setText("idziesz na "+kierunek);          String pochylenie_gd="";         if(event.values[1]==0){             pochylenie_gd="poziomo";         }else if(event.values[1]>0){             pochylenie_gd="góra niżej";         }else{             pochylenie_gd="dół niżej";         }                t3.setText("Płaszczyzna góra-dół:  "+pochylenie_gd);          String pochylenie_lp="";         if(event.values[2]==0){             pochylenie_lp="poziomo";         }else if(event.values[2]>0){             pochylenie_lp="lewa niżej";         }else{             pochylenie_lp="prawa niżej";         }         t4.setText("Płaszczyzna lewa-prawa:  "+pochylenie_lp);          if((event.values[1]==0)&&(event.values[2]==0)){             Toast.makeText(getApplicationContext(), "Idealny poziom!", Toast.LENGTH_LONG).show();         }      }  }   Every time I got error:   java.lang.NullPointer.Exception at com.example.pomocnik.PoziomicaActivity.onSensorChenged (PoziomicaActivity.java:51).   Can someone tell me where is a problem?

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


How can I show that $\sum \limits_{n=2}^\infty\frac{1}{n\ln n}$ is divergent without using the integral test?  I tried using the comparison test but I could not come up with an inequality that helps me show the divergence of a series. I also tried using the limit comparison test but I was not successful.  Please do not give me solutions; just a hint so that I can figure it out myself.

Recently, I encountered a problem about infinite series. So my question is how to know whether the infinite series $\sum _{n=2}^{\infty } \frac{1}{n \log (n)}$ is convergent?


I read documentation on the internet on how to create a new user with SSH access. I figured it out and to create a user is quite simple.  The next step I want to take is to jail this ssh server to the /home/ directory on my machine. It needs the permission to write/create folder/files in directories of other users (CMS system).  How can I implement this?

How to add an ssh user who only has permissions to access specific folder?  useradd -d /var/www/xyz.com.tr/musteri  -s /bin/bash -g sshd musteri   I created a user called musteri. I set its home folder and group. So, I want to integrate musteri users into "/var/www/xyz.com.tr/musteri". I don't want it to access another folder.


I have actually an enum in c++:  class myClass { public:     enum ExampleType     {        TEST1        TEST2        TEST3        TEST4     } };   I would like to print the enum not as number but as String.. Actually it prints 0 .. 1 .. 2 .. 3 I would like it print TEST1 or TEST2 etc ...  I already try Switch case as :   std::string type;   switch (this->type)     {     case 0:   type = "TEST1";     case 1:   type = "TEST2";     case 2: type = "TEST3";     case 3: type = "TEST4";     }   then print type, but he don't go in the right case ..  How can it be possible ?

Here's what I am trying to do:    typedef enum { ONE, TWO, THREE } Numbers;   I am trying to write a function that would do a switch case similar to the following:   char num_str[10]; int process_numbers_str(Numbers num) {   switch(num) {     case ONE:     case TWO:     case THREE:     {       strcpy(num_str, num); //some way to get the symbolic constant name in here?     } break;     default:       return 0; //no match   return 1; }   Instead of defining at every case, is there a way to set it using the enum variable like I am trying to do above?


I'm in a Clan War and I see a little mini dark elixir storage at the top of my Clan Castle, but I don't have an actual dark elixir storage.  Will the dark elixir stay in the Clan Castle until I can claim it?

I have a level 7 town hall and I would like to get a  barbarian king. However, I don't have a dark elixir storage. What would happen if I buy a King ? I'm affraid to lose my gem so any advice would be great thanks.


I have seen many questions about circular reasoning on this website but none of them have satisfied my doubt. How do I know if I'm doing circular reasoning on a limit by doing l'hôpital? I do know that circular reasoning is when you use l'hôpital on a limit like $\lim_{x\to 0}\frac{\sin(x)}{x}$ because the defn of the derivative of sine is cosine which is obtained by applying l'hôpital? Yeah but how do I know exactly if whenever I want to apply l'hôpital, that same l'hôpital has been used to evaluate the derivative?

I have heard people say that you can't (or shouldn't) use the L'Hopital's rule to calculate $\lim\limits_{x\to 0}\frac{\sin x}x=\lim\limits_{x\to 0}\cos x=1$, because the result $\frac d{dx}\sin x=\cos x$ is derived by using that limit.  But is that opinion justified? Why should I be vary of applying L'Hopital's rule to that limit?  I don't see any problem with it. The sine function fulfills the conditions of the L'Hopital's  rule.  Also, it is a fact that the derivative of sine is cosine, no matter how we proved it. Certainly there is a way to prove $\frac d{dx}\sin x=\cos x$ without using the said limit (if someone knows how, they can post it) so we don't even have any circular logic. Even if there isn't,  $\frac d{dx}\sin x=\cos x$ was proven sometime without referencing the L'Hopital's rule so we know it is true. Why wouldn't we then freely apply the L'Hopital's rule to $\frac {\sin x}x$?  PS I'm not saying that this is the best method to derive the limit or anything, but that I don't understand why it is so frowned upon and often considered invalid.


I have installed Ubuntu 20.10, since it is non LTS, I'd like to have 20.04. Problem is I have already installed lots of apt packages in my 20.10. So is it possible to reuse the apt cache in my newly installed 20.04? I really don't wanna download them all again as I have a limited internet connection.

As we know that we are using  for installing packages and repositories configuration file located at /etc/apt/sources.list.  I am using Ubuntu 12.10 (Quantal Quetzal) which reaches . That means no updates or support. So, the question is, can I use sources.list file from another version, say Ubuntu 12.04 LTS, and will it negatively affect the system.


Before someone shoots me down, I am aware of the Java to binary compilers and I'm not after one of those.  I also know there will be no perfect tool that converts everything without any problems. I am aware that missing Java libraries are a major problem; however my source doesn't make use of many Java libraries except for stuff like String and prints. I only want to the tool to create the classes that the Java source references. In the case of the String stuff I am happy to fill in the gaps or fix at a later stage. I just want the tool to do the boring bits so I don't have to do the translation manually.  In the case of required classes etc, I will manually fix those at a later stage but would appreciate a pointer to something that at the very least gets enough of the boring stuff done.  Once again I want the source translated and not a compiler to produce a binary. Basically I want to take some Java stuff and convert it to C++ for later use in other projects.  EDIT ADDITIONAL NOTES  Sorry if I was not clear in my previous parts of this question. I know that Java is very much different from C++. I have some Java code which is mostly filled with processing arrays and bits and has almost no object creation. In a sense it is very self-contained and has few calls to other classes. These classes seem to be prime candidates for conversion; the other stuff will have to be rewritten but at the least some parts are leveraged.

I always asked myself if it would be possible to make a Java to C++ converter.  Maybe a tool that converts the Java syntax to the C++ syntax?  I am aware that the languages differ, but simple things like loops where the semantics match 1 to 1.  Is there such a tool? Or is it possible to make one?


I have an issue involving filling a rectangle, although, this is probably quite a simple problem, this has compeletly stumped me...   I know how to draw a rectangle for a given colour and a circle over the centre of said rectangle, however, I don't know how to ignore the colouring of the rectangle where I place the circle over the top of the rectangle!       \begin{tikzpicture}       \draw[black, fill = white, fill opacity = 0.5, semithick] (0,0) rectangle (5,);       \draw[black, semithick] (2.5,2.5) circle (0.5);     \end{tikzpicture}   Is there a way to fill in a rectangle with a particular colour but make an exemption for a circle in the centre? So that that part has no colour and is transparent?   Thanks!

I'm trying to draw a rounded rectangle with round "holes" using  but I need the rectangle borders to be thick and "holes" borders to be thin. Is there a better way to do so than:  \begin{tikzpicture}[x=1mm, y=1mm]     % Background         \fill[fill=black!10] (1.5, 1.5) rectangle (15, -15);      % Fill     \fill[fill=black!2, even odd rule, rounded corners=0.5mm]          (0, 0) rectangle (10, -10)          (2, -2) circle[radius=1.25mm]         (2, -5) circle[radius=1.25mm];     % Rectangle border     \draw[thick, rounded corners=0.5mm] (0, 0) rectangle (10, -10);     % Holes borders     \draw[thin] (2, -2) circle (1.25mm);     \draw[thin] (2, -5) circle (1.25mm); \end{tikzpicture}   The result image should look like this:


For my Computer Science class, we are doing an assignment on depth first search and i need to access the adjacent vertices (which is contained in a list within a struct). I need to use reverse iteration to go through the list but my teacher clearly states in the specifications:      "There are several ways to do this, and for (it=x.end(); it!=x.begin(); it--) is not one of them."   Any suggestions?

I'm writing some cross-platform code between Windows and Mac.  If list::end() "returns an iterator that addresses the location succeeding the last element in a list" and can be checked when traversing a list forward,  what is the best way to traverse backwards?  This code workson the Mac but not on Windows (can't decrement beyond first element):  list<DVFGfxObj*>::iterator iter = m_Objs.end(); for (iter--; iter!=m_Objs.end(); iter--)// By accident discovered that the iterator is circular ? { }   this works on Windows:  list<DVFGfxObj*>::iterator iter = m_Objs.end();     do{         iter--;     } while (*iter != *m_Objs.begin());   Is there another way to traverse backward that could be implemented in a for loop?


Is it possible to bind a jquery filter method to elements that don't exist yet? I have a table that is not built before page load, and a table row search that is supposed to filter out rows. Since table rows can also be added and removed, I need to be able to pre-bind the method handler. Example  class ElementSearch {      constructor($input, $elementClass){         let self = this;         this.$input = $input;         this.$elementClass = $elementClass;         this.$input.on('input', function(){             self.filterElements($(this).val());         });          return this;     }      /**      * Hide or show elements according to the search string      * @param {string} search       * @return ElementSearch      */     filterElements(search){         search = search.toLowerCase();         let self = this;         this.$elementClass.filter(function(){              let $this = $(this);             if($this.text().toLowerCase().indexOf(search) > -1){                 $this.fadeIn();             }             else {                 $this.fadeOut();             }         });         return this;     } }   In my App I create ElementSearch before the table is even defined or built. So I try this  this.elementSearch = new ElementSearch($input, $('body table tbody tr'));  Hoping that it will call filter on all tr elements even though they don't yet exist. This doesn't work (this.$elementsClass length = 0) but if I then set it after the table is built, it works.  Is there any way to do this?

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


There is a great tool called 'canned response' at Gmail but how can I make it produce responses that are customised? Sample template I want to create:  Dear %FIRSTNAME%, Thank you blah-blah-blah... (<-put cursor here) Please find this attached.   Does Gmail have macro definitions and do the canned responses allow for attachments?

It seems to be a very easy thing but I am struggling to see how. I need a "Dear %firstname%,  [cursor here] Kind Regards etc" template in my Gmail account, so every time I click reply, it is already there. How can I do that?


I know that the L2 regression (regression-based L2 loss function/least square regression) assumptions are as follows.   1- Little or no Multicollinearity between the features.  2- Homoscedasticity Assumption.  3- Normal distribution of error terms.  4- Little or No autocorrelation in the residuals.  My question is, what are the assumptions of L1 regression (regression-based L1 loss function/Mean absolute error?  Any resources/references related to my question are appreciated.

The question has been asked (one time) on CV before, but the answer is really imprecise and does not really answer the question in my opinion.  So: What are the assumptions for estimating a linear regression model via quantile regression?  To my understanding (and as several CV users have mentioned), quantile regression does not assume any specific distribution of the error terms - does that mean that, in a time series model, autocorrelation and heteroscedasticity do not have to be accounted for?  What about the other Gauss-Markov assumptions? I would assume that the assumption of no perfect multicollinearity has to be met when applying quantile regression, but do the parameters have to be linear? The linearity assumption only has to hold for the specific quantile I would assume.  Anyways - I do not find any backup for any of my thoughts in the scientific literature and I would appreciate a comprehensive answer. Thank you!


Let $f:[0,\infty)\to\mathbb{R}$ be continuous and $\lim_{x\to\infty}f(x)=L$. Show that $$\int_0^{\infty}\frac{f(ax)-f(bx)}{x}dx=[f(0)-L]\ln\frac{b}{a}$$ where $0<a<b$.  I don't even know how to start.

How can I prove the Theorem of Frullani? I did not even know all the hypothesis that $f$ must satisfy, but I think that this are  Let $\,f:\left[ {0,\infty } \right) \to \mathbb R$ be a a continuously differentiable function such that $$ \mathop {\lim }\limits_{x \to \infty } f\left( x \right) = 0, $$ and let $ a,b \in \left( {0,\infty } \right)$. Prove that $$ \int\limits_0^{\infty}  {\frac{{f\left( {ax} \right) - f\left( {bx} \right)}} {x}}dx  = f\left( 0 \right)\left[ {\ln \frac{b} {a}} \right] $$  If you know a more general version please give it to me )= I can´t prove it.


Newbie here. Curious why standard deviation subtracts x from xbar and then ^2's them instead of skipping hte squaring/square-rooting and instead takes the ABS value of each x-xbar Thanks mods

In the definition of standard deviation, why do we have to square the difference from the mean to get the mean (E) and take the square root back at the end? Can't we just simply take the absolute value of the difference instead and get the expected value (mean) of those, and wouldn't that also show the variation of the data? The number is going to be different from square method (the absolute-value method will be smaller), but it should still show the spread of data. Anybody know why we take this square approach as a standard?  The definition of standard deviation:  $\sigma = \sqrt{E\left[\left(X - \mu\right)^2\right]}.$   Can't we just take the absolute value instead and still be a good measurement?  $\sigma = E\left[|X - \mu|\right]$


I have a text in a variable, for example: "Lancer Square super / CIT" and I would like to divide the text into 2 variables after the mark, namely: "Square super" and "CIT"

I have this string  'john smith~123 Street~Apt 4~New York~NY~12345'   Using JavaScript, what is the fastest way to parse this into  var name = "john smith"; var street= "123 Street"; //etc...


Can I have Ubuntu and Windows 7 on the same computer? If so, how do I do this? I want to be able to choose which operating system to boot up to when I turn on my computer.

I need my pre-installed version of Windows 7 (or any other version of Windows), how could I install Ubuntu without erasing it?


I was trying to install Opendtect in Ubuntu and I am finding the following error during installation:   Err: Corrupt survey: missing directory: /tmp/Seismics Err: Cannot open user settings file for write     Cannot open '/home/dibakar/.od/settings.new' for write Err: Cannot open user settings file for write     Cannot open '/home/dibakar/.od/settings.new' for write   Any help on this issue will be appreciated.

The  is open source and still I have problems with the installation. When I run the installer, it does open a terminal for a second and then disappears. It has no manuals and few topics, the installation manual is not clear at all either.  So, how do I install Opendtect in Ubuntu 12.04?


I'm running Ubuntu 15.04 with "Cinnamon" installed, and I wish to install  this exstension :   I tried to install it this way:  1) Copied the folder "CoverflowAltTab@dmo60.de" to "~/.local/share/cinnamon/extensions/".  2) Enabled the extension in the cinnamon settings. (Eventually you have to restart cinnamon: Press Alt+F2, type 'r' and enter)  The problem is that I can`t locate this path : ~/.local/share/cinnamon/extensions/

How do you show a hidden folder (whose name starts with .) in File Manager a.k.a. Nautilus on Ubuntu?  I am somewhat new to Ubuntu and can't seem to find the "view" menu.


I would like to print something as 5,4,3,2,1.  This is my program, but it prints the numbers vertically.  numbers=5 i=1 while [ "$i" -le "$numbers" ] do echo “$i” i=$(( $i + 1 )) done   Do you have any solution that could help me?

I have iterate over numbers in various order. I am able to display them in increasing order, even with steps like:  $ seq --separator="," 1 10 1,2,3,4,5,6,7,8,9,10 $ seq --separator="," 1 2 10 1,3,5,7,9   I am also able to display them in reverse order, neither continuous nor step wise.  $ seq --separator="," 10 1    $ seq --separator="," 10 2 1   No output for above commands.   My shell details:  $ bash --version GNU bash, version 3.2.25(1)-release (x86_64-redhat-linux-gnu) Copyright (C) 2005 Free Software Foundation, Inc.   Let me know how I would be able to display the numbers in descending order?


I have a small VPS with 6GB RAM hosting a couple of websites.   Recently I have noticed that my cached memory size is quite high - see below:      Cpu(s):  0.1%us,  0.1%sy,  0.0%ni, 99.1%id,  0.0%wa,  0.2%hi,  0.4%si,  0.0%st     Mem:   6113256k total,  5949620k used,   163636k free,   398584k buffers     Swap:  1048564k total,      104k used,  1048460k free,  3586468k cached   After investigating if there is some method to have this flushed or cleared I stumbled upon a command which is:      sync; echo 3 > /proc/sys/vm/drop_caches   I read it could be useful to add this to a chron-task/job. Is this method recommended or could this lead to potential problems?  The only concern I have is that I use one Magento installation on Memcached - could this have any negative effects on it?  I am certainly not a pro therefore I would very much appreciate some expert advise.  PS: My VPS runs on CentOS 5 x64 and I have WHM + NGINX installed.

In our servers we have a habit of dropping caches at midnight.   sync; echo 3 > /proc/sys/vm/drop_caches   When I run the code it seems to free up lots of RAM, but do I really need to do that. Isn't free RAM a waste?


I created this bit of code to try and better understand some concepts in Java.  class S {     private String s;      public S(String s) {         this.s = s;     }      public S c(String s) {         return new S(this.s + s);     }      public void b(S o) {         if (this.s == o.s) {             System.out.println("ok");         }     } }  class M {     public static void main(String[] args) {         S s1 = new S("toto");         S s2 = s1.c("");         s1.b(s2); //1.         s1.b(new S("toto")); //2.     } }   At //1 (Changing it so user can understand) it prints ok as I expected it to, but at //2 it doesn't print ok (nothing) but I don't understand why. Isn't the variable s in S2 the same as the variable s in S1?

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I know $4^{n}$ diverges, and $\frac{(n!)^2}{(2n)!}$ converges. I also think that their product diverges since the term of this series is increasing but I don't know how to prove it. I tried ratio test which is inconclusive, and some other tests.

$$\sum_{n=1}^\infty {{4^n n!n!}\over{(2n)!}}$$  I tried the ratio test but got that the limit is equal to 1, this tells me nothing of whether the series diverges or converges. if I didn't make any errors when doing the ratio test,  it may diverge, but I need help proving that. Is there any other test I could try.


A couple of years ago, a former coworker told me a trick in Bash that I completely forgot how to do it. The idea is that when you type a path, in the next command you can use some shortcut to automatically put that path there as well.  Let's say I create the directory /tmp/test. If then I want to move a file there, I could mv file [shortcut that puts /tmp/test]  What's that shortcut?

I am starting to learn some Regex, therefore I use this command repeatedly:  grep pattern /usr/share/dict/american-english    Only the part with pattern changes, so I have to write the long expression "/usr/share/dict/american-english" again and again.   Someone made the remark that it is possible to expand an argument of a command from the command history by typing cryptic character combinations instead of the full expression.  Could you tell me those cryptic character combinations ?


With the time value being:  value = '2017-08-31T02:24:29.000Z'   I try to convert it to a datetime object with:  import datetime  datetime_object = datetime.datetime.strptime(value, '%Y-%b-%d  %I:%M%p')   But the command crashes with the exception:  ValueError: time data '2017-08-31T02:24:29.000Z' does not match format '%Y-%b-%d  %I:%M%p'

I need to parse  strings like "2008-09-03T20:56:35.450686Z" into Python's datetime type.  I have found  in the Python standard library, but it is not very convenient.  What is the best way to do this?


In cricket, can a bowler start his run-up to the delivery before the batsman takes his stance?

Is there a rule that states that a batsman must be ready for the bowler, or is it just good etiquette? I'm not referring to waiting for a new bat to come in after a wicket has fallen. I'm talking about a bowler having to wait for the batsman mid-over, to get ready to receive the next delivery. In a recent match, the bowler was bowling off a 10 yard run up. For every ball, a particular batsman was waiting 3-4 yards leg side of the wicket. He waited for the bowler to get to his mark and be ready to start the delivery, before he then walked into the crease and took his guard to receive the ball.  This was adding a slight delay to every ball, and (perhaps intentionally) annoying the entire field! On occasion this would be fine, but this batsman did it every single ball. I was always taught that it is the batsman's responsibility to be ready for the bowler (assuming the batsman has reasonable time). In this case, with the bowler having a 10 yard run-up there was always plenty of time for the batsman to get ready. I have scoured the rules but can't find anything that explicitly states one way or the other. All I can find under the dead ball rules is  Law 20.5 Ball ceases to be dead. The ball ceases to be dead – that is, it comes into play – when the bowler starts his/her run-up or, if there is no run-up, starts his/her bowling action.  and under 20.4.2 Either umpire shall call and signal Dead ball when  20.4.2.5 the striker is not ready for the delivery of the ball and, if the ball is delivered, makes no attempt to play it.  Provided the umpire is satisfied that the striker had adequate reason for not being ready, the ball shall not count as one of the over.  This implies that unless the batsman has a good reason not to be ready, he has to be ready to receive the ball. "adequate reasons" is a bit vague - there are many adequate reasons that could fit in here, but if the batsman's batting mannerisms are simply that he likes to wait for the bowler to be ready, then surely that doesn't apply? Was it reasonable for the batsman to oblige the bowler to have to wait for him to be ready every single delivery, or, given there was no adequate reason, could the bowler have legitimately just started bowling? Where in the rules does it govern who has to be ready for who?


Let $\Omega$ $\subseteq$ $\Bbb R^{n}$ be bounded and $u$ be a measurable function on $\Omega$ Such that $|u|^{p} \in {L^{1}_{\mathrm{loc}}(\Omega)}$ for some $p \in \Bbb R$. Then how to show the following?  $$\lim_{p\rightarrow0} \left(\frac{1}{|\Omega|}\int_{\Omega} |u|^{p}\,\mathrm{d}x\right)^{\frac{1}{p}} = \exp \left(\frac{1}{|\Omega|}\int_{\Omega}\log|u|\,\mathrm{d}x\right)$$  I attempted as follows:  $$\lim_{p\rightarrow0} \left(\frac{1}{|\Omega|}\int_{\Omega} |u|^{p}\,\mathrm{d}x\right)^{\frac1p} = \lim_{p\rightarrow0} \frac{1}{|\Omega|^\frac{1}{p}}\left(\int_{\Omega}|u|^{p}\,\mathrm{d}x\right)^{\frac1p} = \exp \lim_{p\rightarrow0} \frac{1}{|\Omega|^\frac1p} \log\left(\int_{\Omega} |u|^{p}\,\mathrm{d}x\right)^{\frac1p}= \exp\left(\frac{1}{|\Omega|}\int_{\Omega}\log|u|\,\mathrm{d}x\right)$$    However;I think some steps especially the last two are not satisfactory for me.If you see that you're well come!

I not solve the follow limit $$\lim_{p\rightarrow 0} \bigg[\int_{\Omega} |f|^p d\mu \bigg]^{1/p} = \exp\bigg[ \int_{\Omega} \log|f|d\mu \bigg],$$  where $(\Omega, \mathcal{F}, \mu)$ is a probability space and $f,\log |f| \in L^1(\Omega).$  Can someone help me?  Thank you!


A baseball diamond is a square with side length $90$ ft. A batter hits the ball and runs toward first base with a speed of $f(t)$ ft/s after $t$ seconds. At what rate is the batter's distance to second base decreasing when the batter is halfway to first base? This is not a duplicate, because the speed is varying in this question compared to the one you guys linked it to.

Trying to study for my mid-term, but I'm having slight difficulties understanding what I'm supposed to do in this one problem:  A batter starts running towards first base at a constant speed of 6 m/s. The distance between each adjacent plate is 27.5 m. After running for 20 m, how fast is he approaching second base? At the same moment, how fast is he running away from third base? (see image below)    This is what I have so far:   Let $d$ be the distance the batter has run thus far The distance between the batter and first base is 7.5 m The distance between the batter and second base is $\sqrt {27.5^2 + (27.5-d)^2}\ $, or approx. 28.5044 m when $d = 20$ The distance between the batter and third base is $\sqrt {27.5^2 + d^2}\ $, or approx. 34.0037 m when $d = 20$   No need to hand feed me the answer, I'd just like a bit of insight on how to solve the problem.


I can't back up my iPhone to iTunes and haven't been able to for almost a year.   I updated my phone, I've reinstalled iTunes, |I've deleted the backups existing in the preferences.  Any forum I've looked at only shows how to fix it on a Mac, and I don't have one of those. I've got a windows machine.

When I try to sync my iPhone with my computer, I get the following message:       iTunes could not back up the iPhone "iPhone Name"   because the backup was corrupt or not compatible   with the iPhone.      Delete the backup for this iPhone, then try again.   Yet, here is no option to delete the backup. Where are backups stored / how can I delete the backup?  This is iTunes version 10.5.3 running under  Mac OS X 10.6.8.


I need to forward some websites, such as  to an fixed IP address on my local network. I can do this easily on one computer using the hosts file. However, I need this to work for all machines on my network.  I think the best way to do this will be to setup my own DNS Servers and add the custom DNS settings there.  However, I'm looking for the simplest way possible to do this - I really don't want to spend hours setting up Unix Servers and running tricky terminal based scripts just to do this!  My server is a standard Windows 7 machine.  My dream would be a nice simple windows program with a GUI where I could input my ISP's DNS server and it would use those records, unless I had specifically set up my own DNS for a domain to use instead. If it had a web based admin system that was accessible from another computer on the network that would be even better.  Does anyone know of anything that can do this? Many thanks indeed.

I have a small home network that just got larger (new roommate, my existing roommate got a laptop (on top of her computer), my friends coming over with laptops, etc.).    I'd like to run a local DNS server for lookups of my local network stuff (fileserver.local, windowsTV.local, machineA.local, machineB.local, appletv.local).   I used to have a business line with a static IP, and run bind/named internally.   However, now I have a normal account.  My ISP's DNS servers are constantly changing (for whatever reasons my ISP doesn't like to keep the same IP range for long).  I need my local DNS to be automatically updated to use my ISP's DNS for external traffic, but be able to maintain an internal DNS server (getting to update the hosts file is being a hassle with every new machine on top of rebuilding existing machines with win7 or Ubuntu 9.04).  Additionally, My ISP's DNS servers often crash or become unresponsive.  Are there any open DNS servers that are reliable (I don't want to reconfig every day) that I could use as my primary, then if those fail, then use my ISP's?  UPDATE:  Also looking for each workstation to be able to use dhcp to connect, but instead of getting ISP DNS servers, getting my internal one....


Lets say we have an irregularly shaped conductor with a random cavity inside it and a charge +q outside the conductor. Now I have to find the potential inside the conductor due to induced charges on conductor and +q outside the conductor. Now from the property of conductors with cavity, the field due to outer surface charges and outer charges is 0 inside the conductor. Since there will be a field outside the conductor due to +q and induced charge in outersurface, we cant say that line integral of field due to these two till the surface is not 0 and hence potential is not 0. Due to which potential due to these two is also not zero inside the conductor. Am I right?

Would the field in a cavity inside an arbitrary conductor with some charge, which is NOT SYMMETRIC be zero?   My book only says that field inside a cavity is always zero when there is no charge in cavity. But they prove this by taking a sphere with a symmetrical cavity and using Gauss law. But how can I prove this in cases where I can't take $E$ (field) out of:   $$\oint\pmb{E}\cdot d\pmb{A}=\frac{Q_{enclosed}}{\varepsilon_0}.$$


I'm running Lubuntu 16.10 on a machine which will mainly act as a file server. I want to create some SMB shares, which I was led to believe would be simple (!)....so having not found anything in the GUI I launched shares-admin from the command line. I got:  Sharing services are not installed - Install Unix networks support (NFS) - Install Windows networks support (SMB)  I clicked the option to install both, then got: Could not install package GDBus.Error:org.freedesktop.DBus.Error.ServiceUnknown: The name org.freedesktop.PackageKit was not provided by any service files   Any ideas?   I REALLY, REALLY want to use Linux for this server, but every time I come back to it I find myself losing hours trying to do things that are 2 minute jobs on Windows :0(

I'm running Ubuntu 12.04 inside VMware on a Windows 7 host and I need to share a folder to the host machine.  I've successfully shared the folder so it's visible to the Windows side, but I need to be able to have this work on multiple domains for different users.  Any idea on how I can make this folder available to everyone no matter what domain it's running on?


I know that Merope's love potion made him unable to love, but I was wondering if Tom Marvolo Riddle's inability to love somehow affected his moral alignment for the worse.

So I was reading through this list:   And it happens to state:     Voldemort cannot love due to being conceived under the effects of a   love potion.   Now, I'm pretty sure that's not canon. I can't find a source for this in that site. But now that it mentions it, I can't help but stop wondering how did they reach that conclusion at all.  Is there anything canon that might suggest that statement? About how a love potion on Voldemort's father happened to affect his own ability to love?


f is an entire function, suppose $|f(z^{2})| \leq  2|f(z)|$ for all C, then f is a constant. I 'm trying to use Liouville's theorem, but it seems that it isn't helpful.

I'm not sure if this requires Liouville's theorem or the use of the integral formula for the Taylor coefficients but I cant get either to work.  By the formula for the Taylor coefficients for $f(z^2)$ we have that:   $$\vert a_n\vert  = \Big\vert \frac{1}{2 \pi i} \int_{\vert z\vert =R} \frac{f(z^2)}{z^{n+1}} dz\Big\vert \leq \frac{1}{2 \pi} \int_{\vert z \vert =R} \frac{\vert f(z^2) \vert}{\vert z \vert^{n+1}} \vert dz \vert \leq \frac{1}{2 \pi} \int_{\vert z \vert =R} \frac{2\vert f(z) \vert}{\vert z \vert^{n+1}} \vert dz \vert  $$  and then this can be bounded by   $$ \frac{1}{2 \pi } \frac{M_f(R)}{R^{n+1}} 2 \pi R =  \frac{M_f(R)}{R^{n}} $$  where $M_f(R)$ is the max of $\vert f\vert $ on the circle $\vert z \vert =R$. I had wanted to take the limit as $R \to \infty$ and have that it equals $0$ unless $n=0$ but this isn't clear to me.


I have two scripts: foo.sh: #!/bin/bash echo -e "one\ntwo" | while read line; do     cat not-existing     echo hello $line done  bar.sh: #!/bin/bash echo -e "one\ntwo" | while read line; do     ssh user@machine 'cat not-existing' # Here is the only difference     echo hello $line done   And now I run them $ ./foo.sh  cat: not-existing: No such file or directory hello one cat: not-existing: No such file or directory hello two  $ ./bar.sh  cat: not-existing: No such file or directory hello one  The output of bar.sh is surprising to me. I would expect it to be the same for both scripts. Why does the output of foo.sh and bar.sh differ? Is it a bug or a feature?  Note The following works as I expect, i.e. the output of this is the same as the output of foo.sh: #!/bin/bash for line in `echo -e "one\ntwo"`; do     ssh user@machine 'cat not-existing'     echo hello $line done  Why?

I have finally managed to boil down a problem I have been struggling with for a few weeks.  I use SSH with "authorized keys" to run commands remotely.  All is fine except when I do it in a while loop.  The loop terminates after completing any iteration with an ssh command.  For a long time I thought this was some kind of ksh weirdness, but I now discovered bash does in fact behave identically.  A small sample program to reproduce the problem.  This is distilled from a larger implementation which takes snapshots and replicates them amongst the nodes in a cluster.  #!/bin/bash  set -x  IDTAG=".*zone" MARKER="mark-$(date +%Y.%m.%d.%H.%M.%S)" REMOTE_HOST=sol10-target ZFSPARENT=rpool  ssh $REMOTE_HOST zfs list -t filesystem -rHo name,mounted $ZFSPARENT | grep "/$IDTAG    " > /tmp/actionlist  #for RMT_FILESYSTEM in $(cat /tmp/actionlist) cat /tmp/actionlist | while read RMT_FILESYSTEM ISMOUNTED do    echo ${RMT_FILESYSTEM}@${MARKER}    [ "$ISMOUNTED" = "yes" ] && ssh $REMOTE_HOST zfs snapshot -r ${RMT_FILESYSTEM}@${MARKER}    echo Remote Command Return Code: $? done   (Note there is a TAB character in the grep search expression as per the definition of the behaviour of the zfs list "-H" option.)  My sample have some ZFS filesystems for the root where all the "zones" have their root file system on a dataset named similar to  POOL/zones/app1zone POOL/zones/group2/app2zone    etc.  The above loop should create a snapshot for each of the selected datasets, but in stead it operates only on the first one and then exits.  That the program finds the right number of datasets can be easily confirm by checking the "/tmp/actionlist" file after the script exists.  If the ssh command is replaced by, for example, an echo command, then the loop iterates through all the input lines.  Or my favourite - prepend "echo" to the offending command.  If I use a for loop in stead then it also works, but due to the potential size of the list of datasets this could cause problems with the maximum expanded command line length.  I am now 99.999% sure that only those loops with ssh commands in them give me problems!  Note that the iteration in which the ssh command runs, completes! It is as if the data pipped in to the while loop is suddenly lost...  If the first few input lines don't perform an ssh command, then the loop goes on until it actually runs the SSH command.  On my laptop where I am testing this I have two Solaris 10 VMs with only about two or three sample datasets, but the same is happening on the large SPARC systems where this is meant to go live, and there are many datasets.


when i do sudo apt-get update i get these errors;  Err http://ppa.launchpad.net wily/main amd64 Packages   404  Not Found Hit http://archive.ubuntu.com wily-backports/restricted Translation-en   Please could someone help out

PPA seems to be constantly offline. Whenever I use sudo apt-get update, this error is shown:  W: Failed to fetch http://ppa.launchpad.net/ 404  Not Found   How do I fix these errors?


here is code  public WebDriver driver; @FindBy(xpath="//*[@class='btn btn-primary m-t-15 waves-efassociatesave']") public WebElement addEmployee; public Employee(WebDriver x) {     this.driver=x;     PageFactory.initElements(driver, this); } public void fillEmployeeName(String x) {     ExplicitWaitMethods.waitForVisibility(employeeName);     inputObj.enterText(employeeName, x); }   iam calling this method  public class TestImpl implements Test{  WebDriver driver; Employee e=new Employee(driver);  public TestImpl(WebDriver x) {     this.driver=x;     PageFactory.initElements(driver, this); } @Override public void addEmployee() {     // TODO Auto-generated method stub     e.addEmployee.click();     e.fillEmployeeName("vishal"); }   }  iam calling this method in stepdefination  @Then("^get data$") public void getData() {     //employee.getEmployeeName();     t.addEmployee();  }   error message:     java.lang.NullPointerException     at   org.openqa.selenium.support.pagefactory.DefaultElementLocator.findElement(DefaultElementLocator.java:59)     at org.openqa.selenium.support.pagefactory.internal.LocatingElementHandler.invoke(LocatingElementHandler.java:37)     at com.sun.proxy.$Proxy12.click(Unknown Source)     at pages.TestImpl.addEmployee(TestImpl.java:19)     at stepDefintions.PredefinedStepDefinitions.getData(PredefinedStepDefinitions.java:315)     at ✽.Then get data(E:/eclipse/erp/src/test/resources/features/login.feature:48)  then nullpointer exception arises. can anyone help me out for this issue

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I'd like to hang at the United Club in Newark Terminal C as long as poss b4 leaving on international Austrian Air in Terminal B.  How much transfer time should my family allow? Only one of us has Global card.

I fly in from Sweden with United to Newark Liberty Airport. The connecting flight with United departs to Costa Rica a few hours later from Newark as well. The two flight-segments are part of the same trip and ticket.  I was hoping to stay in the same terminal but am suspecting that it wont be as straightforward as I had hoped - reading through the older posts it seems that a transfer is needed from A to C but it's not fully clear.   Do I need to pass through immigration? Do I need to fetch our bags? Even if my bags have tags all the way to SJO? Do I need to change terminals? Which terminal would I arrive in? Depart from?


I want to know this because I died really far away and I am stressing that the items will despawn. My world tick speed is 1.

Possible Duplicate:          New Minecraft player and I am trying to dump my wooden tools and rock tools now that I am smelting iron.  My solution so far is to dig a hole away from my dwelling and dropping the items down in it.    Do the items eventually decay?


In this site, the existence proof of the transitive closure for sets is addressed in the following questions and others:   I think the  of the first question particularly, after correcting seemingly formally fragile argument, shows that, taking Extensionality, Pair, Union, and Replacement (and hence Separation) for granted, Infinity or $\in$-Induction is sufficient for the construction of the transitive closure of a set. However, the usual presentation of ZFC does not contain $\in$-Induction; instead it has the following Regularity: $$ \forall x,\left[\left(\exists y, y \in x\right) \implies \left(\exists y \in x, x\cap y = \emptyset\right) \right]\text{.} $$ If I remember correctly, in the proof of $\in$-Induction from Regularity, we utilize the existence of the transitive closure. Is it possible at all to justify the operation using the axioms Extensionality, Pair, Union, Replacement, and Regularity (and possibly Power)?

This question is my attempt to hone in on the problem of proving the strong form of the Axiom of Regularity $A\neq\emptyset\to\exists x\in A(x\cap A=\emptyset)$ (where $A$ is an arbitrary class) from the weak form $\forall a\!:a\neq\emptyset\to\exists x\in a(x\cap a=\emptyset)$. In ZF with the negation of the Axiom of Infinity (which I abbreviate as $\sf ZF^{\neg\infty}$), all sets have finitely many elements, and this allows us to prove that sets like $x=\{\{\{x\}\}\}$ do not exist, but I don't see how to prove that the infinite family $x_n=\{x_{n+1}\}$ does not exist, since I can't collect all the elements together and use regularity on that, since the resulting class is (provably) not a set.  My ultimate goal is to prove that every set has a transitive closure (that is a set), but these sets will foil my attempt if I can't prove their non-existence. Conversely, supposing I couldn't prove this, this would mean that $\infty$ is required for the proof, so could I turn it around and prove, given that every set has a transitive closure, that $\omega\in V$?


I need your advice please. Any advice will be appreciated! My first interview for B1 US visa was denied in 17th April. 2019 and I again applied to new interview with same purpose. Interview date is 25th April. I wore suit with tie. And my interview started with nise VO.   VO: Good morning  Me: Good morning sir.  VO: Can I have your passport  Me: sure  VO: Where do you study  Me: ABCD university PhD student   VO: what is your purpose  Me: IEEE s&p conference  VO: how long you will stay Me: 4 nights  VO: what your parents do? Me: I said my father is taxist instead of( taxi driver)  my mom is seller  VO: sorry I don’t understand your father’s job Me: again taxist instead of( taxi driver), after 2 secon I corrected my mistake he is taxi driver. Sorry   VO: have you been other countries (last question) Me: no  VO:( gave me one yellow paper) everything is explained here.  Me: Thank you very much( I read this Paper after leaving interview room. It was Section 214(b) But I live with my wife in korea. It is not  strong tie? He did not asked about my marriage and supporting documents. I had following documents: -financial support ; -letter of guarantee (returnt bact Korea); -invitation letter; -round trip ticket ; -hotel booking; 1)I wanna give all of my docs with passport. Is it polite? How VO react for this situation? 2)Making mistake with my father’s job and correcting that mistake will it lead to a rejection? 3) what kind of questions I can expect in the 25th next interview? And how many % of chance I have for approving my visa in next immediate interview? Thank you for sharing you time!

How can I prove the immigrant officers that I have significant ties in my home country?  Are there any documents that I need?


What does:  someFunction(args)(moreArgs);   Do in JavaScript?  I have a following working piece of code from the :  app.get('/login', function(req, res, next) {     passport.authenticate('local', function(err, user, info) {         if (err) { return next(err); }         if (!user) { return res.redirect('/login'); }         req.logIn(user, function(err) {             if (err) { return next(err); }             return res.redirect('/users/' + user.username);         });     })(req, res, next); });   In this case passport.authenticate is being called with args (the String local and a Function) then afterwards (req, res, next) exists.  In otherwords:  someFunction(args)(moreArgs);   This isn't an IIFE - there's no () around the function being ran. What is it?

I've seen references to curried functions in several articles and blogs but I can't find a good explanation (or at least one that makes sense!)


We installed a new CentOS server for testing and the configuration was a bit different as compared to debian. I am unsure at this moment if the port-5432 is secure for us. If not, how can I secure port-5432 running postgresql so that it's not accessible from internet. Although I remember adding a rule for port-5432, I cannot see it in Iptables.  This is not a debian system.   Iptables -S :  -P INPUT ACCEPT -P FORWARD ACCEPT -P OUTPUT ACCEPT -A INPUT -p tcp -m tcp --dport 443 -j ACCEPT -A INPUT -p tcp -m tcp --dport 80 -j ACCEPT -A INPUT -m state --state RELATED,ESTABLISHED -j ACCEPT -A INPUT -p icmp -j ACCEPT -A INPUT -i lo -j ACCEPT -A INPUT -p tcp -m state --state NEW -m tcp --dport 22 -j ACCEPT -A INPUT -j REJECT --reject-with icmp-host-prohibited -A FORWARD -j REJECT --reject-with icmp-host-prohibited   netstat -tulpn | grep 5432 tcp        0      0 127.0.0.1:5432          0.0.0.0:*               LISTEN      2938/postgres        tcp6       0      0 ::1:5432                :::*                    LISTEN      2938/postgres

I add this rule:  sudo iptables -t nat -A OUTPUT -d a.b.c.d -p tcp \        --dport 1723 -j DNAT --to-destination a.b.c.d:10000    When restart computer rules are deleted. Why? What I can do to make the rules persist?


When people move places from one apartment to another one they can say 'we moved' or 'we relocated'. Is it also valid to say 'we shifted'?      These definitions do not provide such an example.

For changing one's home from one place to another, I've heard people in western part of the world using the sentence:      I'll be moving next month.   In India, even in the English news channels, I've heard many people using the phrase:     I'll be shifting next month.   Which one is the correct usage? Or are both of them correct and the difference in usage is regional?


after enabling depth of field i faced with problem of noise. Metal objets especially looks very bad. How to fix it?

I know that this question is a bit old or maybe overdone, but I'm running the latest edition of Blender and when I use the Cycles engine I get really fuzzy results and I can't find a simple, non-compromising solution to the quality.  I don't know exactly what I'm doing wrong here, but I'm sure others share my frustration.  Leaving everything in default settings, I started a new project and switched to the Cycles render.  I duplicated the cube and set colors for two Diffuse BSDF shaders, then went ahead and made walls and a floor all sharing the same diffuse shader.  I made two windows to emit blue light.  The screenshot has gaps between the walls because of the setup:  I'm aware that it's considered very incomplete and many have come to terms with some amount of noise, but is this normal?  Furthermore, with default settings or not, I can't change the amount of noise produced.  Supposedly, using "progressively refine" in the rendering tab should make it refine itself indefinitely, however Cycles only counts to 10 refines and then stops, creating a render which is a pixel-perfect match of the ordinary rendering method when it's completed.  I understand that there are tricks that can be used to reduce noise, but at the cost of extra processing time and usually small quality conflicts, like blurring.  My question essentially boils down to is this Cycles' current limit?


I am having a strange problem in that when anything from my mysql database is retrieved and echo'd out in a php script the quotation marks in the record are being replaced by diamond shaped question marks in Google Chrome.  My mysql database is set to collation : utf8_general_ci   The part of script that is pulling down the records is as follows :      <?php     echo '
';     // Retrieve Page Content //      $testimonialssql = <<<SQL         SELECT *         FROM `testimonials`         ORDER BY id DESC         LIMIT 5     SQL;      if(!$resulttestimonials = $db->query($testimonialssql)){         die('There was an error running the query [' . $db->error . ']');     }     while($rowT = $resulttestimonials->fetch_assoc()){         if ($rowT['company'] == ''){$name = $rowT['name'];}else{$name = $rowT['name'].' - '.$rowT['company'];}         $from = $rowT['from'];         $message = $rowT['message'];         echo '
'.$name.'
';         echo '
'.$from.'
';         echo '
'.$message.'
';             }             echo '
';     ?>   This is included in my index.php which has the following settings :  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"     "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">   <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />   I have tried using htmlenteties and stripslashes and various other things, but still have the same problem.

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


New LaTex user here, hoping you can help me.   I am drafting a letter, the submission date of which I do not yet know. For this reason I am dating it using \today. However, in the text of the letter, I would like to specify a date two weeks in advance of \today. In other words, there is an [advance date] and an [advance date II], the latter specifying a date 14 days after the former.  I found the advdate package but, unless I am mistaken, it doesn't allow for setting two individual hypothetical dates. Is there a non-complicated way of implementing this?  Thanks for your help.

I was asked how to implement a \tomorrow macro in TeX/LaTeX. While I could come up with a reasonably good solution, working for one document class, I don't see how that could be achieved in a document class agnostic way.  I found , but even though the date arithmetic may be of use, it assumes a specific format for the date (which also is wrong for the locale I reside in).  Does anyone have a reasonably portable solution? Is this even possible?


Can we use ampersand in alias names which we use in Oracle select statement. any work around to get this working?  select ename||','||job as name&job from employees ;   ps: I am using plsqldeveloper IDE.

I have a SQL script that creates a package with a comment containing an ampersand (&). When I run the script from SQL Plus, I am prompted to enter a substitute value for the string starting with &. How do I disable this feature so that SQL Plus ignores the ampersand?


I have a simple setup like this:  SERVER ---- INTERNET ---- CLIENT  On SERVER I already have OpenVPN set up with a sertificate for CLIENT. On CLIENT I already have OpenVPN set up to contact the server using its key and this is working fine.  Now I would like to set up another OpenVPN connection between SERVER and CLIENT with different settings (lets say the first is TCP and the other is UDP for example).  In this scenario, can I reuse the certificate/key from the first connection in the configuration of the second?  Is this a good practice? Why/Why not? Any caveats to know about?

We are experimenting with running an OpenVPN server for our business. One question I can't seem to find the answer to is this:  When we generate keys for one of our users for them to use at home, can their use the same keys on their home laptop as well as their home desktop? Or do we need to generate separate keys for each user's client machine?


I am wondering if there is a rigourous way to show the following series converges: $$ f(x) = \begin{cases} \dfrac{1}{x^2} & x \in \mathbb{N} \\[1ex] g(x) & x \not\in \mathbb{N}\in \mathbb{R} \end{cases}$$ Here, $g(x)$ could be anything, but for interest, wouldn't converge on its own. When we do the following: $$\lim_{k\to\infty}\sum_{n=1}^{k}f(n).$$ Do we get a limit that exists? Intuitively we would, because summation is only defined on the natural numbers (unless we redefined it here, doing some interpolation between points). However, I am not certain this function is integrable, which would suggest the function does not converge (unless my understanding of the Integral Test is wrong, after all, it says nothing of whether the integral exists, just if it converges the sum converges and vice-versa).

As I have heard people did not trust Euler when he first discovered the formula (solution of the ) $$\zeta(2)=\sum_{k=1}^\infty \frac{1}{k^2}=\frac{\pi^2}{6}.$$ However, Euler was Euler and he gave other proofs.   I believe many of you know some nice proofs of this, can you please share it with us?


I have a set of shapefiles loaded to GeoServer, which I later deliver as a WMS. All the shape files are rendered in the same neutral grey, which makes it quite difficult to tell apart which shape file I'm visualizing. Can I assign colours of textures to each polygon? A very similar question was posted earlier. But, since the user relied on ESRI technology, all answers focused on ESRI solutions; not GeoServer.  The question linked to mark mine as duplicate is a different question; even if both answers happen to be in the same manual. I want to give a colour to each shapefile. While the other question was about assigning colours based on the value of a field.

In arcgis, this can be easily done by using the Symbology tab in the properties.I need to achieve a similar effect in Geoserver. How can I do it?


Which preposition is appropriate? On, with or to?    Stay updated with/on our Facebook page Stay connected to/on/with our Facebook page Stay updated on the go on/with our Facebook page Stay connected on the go to/on/with our Facebook page.

I have seen both usages.    Stay tuned on our Facebook page to know more  Stay tuned to our Facebook page to know more    But don’t know which one is more appropriate. Please help me figure it out. Thanks


Let $f:\mathbb{C}_{4\times4}\longrightarrow\mathbb{C}_{4\times4}$ be the linear map defined by $f(A)=A+3A^T$. Determine eigenvalues, the corresponding eigenspaces and their dimension.  I cannot start this exercise. Some helps?   Thank You

Let $M_n$ denote the vector space of all $n\times n$ real valued matrices and for any matrix $A\in M_n$ let $A^t$ denote its transpose. Define the linear map $T:M_n\rightarrow M_n$ as $$T(A)=A+A^t.$$ What is the minimal polynomial of $T$? What are the eigenvalues and the corresponding eigenspaces of $T$? What is the characteristic polynomial of $T$?  I learned about minimal polynomials of operators from $\textit{Linear Algebra Done Right}$ by Axler. In his description he explains how in order to find the minimal polynomial you must find the smallest positive integer $m$ such that $T^m$ is a linear combination of $I, T, T^2, \ldots, T^{m-1}$. That is, the smallest integer $m$ such that $$T^m = a_0I+a_1T+a_2T^2+ \cdots +a_{m-1}T^{m-1}.$$  As for the eigenvalues...since we are working with real-valued matrices, then $A$ and $A^t$ have the same eigenvalues, so if $\lambda \in \mathbb{R}$ is an eigenvalue of $A$ (and hence of $A^t$) wouldn't $2\lambda$ be an eigenvalue of $A+A^t$? I apologize if I am saying utter nonsense...


I have ground lidar points, nonground lidar points and tree lidar points.   The problem is some of the ground lidar points are incorrect. For example, the highest elevation values of tree and building are not over 200 but a few of points in ground lidar points are over 300.  so I want to remove the points higher than 200 and replace them with the surrounding values in ground lidar data.  Any help?

I have more than 2000 XYZ (only ground points) .txt files and I have to do Quality Control (QC).  Let's say I have file, which I converted to multipoint (or even singlepart feature). I have mean Z value for a file, but if most of the points are 20-40 metres, and two, three points per file are 70-80 metres (wrong Z values). How to catch these points and remove? On another hand, it could be that in another file 70-80 metres is common Z value and some points wrong Z value 120 metres. In another file 120 metres is common and correct.  How to find and remove points with wrong Z values in LIDAR data?  Standard deviation? Raster cells?


I receive this meassage when I run sudo apt-get update in the terminal:- Duplicate sources.list entry  precise/partner i386 Packages (/var/lib/apt/lists/archive.canonical.com_ubuntu_dists_precise_partner_binary-i386_Packages)  So i ran the command gksu gedit /etc/apt/sources.list and checked the source to find there was no duplicate, not that I can see anyway. Here is the source:-  # deb cdrom:[Ubuntu 12.04 LTS _Precise Pangolin_ - Release i386 (20120423)]/ precise main restricted deb-src http://archive.ubuntu.com/ubuntu precise main restricted #Added by software-properties  # See http://help.ubuntu.com/community/UpgradeNotes for how to upgrade to # newer versions of the distribution. deb http://gb.archive.ubuntu.com/ubuntu/ precise main restricted deb-src http://gb.archive.ubuntu.com/ubuntu/ precise restricted main multiverse  universe #Added by software-properties  ## Major bug fix updates produced after the final release of the ## distribution. deb http://gb.archive.ubuntu.com/ubuntu/ precise-updates main restricted deb-src http://gb.archive.ubuntu.com/ubuntu/ precise-updates restricted main multiverse universe #Added by software-properties  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu ## team. Also, please note that software in universe WILL NOT receive any ## review or updates from the Ubuntu security team. deb http://gb.archive.ubuntu.com/ubuntu/ precise universe deb http://gb.archive.ubuntu.com/ubuntu/ precise-updates universe  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu  ## team, and may not be under a free licence. Please satisfy yourself as to  ## your rights to use the software. Also, please note that software in  ## multiverse WILL NOT receive any review or updates from the Ubuntu ## security team. deb http://gb.archive.ubuntu.com/ubuntu/ precise multiverse deb http://gb.archive.ubuntu.com/ubuntu/ precise-updates multiverse  ## N.B. software from this repository may not have been tested as ## extensively as that contained in the main release, although it includes ## newer versions of some applications which may provide useful features. ## Also, please note that software in backports WILL NOT receive any review ## or updates from the Ubuntu security team. deb http://gb.archive.ubuntu.com/ubuntu/ precise-backports main restricted universe multiverse deb-src http://gb.archive.ubuntu.com/ubuntu/ precise-backports main restricted universe multiverse #Added by software-properties  deb http://security.ubuntu.com/ubuntu precise-security main restricted deb-src http://security.ubuntu.com/ubuntu precise-security restricted main multiverse universe #Added by software-properties deb http://security.ubuntu.com/ubuntu precise-security universe deb http://security.ubuntu.com/ubuntu precise-security multiverse  ## Uncomment the following two lines to add software from Canonical's ## 'partner' repository. ## This software is not part of Ubuntu, but is offered by Canonical and the ## respective vendors as a service to Ubuntu users. deb http://archive.canonical.com/ubuntu precise partner # deb-src http://archive.canonical.com/ubuntu precise partner  ## Uncomment the following two lines to add software from Ubuntu's ## 'extras' repository. ## This software is not part of Ubuntu, but is offered by third-party ## developers who want to ship their latest software. # deb http://extras.ubuntu.com/ubuntu precise main # deb-src http://extras.ubuntu.com/ubuntu precise main deb http://repository.spotify.com stable non-free   I can see there are two lines of deb  precise partner but one has #deb-src at the beginning of it.  Hashed out no?   I'm quite new to linux OS and have little to none sourced editing skills so any help would be most appreciated.  Thank you:)

I keep getting this warning whenever I try to run sudo apt-get update.  W: Duplicate sources.list entry http://archive.ubuntu.com/ubuntu/ precise-updates/main i386 Packages (/var/lib/apt/lists/archive.ubuntu.com_ubuntu_dists_precise-updates_main_binary-i386_Packages) W: You may want to run apt-get update to correct these problems   Below is the output from /etc/apt/sources.list file:  deb http://archive.ubuntu.com/ubuntu precise main restricted deb-src http://archive.ubuntu.com/ubuntu precise main restricted  deb http://archive.ubuntu.com/ubuntu precise-updates main restricted deb-src http://archive.ubuntu.com/ubuntu precise-updates main restricted  deb http://archive.ubuntu.com/ubuntu precise universe deb-src http://archive.ubuntu.com/ubuntu precise universe deb http://archive.ubuntu.com/ubuntu precise-updates universe deb-src http://archive.ubuntu.com/ubuntu precise-updates universe  deb http://archive.ubuntu.com/ubuntu precise multiverse deb-src http://archive.ubuntu.com/ubuntu precise multiverse deb http://archive.ubuntu.com/ubuntu precise-updates multiverse deb-src http://archive.ubuntu.com/ubuntu precise-updates multiverse  deb http://archive.ubuntu.com/ubuntu precise-security main restricted deb-src http://archive.ubuntu.com/ubuntu precise-security main restricted deb http://archive.ubuntu.com/ubuntu precise-security universe deb-src http://archive.ubuntu.com/ubuntu precise-security universe deb http://archive.ubuntu.com/ubuntu precise-security multiverse deb-src http://archive.ubuntu.com/ubuntu precise-security multiverse   How do I fix it?


I have an analysis program and a text file with data in it which for the sake of exposition I will call wibble and data.txt respectively.    I tried a simple for loop to process all of my data:for i in $(cat data.txt); do     wibble $i done  But it takes a very long time to finish the analysis one by one.  So I tried making it spin off separate jobs for each datum:for i in $(cat data.txt); do     ( wibble $i ) & done  But this many analysis processes running causes a memory crash!  So I want to spin up analysis processes in groups of, say, five.  I want to take the first five data items, spin up an analysis process on those; then take the next five and do the same; and so on.  How can I do that without using the program "parallel' as explained in previous posts (bellow)? I don't have sudo permission on my institutional workstation to install this app, so I am trying to accomplish this goal using simpler code.  https://unix.stackexchange.com/questions/299346/running-commands-at-once https://unix.stackexchange.com/questions/361505/how-to-control-for-loop

I wrote a bash script that executes a Java jar for a n number of times.  In practice, I defined e foo() function, containing the invocation of the jar, and then I run this script:  for RUN in $(seq 1 $RUNS)  do      foo &  done   Now, I would like to not execute runs times in parallel the jar. There is a wait to limit the number of parallel execution (like a wait every 10 process for instance)?


How can I split strings, which are in one table column, into separate words but those words are not always one and the same number. Sometimes string can contain 1, 2, 3 or more words. And when they are split, to be shown in columns each one of them separately. This is the query so far:  SELECT search, count(DISTINCT session_id) IPC, method FROM table WHERE type='organic' GROUP BY search, method   The one that needs splitting is search and after the already generated columns to have others containing the splitted words, everyone of them in separated column.  Will be grateful if someone helps. :)

I have to create a report on some student completions. The students each belong to one client. Here are the tables (simplified for this question).  CREATE TABLE  `clients` (   `clientId` int(10) unsigned NOT NULL auto_increment,   `clientName` varchar(100) NOT NULL default '',   `courseNames` varchar(255) NOT NULL default '' )   The courseNames field holds a comma-delimited string of course names, eg "AB01,AB02,AB03"  CREATE TABLE  `clientenrols` (   `clientEnrolId` int(10) unsigned NOT NULL auto_increment,   `studentId` int(10) unsigned NOT NULL default '0',   `courseId` tinyint(3) unsigned NOT NULL default '0' )   The courseId field here is the index of the course name in the clients.courseNames field. So, if the client's courseNames are "AB01,AB02,AB03", and the courseId of the enrolment is 2, then the student is in AB03.  Is there a way that I can do a single select on these tables that includes the course name? Keep in mind that there will be students from different clients (and hence have different course names, not all of which are sequential,eg: "NW01,NW03")  Basically, if I could split that field and return a single element from the resulting array, that would be what I'm looking for. Here's what I mean in magical pseudocode:  SELECT e.`studentId`, SPLIT(",", c.`courseNames`)[e.`courseId`] FROM ...


Cant remember the name if a sci fi book i tead it was based around the invention of a space portal where it closes the distance between two spots (space portal ) built from one end used for planet exploration . Books prologue is the last pilot if a space shuttle finally landing in mars just to come face to face with what he discribed as two surfer dudes standing in caltech when one of them say hey dude ! Which turned out to be the first test try if the device it thn gies on to years later wen one scientist on a planet far from earth notices a star appearing in the sky so travels through a space portal which have been used for cars appearing as tunnels to the onlookers from one end to a planet light years closer and double checks and is right a new star appared so thn trVels light tears further away farther past his original planet cliser to earth and reports it to his collegues and its the start to a mission to investigate the new star n ut turns it was an two entire star systems had been enclosed in a visible shield odd some sort and the star appearing was the first going down they couldnt see in but after sending probes and investigative waves the shield is dropped revealing an entire star system colonized by a  species of sentient species so unique and complex i cant describe thm but they had been enclosed in Ahield was would soon be realised for the universes good . I’ve missed out loads of main details so al give a quick list memory was stored on crystal chips and if death occured an insurance company would commission a clone if that person and the memory uploaded continuing life so humans are technically immortal  one of the creators of the portal end up lost on a supernatural trek travelling planets by unknown nature trails that jump planets without them knowing where or how  the other species captured one of the original investigation crew members an astrologist the one who saw the star appear infact sorry just remembered prior to the crew giong there they loaded there memorys n were told if caught by anything hit the data wipe on the memory as it was an implant controlled with the mind witha screen appearing with a eye implant and the species get his knowledge of what he knows including the basica of portal technology this species is cerg advanced and had xolonised every meteor or small planet in there enclsure thathad the space or mined for resources

Desperate to locate and re-read exceptional book/series, but cannot remember the title. The high concept: The U.S. has just sent the first successful expedition to Mars, and it has just landed. As the astronauts make their initial exploration outside their ship, a tear in the fabric of space opens up right in front of them, and they look through to the insides of a laboratory (at a California university?) and two students who just figured out how to create arbitrary portals between two points in the Universe. The rest of the novel/series is a consequence of this breakthrough. But I can't remember the author and title(s). Surely someone reading this forum will remember it well! TIA.  (Reposted .)


I am working on my thesis (in french) and using Biblatex with  as the style for defining citations in the footnotes.  In addition to the normal footnotes (executed through \footnote{}), I am often using \footcite[][]{} to cite articles/books.  The geschichtsfrkl style adds a comma between the LastName and FirstName of authors. However, since my university asks that there must be no comma in between them, I updated the style using the following code:   \DeclareNameFormat{author}{ \nameparts{#1}% {\autorenschriftart% \ifdefvoid{\namepartprefix}{}{\namepartprefix\addspace}% \namepartfamily }% \ifdefvoid{\namepartgiven}{}{\space% \ifbool{bbx:nurinit}{\namepartgiveni}{\namepartgiven}}% \isdot% \ifthenelse{\value{listcount}<\value{liststop}}% {\autorentrennzeichen\addspace}{}% }%   But, doing so destroys the alignment of the footnotes and adds an extra space before the author name. Please check the following image for the problem (13 and 16 are citations and others are normal footnotes). I problem of alignment happens only with citations and not with normal footnotes.    I haven't so far managed to fix this problem. Any help would be greatly appreciated. Many thanks for help in advance :)  Following is a MWE:  \documentclass[     french,     10 pt,                   openright ]{article}               \usepackage[utf8]{inputenc} \usepackage[style=geschichtsfrkl, backend=biber, sorting=nyt]{biblatex}  \DeclareNameFormat{author}{ \nameparts{#1}% {\autorenschriftart% \ifdefvoid{\namepartprefix}{}{\namepartprefix\addspace}% \namepartfamily }% \ifdefvoid{\namepartgiven}{}{\space% \ifbool{bbx:nurinit}{\namepartgiveni}{\namepartgiven}}% \isdot% \ifthenelse{\value{listcount}<\value{liststop}}% {\autorentrennzeichen\addspace}{}% }%  \addbibresource{\thesis.bib} \usepackage{filecontents}  \begin{filecontents}{\thesis.bib}  @article{deroudille2019extraterritorialite,   title={L’extraterritorialit{\'e} du RGPD dans le contexte du “Cloud Act”},   author={Deroudille, Alexis and Fatah, Farid},   journal={Revue du marche commun et de l'Union Europ{\'e}enne},   number={630},   pages={442--452},   year={2019},   publisher={{\'E}ditions Techniques et Economiques} }  @article{decaux1987application,   title={L'application extraterritoriale du droit {\'e}conomique},   journal = {Cahiers du Centre de Droit International de Nanterre},   number = {3},   author={Decaux, Emmanuel},   year={1987},   publisher={JSTOR} }  @article{lehmann_m_legal_2017,     title = {Legal fragmentation, extraterritoriality and uncertainty in global financial regulation},     volume = {37},     issn = {0143-6503},     %language = {English},     number = {2},     journal = {Oxford Journal of Legal Studies},     author = {{Lehmann}, Matthias},     pages = {406-434},     year = {2017},     note = {OCLC: 7086651768},     pages = {406--434} }  \end{filecontents}  \begin{document}  Some text\footcite[Sample Pre-text][Post-text]{lehmann_m_legal_2017}, then some more text without pre- and post-notes\footcite[][]{decaux1987application}, and now a normal footnote\footnote{Hello world!}. One more citation just in case\footcite[][]{deroudille2019extraterritorialite}.  \end{document}

I see that the code in many packages and examples contains percent signs % at the end of (many) lines. What are they used for? Do they affect the parsing of those lines?


Instead of adding an entire new column in my attributes table, is there a way I can edit the properties of an existing (unnecessary) column and change the type from integer to text?

How can I change the data type in an attribute table in ArcGIS for multiple fields?    For example, if the fields have been exported as a string from Excel, and I would like to use them as numerical values?


I just wanted to know how we get from the first step to the next. I spent too much time on this but could not get to the next step. This seems a simple sum of squares of odd numbers but was not able to get the next step.  $$ \frac{2 \mathcal{E}_p}{M} \left(1^2 + 3^2 + 5^2 + \dots + (M-1)^2\right) $$ $$ \frac{2 \mathcal{E}_p}{M} \times \frac{M(M^2-1)}{6} $$

Is there an analytical expression for the summation $$1^2+3^2+5^2+\cdots+(2n-1)^2,$$ and how do you derive it?


I want two entries in the Windows 10 Start menu for the same application: one for normal Start and another one for Start as administrator (elevated), so I no longer need to use the context menu.  I copied the .lnk in C:\ProgramData\Microsoft\Windows\Start Menu\Programs and changed the properties to run it as administrator.  I expected to see two entries in the Start menu, but it only has one. It is the alphabetically sorted first of them. After renaming it shows the alphabetically first one again. Even if I add a command-line parameter to the .exe in one of the shortcuts I only see the first one.

Problem  If you create two shortcuts with the same target then only one of them is displayed in the Start Menu. This is true for:   search results within the Start menu manually browsing program folders within the Start menu pinned shortcuts within the Start menu   This is important because:   the shortcuts might have different settings defined in the Properties dialog, such as different compatibility settings, or be set to start in different directories. some programs install a shortcut to a command prompt which is set to open in the program's installation folder. This enables easy access to the program from the command line without having to modify %PATH%, but it means that users who are unaware of this "lose access" to CMD. Programs that do this:           Things I've tried   Renaming shortcuts   Only the shortcut that comes first alphabetically is displayed  Using folders doesn't help   Only the shortcut in the folder that comes first alphabetically is displayed  Pinning shortcuts doesn't help   the pinned shortcut updates to point to the displayed shortcut      Steps to reproduce  Fully up-to-date Windows 10 Home.   Start → search for "Command Prompt" (or "cmd"). (Optional) Right-click on Command Prompt → Pin to Start.   This makes Command Prompt available when you open the Start menu without searching for anything.  Right-click on Command Prompt → Open file location   This opens a File Explorer window in %APPDATA%\Microsoft\Windows\Start Menu\Programs\System Tools  Copy the Command Prompt shortcut and rename the copy "AAA Command Prompt"   This ensures it appears before Command Prompt when files are listed alphabetically.  (Optional) Right-click on the new AAA Command Prompt shortcut → Properties   Change something. (E.g. set the "Start in" directory to a different location, such as C:\)    Notice that it is now not possible to access Command Prompt from the Start menu - it has been replaced with AAA Command Prompt everywhere. If you rename AAA Command Prompt to ZZZ Command Prompt then you get back the ordinary version and lose the customised version. Moving the shortcuts to different folders within %APPDATA%\Microsoft\Windows\Start Menu\Programs\ doesn't help.    Any ideas?


I would like to check if two square are intersecting with each other. My idea is this  for (i = 0; i < 4; i++)    for (j = 0; j < 4; j++) {        bool x = check line(i) of first square intersect with         line (j) of the second square        if (x) return;    }   any idea to optimize this code?

I am trying to write a C++ program that takes the following inputs from the user to construct rectangles (between 2 and 5): height, width, x-pos, y-pos. All of these rectangles will exist parallel to the x and the y axis, that is all of their edges will have slopes of 0 or infinity.  I've tried to implement what is mentioned in  question but I am not having very much luck.  My current implementation does the following:  // Gets all the vertices for Rectangle 1 and stores them in an array -> arrRect1 // point 1 x: arrRect1[0], point 1 y: arrRect1[1] and so on... // Gets all the vertices for Rectangle 2 and stores them in an array -> arrRect2  // rotated edge of point a, rect 1 int rot_x, rot_y; rot_x = -arrRect1[3]; rot_y = arrRect1[2]; // point on rotated edge int pnt_x, pnt_y; pnt_x = arrRect1[2];  pnt_y = arrRect1[3]; // test point, a from rect 2 int tst_x, tst_y; tst_x = arrRect2[0]; tst_y = arrRect2[1];  int value; value = (rot_x * (tst_x - pnt_x)) + (rot_y * (tst_y - pnt_y)); cout << "Value: " << value;     However I'm not quite sure if (a) I've implemented the algorithm I linked to correctly, or if I did exactly how to interpret this?  Any suggestions?


My current setup is a Postfix installation configured with DKIM on a server with hostname prod01.example.com The server is used to send out mail on the form webshop@example.com, newsletter@example.com, etc. The setup works perfectly, and all mails are signed correctly using DKIM. Note, the server is and should only be used to send mail. Below are the relevant configurations:  PostFix conf  myhostname = example.com alias_maps = hash:/etc/aliases alias_database = hash:/etc/aliases myorigin = /etc/mailname # the file contains example.com mydestination = prod01.example.com, localhost relayhost = mynetworks = 127.0.0.0/8 [::ffff:127.0.0.0]/104 [::1]/128 mailbox_size_limit = 0 recipient_delimiter = inet_interfaces = all inet_protocols = ipv4 home_mailbox = Maildir/ mailbox_command =  # DKIM milter_default_action = accept milter_protocol = 2 smtpd_milters = inet:localhost:8891 non_smtpd_milters = inet:localhost:8891   OpenDKIM conf:  Domain                  example.com KeyFile                 /etc/mail/dkim.key Selector                mail   I would like to hear what the best/preferred way to extend the above configuration to allow the server to send out and sign mail from domains example2.com and example3.com  I did some simple testing using the following PHP code:  $to      = 'my@gmail_address.com'; $subject = 'test'; $message = 'test'; $headers = 'From: shop@example2.com' . "\r\n" .     'Reply-To: shop@example2.com' . "\r\n" .     'X-Mailer: PHP/' . phpversion();  mail($to, $subject, $message, $headers);   The above code does in fact send the mail, but the mail is of course not signed correctly. Furthermore, if I look at the mail in Gmail it says: From shop@example2.com via example.com  So basically want I is a way for the server to send out mail as example2.com, without implying that the mail was send from example.com (such that Gmail does not write via example.com), and that the mails are correctly signed.   A google search reported many hits on virtual domains in Postfix, but as far as I can tell, they are only used if the server should receive mails and be final destination from multiple domains. I also found the following post, , which more or less does the same thing as I want. However, the post is rather old, and I would to see if this is still the way to do it.

I got DKIM setup on my mail server (postfix and ubuntu) so it signs outgoing emails.  I used these instructions:   However, I need it to sign emails from any domain (in the From address) and not just my own.  I'm building an email newsletter service and clients will be sending their own email through the server.  First I set "Domain *" in /etc/dkim-filter.conf.  This got it to include the DKIM headers in all outgoing emails, no matter what the domain.  However, the verification check fails on gmail because it is checking the domain in the from address, and not my domain (and dns record).  Does anyone know how to do this?


My testing database has been hacked.  I am pretty sure it's hacked by an easily guessed test use admin credential.  After reading  I've got an idea of what to do, but the problem is how to do it.  I have tried looking to see what queries the hacker had used but since the general_log was turned off there isn't a log to see.   So far what I did is remove all unused accounts, set port access on AWS to my computer only.  What/and how could I do to make sure that I didn't leave any vulnerability open for the hacker to use? Also how do I ensure I removed everything the hacker has done without having a log?

This is a  about Server Security - Responding to Breach Events (Hacking)   See Also:                  Canonical Version I suspect that one or more of my servers is compromised by a hacker, virus, or other mechanism:   What are my first steps? When I arrive on site should I disconnect the server, preserve "evidence", are there other initial considerations? How do I go about getting services back online? How do I prevent the same thing from happening immediately again? Are there best practices or methodologies for learning from this incident? If I wanted to put a Incident Response Plan together, where would I start? Should this be part of my Disaster Recovery or Business Continuity Planning?   Original Version       2011.01.02 - I'm on my way into work at 9.30 p.m. on a Sunday because our server has been compromised somehow and was resulting in a    attack on our provider. The servers access to the Internet   has been shut down which means over 5-600 of our clients sites are now   down. Now this could be an FTP hack, or some weakness in code   somewhere. I'm not sure till I get there.      How can I track this down quickly? We're in for a whole lot of   litigation if I don't get the server back up ASAP. Any help is   appreciated. We are running Open SUSE 11.0.            2011.01.03 - Thanks to everyone for your help. Luckily I WASN'T the only person responsible for this server, just the nearest. We managed   to resolve this problem, although it may not apply to many others in a   different situation. I'll detail what we did.      We unplugged the server from the net. It was performing (attempting to   perform) a Denial Of Service attack on another server in Indonesia,   and the guilty party was also based there.      We firstly tried to identify where on the server this was coming from,   considering we have over 500 sites on the server, we expected to be   moonlighting for some time. However, with SSH access still, we ran a   command to find all files edited or created in the time the attacks   started. Luckily, the offending file was created over the winter   holidays which meant that not many other files were created on the   server at that time.      We were then able to identify the offending file which was inside the   uploaded images folder within a  website.      After a short cigarette break we concluded that, due to the files   location, it must have been uploaded via a file upload facility that   was inadequetly secured. After some googling, we found that there was   a security vulnerability that allowed files to be uploaded, within the   ZenCart admin panel, for a picture for a record company. (The section   that it never really even used), posting this form just uploaded any   file, it did not check the extension of the file, and didn't even   check to see if the user was logged in.      This meant that any files could be uploaded, including a PHP file for   the attack. We secured the vulnerability with ZenCart on the infected   site, and removed the offending files.      The job was done, and I was home for 2 a.m.            The Moral   - Always apply security patches for ZenCart, or any other CMS system for that matter. As when security updates are released, the whole   world is made aware of the vulnerability.   - Always do backups, and backup your backups.   - Employ or arrange for someone that will be there in times like these. To prevent anyone from relying on a panicy post on Server   Fault.


I understand that when you put your tongue on frozen metal, your tongue sticks to the metal but how does having a layer of ice covering the metal prevent your tongue from sticking?

since the Christmas season is here, I would like to ask a question about the movie, "A Christmas Story." In one of the subplots of the movie, Ralphie's friends were betting each other that their tongue would stick to to a frozen pole. Finally, the kid did it and it stuck to the pole.   Why does this happen? I believe that there is a physics explanation for this.


I'm new in Unix, and I'm learning about sed command. I need to write a very small script for searching a number in a file and replacing it. I tried doing grep, and than deleting the specific phone number from a file, and then adding another one. But i was told that i can use sed in a script to replace. I know how to use the sed command on a command line for search, and replacing something. But how do i write a script, which lets the user search a number, and then let the user enter the number which they want to replace the old number with.   So far what i did was use grep to find a number, that works. but now I'm stuck at how can i let the user add in the new number, so the new number can replace the old one. I tried piping grep to sed, and vice versa. No luck so far. I sound redundant, :/ but I'm really frustrated. Any help will be appreciated :D.

Replacing strings in files based on certain search criteria is a very common task. How can I    replace string foo with bar in all files in the current directory? do the same recursively for sub directories? replace only if the file name matches another string? replace only if the string is found in a certain context? replace if the string is on a certain line number? replace multiple strings with the same replacement replace multiple strings with different replacements


I read an article about thread safe maps and got a question. Collections.synchronizedMap() proxies underlying map with adding synchronized blocks on each method. On the other hand ConcurrentHashMap doesn't lock the whole map on read/write operations. Which means all operations in multi thread system are faster.  So what are the benefits of using synchronizedMap() nowadays? I see the only:   it's available since java 1.2 (vs java 1.5 for ConcurrentHashMap) can store nullable values (if underlying map can do it)   Are there any other situations when synchronizedMap() is better?

I have a Map which is to be modified by several threads concurrently.   There seem to be three different synchronized Map implementations in the Java API:   Hashtable Collections.synchronizedMap(Map) ConcurrentHashMap   From what I understand, Hashtable is an old implementation (extending the obsolete Dictionary class), which has been adapted later to fit the Map interface. While it is synchronized, it seems to have serious  and is discouraged for new projects.  But what about the other two? What are the differences between Maps returned by Collections.synchronizedMap(Map) and ConcurrentHashMaps? Which one fits which situation?