Why does my exported FBX "grow" a face on my object once exported into UnrealEngine4?

I made a cleaning cart in blender using quite a few Boolean modifiers. Originally I had the same issue within blender, but after just messing around with the object I was able to fix it. Now once I export the object as an FBX into UE4, it mysteriously "grows" a face over the handle area. I have exported the cart with just one (1) receptacle and had no issues, but as soon as I shift D the receptacle part to the other side and join all three (3) objects I have this issue. I have also unwrapped the UV's multiple times and feel like they are at the most optimized they can be.   Other questions on this site related to this issue did not help me.


I would like to make a python code that will:   Read data from api and refresh every 10 minutеs. Display this data on LCD display in two sheets which change continuously every 5 seconds   I do not know how to make one part of the code run independently of the other. In my case..  - BLOCK1 run every 300s  - BLOCK2 run nonstop  Here is my Python code... of course, it's not working and is not finished yet. Thank you for your help!  from urllib import urlopen import I2C_LCD_driver1 import json import time mylcd = I2C_LCD_driver1.lcd()  while True:     # BLOCK 1 - start every 600s     CNV7 = urlopen('https://www.coincalculators.io/api/allcoins.aspx?hashrate=12200&power=1400&powercost=0.15&difficultytime=0&algorithm=CryptoNightV7').read()     dataCNV7= json.loads(CNV7)       coinCNV7 = dataCNV7[0]["name"]      algoCNV7 = dataCNV7[0]["algorithm"]      dayUSDCNV7 = dataCNV7[0]["profitInDayUSD"]     print ("Algoritm:"),algoCNV7     print ("Coin:"),coinCNV7     dayUSDCNV7 = float(dayUSDCNV7)     dayEUCNV7 = dayUSDCNV7*0.88     print("%.2f" % dayEUCNV7),("Eu/dan")     time.sleep(600) # Read API every 10minuts      # BLOCK 2 - must run non-stop     if dayEUCNV7 > 3:         while True:             print("RELEY ON")             mylcd.lcd_clear()             mylcd.lcd_display_string("RELEY - ON",1,0)             mylcd.lcd_display_string("Profit:",2,0)             mylcd.lcd_display_string(str(dayEUCNV7),3,2)             print ("LCD page 1")             time.sleep(2)              mylcd.lcd_clear()             mylcd.lcd_display_string("RELEY- ON",1,0)             mylcd.lcd_display_string(str(coinCNV7),3,2)             print ("LCD page 2")             time.sleep(2)      else:         while True:             print("RELEY OFF")             mylcd.lcd_clear()             mylcd.lcd_display_string("RELEY - OFF",1,0)             mylcd.lcd_display_string("Profit:",2,0)             mylcd.lcd_display_string(str(dayEUCNV7),3,2)             print ("LCD page 1")             time.sleep(2)              mylcd.lcd_clear()             mylcd.lcd_display_string("RELEY- OFF",1,0)             mylcd.lcd_display_string(str(coinCNV7),3,2)             print ("LCD page 2")             time.sleep(2)


If $|p(z)|\leq1$ for all $|z|\leq1$ then $p(z)=z^n$

I have a polynomial $p(z)=z^n+a_{n-1}z^{n-1}+..+a_0$ satisfying $|p(z)|\leq 1$ for all $|z|\leq 1$. I have to show that $a_{n-1}=...=a_0=0$. Applying Cauchy estimates gave me $|a_k|\leq 1$ for all $k$, which doesn't seem to help. For non-zero $z$ I can write $|\frac{z^n}{|z|^n}+..+a_0|\leq 1$ but I don't see how that would help either. Any hint would be appreciated.


Calling template member function of template class fails on GCC/clang but works with MSVC

I am trying to wrap a call to a template member function of a template class with a free function, and I do not understand why the snippet of code below compiles with MSVC but is rejected by gcc and clang.  template <int N> struct S {     template <int I>     void f(); };  template <int N, int I> void call(S<N>& s) {     s.f<I>();               // g++-9.1 and clang++-8.0 complain here }  template void call<4, 1>(S<4>&); // The exact numbers are unimportant   This code fails to compile with g++, with the error message error: invalid operands of types '<unresolved overloaded function type>' and 'int' to binary 'operator<'. Clang similarly refuses to compile this, complaining error: missing 'template' keyword prior to dependent template name 'f'.  MSVC happily compiles the full example with no errors or warnings.  Is this code valid C++ or are gcc and clang correct to reject it?


iOS: How to stop the device standby timer?

I'm creating an iOS app who will have to stop the standby timer.  I mean the timer who put the device in standby after 60 seconds that a user does not touch the screen.  How can I do it?  Thanks


Form state cache breaks dependency injection

I have a class that extends FormBase and there are 6 services that are injected into the class via Dependency Injection (DI). My problem is when I submit the form it says to a class property that normally should be injected, it's NULL and can't be called the load() function on NULL. However when I debug, I clearly see all the dependencies are injected to the class and saved to the properties, but until the execution reaches the validation/submit function somehow it became all property to NULL. Why does this happen? How can I use DI in the form validation/submit phase? I'm really thinking if this class is not a deserialized cached version... Extra info this form also has an ajax function where the DI works fine.  I went a bit deeper into the system, after the classfinder creates my form with the injected things and saved into this place: $form_state->getBuildInfo()['callback_object'], I found it out the problem is the cache. (/core/lib/Drupal/Core/Form/FormCache.php:149)    protected function loadCachedFormState($form_build_id, FormStateInterface $form_state) {     if ($stored_form_state = $this->keyValueExpirableFactory->get('form_state')->get($form_build_id)) {       // Re-populate $form_state for subsequent rebuilds.       $form_state->setFormState($stored_form_state);        // If the original form is contained in include files, load the files.       // @see \Drupal\Core\Form\FormStateInterface::loadInclude()       $build_info = $form_state->getBuildInfo();   The system loads the formstate from the cache with the following lines, the $stored_form_state contains the cached state, without any dependencies, and the $form_state->setFormState($stored_form_state); line overwrites my formstate which contains the right properties with the DI classes... And that's a problem.


The Difference Between a DataGrid and a GridView in ASP.NET?

I've been doing ASP.NET development for a little while now, and I've used both the GridView and the DataGrid controls before for various things, but I never could find a really good reason to use one or the other. I'd like to know:  What is the difference between these 2 ASP.NET controls? What are the advantages or disadvantages of both? Is one any faster? Newer? Easier to maintain?  The intellisense summary for the controls doesn't seem to describe any difference between the two. They both can view, edit, and sort data and automatically generate columns at runtime.  Edit: Visual Studio 2008 no longer lists DataGrid as an available control in the toolbox. It is still available (for legacy support I assume) if you type it in by hand though.


Script to recursively replace invalid characters in filenames, not directories, with rename

I'm looking to write a script that will find and replace any characters other than [^A-Za-z0-9._-] in a specific file type (in this case .avi) with an underscore _. I want this to exec recursively from the current path. I'm using Ubuntu.  I do not want or need to change any folder names as I have control over those at the time of creation. Here's what I have now after referencing the following link:    find . -depth -exec rename 's!([^/]*\Z)/[^A-Za-z0-9._-]/_/g' *.avi {} +   I'm clearly missing something. Please help. :)


Prove that when $d$ is in $\mathbb{Q} \setminus\mathbb{Z}$, $\mathbb{Z}[\sqrt{d}]$ is not a finitely generated abelian group.

When $d$ is in $\mathbb{Z}$, $\mathbb{Z}[\sqrt{d}] = \{a_0 + a_1 \sqrt{d} \mid a_0, a_1 \in \mathbb{Z}\}$  However, when $d$ is in $\mathbb{Q} \setminus \mathbb{Z}$, I cannot prove it.  Of course, when I see an example, I can understand that this is not a finitely generated abelian group, but I want to know the proof in general.


A concrete example of involution in group theory

I am reading the textbook "Introduction to Modern Algebra, Joyce 2017" and in the Cyclic groups and subgroups section, there is a following sentence about involution.     An involution $a$ is an element of a group which is its own inverse, $a^{-1} = a$. Clearly, the order of an involution $a$ is $2$ unless $a = 1$, in which case the order of $a$ is $1$.    I was trying to come up with a concrete example, but I am having difficulties. Maybe when $a = \frac{1}{2}, \frac{1}{2}^2 = 1$? I also searched the  for a concrete example, but wasn't able to find anything.  Can someone provide an example with numbers for me please? I want to understand why the author writes "clearly" that the order of an involution $a$ is $2$. Thank you


Looking at some old code of mine, I see that out of clumsiness I defined a destructor like so :  ~ResourceManager(void);   This not only compiles, but works as expected. I changed it of course to   ~ResourceManager();   but was I too quick to refactor? Is the first version correct and good C++ style?   EDIT  Since the question was closed and won't get any chance for proper disambiguation, I should put the related quote from the standard that answers this question, when destructors are put in perspective  12.4 Destructors        A special declarator syntax using an optional function-specifier (7.1.2) followed by ˜ followed by the destructor’s class name followed by an empty parameter list is used to declare the destructor in a class definition. In such a declaration, the ˜ followed by the destructor’s class name can be enclosed in optional parentheses; such parentheses are ignored. A typedef-name shall not be used as the class-name following the ∼ in the declarator for a destructor declaration.      So the standard mandates an empty parameter list. Maybe backwards compatibility with C  practices for free functions (where f(void) is the way to declare an empty parameter list) took destructors along with them in implementations, but it certainly doesn't seem to be valid C++.


I’ll finish the work in the next few days. You can pay me then.  Although you can visit these places, you’re welcome to stay in the hotel if you are tired.  You can buy a ticket from the Tourist Information Center.   Can I use "may" in place of "can" in (1), (2) and (3)?


Bijection between $P(\mathbb{N})$ and set $\{f | f:\mathbb{N} \to \{0,1\}\}$

I need to find a bijection between the power set $P(\mathbb{N})$ and the set of functions $J=\{f|f:\mathbb{N}\to \{0,1\}\}$   I considered the map $g:P\to J$ as $g(A)=f $ where $f$  is a function who is mapping $A$ to {0} and $\mathbb{N}\setminus A$ to ${1}$, then i think this will be a required bijection!


Let $R$ be a PID. How can one show that for all non zero $a,b \in R$ we have $R/(a) \oplus R/(b) \cong R/\gcd(a,b) \oplus R/\operatorname{lcm}(a,b) $.  I have no idea how to define such an isomorphism. What I tried is to define $f([x],[y])=([\gcd(x,y)], [\operatorname{lcm}(x,y)])$. I didn't get anywhere with that my map is probably not even well defined I got lost in the calculations. So does anyone know how to find the desired isomorphism. Thanks in advance


How do you completely remove ubuntu-desktop along with all installed packages with it? I'm using Ubuntu 14.04 server on vps and used sudo apt-get install ubuntu-desktop to install.


What does "deb8u3" in the version number of debian mean?

The output of uname -a is:  #1 SMP Debian 3.16.7-ckt11-1+deb8u3 (2015-08-04)  I failed to find any explanation for "u3" in the output so what does it mean?


Any suggestions for a good undergraduate introductory textbook to statistics?

I am hoping you can give me some suggestions. I am teaching in a very diverse (made of minority groups) college and the students are mostly Psychology majors. Most students are fresh from high school but some of them are older returning students above 40. Most of the students have motivational problems and aversion to math. But I am still looking for a book that covers the basic curriculum: from descriptive to sampling and testing all the way to ANOVA, and all in the context of experimental methods. The department requires me to use SPSS in class, but I like the idea of building the analysis in a spreadsheet such as excel.  p.s. the other teachers use a book that I don't like because of the extensive reliance on computational formulae. I find using these computational formulas - rather than the more intuitive and computationally intensive formula that is consistent with the rational and basic algorithm- unintuitive, unnecessary and confusing. This is the book I refer to Essentials of Statistics for the Behavioral Sciences, 7th Edition Frederick J Gravetter State University of New York, Brockport Larry B. Wallnau State University of New York, Brockport ISBN-10: 049581220X Thank you for reading!


Set drop down option value using jquery or java script

I want to add options to a drop down list dynamically as per the integer value of a variable  this is my html code of dropdown list  <select class="inputreq" id="qty" name="qty"><option value="1">1</option></select>   Like below i am getting integer value at run time  var optioneValue = <%=getCurrentAttribute('item','custitem_max_qty_limit')%>         Suppose if optioneValue is 3 i want to display 3 options in dropdown list like this  <select class="inputreq" id="qty" name="qty"> <option value="1">1</option> <option value="2">2</option> <option value="3">3</option> </select>   I have tried with javascript but its not working..I am new to this can we achieve this using jquery?  <script type="text/javascript"> var i = 1; while ( i <= <%=getCurrentAttribute('item','custitem_max_qty_limit')%> ) { var addSelectOption = document.getElementById('qty'); addSelectOption.options[i-1]= new Option(i,i); i++; // Increment i } </script>


I have tested the quadratic formula and I have found that it works, yet I am curious as to how it was created. Can anybody please tell me one of the ways that it was created?


SMS converts to MMS and only sends when data mobile is on

I have had a Galaxy S2 for 2 years. I just upgraded to the S4 3 weeks ago.   Until this morning, I was able to send SMS messages without data mobile being on via my Wi-Fi connection.  I have made no alterations to my phone other than trying out various suggestions on given on forum sites. I have tried 3-word messages as a test and even these are converted to MMS.  I have loaded both Handcent and Bigsms. They work, but why should I have to have these after 2 years and 3 weeks without a problem?


What happens if a SHA-256 input is too long (longer than 512 bits)?

What I understand is: When we parse a message into 512 bit message blocks. Then we extend the first message block to 64 entry array and start with the compression function.   What happens if the message is longer than 512 bits? As a result, we would receive several message blocks, but where are these fed into the function.


Remove BIOS password for HP ProBook 4530s ( Reset BIOS )

I’m locked up beyond BIOS of my HP ProBook 4530s. Long time ago I put a password on it, But now I don’t remember it.   I have to reset the BIOS password, But I found that it doesn't relate to the CMOS battery. My ProBook is out of warranty too. What should I do?


For $a>0$,the series $\sum_{n=1}^\infty a^{\ln n}$ is convergent if and only if       (1). $0<a<e$  (2). $0<a\leq e$  (3). $0<a<\frac{1}{e}$  (4). $0<a\leq \frac{1}{e}$  I tried with $a=e$ as well as $a=\frac{1}{e}$. I can eliminate (1),(2) and (4), but how can I confirm (3)?


I was trying to find remainder for a float,  >>> x = 123.1233  >>> x%1 0.12330000000000041   The remainder should be 0.1233 but where is this extra 0000000000041 coming from, have faced this before too but don't know, what is causing this.


Convergence in measure and almost everywhere

In a finite measure space, let $\{f_{n}\}$ be a sequence of measurable functions. Show that $f_{n}  \rightarrow f$ in measure if and only if every subsequence $\{f_{n_{k}}\}$ contains a subsequence $\{f_{n_{k_{j}}}\}$, that converges almost everywhere to f.   I can prove from converge in measure to converge almost everywhere, but I don't know how to write it down for the other direction.


Revisit - Allow a bounty to go un-awarded. No winner

I'm raising this again because I now have a question I would dearly like to find an answer to, with one totally wrong answer awarded a bounty. I would prefer to be able to delete the entire question rather than leave this wrong answer as the only thing users will see if they visit it. Relating to  which is marked [status-complete] and  which is marked [status-declined]. The answers to the latter do not answer the question as asked. They are all essentially frame challenges, or reasons why variations on this theme have not worked in the past.  E.g., a bounty is a payment for advertising. That is not an answer. The payment has been made, and the advertising has been gained. If I paid for an advert for a job opportunity I would certainly not be bound to offer the job to the least worst candidate. I could choose… none. Therefore this is a new question with a clear goal. I want to decide if no one deserves the bounty. It should not be tied to votes, accepted check marks or who answered at what time. There is no gain for the user who offered the bounty. That's already gone, given away at the start. If no satisfactory answer is received, the bounty should not be awarded automatically without giving the initiator the chance to say no. If no action is taken you can assume lack of interest and auto-award. If a definitive action is taken, that should be the right of the one whose reputation was staked on receiving a satisfactory solution. A decade later and this is still badly broken, IMO. I should have the right to decide no one deserves the bounty. The bounty should not be a reward for effort but a reward for getting the answer right! I offered a 500-point bounty on a new question right from the start, to pull some attention to an issue I knew was going to be tough to answer.  As expected, no one even got close, though one answer received three upvotes… perhaps for effort. The answer went through three major revisions, none of which were salient and after a comment thread 22 deep trying to clarify, the last version was still totally wide of the mark. Two answers were deleted, for not even leaving the starting blocks. This question itself also went through some major revisions, reducing some initial guesswork as my endeavour to find a single underlying symptom/cause was honed. Also, in each revision was an attempt to clarify what was confusing the answerers and commenters… not that it seemed to make any real difference to misinterpretations. The end result, however, was there was no answer anywhere near. This means, in my mind, no one deserves the bounty. I want the option to declare specifically that no one gets the bounty. However, the system automatically gave half points to the one remaining answer, with little regard as to how well it actually answered the question. I have already given up the points. I don't want them back; I just feel no one deserved them. I should have been given that choice. I didn't upvote any of the answers. None of them were more than misreadings of the question, or very poor guesses. I didn't downvote anyone either - I decided the users should decide, until and unless I got a working solution, which would then have been marked accepted and also awarded the bounty. I have in the past awarded bounties without accepting, for answers which showed good research and working method, or a good path towards a 'fix' even if it didn't work in my particular case.


I am trying to escape the underscore character in a LIKE Statement. I have tried to use the ESCAPE keyword as follows:   COLUMNNAME NOT LIKE '%[\_]xyz%' ESCAPE '\'   but it doesn't work. It is still filtering out %xyz% when I really want it to filter out %_xyz%.  If not by the ESCAPE keyword, how else can this be accomplished?  Any help is appreciated.


$X_1,X_2$ distributed $U(0,1)$ and independent, find the distribution of $D=|X_2-X_1|$

I know it shouldn't be this hard but I am having trouble anyway. I tried using $F_D(t)=\mathbb{P}(|X_2-X_1|\leq t)=\mathbb{P}(-t\leq X_1-X_2\leq t)$ and sketching the unit square $[0,1]^2$ but to no avail, I can't seem to find a formula that fits.


How to only accept a specific format of numbers from the user in Java?

How can I make it so input from the user will only be accepted if the format is exactly "xxx-xxx-xxxx" where x can be any number, but only numbers, and the dashes have to be there, in those groupings. Basically, it's supposed to accept phone numbers. Right now I have:  Scanner input = new Scanner(System.in); String in = input.next(); // Stores user input as a string  if (in.contains("[a-zA-Z]") == false && in.length() == 12) {     System.out.println("Number Accepted"); } else {     System.out.println("Number Rejected"); }   Currently, it will reject numbers that are greater or less than 12 characters, but it will accept anything that is 12 characters, even if it has letters. I also do not a solution to grouping the numbers with the dashes correctly, as the user should only be able to input 3 numbers, then a dash, then 3 more numbers, then a dash, and then finally 4 numbers.


My idea is using a AsynTask download a dataset and store in a arrayList. That I have checked and works well. In the onPostExecute method I call a function to update my listView and I load the data stored in the ArrayList.  Code:  protected void onPostExecute(String result)  {            progressDialog.setProgress(99);     actualizarDisplay(); }   The method actulizarDisplay:  dataAdapter = new MyCustomAdapter(this,R.layout.servicio, listaServicios); ListView listView = (ListView) findViewById(R.id.listaServ); listView.setAdapter(dataAdapter);   And the class MyCustomAdapter:  private class MyCustomAdapter extends ArrayAdapter<Servicio>  {  private ArrayList<Servicio> servicioList;  public MyCustomAdapter(Context context, int textViewResourceId,ArrayList<Servicio> servicioList)  {     super(context, textViewResourceId,servicioList);     this.servicioList = new ArrayList<Servicio>();     this.servicioList.addAll(servicioList); }  private class ViewHolder  {    TextView nombre, hora, lugar, fecha;    ImageView tipo;    }  @Override public View getView(int position, View convertView, ViewGroup parent)  {     ViewHolder holder = null;      if (convertView == null)      {        LayoutInflater vi = (LayoutInflater)getSystemService(Context.LAYOUT_INFLATER_SERVICE);        convertView = vi.inflate(R.layout.servicio, null);         holder = new ViewHolder();        holder.nombre = (TextView) convertView.findViewById(R.id.titulo);        holder.lugar = (TextView) convertView.findViewById(R.id.lugar);        holder.hora = (TextView) convertView.findViewById(R.id.hora);        holder.fecha = (TextView) convertView.findViewById(R.id.fecha);        convertView.setTag(holder);     }      else       {         holder = (ViewHolder) convertView.getTag();      }       Servicio servicio = servicioList.get(position); Log.i("ConvertView", servicio.getNombre()); // the correct value is displayed      holder.nombre.setText(servicio.getNombre());      holder.hora.setText(servicio.getHora());      holder.lugar.setText(servicio.getLugar());      holder.fecha.setText(servicio.getFecha());       if (servicio.tipo == 0)            holder.tipo.setImageResource(R.drawable.cultural);       return convertView;  }      }  And this is the error in the logcat, THE LINE 423 is: holder.nombre.setText(servicio.getNombre());     FATAL EXCEPTION: main java.lang.NullPointerException at   app.serviciosprote.Inicio$MyCustomAdapter.getView(Inicio.java:423)     at android.widget.AbsListView.obtainView(AbsListView.java:2350)         at android.widget.ListView.measureHeightOfChildren(ListView.java:1409)         at android.widget.ListView.onMeasure(ListView.java:1273)         at android.view.View.measure(View.java:15286)         at android.widget.RelativeLayout.measureChild(RelativeLayout.java:602)         at android.widget.RelativeLayout.onMeasure(RelativeLayout.java:415)       at android.view.View.measure(View.java:15286)       at android.view.ViewGroup.measureChildWithMargins(ViewGroup.java:4832)             at android.widget.LinearLayout.measureChildBeforeLayout(LinearLayout.java:1390)             at android.widget.LinearLayout.measureVertical(LinearLayout.java:681)             at android.widget.LinearLayout.onMeasure(LinearLayout.java:574)             at android.view.View.measure(View.java:15286)             at android.view.ViewGroup.measureChildWithMargins(ViewGroup.java:4832)             at android.widget.FrameLayout.onMeasure(FrameLayout.java:310)               at android.view.View.measure(View.java:15286)             at android.widget.LinearLayout.measureVertical(LinearLayout.java:833)             at android.widget.LinearLayout.onMeasure(LinearLayout.java:574)             at android.view.View.measure(View.java:15286)             at android.view.ViewGroup.measureChildWithMargins(ViewGroup.java:4832)             at android.widget.FrameLayout.onMeasure(FrameLayout.java:310)             at com.android.internal.policy.impl.PhoneWindow$DecorView.onMeasure(PhoneWindow.java:2269)   Thanks for trying to help


How to Disavow Bad Backlinks Automatically?

I have this website which is relatively new and I am trying to rank it in Google. But, I have this enemy who keeps building bad/spam links to my site. So, every time I see some rank improvement in my site, he builds spam links to my site and my ranking slides down in SERP's. I am disavowing those links as soon as I see them but, for how much time I am gonna do that! Is there any tool or trick using which I can disavow such links automatically?


$H_0(X,A) = 0 \iff A \cap X_i \neq \emptyset \forall $ path-components $X_i$

I've been doing some more exercises in , in particular the following:  Show that $H_0(X,A) = 0$ iff $A$ meets each path-component of $X$.  "$\Leftarrow$": Let $x_i \in A \cap X_i \neq \emptyset \forall $ path-components $X_i$. Then for any $x \in X_i$ there is a path $\gamma$ from $x_i$ to $x$. They therefore differ by a boundary: $\partial \gamma = x - x_i$ and therefore $\{ x \} = \{ x_i \}$ in $H_0(X,A) $. Therefore $H_0(X,A) = 0$.  "$\Rightarrow$" Now for this direction I'm not so sure and I'd be glad if you could give me a hint. Let $H_0(X,A) = 0$. By definition, the relative homology group is calculated from the following sequence of chain groups:  $$ 0 \rightarrow C_0(A) \rightarrow C_0(X) \xrightarrow{\partial_1} C_0(X) / C_0(A) \xrightarrow{\partial_0} 0$$  Then $H_0(X, A) = H_0(C_0(X) / C_0(A)) = ker \partial_0 / im \partial_0 = (C_0(X) / C_0(A) ) / im \partial_1 = 0$.  There are two cases where this equality holds:  (i) $C_0(X) / C_0(A) = 0$  (ii) $im \partial_1 = C_0(X) / C_0(A)$  In case (i), $A \cap X_i \neq \emptyset$ for all $X_i$.  In case (ii) I'm not sure how to proceed. Can you give me a hint? Many thanks for your help!  Edit Or maybe I could do the second direction like this:  $$0 = H_0(X,A) = \oplus_i H_0(X_i, A) \implies  H_0(X_i, A) = 0 \forall i$$  $$ \implies A \cap X_i \neq \emptyset \forall i$$?


How do I protect sending scores from HTML5 games to my server

On backend I am using java. I have a game in HTML5; when user completes it I sends an Ajax call to save the score to database. Now, someone can easily use tools like Fiddler and firebug to modify this ajax request and send a much better score to the server. How do I make sure that user cannot manipulate scores !


POST regular JSON to custom RestResource

So I created my own RestResource, like so:  /**  * Provides a resource to get/create content data.  *  * @RestResource(  *   id = "mycontent_content",  *   label = @Translation("My content"),  *   uri_paths = {  *     "canonical" = "/api/content/{type}",  *     "https://www.drupal.org/link-relations/create" = "/api/content/{type}"  *   }  * )  */ class ContentResource extends ResourceBase {      public function get($type) {         // Works     }      public function post($type) {         // Doesn't work     } }   GET works fine, but I can not post a regular JSON object.  With the content-type set to application/json I always get this error:  {     "error": "Could not denormalize object of type , no supporting normalizer found." }   I guess it's trying to create an entity out of it, but that's not what it is. I just want the damn JSON object as it is.  Is there some way to do this?


Installing Visual Studio without restart

I would like to install Visual Studio (Community edition) on a server that is used by other individuals. The installation requires a restart to complete the process. Is there any way to complete the necessary steps manually without restarting the server?


Prove we cannot make a homeomorphism from [0, 1] to ℝ by contradiction.

So start off contradiction proofs by assuming the opposite. So we assume f is a homeomorphism from ℝ to [0, 1]. Since f is a surjection, there exists some 𝑎 ∈ ℝ with $f(𝑎) = 0$. Let $x_1 = 𝑎 – 1$ and $x_2 = 𝑎 + 1$. Since f is an injection, and since $x_1≠ x_2 ≠ 𝑎$,we know that $f(x_1) ≠ f(x_2) ≠ 0$. Let $M = min \{ f(x_1), f(x_2) \}$. I know I have to use the intermediate value theorem at some point but I'm stuck at the next step.


hello i'm trying ton understand a programm and a line giving me some trouble. Can you explain me the Construction of this line because i have never seen a "For" like that  for (Iterator<IBaseVO> itMachine = machinesSelected.iterator(); itMachine.hasNext();) {             MachineVO mach = (MachineVO) itMachine.next();             idsMachines.add(mach.getMchId());         }   thanks you


Tell tex distribution to avoid residual temporary files

When I compile a tex document, the compilation process usually leaves some temporary files, like .aux and .log.  I have got a small document that can be compiled in just one single run - can I tell the compiler to remove all the remnant temporary files?


If $A$ is an $n×n$ orthogonal matrix with $\text{det}(A)=1$ and $n$ odd, then show that $\text{det}(I-A)=0$.

Primarily, here $A$ can be either real or complex matrix and as $A$ is orthogonal, hence all the eigenvalues of $A$ are of the form $e^{i\Delta}$ for $i^2=-1$ and real $\Delta$.  I tried to show it by induction but I couldn't prove for the $n=2$ case that $1$ is an eigenvalue of $A$. Can someone please provide me with a short hint?


Proof Check: Number of elements of $\mathbb{F}_{p^{n}}$ of the form $a^{p}-a$ for some $a \in \mathbb{F}_{p^{n}}$.

Consider the map $\varphi:\mathbb{F}_{p^{n}} \rightarrow \mathbb{F}_{p^{n}}$ defined by $x \mapsto x^{p}-x$. Since $(a+b)^{p}= a^{p}+b^{p}$ for all $a,b \in \mathbb{F}_{p^{n}}$ we have that $\varphi$ is a homomorphism. An element of $\mathbb{F}_{p^{n}}$ can be written in the form $a^{p}-a$ iff it is in Im$(\varphi)$, so it suffices to find $|$Im$(\varphi)|$, which is equal to $\mathbb{F}_{p^{n}}/K$ where $K=$ker$\varphi=\{a \in \mathbb{F}_{p^{n}} : a^{p}-a = 0\}$. So in particular, if $a \in$ ker$\varphi$ then $a$ is a root of the polynomial $x^{p}-x$ which is a separable polynomial so has precisely $p$ roots. Since $a^{p}=a$ for all $a \in \mathbb{F}_{p} \subseteq \mathbb{F}_{p^{n}}$, which is all $p$ of the roots, we have $|$ker$\varphi| = p$. Hence $|$Im$(\varphi)|=p^{n-1}$ so this is the number of such elements.  I am pretty sure this works, but is there an easier or shorter way?


I have tamron di 70-300 for Nikon , will it fit a canon D 4000 body?

Will a tamron lens for Nikon fit a canon body


Every field with 6 elements is isomorphic to $\Bbb Z_2\times \Bbb Z_3$  I think it's false because:  $\Bbb Z_6[x] / (3x +2)$ is such that $3x+2$ is irreducible in $\Bbb Z_6$ so $\Bbb Z_6 [x]/ (3x +2)$ is a  field with 6 elements.   This is isomorphic to $\Bbb Z_2\times \Bbb Z_3$ $\approx \Bbb Z_6$, as the elements are actually the same. We also know that if $f:A\rightarrow B$ is an isomorphism, if A is field then B is field and as  $\Bbb Z_6 [x]/ (3x +2)$ $\approx \Bbb Z_6$, with $\Bbb Z_6 [x]/ (3x +2)$ field, then $\Bbb Z_6$ is a field (contradiction as 6 isn't prime).   Then not every field with 6 elements is isomorphic to $\Bbb Z_2\times \Bbb Z_3$, because $\Bbb Z_6[x] / (3x +2)$ is not isomorphic to $\Bbb Z_2\times \Bbb Z_3$.


I have been using my MacBook Pro for nearly 2 years. I have no problem using iMessages both on my iPhone and Mac. However, today, I can't seem to be able to send any messages out from my Mac. There is no problem on my phone. Also, I cannot use FaceTime on my Mac.  I reviewed through the internet for some solutions, but nothing seems to work, such as deleting files, changing setting on the Flash Player.  How can I resolve this issue?


See dashboard as non logged user in community

Is it possible, as a non logged user, to see report and dashboard in community when it is open to non logged user? And  for analytic dashboards?


Prove that $I=\{r \in R: f(r) \in J\}$ is a prime ideal in $R$.

Let $f:R\to S$ be a surjective homomorphism of commutative rings. If $J$ is a prime ideal in $S$, and $I=\{r \in R: f(r) \in J\}$, prove that $I$ is a prime ideal in $R$.   I am perfectly fine with proving that $I$ is prime, however, I am struggling to prove that $I$ is an ideal in $R$ in the first place.  Clearly $I \neq \emptyset$, since if $j \in J\subseteq S$, by surjectivity of $f$, there exists an $r \in R$ s.t. $f(r)=j$, i.e. $r \in I$.   Now let $a,b \in I$, then $f(a), f(b) \in J$. Then $f(ab)=f(a)f(b) \in J$, i.e. $ab \in I$.  Also notice that $f(a-b)=f(a)-f(b) \in J$ (since $J$ is an ideal, and hence a subring, of $S$), and so $a-b \in I$.  We thus have that $I$ is a subring of $R$. In order to prove that $I$ is an ideal in $R$, we require the following     If $a \in I$ and $r \in R$, then $ar \in I$. Since $I$ is commutative (since $R$ is commutative), this will be enough to ensure that $ra=ar \in I$ is also satisfied.   This is the part I am struggling with:  Let $a \in I$, then $f(a) \in J$.Now consider any $r \in R$, then clearly $f(r) \in S$ and so $f(ar)=f(a)f(r) \in S$. The problem, however, is I require $f(ar) \in J$ to have that $ar \in I$.  How can I do this?


Why does Cirdan give Narya to Gandalf instead of Saruman?

In the Lord of the Rings I recall some mention of when Cirdan gives Narya to Gandalf when the Istari arrive in Middle Earth. I think it is in the appendices but I cannot recall exactly, but I remember something about him suspecting Gandalf's origins and giving him the ring to aid in the fight against Sauron.  Throughout the novel, we learn that Saruman is more powerful than Gandalf and is his superior in some way. I recall somewhere in the novel Gandalf himself confirms this when he describes Saruman as the head of his order (here I assume that when he refers to "his order" he means the Istari - please correct me if this is wrong).  This being the case, I wonder if Tolkien ever discusses in interviews or other works the reasons that Cirdan chose Gandalf over Saruman as the person to pass Narya onto. It would seem to me that without the knowledge of the events to come that Saruman would be the more natural choice if Cirdan was intent on passing on Narya to someone else.


Installing several different flavours of Ubuntu 20.04

I know it used to be possible to install several different flavours of Ubuntu into the same Ubuntu base.  I could log out of flavour 1 and log back into Flavour 2, and so on I have forgotten how to do this :-( Please advise.


I know that Adobe is dropping support of this product at the end of the year.  However, I see an update was recently made available on the Windows platform but not on Linux?  Or, at least, I haven't gotten any updates when I run the Software Updater.  Is Adobe not releasing a maintenance update for Linux? I don't know where else to ask this question.


Differentiation in support vector machine

My problem is we want to minimize $1/2 \cdot \text{Norm}(w)^2$ under suitable constraints $y(i){[w^Tx_i+b]-1}$.  We write the Lagrangian and get the above equations.  I have a problem in differentiating with respect to $w$ can somebody elaborate on that? How do we get first equation?


Showing a polynomial having at least one integer root under certain conditions has precisely one integer root

$P(x) = 0$ is a polynomial equation having at least one integer root, where $P(x)$ is a polynomial of degree five and having integer coefficients.  If $P(2) = 3$ and $P(10)= 11$, then prove that the equation $P(x) = 0$ has exactly one integer root.  I tried by assuming a fifth degree polynomial but got stuck after that.  The question was asked by my friend.


Entire function bounded by a polynomial is a polynomial

Suppose that an entire function $f(z)$ satisfies $\left|f(z)\right|\leq k\left|z\right|^n$ for sufficiently large $\left|z\right|$, where $n\in\mathbb{Z^+}$ and $k>0$ is constant. Show that $f$ is a polynomial of degree at most $n$.


Any recommendations on  tools for Windows? Ideally ones that could leverage 64-bit OS.  I'm aware of , of course, and have also found , but I'm wondering if there are any hidden gems out there?


I'm refering to this popular blog post:    Here, the author first demonstrates a simple regular Python mapper  #!/usr/bin/env python  import sys  # input comes from STDIN (standard input) for line in sys.stdin:     # remove leading and trailing whitespace     line = line.strip()     # split the line into words     words = line.split()     # increase counters     for word in words:         # write the results to STDOUT (standard output);         # what we output here will be the input for the         # Reduce step, i.e. the input for reducer.py         #         # tab-delimited; the trivial word count is 1         print '%s\t%s' % (word, 1)   But then he mentions:     In a real-world application however, you might want to optimize your   code by using Python iterators and generators (an even better   introduction in PDF).   #!/usr/bin/env python """A more advanced Mapper, using Python iterators and generators."""  import sys  def read_input(file):     for line in file:         # split the line into words         yield line.split()  def main(separator='\t'):     # input comes from STDIN (standard input)     data = read_input(sys.stdin)     for words in data:         # write the results to STDOUT (standard output);         # what we output here will be the input for the         # Reduce step, i.e. the input for reducer.py         #         # tab-delimited; the trivial word count is 1         for word in words:             print '%s%s%d' % (word, separator, 1)  if __name__ == "__main__":     main()   My question: Why is the second mapper more efficient than the first mapper?   If I understand yield correctly;  it suspends the function before another call. So basically whenever data is called to be iterated upon, read_input comes into action to yield another item.   But even in the first simple mapper, we are doing the same thing right? for line in std.stdin: would basically load whatever stdin is available to the host where the mapper is running; and we operate on it line by line.  What is the benefit of using yield and what sort of gains can I expect over the first one? Speed? Memory?  Thanks a lot.  EDIT: I'm not sure why people think it's duplicate. I'm not asking about how the 'yeild' keywork works, I'm asking about an explanation as to what benefit it provides in the hadoop streaming mapping context.


It is my understanding that the main difference between a network hub and a network switch is that the hub always sends out all packets to all (other?) hosts while the switch is smart about it and keeps track of which port belongs to which MAC address via MAC address tables and whatnot. If a packet is addressed to a host which is connected to the switch but have never sent or received anything, the switch acts like a hub would. But every subsequent packet addressed to that host is not broadcast to the other hosts but forwarded only to that specific host. Please correct me if I got something wrong. Does a network bridge in Linux act like a hub would, or like a switch?


Legendre Symbol: Prove that if $(a,p)=1$ and $p$ is an odd prime, then $\sum^p_{n=1}\left(\frac{an+b}{p}\right)=0$.

Prove that if $(a,p)=1$ and $p$ is an odd prime, then $\sum^p_{n=1}\left(\frac{an+b}{p}\right)=0$.   In this question we define Legendre symbol $\left(\frac{a}{p}\right)=0$ if $p$ is an odd prime and $p|a$.  I am struggling.   So far, I've tried expanding out the summation to get   $$\sum^p_{n=1}\left(\frac{an+b}{p}\right)=\left( \frac{a+b}{p}\right)+\left( \frac{2a+b}{p}\right)+\dots+\left( \frac{pa+b}{p}\right)$$  By definition of Legendre Symbols, I got  $$\sum^p_{n=1}\left(\frac{an+b}{p}\right)=(a+b)^{(p-1)/2}+(2a+b)^{(p-1)/2}+\dots+(pa+b)^{(p-1)/2} \mod p$$  And then I am stuck.


route on specific interface based on port

I have a php / bash application on top of a Linux machine with 1 physical interface connecting to e.g., outbound webserver 123.123.123.123 :80. I do this via several openvpn providers. I have both tun and tap providers, but my favorite provider uses tun.  Actually I'm perfectly able to serially:   open the vpn sudo route add 123.123.123.123 tun0 send traffic to 123.123.123.123 :80 close the vpn sudo route del 123.123.123.123   I use the "route-nopull" option inside the .ovpn config file in order to keep the Linux machine reachable and allow simultaneous openvpn connections.  Now I need to open several independent requests, always to outbound webserver 123.123.123.123 :80. But my actual flow is serial and I need to wait the first connection to close and clear itself before attempting a second connection.  I'm quite sure that I can achieve it mangling with "fake ports". Eg:   interfaces tun0, tun1, tun2 fake ports 9000, 9001, 9002 multiple routing tables rt0, rt1, rt2   So conceptually speaking:   123.123.123.123:9000 -> mark for rt0 (tun0 is default gateway) -> rewrite as 123.123.123.123:80 -> rt0 123.123.123.123:9001 -> mark for rt1 (tun1 is default gateway) -> rewrite as 123.123.123.123:80 -> rt1 123.123.123.123:9002 -> mark for rt2 (tun2 is default gateway) -> rewrite as 123.123.123.123:80 -> rt2   I can only represent the concept because I have almost no skills on iptables. If you have different ways to achieve the result, they're welcome. Thank you for reading and helping.


Prevent Wordpress from automatically correcting URLs

I notice that if I type in http://www.example.com/pag I can land on an existing page that has a name like http://www.example.com/page_five. I don't know exactly what causes this, but I want to know if there is a way to stop it from happening.


Four-velocity in General-relativistic geodesic equation

I'm writing this question since I haven't find exhaustive enough answers searching on the Net. I'm writing an application for simulating General Relativity orbits calculating the acceleration from Christoffel's symbols, which are already derived from the Schwarzschild metric in isotropic coordinates:  $$\frac{d^2x^\alpha}{d\tau^2}=-\Gamma{^\alpha}{_\mu}{_\nu} \frac{dx^\nu}{d\tau} \frac{dx^\mu}{d\tau} \hspace{7.1em} (1)$$  My problem is: how should $\frac{dx^0}{d\tau}$ be defined from arbitrary spacial components of the four-velocity?  $$u^i=\frac{dx^i}{d\tau}=\text{arbitrary quantity} \hspace{4.4em} (2)$$  In special relativity, the time component of four-velocity, in terms of the spacial components, is:  $$u^0=\frac{dx^0}{d\tau}=\frac{cdt}{d\tau}=\sqrt{c^2+|u^i|^2} \hspace{4em} (3)$$  where $|u^i|^2 = (u^1)^2+(u^2)^2+(u^3)^2$ is the magnitude squared of the spacial components of the four-velocity. This comes from the Minkowskian metric. Then I derived a similar equation from the Schwarzschild metric in isotropic coordinates:  $$u^0=\frac{cdt}{d\tau}=\sqrt{\frac{B}{A}(c^2+B^2|u^i|^2)} \hspace{4em} (4)$$  where $A=(1-\frac{GM}{2R})^2$ and $B=(1+\frac{GM}{2R})^2$. If this is correct, it's quite straightforward to find that the latter definition gives a greater value than the one from special relativity, since $B > 1$ and $B > A$. Does this mean that the four-velocity magnitude is not constant in General Relativity, as it depends also on radial distance? (I knew that the four-velocity always equals the speed of light)


I really don't understand why this needs to be. To be reversible, isn't all we need is that there is no net energy change in the system so, who cares how fast or slow it goes?


i am getting an dpkg error while installing eclipse...  sanju@sanju-HP-000-Notebook-PC:~$ sudo apt-get install eclipse E: dpkg was interrupted, you must manually run 'sudo dpkg --configure -a' to correct the problem.    how i fix this error.. plz guys help me..


What does this Set actually mean/contain?

I'm having trouble understanding the following set: $$\mathbb{Z}[\sqrt{2}] := \{ a + \sqrt{2}b : a,b \in \mathbb{Z}\}$$ What elements does it actually contain? I thought $\mathbb{Z}$ only contains integers, so what does the root of $2$ behind $\mathbb{Z}$ mean? Thank you.


Question on eigenstates of hermitian operators that fulfill canonical commutation relation

Two operators, in a suitable basis with matrix representations $A$ and $B$ have the following commutator $[A, B] = AB − BA = kI$, where $k$ is a non-zero complex number and $I$ is the $n × n$ identity matrix, where $n$ can be any integer between 1 to ∞. Determine if the matrices $A$ and $B$ are of finite or infinite dimensionality, and prove your assertion, using only the commutation relation given above.


which one: "'Id prefer to drink tea rather than drink coffee"/ "I'd prefer to drink tea rather than coffee" / "I'd prefer to drink tea to coffee"?

Based on the instruction in this , I can come up with some following sentences:   I would prefer to drink tea rather than to drink coffee. I'd prefer to drink tea rather than drink coffee. I'd prefer to drink tea rather than coffee. I'd prefer to drink tea to coffee. I'd prefer tea to coffee. I'd prefer tea rather than coffee. I'd prefer tea.   I think (4) is wrong, (1), (2) & (7) are definitely right. But not sure (3), (5) & (6).  So, which one is correct?


Java check if the application is getting run from a specific phat

As the title says, is there a way to get the current location of the .jar that is begun open, for example i have a file Test.jar and when i run it on desktop it works but when i run it from my documents it just will don't open.  An example of how can it be structured:  if(location == Desktop){    //Do stuff here } else { System.exit(0); }   Thx for the help! and sorry for my bad English


All in the title basically. Not sure how to prove $a^{\log_a(b)}=b$.  Don't know how to use the rules to get that.


If $a_n \searrow 0$ and $\sum a_n$ converges, is it true that $n a_n \to 0$?

I am posting for a friend: he has a strong feeling that the following should be true but can't prove it:  "Let $(a_n)$ be a real sequence. If $a_n \searrow 0$ and $\sum a_n$ converges, then $n a_n \to 0$."  He has checked all the theorems and exercises in Rudin and Apostol but hasn't found an answer to this question. He thinks the question reduces to showing the existence of a series with positive integers, strictly increasing such that   $$ \frac{1-\frac{n_k}{n_{k+1}}}{1-\frac{n_{k-1}}{n_k}} < \frac{1}{M} $$  for some fixed $M > 1$.


How to re-run the case statement if the input is invalid?

I have the following code in the middle of a script to confirm whether we want to resume the script or not.  read -r -p "Would you like to continue  [Y/N] : " i case $i in         [yY])                 echo -e "Resuming the script";;         [nN])                 echo -e "Skipped and exit script"                 exit 1;;         *)                 echo "Invalid Option"                 ;; esac   I would like to know is there any way to know is there any way to recall the switch-case if the input option is invalid?


Hyperref to the reference in the mentioned text

I want "Smith (2003: 22-3)" in the footnote to appear as a hyperlink to the same reference mentioned in the bibliography section. How should I do that?  \documentclass[preprint,12pt]{elsarticle} \usepackage[english]{babel}  \usepackage{graphicx} \usepackage{amssymb} \usepackage[superscript]{cite} \usepackage{lineno} \usepackage[colorlinks=true]{hyperref} \usepackage{natbib} \usepackage{footnotebackref}  \begin{document}  \begin{frontmatter}  \title{\textbf{Title}}   \begin{abstract} this is abstract \end{abstract}  \begin{keyword} \hspace{-0.5cm} social epistemology, testimony, manipulation, truth, knowledge \end{keyword} \end{frontmatter} \section{one} That is widely accepted.\footnote{for example see Smith (2008: 22-3) as one example.}  \section{Bibliography} \begin{thebibliography}{99}  \bibitem Smith, D. (2003). Perception. Oxford University press.    \end{thebibliography} \end{document}


How to automatically kill long running MySQL queries after N seconds in mysql?

Is there any configuration setting using which long running query can be killed automatically in mysql?


Texture-less/colourless .obj file when opened

I have an MMD model which i exported from PMD/PMX editor in .obj format, but when I import it into blender (ver. 2.75a), it's missing it's textures, same thing happens when I open it in Keyshot, anyway to fix this/re-colour textures?


What is known of James Potter's parents?

In the Harry Potter saga it is said that Harry's only family left are the Dudleys. However there is nothing said about his family on the parent side (at least not that I can recall), so the question is what is known about the James Potter parents (Harry's grand parents)? Are they alive? wasn't there any uncle, cousin, something/someone Harry could count on on the father family side?


Is there any mechanism for playing youtube in background? When i am playing just audio songs from youtube, i need to play it as on background, since there is no video in it.


Connecting 2 ventilators to the same output?

So i have an output of 5V 1A, and i want to connect 2, 5V 0.15A ventilators to the same output, and the question is - will there be enough voltage for both of them(because i have 1A output, and both of them would only need 0.30A)? Or do i still need 10 V?


In the following problem, you are given three pieces of information. Use them to answer the question.   $GCF(a,b)= 13\cdot 7$ $LCM(a,b) = 13^2 \cdot 7^3 \cdot 41$ $b=13^2 \cdot 7 \cdot 41$ $a \in \mathbb{N}$      What is $a$ ?


Necessary condition for square integrable functions?

I'm studying Quantum Mechanics and I came across this which I don't quite understand: For a vector space of functions $f(x)$ to be square integrable (i.e $\int{|f(x)|^2dx < \infty)}$, the necessary condition is $\lim_{|x| \to \infty}f(x) \to 0$. Can someone help me understand why that must be the case? I sort of understand that it must not blow up at the infinities but can a (continuous or piece-wise continuous) function have a non-zero finite value at the infinities and still be square integrable?


How to create shortcut and send it to Windows' Startup folder in one click?

Is there a shell extension or some program which lets you do it in one click? How do you get it to automatically create a shortcut (like the premade Send to “Desktop (create shortcut)” version)?


Recommended to Ubuntu, downloaded to a saved file on desktop

So now what?  Old HP with XP, running IE8 and had to put Chrome into the mix because Yahoo quit working in IE. Still use the IE, because my online shop won't load with Chrome. My AVG antivirus began having conniptions and to get System Restore to work again, Microsoft said to erase the antivirus software, which doesn't want to go (maybe another problem in itself?).  How do I open U and 'run it alongside' the others? I downloaded the 32 bit 12 LTS. Not as tech savvy as I should be for this, but was hoping to keep it all working at least until I can afford another computer. Thank you!


python regex sub does not replace all occurrence

I am using re.sub to remove certain part of the text. there suppose to be multiple matches, but sub function only replace one occurrence per one execution. What is going on?   import re import requests  r = requests.get('https://www.sec.gov/Archives/edgar/data/66740/000155837018000535/0001558370-18-000535.txt') text = r.content.decode() reg = re.compile('<DOCUMENT>\n<TYPE>(XML|GRAPHIC|ZIP|EXCEL|PDF)[\s\S]*?(</DOCUMENT>)')  re.findall(reg, text)   `` output: [('GRAPHIC', '</DOCUMENT>'),  ('GRAPHIC', '</DOCUMENT>'),  ('XML', '</DOCUMENT>'),  ('XML', '</DOCUMENT>'),...] ``  for i in range(10):     text = re.sub(reg, '', text, re.MULTILINE)     print(len(text)) `` output: 41875141 40950114 37558399 36097349 34776527``   In the first code block, I download the txt file and did a findall. there are multiple occurrence in this file. but when I use re.sub, it only replace one occurence.  EDIT  Seems that adding flag re.MULTILINE prevent the replace. Is there a way to get around?


Suppose Alice, Bob and Carol are playing a number guessing game, in which Alice, Bob and Carol pick a number from $[0, 1]$ sequentially i.e. first Alice then Bob and then Carol. After that, a random number $X$ is drawn from the uniform distribution $U[0, 1]$, and the person whose number is closest to $X$ wins (in terms of absolute differences). Suppose all the three players are smart and want to win, then which number should Alice pick?  An obvious choice seems to be $0.5$, and we can indeed prove that in this case Bob and Carol will have to both pick $0.5$ also - let's say Bob pick any $a<0.5$, then Carol would just pick any $b>0.5$ such that $|b-0.5|<|a-0.5|$ to have a strictly greater probability to win than Bob, which implies Bob wouldn't pick any number other than $0.5$, and thus Carol also has to pick $0.5$ too. So, Alice picking $0.5$ will definitely result in a draw.  My question is, does there exist other choices that can give Alice a strict advantage over Bob and Carol?


Differential equation: autonomous system

This isn't homework. I have no idea what theorems I should be looking at to solve this. Guidance, partial and total solutions are all welcomed.     Let $f$ be a locally lipschitz function in an open set $G\subseteq \Bbb R^n$. Consider the autonomous system $y'=f(y)$.      Let $y(x,\xi)$ be the value at point $x$ of the maximal solution that satisfies the initial condition $y(0)=\xi$.         Prove that the domain of $y(\cdot, y(s, \xi))$ is $I-s$, where $I$ is the domain of $y(\cdot ,\xi)$.   Prove that for all $s, t$ such that $y(s, \xi)$ and $y(t+s, \xi)$ exist, then $y(t,y(s,\xi))$ also exists and $y(t,y(s,\xi))=y(t+s, \xi)$.   If $y$ is a maximal solution and there exists $T>0$ such that $y(0)=y(T)$ and $f(y(0))\neq 0$, then $y$ is a periodic solution and not constant.   If $y$ is a solution whose domain is $(a,+\infty)$, if $\eta:=\lim _{x\to +\infty}y(x)$ and $\eta \in G$, then $f(\eta)=0$.      EDIT  I found an alternative solution for 3. Please check my proof and give feedback in comments:  let $u$ be the restriction of $y$ to $[0,T]$, now let $\overline u$ be the periodic extension of $u$ to $\mathbb R$. It is easy to see that $\overline u$ is a solution to the given differential equation. But since $f$ is locally lipschitz, $\overline u$ must coincide with $y$ wherever they are both defined. Since $y$ is a maximal solution, it must be $\overline u$, so $y$ is defined on $\mathbb R$.


Demoting/Promoting sections, chapters, etc

Consider following structure:  . |_s |_s  |_ss  |_ss+   |_sss  |_ss |_s |_s   How can I demote a subsection to subsubsection without changing markups ?  . |_s |_s  |_ss   |_sss+    |_p  |_ss |_s |_s   How can I promote a subsection to section without changing markups ?  . |_s |_s  |_ss |_s+  |_ss  |_ss |_s |_s   A wrapper command would be excellent  \begin[+1]{level} \section{} \end{level}


How do I load an mp4 video with multiple audio tracks into blender?

I've recently started using OBS multiplatform to record game play. I currently have it set to record sounds on 2 different tracks. The first for system sounds (like gamesound, mumble, etc.) and the second to record the mic.  I am able to switch between tracks when I play the unedited video using VLC, but when I load the mp4 into blender, I only get track 1.  Did I do something wrong, or does blender vse not support multiple tracks?  Blender after loading mp4:  VLC video information:   UPDATE  For now, it seems like the solution will be to use an external tool to get the second audio track and import it into blender afterwards. A  has been logged with the Blender bug reporting tool.  UPDATE 2  The bug report has been closed/archived with the gist being "not a bug". It has been added to the . If you are looking to have support for multiple audio tracks, I would suggest looking at other video editing software until Blender adds support for this feature.


polynomial function f(x,y) = x^3 – 5*y^2. polynomial function f(x,y) = x^3 – 5*y^2.  Heading


Problem with installation of Xubuntu all versions except 10.04

I'm trying to install a xubuntu version greater than 10.04, but it doesn't work. I run the program via a usb stick. I can access to the menu just after I choose my keyboard. I choose "Install" or "Try Xubuntu without installing", then I get an error set power failed status. So I shutdown the PC and I re run the install program with blacklist=firewire_ohci in paramaters. I don't get the error anymore with this line. Xubuntu is loading and after a couple of seconds, the loader stops and doesn't continue.   I tried differents versions (12.04,13.04,15.10,16.04) but none of them work. I have an Acer Travelmate.


I have a level 5 champion mastery with Morgana, and recently received my second S rank champ token with her.  Upon going to the crafting menu, I select "Upgrade with 2 champ tokens and 1 champ permanent."  When I select that, however, it shows I have the tokens, but NOT the permanent.  I clearly own Morgana, but is that not a permanent? Is this a bug or am I missing something?


question about when we use a and when we use an

The patient had been waiting in the emergency room for almost an hour before a doctor finally treated her.  (an) goes with a,e,i,o,u  (a) goes with the other letters  why do we use an hour ? instead  of a ?


Is there a proof for $\frac{\mathrm{d}y}{\mathrm{d}x} = - \frac{\frac{\partial }{\partial x}}{\frac{\partial }{\partial y}}$?

I've read that $$\frac{\mathrm{d}y}{\mathrm{d}x} = - {\frac{\frac{\partial}{∂x}}{\frac{∂}{∂y}}}$$ For example, if $f(x,y) = 2xy + y^2,$ $$\frac{\partial f(x,y)}{\partial x} = 2y \ \ \text{ and }\ \ \frac{\partial f(x,y)}{\partial y} = 2x+2y, $$ so $\displaystyle \frac{\mathrm{d}y}{\mathrm{d}x} = -\frac{2y}{2x+2y}$ Is there a proof for this assertion? I can't seem to find one.


I met a guy through Snapchat and he says he’s a sugar daddy. He claims he’ll pay me an allowance weekly through Cash App. But before he starts giving me an allowance he wants me to download and create an account on this Bitcoin app. I told him I did but now he wants the login information I created. Is this a scam? He’s sent me pictures of himself through Snapchat and even posts on his story. I’m having a hard time determining if this is real or not. I’ve had scammers message me and I’ve read things online, but this seems different. Please help!


For two path-connected homeomorphic spaces, is there a homeomorphism with a prescribed value at a point?

Let $X$, $Y$ be homeomorphic path-connected topological spaces. Is is true that for any pair $x\in X$,  $y\in Y$ a homeomorphism can be chosen such that $h(x)=y$?


Why am I getting 'Undefined Control Space' error?

I've come across some issues whilst compiling. I am using TeXShop and everything was working just fine and then suddenly I got this block of code:    Not sure what's wrong with it... :'(  Any help would be greatly appreciated.


Scope and wording of "minimal understanding of the problem" close category

It seems to me that the subject category comprehends not only "understanding of the problem" but also "effort to solve". These both seem like valid reasons to close, but it seems odd to bundle them and even odder to bundle them under a bold-formatted name (i.e. minimum understanding of the problem) that comprehends only one element.  The situation is further muddied by the fact that people seem to also use this category for situations where they feel the poster has not demonstrated sufficient competence in their efforts to solve the problem.  Perhaps the people who wrote this category are thinking of "problem" in the broader sense of "problem and the associated solution space"?  In any event, my question is whether this category (including the bolding) should:   Remain as is? Be reworded/rebolded to more accurately reflect the existing scope? Be otherwise refactored?   Update in response to close votes: This question is different than  because the latter only addresses the question of emphasis/bolding whereas this question raises questions of wording/semantics and whether to refactor the category (e.g. split out some of the content into other categories).  For example, this question also covers:   What is meant by "problem" in the phrase "understanding the problem"? Does it refer to just surface level symptoms, what's causing the symptoms, what's required to address the cause? Should we use more specific language?emphasized text Which, if any, of these things is really a requirement given the de facto standard or what is acceptable on SO, where one or more of these things is commonly absent in unclosed questions. Should demonstrated understanding/competence in the solution space be in a separate category from demonstrated understanding of the symptoms and/or causes of those symptoms (i.e. what I would consider "the problem")?


Let $A \in M_n(\mathbb{C})$ such as $A^m=I_n$ or $A^m=-I_n , m\ge1$. Show that A is diagonalizable.


Let G be a set of all non-zero real numbers. And  a * b  = (ab/2).  We need to show (G,*) is an abelian group.  I know I need to show ab = ba, but that seems so trivial,  Assuming the group is abelian,  a * b  = b* a  ab/2 = ba/2 Crossing out 2, we get ab = ba  Is this the correct answer ?  Multiplying both sides inverse of a and b results in 1 = 1 . Am I doing something wrong ? Or am I missing something?


Dropbox - soft link from external hard drive doesn't get recognized by Dropbox on OS X

I store some super large compilation of files on my external hard drive because there isn't enough space on my Macbook Pro. I would like to have them in my Dropbox as well. In this question  the OP seems to have success in using soft link to back up his folders in external hard drive to Dropbox.  However it didn't work in my case: Dropbox simply seems to think those links are nonexistent and doesn't back up the contents. I suspect the reason is because my external hard drive is in NTFS+ while my local hard drive is in HFS+, and I use the tool "Paragon NTFS for Mac OS X" to be able to write to the external drive.   However I think soft links are supposed to work across file systems? Is there any work around to this.


How do you make a list of all possible arrangements in python?

I am currently working on a simple project on my own, and I stumbled on a problem: I need to have a list of 4 numbers: say   L=[1,3,4,6]     I need a full list of rearrangements of the Numbers so:    L_arranged=[[1,3,4,6],[1,3,6,4],[1,6,3,4],...,[3,4,1,6]]     Any Ideas? Even a theory would be useful, thank you :)


Are there regional distinctions in how hiccup/hiccough is spelled?

So I was a student of English was taught English right on the border between the US and Canada.  My husband (who is from the Southwestern states) was reading something I wrote where I used the spelling hiccough and laughed at the spelling as he had not yet encountered it.  I was wondering if there was any regionality behind how one spelling gets chosen over another in how the spelling is taught.  I actually know and use both spellings (I don't know why I choose one over another in any particular circumstance).  To draw an analogy, all over BC Canada, you find "cheque" spelled as I show here.  However, all over Washington State US, you find it spelled, "check."  Pronunciation is the same.  I'm just wondering if any one knows if there is a similarity in regard to hiccup/hiccough.


I am using this script to add in a date whenever a row is edited. I want it to ignore the first row. Thoughts on how to do this?  function onEdit() {      var s = SpreadsheetApp.getActiveSheet(); // Get spreadsheet name      var r = s.getActiveCell(); // store active cell name in current spreadsheet    var cell1 = 2 // This is the row I want to put values   if(r.getColumn() != cell1) { // Ignores this row (where I put the dates)     var row = r.getRow();  // Get column # from active cell     var time = new Date(); // Get date and time of last mod     time = Utilities.formatDate(time, "GMT-05:00", "MMM dd 20yy, hh:mm"); // Format date and time     SpreadsheetApp.getActiveSheet().getRange('B' + row.toString()).setValue(time);   };  };


How to avoid inaccuracy in double numbers C++

I need to print all digets of some double number. I have following code:  double number;     while (number != floor (number)) number = number * 10;   But when number = 0.222, I have following result 22200000000000004. How can I avoid this inaccuracy.  P.S. I can use only double, so I can't parse this like a string.


I was wondering how to find the value of the following series:  $$\cfrac{1}{2+\cfrac{1}{3+\cfrac{1}{4+\cfrac{1}{5+\cfrac{1}{6+\ddots}}}}}$$  How can I solve this?


How can I access windows 10 partition in ubuntu when i cant get it to shut down in a "safe state"?

i am having a problem with trying to access my windows 10 partition from ubuntu, getting the error:   Error mounting /dev/sda4 at /media/jacob/OS: Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000" "/dev/sda4" "/media/jacob/OS"' exited with non-zero exit status 14:       Windows is hibernated, refused to mount.       Failed to mount '/dev/sda4': Operation not permitted       The NTFS partition is in an unsafe state. Please resume and shutdown       Windows fully (no hibernation or fast restarting), or mount the volume       read-only with the 'ro' mount option.   I have tried doing a "safe" shutdown many times. (shut down from start menu)


Almost everything about Rey is purposefully left a mystery. The film strongly hints that she’s related to one of our main characters—but since we get very little indication from Leia, most people think she’s related to Luke. That’s bolstered by the fact when Kylo Ren reads her mind, he sees an island with water. This is a huge clue. Is he seeing Rey’s future, from the end of the film, or her past, when she was with Luke before?


Why do electrons occupy the space around nuclei, and not collide with them?

We all learn in grade school that electrons are negatively-charged particles that inhabit the space around the nucleus of an atom, that protons are positively-charged and are embedded within the nucleus along with neutrons, which have no charge. I have read a little about electron orbitals and some of the quantum mechanics behind why electrons only occupy certain energy levels. However...  How does the electromagnetic force work in maintaining the positions of the electrons? Since positive and negative charges attract each other, why is it that the electrons don't collide with the protons in the nucleus? Are there ever instances where electrons and protons do collide, and, if so, what occurs?


I have been trying to create a file called ~/dictwords.txt, which contains the number of words found in the file /usr/share/dict/words.  I already created the file then I removed it because I did it wrong I originally did the echo command. Then I tried this command and was so excited because I thought I was correct.  wc -w /usr/share/dict/words > ~/dictwords.txt   It's still wrong, I am supposed to have just the number, without a file name.


How can I get characters in string using index but did not use charAt()?

I'm writing a program in Java. They say to not use String functions - so how can I get characters in a String using the index but not using charAt()?   other question has answer but they all are using charAt()  I also want to get characters one by one using a loop.


I installed Ubuntu a few days ago. Due to some error my hard disk was erased. Now I am trying to install Windows 8.1 again, but I am getting this error:   Windows Boot Manager   Windows failed to start. A recent hardware or software change might be the cause.   To fix the problem:    1. Insert your Windows installation disc and restart your computer.    2. Choose your language settings, and then click "Next."   3. Click "repair your computer."  If you don't have this disc, contact your system administrator or computer manufacturer for assistance.     Status: 0xc000000f    Info: The boot selection failed because a required device is inaccessible.


Changing Cell Date Formats to Text Format and Retain mm/dd/yy

I need to change cell dates with a general format (mm/dd/yy) to a text format for uploading to Peoplesoft. However I must retain the mm/dd/yy. When I change the cell from general format to text format it then changes the date to a serial number date such as 41982 etc. I don't want the serial number date. It must remain a text format cell with mm/dd/yy or mm/dd/yyyy etc.


Collapse in Google Traffic After Domain Migration and SSL Certificate Install

We migrated our old URL (www.nyc-officespace-leader)  to a new domain (https://www.metro-manhattan.com) on April 5th, 2018. The new domain has been registered to us since 2013.    Within 5 days web traffic feel about 90%. At about 21 days, web traffic increased to about 75% of it's previous daily traffic. It has been stable in the last week.   Is this normal? Should traffic recover? I have read it can take up to about 2 months. A feedback or advice would be greatly appreciated! We followed the below procedures for the switch:   Create "splash" page with h1 and text Remove redirection SSL for www.metro-manhattan.com      Verify the domain metro-manhattan.com on Google search console Create two subdomians to "simulate" the redirection/migration and test redirection    move the reduced website from subdomain 2 to www.metro-manhattan.com Apply the partial redirection on production   Submit a sitemap on google webmaster tools for www.metro-manhattan.com Apply complete redirection from nyc-officespace-leader.com to www.metro-manhattan.com


I have 100 files with 57,816 rows each.I want to do an outer join of these files by merging on basis of the common column.  I am using R programming for this but this is very slow.  fileList <- list.files(, pattern=".txt") pm_list=lapply(fileList, read.table) merged_pm=merge_all(pm_list, by = "gene_short_name")   Is there any quick way to do this in bash? The other method that I can use is SQL but I have to create 100 tables first and then load them up before join,which is not very efficient way to do.  The number of rows are equal in each file, thats why I want to merge  based on common column and can't use cbind from R as the constants in the common column are a bit up and down in different files and not present at same location in each file.Below are two sample files.I want to join based on 'gene_short_name'  gene_short_name FPKM56  MT-TF   0.90 MT-TV   0 MT-RNR1 310.015 MT-TL1  0 MT-TM   0   File 2 is below:  gene_short_name FPKM53  MT-TF   0 MT-TV   0.344 MT-TM   0.10 MT-TL1  0 MT-RNR1 0 MT-ND2  158.332


Quantum Entanglement, connected or just in tune?

I read a few of the questions suggested to be similar, but I didn't see what I am looking for. Please feel free to point me in the right direction if I just missed it... (there are quite a few).        I am in my mid 30s and never went to college. My understanding is largely from various YouTube sources.    There is one thing I don't understand about entanglement and I can't find any videos that explain it.         If I spin a coin on a table, shoot it with a gun dead center and the coin breaks perfectly into two smaller coins... and the split pushes the coins into spinning in opposite directions of each other... and this was all on a big magic friction-less table that allowed them to spin away from each other until they were a mile away from each other... I could look at one and see that it was spinning clockwise and instantly know that the other coin is spinning counter clockwise without those coins having to communicate faster than light.             I know I'm just some pleb stuck thinking from an intuitive state of mind... but I'm open to expanding that... I just don't understand why entanglement isn't just two objects being in sync because they were created in sync or were synced up at some point. Can anyone explain why this isn't the case?


How to read an excel file inside the jar?

I have a Sample.jar in my build path which contains only an excel file abc.xls under src. How do I read this into a FileInputStream in my java application?  Also, I have to deliver my project as a jar. This jar must be able to read the excel file present in Sample.jar.


I'm not familiar with creating .bat files, but I want to create a file to deactivate/disable a network device    This is in win7. I have googled some similar problems, but nothing to solve this. pls help.


Aligning environmental layers causing a change in nodata values

I'm trying to align and re-sample environmental layers in QGIS (2.18.3). The layers I am using were obtained from the world clim data base Bio3,Bio18,Bio12,Bio10 as well as a Sheep and Cattle layer obtained from the FAO website. The World clim layers are at pixel size of 0.0416667,-0.0416667 and the two livestock layers are at a pixel size of 0.05,-0.05. Using the identify tool in QGIS I can see the ocean areas in this raster have a value of 0 for the livestock layers and a nodata value in the environmental layers (note my analysis is only interested on the land). I have been trying to use the raster align tool in QGIS so I can match these layers for some later Maxent analysis. I have used the following procedure in QGIS. Raster>Align Raster. Then I have been adding all the 6 layers, making the livestock layer the reference layers as it is of lower resolution. Checking the CRS value is at WGS 85, as well as adding coordinates to trim. This process occurs correctly, with pixel size matched. However my concern arises when I look at the trim and aligned rasters. Three raster Bio 10,12,18 all get a minimum value of -32768, were as Bio3 gets 43. When I used the identify tool again on the rasters Bio10,12,18 in the oceans show a value of -32768, whereas Bio3 give a value of 255 and the livestock layers are at 0.   Should the min and max values be matching in these layers if I am to compare between them?   Or are these values just proportional?


Is there a way to obtain a certain element in a two-dimensional ArrayList in Java?

Introcution I am new in Java and I have written a method to return an element from an two dimensional ArrayList, based on a given parameter. The method should return a value that meets the given parameter or else return null. Problem     public String getUnit(String nutrient) {         String foundUnit = null;          for (int row = 0; row < nutrientsList.size(); row++) {             for (int column = 0; column < nutrientsList.get(row).size(); column++) {                 if(nutrientsList.get(row).get(column) == nutrient) {                     foundUnit= nutrientsList.get(row).get(column+1);                 }             }         }         return foundUnit;     }  The unit value is located in the second column. Unfortunately it returns a null, when there are more than two instances. The output of  System.out.print((nutrientsList.get(row).get(column))); is BIG Macstuk510drop100 g336 . While the output is correct, it cannot be used to compare it against the nutrient variable. For example, if I need to have the value drop from the ArrayList, it won't return me this value. I have been debugging the code and the variable nutrient has the correct value, so I suspect the main cause has to be: if(nutrientsList.get(row).get(column) == nutrient). Question What is issue here? Although all the values and outputs are correct, I have no idea what is causing the if-statement to fail. I have been trying to split it, but it didn't work out as expected. How could this be fixed? Things I have tried  I have tried to convert the ArrayList to an Array; Tried to add + "," to split the elements; Tried to change the if-statement to nutrientsList == nutrient. This gave me the error that the data types were not equal  None this worked.


Where are Wine files stored in Ubuntu 18.04?

I just used Wine to install a program in the "Program Files (x86)" folder. I would like to use wine to be able to run this program instead of having to run the installer every time I want to use it. Where does Wine keep its program files folder? Or else, how can I use Wine to run programs in this folder?


Find the limit $$\lim_{n \to \infty}\left[\left(1-\frac{1}{2^2}\right)\left(1-\frac{1}{3^2}\right)\cdots\left(1-\frac{1}{n^2}\right)\right]$$   I take log and get $$\lim_{n \to \infty}\sum_{k=2}^{n} \log\left(1-\frac{1}{k^2}\right)$$


The preimage of continuous function on a closed set is closed.

My proof is very different from my reference, hence I am wondering is I got this right?  Apparently, $F$ is continuous, and the identity matrix is closed. Now we want to show that the preimage of continuous function on closed set is closed.  Let $D$ be a closed set, Consider a sequence $x_n \to x_0$ in which $x_n \in f^{-1}(D)$, and we will show that $x_0 \in f^{-1}(D)$.  Since $f$ is continuous, we have a convergent sequence $$\lim_{n\to \infty} f(x_n) = f(x_0) = y.$$  But we know $y$ is in the range, hence, $x_0$ is in the domain. So the preimage is also closed since it contains all the limit points.  Thank you.


As a lot of people are aware, vaccines produced by different pharmaceutical companies have different “efficacy rates”: which shows different rates of how effective vaccines are. My question is, are there different measures of how effective a vaccine are? e.g.- Are they measured according to how many people, as a percentage, receive immunity? Is it measured according to who retains immunity after trials? A secondary question is do different pharmaceutical companies have a standard for measuring how effective their vaccines are, or do they each set their own standards? (with or without help from the WHO, etc?)


Changing the size of sub- and superscripts for the whole document

I want to change the sizes of sub- and superscripts of formulas as their font size is already set to \scriptsize. Is there a way to decrease the font size of all formulas written in \scriptsize by predefining the size in the preamble?  Thanks!


Invalid parameter number: number of bound variables does not match number of tokens using pdo

This problem has got me absolutely stumped, I have looked through other answered questions on stack overflow and none of them answer my question.  **  Code:  **      function inputVCA(){     global $dbh;     $count = 0;     if(isset($_POST['vca'])){         $pcid = mysql_real_escape_string($_POST['ID']);         $vca = $_POST['vca'];         $tok = strtok($vca, ";");         while($tok !== false){                   $countNew = countDataToHour($count);             $stmt = $dbh->prepare("UPDATE $pcid SET $countNew = :token WHERE ID='1'");             $stmt -> bindParam(':token', $tok);             echo "
".$pcid."
";             echo countDataToHour($count)."
";             echo $tok."
";             if($stmt->execute()){                 // do nothing             }else{                 die("failed to execute query");             }             $count++;             $tok = strtok(";");         }     }  }   **  Output (including the error message):  **  888 00:00 40  Warning: PDOStatement::execute(): SQLSTATE[HY093]: Invalid parameter number: number of bound variables does not match number of tokens in C:\xampp\htdocs\practice\src\dataChecker.php on line 170 failed to execute query  **  What do I already know about the issue?  **  The reason this problem has me so stumped is because when I test variables etc. everything seems to output correctly. Anyway:   I've tested the sql query without the :variables. That works The variables outputted are the ones I entered into the form so I assumed it cannot be a problem there   **  Extra info  **  The one bit of my program that I am unsure about is the:  WHERE ID='1'   in my sql query. The reason I do this is because I only will ever need one line in the sql table for the moment.    Any help appreciated, thank you :). Also as a sidenote, whoever voted me down should not have the privileges to vote anyone down. I presented my problem very clearly. My php code is a little bit sketchy but if you are voting me down for this reason this is counter productive and may discourage new users to posting questions on this site. If new users don't come then you will lose out to other competitors. Thank you to all those who gave helpful contributions.


Javascript validation for emails starting with comma and period symbols

We have .js email validation function using regex for a textbox. But however our validation allows wrong emails, when user mentions email ID, starting with comma or period symbol. Please help with the code.  function validEmailAddress(emailAddress){        var regex = /^([\w-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([\w-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$/;     var result = emailAddress.replace(/\s/g, "").split(/,|;/);      alert(result.length);            for(var i = 0;i < result.length;i++) {         if(!regex.test(result[i])) {             return false;         }     }            return true; }


Casting idataset to ifeaturelayer in ArcObjects C#?

I am try to casting idataset to ifeaturelayer i did not get any idea  here my code              ESRI.ArcGIS.ArcMapUI.IMxDocument mxd = ArcMap.Application.Document as                                                    ESRI.ArcGIS.ArcMapUI.IMxDocument;             ESRI.ArcGIS.Carto.IMap map = mxd.FocusMap;             ESRI.ArcGIS.Geodatabase.IWorkspaceFactory wsf = new                          ESRI.ArcGIS.DataSourcesGDB.FileGDBWorkspaceFactory();             ESRI.ArcGIS.Geodatabase.IWorkspace ws = wsf.OpenFromFile(@"D:\ARC OBJECTS\TemplateData.gdb", ArcMap.Application.hWnd);             ESRI.ArcGIS.Geodatabase.IFeatureWorkspace fws = ws as ESRI.ArcGIS.Geodatabase.IFeatureWorkspace;             ESRI.ArcGIS.Geodatabase.IFeatureDataset fd = fws.OpenFeatureDataset("World");


Despite my inflammatory title, I understand that \usebox is employed to display a predefined box.  But this question concerns when [the use of the box register, rather than the box content] becomes absolutely essential to a LaTeX operation (for example, as arguments to \wd, \ht, and \dp). [EDITS above and below in brackets, to reflect proper terminology]    Clarifying, based on Werner's comments, given the syntax  \newsavebox{\xyz} \sbox{\xyz}{...} \def\xyzbox{\usebox{\xyz}}   are there useful things I can perform only upon [the register] \xyz that I cannot perform on [the box content] \xyzbox?  (If not, then maybe \usebox is vestigial).    For example, consider the LaTeX syntax  \newsavebox{\xyz} \sbox{\xyz}{...} \usebox{\xyz}   Why couldn't LaTeX have been constructed so that the last line could have been issued as \xyz, without the \usebox (saving me a few characters of typing)?  I am so frustrated [an exaggeration] with the \usebox syntax, that I work around it in both the verbatimbox package and the \stackengine package. In the former, I allow this syntax:  \begin{myverbbox}[]{\boxname} ... \end{myverbbox} \boxname% <--NOTE: THIS IS NOT \usebox{\boxname}   Internally, \boxname actually points to \usebox{boxnamecontent}  Likewise, in stackengine, I allow:  \savestack{\mystack}{VARIOUS STACKING COMMANDS} \mystack% <---NOTE: THIS IS NOT \usebox{\mystack}   Internally, \mystack actually points to \usebox{\mystackcontent}  So the crux of my question is this?  When is the [use of a box register] essential to a LaTeX operation??  I realize things like \wd, \ht, and \dp act on the un-rendered box name itself (without the \usebox); however, even these are replaceable by calc's \widthof, \heightof, and \depthof, which act upon the (rendered) \usebox version of the box.  So what other TeX/LaTeX operations act upon [the box register, rather than the content]?  In essence (rhetorically), why do we still need \usebox syntax if everything that acts upon a box acts upon the rendered \usebox form of the box?  [So far, the answers have revealed that I need the box register to set the box, and to use the box.  And I can, but don't need to, use the register to measure the box.  And in nebulous places where I "need a number, not... a box".    Any other usages of the box register?]


How do I show running windows without clicking the "Activities" button but only hovering over it?

I'm from Ubuntu GNOME 16.04 and I just installed Ubuntu 18.04 which contains GNOME by default, but there are a lot less preferences.  I want to open the selection of windows (as if we clicked on the 3 points or "Activities" button) but only when my mouse is in the (top-left) corner of my screen.  How can I do this?


Why square matrix with zero determinant have non trivial solution

While I was solving problem to determine if given set of vectors are linearly independent or not, the solution given was that the coefficient matrix A of the homogeneous linear system of those vectors   k1a1 + k2b1 + k3c1 = 0  k1a2 + k2b2 + k3c2 = 0  k1a3 + k2b3 + k3c3 = 0  was a 3x3 square matrix, and determinant(A) = 0  Thus it has a non trivial solution and hence the vectors are linearly dependent.  I am unaware about how if A is nxn square matrix and if determinant(A) = 0, then the system is having a non trivial solution.


If every prime ideal is maximal, what can we say about the ring?

Suppose $R$ is a ring and every prime ideal of $R$ is also a maximal ideal of $R$. Then what can we say about the ring $R$?


Can any Attack action by a monk trigger Flurry of Blows?

Reading over the Monk I saw that for Martial Arts:     When you use the Attack action with an unarmed strike or a monk weapon on your turn, you can make one unarmed strike as a bonus action.   This implies that non-monk weapons do not count towards being able to make this single unarmed strike. However, when looking over Flurry of Blows:     Immediately after you take the Attack action on your turn, you can spend 1 ki point to make two unarmed strikes as a bonus action.   The requirement doesn't seem to be there anymore, and I didn't see where this discrepancy was covered in . This  says that you can use flurry of blows as a bonus action on any form of attack.   So does the limitation really only exist on a single unarmed strike, but you can use whatever attack action you want to trigger Flurry of Blows?


Show that if $|f(z)| \leq M |z|^n$ then $f$ is a polynomial max degree n

I can't prove this statement, can anybody show me how to prove it?    $$f:\mathbb{C}\rightarrow \mathbb{C} \in \mathcal{O}(\mathbb{C}), \exists n\in \mathbb{N}, R >0 , M>0 : |f(z)| \le M|z|^{n} \ \ \forall |z|>R \Rightarrow \deg(f)\le n $$  To show is that if there exists such an $M$, that then $f$ is a polynomial of max degree $n$. I started like this:   $$f(z) = \sum_{n=0}^{\infty} a_n (z-z_0)^n$$ So if I put this into the inequality: $$|f(z)| = \left| \sum_{n=0}^{\infty} a_n (z-z_0)^n \right| \le M |z|^n .$$


How to prevent negative comments/downvoted being deleted by re-posting answers

I recently downvoted an answer on SO because I believe it didn't actually answer the question, and before I could add a comment, the answer had been deleted. Two minutes later, I looked at the question again, and the same user had re-posted his answer, without the downvote.  I've seen this guy remove answers with negative feedback/downvotes in the past and repost them exactly as they were. My biggest concern is that by getting round the system this way will hide legitimate feedback that may be very relevant to whoever asked the original question.  I feel there's an argument for requiring a vote to close ANY answer or question with any kind of feedback. Personally, I've only ever deleted one question that had answers, because I realised there wasn't an easy way to explain what I was asking, and realised shortly after I posted it that it wasn't possible anyway.


I've set the Supervisor Password on this Acer E3-112M notebook in order to install Fedora in UEFI Mode. Long story short, the prompt seems to accept certain symbols when setting the password but not when prompting for it, and now I'm stuck without being able to access the BIOS. I'm wondering if it's possible to dump the BIOS of one chip and then dump it into mine. I've got a friend with the exact same model of the notebook but his doesn't have the supervisor password set. Is it possible to dump the firmware ROM to a file from his laptop then dump it to mine to restore its "factory status"?  Also, I haven't found any information about how to "short-reset" this BIOS or clearing the CMOS (most Acer methods don't work in this one, the password stays) and I also haven't found much info on this model.  All help is appreciated, thanks.


I'm designing my own Sonoff with ESP32, with power monitoring capability. Now before I start my own design, I took a look at Sonoff design. In the Sonoff POW the power metering IC has a 0R resistor, while the datasheet of HLW8012 did not have any 0R resistor. The 0R an an SMD 1206 resistor, and I don't quite understand its purpose.  What's the purpose of 0R here?  Moreover, Is the transformer enough to make the Mains isolated from the power supply, or we should go for extra safety and mains isolation stuff?


It is a general statement that cats tend to fall on their feet. How far is this is a valid statement? If I were to drop a cat from 50 meters height, feet  up(hypothetically), would it still land on its feet? But would that violate the angular momentum conservation (if initially the cat has zero spin when dropped) and the law of Inertia?


$\lim\limits_{n\to \infty} \int_0^1 |f(x)-a_nx-b_n| dx=0$ implies $(a_n)_n,(b_n)_n$ are convergent

Let $f:[0,1] \to \mathbb R$ be a continuous function and the sequences $(a_n)_n,(b_n)_n$ s.t. $$\lim_{n\to \infty}  \int_0^1 |f(x)-a_nx-b_n| dx=0.$$ Prove that $(a_n)_n,(b_n)_n$ are convergent.   I know that $$\left|\int_0^1f(x)dx\right| \le \int_0^1|f(x)|dx.$$ Can somebody help me, please?


Chess game where first person puts down a knight and then they move the knight, whoever can't make a move loses

The knight is the only piece on the board, and it cannot visit a space more than once. I have barely any ideas. However, I know that a knight changes the color it is on every move, but I can't put that fact into use.


Secondary Clustered DTC will not work when Primary goes offline - SQL Server Issues

I've been working on setting up clustered environment with a two new DTC roles, DTC1 and DTC2. I set up DTC1 which allows both clustered VM's and SQL Server Instances to function correctly. However, when I disable DTC1, DTC2 will remain online but no DTC transactions will work. I'm actually going through this issue with a Microsoft tech right now (without much luck). Both DTC services are set up with similar configurations. Anyone here have an idea as to what might be going on?  Here's my setup,  One clustered environment Two DTC Roles Two Separate ISCSI disks, one for each role Two VM's (same configuration) Two SQL Server Instances, on on each VM  Networking configuration is allowed, everything looks to be set up properly.


"Not a COM32R image" error when trying to install from a USB key

Not a COM32R image boot   is a message that the console infinitely keeps spitting out when I try to install Ubuntu 10.04 from a USB. I created the USB using the StartupDiskCreator in 11.04.  What is the reason for this behavior? What do I do to set it right?   I have followed the steps perfectly, as enlisted in the .


In few docs I see suggestion to query the user's last login data to check if user is actively using the license or not, is there any way we can get to know if the feature license is being used properly through API or the suggested approach we can use to determine for feature license usage as well?


In terminal I ran:  defaults write com.apple.finder AppleShowAllFiles TRUE  and   killall Finder  If I CMD + SHIFT + G  /usr/local/.git I can see the folder.    However, if I CMD + SHIFT + G and go to /usr/local I cannot see the folder.


C# Expression tree that calls a generic method

I have a generic method, with the following signature   private static void ProcessItem<T>(int id) where T : BaseItem   And it gets called in the following way  ProcessItem<RedItem>(id: 2) ProcessItem<BlueItem>(id: 7)   My issue is that I get the type of item on application start up via reflection as a Type object.  So now I am looking for a way that I can construct an expression tree that will result in a lambda that calls this method with the appropriate type.  So I can do something like lambda.Invoke(Type type, int id). And this will call something along the lines of id => ProcessItem<type>(id)  I found a similliar issue answered here:   However, the answer there shows how to instantiate a generic param of IEnumerable<> whereas I simply need to call my method, transforming the Type object into an actual <Type> parameter that my method can accept.  I am not exactly sure if this is even possible (converting a Type object into an actual type parameter), but would love to hear any suggestions on the topic.   PS: I am also willing to take a different approach (some reflection tricks maybe), as long as it doesn't affect performance by more than 10-20%


I'm having trouble installing ubuntu 13.04 on my windows 8 machine. The slot one disk is a 360gb SSD with W8, but the disk I want to install Ubuntu on is a 120gb SSD. I keep trying to install the OS, but it tells me there's no root system on the 120gb SSD that I want to use. I was wondering if anyone could help because I cannot find what I think is a relevant article.


I am using Lubuntu 19.04 and am very pleased with the speed and performance however support has now ceased for this iteration. The question is should I go back to Lubuntu 18, as suggested, or switch to Ubuntu. My PC is a virtually new  HP Pavilion with plenty of grunt.


Is this an identity in modular arithmetic or does there exist a proof for this?

I'd like to call this modular multiplication but all the proofs I can find prove the following :   If $a_1 \equiv b1 \pmod{n}$ and $a_2 \equiv b_2 \pmod{n}$, then $a_1a_2 \equiv b_1b_2 \pmod{n}$  How do you go about proving this?  I want to try to show the following, but I am not sure how to do so: $$ab \equiv (a \bmod{c})(b \bmod{C}) \pmod{C}$$


Why IV does not have to be secret yet has to be random

The IV used in schemes such as CBC has to be random and unpredictable. But at the same time it does not have to be kept secret.  If the IV does not have to be secret, why does it have to be random then? I fail to make sense out of these seemingly contradicting requirements.  I have seen descriptions of attacks which exploit the non-randomness. So, I would understand why randomness is needed. However, things get confusing when the requirements specify that the IV does not have to be secret !This seems to defeat the whole purpose of randomness.  Somebody help clarify this please.


what does it mean when there are two brackets in a set

I have a problem that I don't under because I don't know what the answer is because there are two lots of brackets in D B n D when B = {6,7,8,9} when D = {{6,7},6,4}


Concatenating Column Values into a Comma-Separated string

I have a table which looks like the following:  EventProfileID    ParamName       ParamValue 1                 _CommandText    usp_storedproc_1 2                 _CommandText    usp_storedproc_2 2                 _CommandText    usp_storedproc_3 2                 _CommandText    usp_storedproc_100 3                 _CommandText    usp_storedproc_11 3                 _CommandText    usp_storedproc_123   What I would like my output to be is the following:  EventProfileID    ParamValue 1                 usp_storedproc_1 2                 usp_storedproc_2, usp_storedproc_3, usp_storedproc_100 3                 usp_storedproc_11, usp_storedproc_123   However I am having some bother.  If I do a select on one of the event profile ID's I can get an output using the following logic:  SELECT LEFT(c.ParamValue, LEN(c.ParamValue) - 1) FROM ( SELECT a.ParamValue + ', ' FROM DP_EventProfileParams AS a WHERE a.ParamName = '_CommandText' and a.EventProfileId = '13311' FOR XML PATH ('') ) c (paramvalue)   However that just gives me the output for one EventProfileID and also I would like the EventProfileID as part of the output.  Can anyone give me any pointers in the right direction into how I can expand my code to include this and allow the code to be dynamic so that I can show all EventProfileID's?  Thanks


What does `cat passwd | awk -F':' '{printf $1}'` do?

What does this command do? How do I see that in the terminal because I don't have anything when I write cat passwd | awk -F':' '{printf $1}'


Why X-ray and radio waves can penetrate walls but light can not?

Why can visible light, which lies in the middle between X-ray and radio waves in terms of frequency/energy, not penetrate walls?


Understanding blender collection, instancing from Sketchup side of view

I'm trying to migrate to Blender from Sketchup.  There, instancing is managed simply by 'group' and 'component'.  Groups are just separate coordinate system while components make object an instance. So when you want to separate singular object you make group, else to make linked objects you make component. Groups can have components and components also do. There is no depth restriction so a group can have groups which have component which have another components that have a group, and so on.  This kind of structuring is very crucial in architectural modeling as they tend to have duplicated objects and become very hierarchical.  I've read this and that about blender instancing, grouping, tied playing with boxes for days but still things are not clear. I think one of the cause is that parenting and grouping is separate in Blender.   So I'm asking here hopping someone could give a golden answer (once again) that would weave everything vividly and reveal real power of Blender specific hierarchy structure represented by 'collection'.  Is there anyone coming from Sketchup side and managed to understand instancing in Blender? How should I reroute my thinking?