I have a code of C:  typedef void (* FPS_PositionCallback) ( unsigned int   devNo,                                     unsigned int   length,                                     unsigned int   index,                                     const double * const positions[3],                                     const bln32  * const markers[3]   );   and I need to write same thing in C#. Any Idea?

Is there a typedef equivalent in C#, or someway to get some sort of similar behaviour? I've done some googling, but everywhere I look seems to be negative. Currently I have a situation similar to the following:  class GenericClass<T>  {     public event EventHandler<EventData> MyEvent;     public class EventData : EventArgs { /* snip */ }     // ... snip }   Now, it doesn't take a rocket scientist to figure out that this can very quickly lead to a lot of typing (apologies for the horrible pun) when trying to implement a handler for that event. It'd end up being something like this:  GenericClass<int> gcInt = new GenericClass<int>; gcInt.MyEvent += new EventHandler<GenericClass<int>.EventData>(gcInt_MyEvent); // ...  private void gcInt_MyEvent(object sender, GenericClass<int>.EventData e) {     throw new NotImplementedException(); }   Except, in my case, I was already using a complex type, not just an int. It'd be nice if it were possible to simplify this a little...  Edit: ie. perhaps typedefing the EventHandler instead of needing to redefine it to get similar behaviour.


Is there a way to restrict php pdo execute() to run just the first sql statement?  For instance running   SELECT * FROM customer;DROP TABLE invoice   will return all customers but it will also delete the invoice table.  I have a situation where I need a whole SQL statement from a user but it must be a SELECT and nothing additional.  My example is just one of many that could be maliciously entered. It might include additional DROP, UPDATE, DELETE statements etc.  A prepared statement will simply replace ?s with values. It will not stop dangerous SQL statemets being passed to it.  This would not be a problem if there was a way to restrict php pdo execute() to run just the first sql statement?

If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening?


I have been following some of the  and now I have time to review some of them. Is there any archive for old newsletters? They were stored and tagged in my Gmail. While there was thousands of them there it had made a bad view for my inbox, so I deleted them, unfortunately! Now, is there any way to find them on Stack Exchange?

I think I've done due diligence in searching, and I cannot find a StackOverflow newsletter archive.  Does one exist?  If not, would it be possible?


I have recently moved from the authoryear style to authoryear-comp (). However now commas appear behind the the authorlist regardless of  whether \citet or \citep are used:      (Doe etal., 2002) for \citep and Doe etal., (2002)  for \citet   For the latter this is wanted, for the former it just look ugly. How do I get rid of that comma?  I know that I can redefine nameyeardelim but that removes the comma for both cases.  MWE:   \documentclass[a4paper,11pt]{scrartcl}  \usepackage{hyperref} \usepackage[natbib = true,     style = authoryear-comp,     backend = biber,           hyperref = true,        giveninits = true,     maxbibnames = 8, maxcitenames = 2,     uniquename=false,     uniquelist = minyear,     doi = false, url = false, isbn = false, eprint = false]     {biblatex} % \addbibresource{example.bib}  \begin{document}     some text about \citet{Doe1999, Doe2002, Doe2004}, where \citet{Doe1999} are referenced and others \citep{Doe2002}      \printbibliography \end{document}   bibliography:  @Article{Doe2002,   author  = {John Doe and Albert Miller and Jack Frost and Gregor Smith},   title   = {Paper 2},   journal = {Journal of Best Research},   year    = {2002}, }  @Article{Doe2004,   author  = {John Doe and Jack Frost and Albert Miller},   title   = {Paper 3},   journal = {Journal of Cool Research},   year    = {2004}, }  @Article{Doe1999,   author  = {John Doe and Albert Miller and Jack Frost},   title   = {Paper 1},   journal = {Journal of New Research},   year    = {1999}, }   Desired output would look like the following   \citep: (Doe etal., 2002) \citet: Doe etal. (2002)

I've been using the biblatex package for a while, and since updating my TeX installation (post-el capitan upgrade) I have been experiencing the following.   If the following is typed:  Such and such has been said \citep[111]{citekey}.   The following text is displayed:  Such and such has been said (Author, 2016, p. 111).   And if the following is typed:  \citet[111]{citekey} has said such and such.   The following text is displayed:  Author, (2016, p. 111) has said such and such.   The citep command is working as I want it to, but I do not want a comma placed after the author's name when using the citet command. I would like it to display as follows:  Author (2016, p. 111) has said such and such.    If I use the \citeyearpar command, it is fine, but I would rather not have to type the author's name in manually.   Here is the command placed in the preamble:  \usepackage[backend=bibtex, style=authoryear-icomp, url=true, isbn=false, natbib=true, sortcites=true, block=space, pagetracker=false, loccittracker=constrict]{biblatex}   Here is an example of an entry in my bib file (made using BibDesk):  @article{poldrack2006, Author = {Poldrack, Russell}, Journal = {Trends in Cognitive Sciences}, Number = {2}, Pages = {59--63}, Title = {{Can cognitive processes be inferred from neuroimaging data?}}, Volume = {10}, Year = {2006}}   I have also tried changing the entry to the following:  @article{poldrack2006, Author = {Russell Poldrack}, Journal = {Trends in Cognitive Sciences}, Number = {2}, Pages = {59--63}, Title = {{Can cognitive processes be inferred from neuroimaging data?}}, Volume = {10}, Year = {2006}}   The bibliography entry appears as follows, and is fine:  Poldrack, Russell (2006). “Can cognitive processes be inferred from neuroimaging data?” In: Trends in Cognitive Sciences 10.2, pp. 59–63.  Thank you for any help that can be offered.


In a letter to Christiaan Huygens entitled "on problems in the theory of numbers: a letter to Christiaan Huygens", Fermat claism that he solved the diophantine $x^2+2=y^3$ using infinite descent. Here is the letter:  " [1] For a long time I was unable to apply my method (i.e. infinite descent) to affirmative questions, because the twists and turns to get there are much more difficult than those which served me for the negative questions. [...] But finally a line of thought gone over many times showed me a light which did not fail, and affirmative questions surrendered to my method, with the help of some new principles which had to be joined with it of necessity. The progress in my thinking on these affirmative questions is this: if a prime number taken at one's discretion, which exceeds by one a multiple of four, is not a sum of two squares, there will be a prime of the same kind, less than the given one, and then a third still less etc., descending infinitely this way until you arrive at the number 5 which is the smallest of all those of this kind, which it follows cannot be the sum of two squares, which it is nonetheless. From which one must infer from that deduction of an impossibility that all those of this kind are consequently a sum of two squares. [...] [4] Finally I considered certain questions which, although negative, did not shrink from receiving very great difficulties, the way of applying the descent being quite as diverse as the preceding, as it will be easy to check. These are the following: No cube is a sum of two cubes. There is only one square in integers which, added to two, gives a cube. The said square is 25. There are only two squares in integers which, added to 4, give a cube. The said squares are 4 and 121. All the square powers of two, added to one, are prime numbers. This last question is of a very subtle and ingenious study and, even though it is posed affirmatively, it is negative; for to say that a number is prime is to say that it cannot be divided by any number."  So the question is: Did Fermat have an infinite descent proof of $x^2+2=y^3$ (i.e. that the only integer solutions are (x,y)=(5,3), (-5,3) ) ? Has anyone ever found such a proof?

just so this doesn't get deleted, I want to make it clear that I already know how to solve this using the UFD $\mathbb{Z}[\sqrt{-2}]$, and am in search for the infinite descent proof that Fermat claimed to have found.  I've alaways been fascinated by this Diophantine equation $x^2+2=y^3$ in particular ever since I saw it, and I still have no clue how to attack it without $\mathbb{Z}[\sqrt{-2}]$. What's disappointing is that no one else seems interested in the hunt (an elementary proof using infinite descent). I know it's been studied extensively, and there have even been generalizations, such as Mordell's equation. However, I've never seen Fermat's original proof that $(x,y)=(\pm 5, 3)$ is the only integer solution. Obviously, Fermat probably knew nothing of UFD's, which is why I believe there has to be an infinite descent proof like he claimed. Has anyone apart from him actually seen this proof? People mention it all the time, yet I can't find anything about it. As I said, I know that it involved infinite descent, but I've never seen it anywhere and no one seems to have any idea about it.  Does anyone have ideas for this approach? I mean, infinite descent seems more effective for showing a contradiction, e.g. showing there are no solutions. But how could it work here? Also, why isn't it published anywhere in all this time? Could it really be that only Fermat knew his method of descent well-enough to make this problem submit to it?  Thanks!


I am making a website that has multiplayer games like chess, poker, etc.  Users will be able to add friends. I was thinking about how could I make this relationship in the database, and I thought of two methods:  1 - Using a row for every friendship e.g  id   |   friend1   |   friend2   2 - Using only a row per user, adding all friends in a string separated by comma (in a text field maybe?) e.g  |id   |   user    |   friends                | ---------------------------------------------- |1    |    rellfy |   user1,user2,user3,user4|   What would be the best method to use? Using a string only, and parsing it later through the application, or querying for friends directly?

I am currently building out an application that will contain many users, two roles and two groups. Logically we want users to be able to be administrators of other users within the two groups.   User Table    UserID         varchar    PK DisplayName Email Role           int        FK `role`.`RoleID`  DATA [jschmo,Joe Schmo,joe@schmo.com,1]   Role Table    RoleID         int        PK     AI RoleName       varchar  DATA [1=Master,2=Admin,3=User]   Group Table    GroupID        int        PK     AI GroupName  DATA [1=Marketing,2=Infrastructure]   A user could potentially be an admin of both groups. I don't see the option to multi-select foreign keys but as I understand it, having a comma-delimited list in a column is a bad idea and I should use multiple records but I don't like the idea of having multiple records for each user.  Q: How would I keep track of which groups a user is an admin of?


I recently became a Sysadmin for the company I work for. One of the things I want to try and do is improve some of the processes with scripts. I am very new to bash but eager to learn and any help would be appreciated.  In my work if someone requests a grep we have to manually connect to the hostname and then become root and, after that perform the grep. This can be quite time consuming and so I started working on a script which would allow me to enter the following:  ssh user@hostname grep   The problem is I have no idea how to be able to connect to a given hostname. I would like some output when I run the script that asks me for the hostname which I type in and then asks me what I want to grep and from that I get my results.  Any help would be appreciated and apologies if this is a long winded post. It's my first time asking a question.

I have to run a local shell script (windows/Linux) on a remote machine. I have SSH configured on both machine A and B. My script is on machine A which will run some of my code on a remote machine, machine B. The local and remote computers can be either Windows or Unix based system. Is there a way to run do this using plink/ssh?


$$\lim_{n\rightarrow \infty}\frac{1}{n^{2}＋1}＋\frac{2}{n^{2}＋2}＋…＋\frac{n}{n^{2}＋n}$$ Thanks in advance

Evaluate the limit   $$\lim_{n \to \infty} \dfrac{1}{1+n^2} +\dfrac{2}{2+n^2}+ \ldots+\dfrac{n}{n+n^2}$$   My approach :   If I divide numerator and denominator by $n^2$ I get :   $$\lim_{ n \to \infty} \dfrac{\frac{1}{n^2}}{\frac{1}{n^2} +1} +\dfrac{\frac{2}{n^2}}{\frac{2}{n^2} +1} + \ldots+ \dfrac{\frac{1}{n}}{\frac{1}{n} + 1}=0$$   but the answer is $\dfrac{1}{2}$ please suggest how to solve this.. thanks.


We are asked to prove the following integral;  $\int_0^x(\int_0^tf(u)du)dt=\int_0^xf(u)(x-u)dx$  We have to use integration by parts and then by this apply the fundamental theorem of calculus which I believe need to be applied to the derivative part of the one done by parts. I haven't seen anything like this before.   Any help would be greatly appreciated  Thanks in advance!

We are asked to prove the following integral;  $\int_0^x(\int_0^tf(u) du) dt=\int_0^xf(u)(x-u)du$   I know that we have to use integration by parts which when we differentiate a function will help us use the fundamental theorem of calculus. I just don't know when and were to apply this.  Thanks in advance!


Here is a trigonometry problem.     Given   $$\frac{\cos(\alpha-3\theta)}{\cos^3(\theta)}=\frac{\sin(\alpha-3\theta)}{\sin^3(\theta)} = m$$   Show that    $$m^2+m\cos(\alpha) = 2.$$   I tried to convert $\sin^3(x)$ into $\sin(3x)$ and similarly to cosine term, but couldn't get the answer. Please tell how to proceed further and any other way to solve it.

Here is a trigonometry problem.     Given   $$\frac{\cos(\alpha-3\theta)}{\cos^3(\theta)}=\frac{\sin(\alpha-3\theta)}{\sin^3(\theta)} = m$$   Show that    $$m^2+m\cos(\theta) = 2.$$   I tried to convert $\sin^3(x)$ into $\sin(3x)$ and similarly to cosine term, but couldn't get the answer. Please tell how to proceed further and any other way to solve it.


How to solve this error? My app is not running

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


I was given an example of a cube that is $2$ greater than a square number. The pair: $27$ and $25$.  What's the best way to find further pairs ?

It is known that the diophantine equation $y^{2}=x^{3}-2$ has only one positive integer solution $(x,y)=(3,5)$. The proof of it can be read from the book "About Indeterminate Equation" (in Chinese, by Ke Zhao and Sun Qi). But the method I have known of solving this problem is algebraic number theory.  My question:      Does there exists an elementary method for solving the diophantine equation $y^{2}=x^{3}-2$?   I have gotten an elementary method by the assumption that "$x$" is a prime. That is, we can get a conclusion from the equation that $3\mid x$. Since $x$ is a prime we get the only solution $(x,y)=(3,5)$. But if $x$ is not a prime, the answer seems to be difficult.  Thank you for your help.


I'm struggling to find out which ANOVA test to use when you have a non-normal data set with repeated measures AND replication.    I'm doing my data analysis in R and the Friedman test friedman.test() method says it is only suitable for un-replicated data. Is there a way I can twist my data to fit the test?  To be specific: I have put each subject through 4 different treatments (repeated measure) three times each (replication). I want to look for significant differences between the treatments.  My empty data table is structured like this:  SubjectID | Treatment1 | Treatment2 | Treatment3 | Treatment4 <br> 1  1  1  2  2  2    etc....  Any pointers to the right test would be really appriciated!

Some attribute $x$ of 17 individuals was recorded repeatedly on 6 time points using a Likert scale with 7 distractors. Which statistical test(s) can I apply to check whether the changes along the 6 time points were significant?  set.seed( 123 ) x <- matrix( sample( 1:7, 17*6, repl=T ),    nrow = 17, byrow = TRUE,   dimnames = list(1:17, paste( 'T', 1:6, sep='' )) )   I found the Friedman test and the Quade test for testing the overall hypothesis.  friedman.test( x ) quade.test( x )   However, the R help files, my text books (Bortz, Lienert and Boehnke, 2008; Köhler, Schachtel and Voleske, 2007; both German), and the Wikipedia texts differ in what they propose as requirements for the tests. R says that data need to be unreplicated. I read 'unreplicated' as 'not-repeated', but is that right? If so, the example, in contrast, in friedman.test() appears to use indeed repeated measures. Yet, Wikipedia says the contrary that is to say the test is good especially if data represents repeated measures. The text books say either (in the same paragraph, which is very confusing). What is right?  In addition, what would be an appropriate test for post-hoc single comparisons for the indication which column differs from others significantly?  Bortz, Lienert, Boehnke (2008). Verteilungsfreie Methoden in der Biostatistik. Berlin: Springer Köhler, Schachtel, Voleske (2007). Biostatistik: Eine Einführung für Biologen und Agrarwissenschaftler. Berlin: Springer


So I used Agisoft Photoscan to render a model it output a texture that is mapped to different sections of my model  My example:  I have a bunny's head and body  Texture1 is mapped to the bunnies eyes, head, and ears  I want it so that the bunny's eyes have a glossy shader applied to them WHILE maintaining the original mapped texture (kinda combining the mapped portion of the texture with a glossy shader) while avoiding making the rest of the head and ears glossy as well?

I followed  to create a soccer ball.  Now I want to texture it in a way that every pentagon has an image inside itself and the exagons are white, but I also want everything to be a little glossy. I managed to successfully UV Map the ball and paint the texture in photoshop but now I am having big problems in applying the texture material to the mesh.    I've created a new material in Blender Render mode with Diffuse and the texture applied to it. I also set the Texture mapping to UV. I've gone in edit mode, selected all the mesh and applied the material. Unfortunately in Texture View Mode I see just a white ball and while rendering I see everything's black.      If I try to do this in Cycles Render and use a Mix Shader with the FAC set to the texture image I get what I want in the Texture View Mode but while rendering I just see everything black and white of my colored images.        I hope I've been clear enough and that someone will help me in this easy/difficult task! Thank you in advance


It seems that some Windows editions don't include the GUI secpol.msc tool. I would like to change some data at Local Security Policy, like, for example, Create a token object. How can I do that? All I have found until now is the secedit command-line tool, but it allows only export/import of a complete tree, not changing specific parameters. Command-line method prefered, please, but GUI allowed too.

Is there an alternative to gpedit.msc for "Home" versions of Windows (ie: Vista Home Premium)?


I get the Error      Type of conditional expression cannot be determined because there is no implicit conversion between 'System.DateTime' and'System.DBNull'   with the Code (in the 3rd line)  DateTime? BirthDate = GetDate(PersonID); System.Data.SqlClient.SqlCommand myCommand = new System.Data.SqlClient.SqlCommand(cStatement, myConnection); myCommand.Parameters.AddWithValue("@BirthDate", BirthDate.HasValue ? BirthDate.Value : DBNull.Value);   How can i avoid this error?

Could someone explain why this works in C#.NET 2.0:      Nullable<DateTime> foo;     if (true)         foo = null;     else         foo = new DateTime(0);   ...but this doesn't:      Nullable<DateTime> foo;     foo = true ? null : new DateTime(0);   The latter form gives me an compile error "Type of conditional expression cannot be determined because there is no implicit conversion between '<null>' and 'System.DateTime'."  Not that I can't use the former, but the second style is more consistent with the rest of my code.


When writing a question or answer, I usually include a couple of links to outside resources. When I do the following:    Insert an image using 'Insert image/provide a link from the web'. Paste hyperlink into the dialog. Dialog closes.  Insert a hyperlink into the edit box.     step 2 fails: I can't paste anything into the Hyperlink dialog box. From that point on, I can't past into the answer box either. I have to post the answer, then click Edit, then I can paste again.   This happened when writing this question. In the edit history you should be able to see 2 revisions, where the first revision has an incomplete hyperlink (2).  OSX 10.10.5/Firefox 56.0 (I've also seen this on Windows 7/Firefox)

While reuploading a bunch of  to imgur, I noticed something funny: sometimes, after uploading an image from the web, I would no longer be able to paste anything into the edit box.  A bit more investigation revealed that the following steps are needed to reproduce this bug:   In the SE post editor, click the button to upload an image. In the image upload dialog, click "You can also provide a link from the web." Make sure the URL input box has the focus, and then close the dialog by pressing Esc.  Alternatively, on Firefox, type or paste an image URL into the text box and submit the form by pressing Enter.  (This  does not seem to trigger the bug on Chrome; thanks, Chris Jester-Young.)  Either way, the bug will not be triggered if you close the dialog by clicking something outside the URL input box, like the submit button or the close button. Once back in the Markdown editor, try pasting something into the edit box.  Nothing will happen. Reopening and closing the image upload dialog will make paste work again.   Apparently, what happens is that the image upload dialog installs its own paste event handler onto the <body> element, in order to let you paste images into the dialog to upload them.  This handler should be removed when the dialog closes, but the steps above break this, leaving the handler in place.  Why?  Well, it turns out that the dialog itself removes the paste event handler when the URL entry box gains focus (so that you can paste an URL into it, of course), and adds it back when the box loses focus.  But if you submit the upload form while the URL entry box still has focus, then the blur event handler on the box runs only after the dialog has closed.  Thus, the sequence of events (no pun intended) runs like this:   Open upload dialog.  Paste event handler is added. URL entry box gets focus.  Paste event handler is removed. Close upload dialog by pressing Esc.  Paste event handler is (again, redundantly) removed. URL entry box loses focus as it disappears from the page.  Paste event handler is added back.  (Oops!)   How do we fix this?  Well, I see a bunch of ways:   Have the code that closes the popup remove the blur event handler from the URL input, so that it cannot run any more, before removing the popup from the DOM. Have the blur event handler itself check a flag to see if we've already closed the dialog, and if so, not add back the paste handler on <body>. Have the paste handler itself check if the upload dialog is present, and if not, do nothing and let the event propagate.   Any of these should work.  Heck, you could implement all of them, just to make sure. :)


I'm aware of  on this, but they haven't fixed my issue.  I have an .iso installation file previously mounted with MagicDisc that I am now unable to delete.  I have of course unmounted the file and shut down MagicDisc.  I've also , tried deleting with , tried deleting by command line, and nothing works.  Very grateful for suggestions on how to retire this resilient file.  In Explorer the error message is:    By command line the error is:  PS C:\users\Robin\Downloads> del .\ArcGIS_Desktop_101_129026.iso del : Cannot remove item C:\users\Robin\Downloads\ArcGIS_Desktop_101_129026.iso: The process cannot access the file 'C:\users\Robin\Downloads\ArcGIS_Desktop_101_129026.iso' because it is being used by another process. At line:1 char:1 + del .\ArcGIS_Desktop_101_129026.iso + ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~     + CategoryInfo          : WriteError: (C:\users\Robin\..._101_129026.iso:FileInfo) [Remove-Item], IOException     + FullyQualifiedErrorId : RemoveFileSystemItemIOError,Microsoft.PowerShell.Commands.RemoveItemCommand PS C:\users\Robin\Downloads> del *.iso del : Cannot remove item C:\users\Robin\Downloads\ArcGIS_Desktop_101_129026.iso: The process cannot access the file 'C:\users\Robin\Downloads\ArcGIS_Desktop_101_129026.iso' because it is being used by another process. At line:1 char:1 + del *.iso + ~~~~~~~~~     + CategoryInfo          : WriteError: (C:\users\Robin\..._101_129026.iso:FileInfo) [Remove-Item], IOException     + FullyQualifiedErrorId : RemoveFileSystemItemIOError,Microsoft.PowerShell.Commands.RemoveItemCommand PS C:\users\Robin\Downloads>     Appendum

On Windows XP, when I try and delete a specific file it says:     Cannot delete blah.blah: Make sure the   disk is not full or write-protected   and that the file is not currently in   use.   How can I go around this warning and delete it anyway?


Is there any software that will listen on the audio inputs of my PC/laptop and will record what I say (in English) into a text file on my computer ?  I need it to be in a format that I can then reasonably easy edit and rework the text.  Ideally the software would not depend on an active internet connection.  I would like to be able to install this on a laptop that uses Lubuntu and a PC which uses KDE Neon.   Thank you

The short version of the question: I am looking for a speech recognition software that runs on Linux and has decent accuracy and usability. Any license and price is fine. It should not be restricted to voice commands, as I want to be able to dictate text.  More details: I have unsatisfyingly tried the following:       (e.g., )  (used to run  on Linux but was discontinued years ago)      (built on the Kaldi speech recognition toolkit)    +  +  +   : only accepts voice commands  All the above-mentioned native Linux solutions have both poor accuracy and usability (or some don't allow free-text dictation but only voice commands). By poor accuracy, I mean an accuracy significantly below the one the speech recognition software I mentioned below for other platforms have. As for Wine + Dragon NaturallySpeaking, in my experience it keeps crashing, and I don't seem to be the only one to have such issues unfortunately. On Microsoft Windows I use Dragon NaturallySpeaking, on Apple Mac OS X I use Apple Dictation and DragonDictate, on Android I use Google speech recognition, and on iOS I use the built-in Apple speech recognition. Baidu Research released  the  for its speech recognition library using  implemented with Torch. Benchmarks from  are encouraging as shown in the table below, but I am not aware of any good wrapper around to make it usable without quite some coding (and a large training data set):      System Clean (94) Noisy (82) Combined (176)     Apple Dictation 14.24 43.76 26.73   Bing Speech 11.73 36.12 22.05   Google API 6.64 30.47 16.72   wit.ai 7.94 35.06 19.41   Deep Speech 6.56 19.06 11.85     Table 4: Results (%WER) for 3 systems evaluated on the original audio. All systems are scored only on the utterances with predictions given by all systems. The number in the parentheses next to each dataset, e.g. Clean (94), is the number of utterances scored.  There exist some very alpha open-source projects:   (part of Mozilla's Vaani project:   ())  Vox, a system to control a Linux system using Dragon NaturallySpeaking:  +     (to be released by Google, mentioned at Interspeech 2018)  I am also aware of this  as well as this .  I am aware of  , which allows speech recognition via Dragonfly on one computer to send events to another, but it has some latency cost:  I am also aware of these two talks exploring Linux option for speech recognition:   (David Williams-King)  (Tavis Rudd)


True or false?      For any $n ≥ 2$, there exists a $n × n$ real matrix $A$ such that the set $\{A^p \mid p ≥ 1\}$ spans the $\Bbb R$-vector space $M_n(\Bbb R)$.   I am not getting any clue on how to approach!! One thing that came in my mind is to deal with polynomials $f(x)=a_0+a_1x+a_2x^2+\cdots+$ which is satisfied by $A$ but this will not put any effect as we have to create an arbitrary matrix in the spanning set.

I don't know how to answer this question:     Is there a $10 \times 10$ matrix $A$ such that $$M_{10}(\mathbb{F})=\text{span}\{I,A,A^2,\ldots, A^{100}\}\textrm{,}$$ where $M_{10}(\mathbb{F})$ is the vector space of $10 \times 10$ matrices over $\mathbb{F}$?   I think there is a connection to Jordan normal form.


As part of a Google foobar challenge I have been asked to calculate:  $$\sum_{k=1}^{n} \left\lfloor {k*\sqrt{2}} \right\rfloor$$  for numbers up to $10^{100}$  My attempt so far resulted in imprecise results:  Using the formula  $\sum_{k=1}^{n-1} \left\lfloor \frac{km}{n} \right\rfloor = \frac{1}{2}(m - 1)(n - 1)$  I made this calculation: $ \frac{1}{2} ((n+1)*\sqrt{2}-1)*n $  The results needed to be rounded (I suppose because of the irrationality of $\sqrt{2}$) and were incorrect in about 10% of test cases.  Thanks in advance!  Note: I've looked at many of the threads regarding sum of floors and wasn't able to find a closed form that yields better accuracy.

[A001951 A Beatty sequence: a(n) = floor(n*sqrt(2)).][1]  If $n = 5$ then  $$\left\lfloor1\sqrt{2}\right\rfloor+ \left\lfloor2\sqrt{2}\right\rfloor + \left\lfloor3\sqrt{2}\right\rfloor +\left\lfloor4 \sqrt{2}\right\rfloor+ \left\lfloor5\sqrt{2}\right\rfloor = 1+2+4+5+7 = 19$$  Sequence from $1$ to $20$ is:  $S=\{1,2,4,5,7,8,9,11,12,14,15,16,18,19,21,22,24,25,26,28\}$  I want to find answer for $10^{100} n$?


My latex template in teXstudio editor, unfortunately, has a wrong spelling procedure. Some words that are correct are shown as if they are typo! For example, below line:    How can I remove the mistakes?

Why is that most of the words, almost 90 percent, are marked as misspelled words when there is no error? And the spellchecking suggestions don't even look like English.  I am using TeXstudio as my editor.


In a  it has become clear to me that a functor is left-cancellable if and only if it is injective on morphisms. This provides a nice characterization of monomorphisms in category ${Cat}$.   I would like to know whether there is also a nice characterization for epimorphisms in that category. I allready found out that functors that are surjective on morphisms are right-cancellable, but also that the opposite of this is not true. Are there any 'weaker' conditions then? Are these functors necessarily full for instance? Uptil now I couldn't manage to find that out, so my first question is:     Are functors that are right-cancellable necessarily full?   More generally my second question is:     What characteristics can be mentioned of a functor that is right-cancellable?

Denote by $\mathbf{Cat}$ the category of small categories, i.e. categories whose class of arrows is a set. I am working with classes but I suppose it works the same if one is working in a given universe following the Grothendieck approach.  My question is whether monomorphisms and epimorphisms in $\mathbf{Cat}$ can easily be classified. An arrow between two small categories is just a functor.  In particular I was wondering if the subcategories of a given small category correspond to the category-theoretic subobjects in $\mathbf{Cat}$. Given a fixed object $X$ in a category I call an isomorphism class of monomorphisms with codomain $X$ a $\textit{subobject}$ of $X$.


I have encountered issue with symbols alignment (&) within the matrix in an equation block - are on the each other in one row. Issue is most likely associated with txfonts package. Matrix's symbols are well-aligned without the package, however I would like to keep it due to roman fonts it provides. Example using amsmath with txfonts: \documentclass[12pt, oneside, openany, a4paper]{report} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{amsmath} \usepackage{txfonts} \begin{document} \chapter{...} Minimalizacja tranzystorów i konieczność brania efektów kwantowych pod uwagę. \section{...} \begin{equation}     X = \begin{bmatrix}         a & b & c \\         c & d & d \\         e & f & g \\     \end{bmatrix} \end{equation} \end{document}  The output is:  How can use txfonts but with a proper alignment for example for amsmath matrices?

Restated Problem and a Solution  The use of a times font using the package txfonts will cause tables to be improperly displayed (see below for an image) if a character such as ę,ą or a different character with an ogonek is used.   This has something to do with the procedure involved not being local, that is, having unwanted side effects elsewhere.   An effective way of keeping whatever is done local is by enclosing it in brackets {ę}. This can be generally invoked for any mention of the character in question by mapping ę to {ę}, a to {ą} and so on in the preamble by the following:  \DeclareUnicodeCharacter {281}{{ę}} % 281 is the decimal utf-8 code of ę ...   This will solve the problem for the whole document  A more general solution still that fixes the error introduced in the source file of txfonts is described below under the heading WORKAROUND. However, if you do not want to fiddle with the way the package is called (possibly because it is called in a stylesheet you do not want to change) redefining the characters is a good solution  Initial question  I am typesetting a multilingual document with pdflatex (MikTeX, all packages up to date). I need to use Times font, and, for the time being, I cannot switch to LuaLatex or XeLatex since I am in the final phase of typesetting a book with a class provided by my publisher and I would need to adjust my code in order to use these above.   Using Polish characters with txfonts causes the tables to crash:   \documentclass{article}  \usepackage{txfonts} %\usepackage{mathptmx} \usepackage[polish, english]{babel} \usepackage[utf8x]{inputenc} \usepackage[T1]{fontenc}        \newcommand{\ee}{\selectlanguage{english}\fontencoding{T1}} \newcommand{\pl}{\selectlanguage{polish}\fontencoding{T1}} \begin{document} \textbf{A minimal example using a times font} As soon as I enter the Polish character \pl ę  \ee the tables crash  (the lines of the table get printed onto each other). \begin{table}\begin{center}\begin{tabular}{|l||l|l|} \hline type&n    &rel        \\ \hline \hline One line in the table &260& many  \\ Another line in the table      &792&49  \\ A third line in the table       &288&1  \\ \hline \end{tabular}\end{center}\caption{A test table.}\end{table} \end{document}   The alternative package mathptmx does not cause this problem; however, it does not provide the Greek characters I need. This is demonstrated in the following minimal example:  \documentclass{article}  %\usepackage{mathptmx} \usepackage{txfontsb} \usepackage[polutonikogreek,polish, english]{babel} \usepackage[utf8x]{inputenc} \usepackage[LGR,T1]{fontenc}        \newcommand{\ee}{\selectlanguage{english}\fontencoding{T1}} \newcommand{\grrk}{\selectlanguage{polutonikogreek}\fontencoding{LGR}} \begin{document} \textbf{A minimal example using a times font} I need to  print polytonic Greek (and other special characters) using a  times font (e.g. \grrk ἐᾶν \textbf{ἐᾶν})! \ee   I use the \emph{txfonts} (or   \emph{txfontsb}) package, the alternative \emph{mathptmx} cannot find the metric files (``Couldn't find `grtm.cfg''').  \end{document}   How can I use txfonts and still prevent the tables from crashing? I have also tried out txfontsb!  Update: I see now the has nothing to do with Polish, it's the diacritic in ę (the ogonek) that causes the problem. The same problem appears in the following code with an ogonek on an m:       \documentclass{article}      \usepackage{txfonts}     \usepackage[T1]{fontenc}            \begin{document}     text with ogonek:        \k{m}       \begin{table}\begin{center}\begin{tabular}{|l||l|l|}     \hline     type&n    &rel        \\     \hline     \hline     One line in the table &260& many  \\     Another line &792&49  \\     A third line in the table       &288&1  \\     \hline     \end{tabular}\end{center}\caption{A test table.}\end{table}     \end{document}   If \k{m} is enclosed in brackets {\k{m}} the tables work fine. So it has something to do with  locality and the way txfonts apply the ogonek.


We've been trying to show that the matrix $$A=\Big(\frac{1}{i+j+1}\Big)_{i,j\in [n]}$$ is positive semi-definite. We've tried induction on $n$ using the Schur complement, but there is no simple analytic way to find $A_{n-1}^{-1}$ for every $n$.   Any advice?

I want to prove that the matrix $$\begin{pmatrix} 1   &\cfrac{1}{2} &\cfrac{1}{3} &\cdots &\cfrac{1}{n} \\ \cfrac{1}{2} &\cfrac{1}{3} &\cfrac{1}{4} &\cdots &\cfrac{1}{n+1} \\ &\vdots &&\ddots &\vdots \\ \cfrac{1}{n} &\cfrac{1}{n+1} &\cfrac{1}{n+2} &\cdots &\cfrac{1}{2n-1} \end{pmatrix}$$ is positive definite. Using mathematical induction, I only need to show that its determinant is positive. But I can't find the way out.


Is it wrong to substitute $u=\sqrt x$ when integrating?  Here's what I mean, I have to integrate: $\int x \sin \sqrt x dx$.  I defined $u=\sqrt x$ so it's: $$\int u^2\sin u du=2u{\cdot}\sin\left(u\right)+\left(2-{u}^{2}\right){\cdot}\cos\left(u\right)+{C}$$  But when placing back $\sqrt x$ I get a totally different result from the integration of the original expression:   $$2{\cdot}\left(\cos\left(\sqrt{x}\right){\cdot}\left(6{\cdot}\sqrt{x}-{x}^{\frac{3}{2}}\right)+\sin\left(\sqrt{x}\right){\cdot}\left(3x-6\right)\right)+{C}$$  Shouldn't both expressions be equal and why aren't they?

I tried using integration by parts twice, the same way we do for  $\int \sin {(\sqrt{x})}$ but in the second integral, I'm not getting an expression that is equal to  $\int x\sin {(\sqrt{x})}$.  I let $\sqrt x = t$ thus, $$\int t^2 \cdot \sin({t})\cdot 2t dt =  2\int t^3\sin(t)dt = 2[(-\cos(t)\cdot t^3 + \int 3t^2\cos(t))] = 2[-\cos(t)\cdot t^3+(\sin(t)\cdot 3t^3 - \int 6t \cdot \sin(t))]]$$  which I can't find useful.


I want to move my website from joomla to drupal. I read that the  module is the appropriate but i don't know how to use it. Can someone give guides to do this.

I am going to start work on a website that is already developed in Joomla 1.5 What are the possible ways to migrate the contents from Joomla.   PS: I have looked into joomla module but no luck!  Any ideas will highly be appreciated!


I found on a book that there exists R-modules M such that supp(M) is not Zariski-closed. I already know that if M is finitely generated then it is Zariski closed but I can't find an example of a non finitely generated R-module that is not Zariski closed. I found an answer on a book but I can't understand it well, it is too complicated and I'm quite new in this topic. I'm just looking for a simple example of this.  Thank you

It's well known that under some "weak" hypothesis, such as finitely generated, the support of an A-module is closed in Spec(A). It is true also in the most general case?


The Remote Desktop client shows me this option to connect:    What does this option do?

This setting has always confused me:    What exactly does the Bitmap Caching option in the Windows Remote Desktop Client do?  I understand that it is supposed to improve connection performance, but how?  Is it really that much of a difference?


I'm using Ubuntu 19.04 GNOME edition. I'm trying to remap d to run rofi instead of showing Desktop, but when I try to remap the keybinding in the Keyboard Settings, it prompts me to enter the keybinding, and when I enter d, it shows the desktop, and I am unable to bind the key to run rofi.

In Ubuntu 18.04.1, I would like to use my left Super-key only to simply open the Show Applications menu (aka Dash) like a left click on the dock-icon (with the 9 dots) does and preferably close it again without showing me any open programs.   I can open it with Super + A and even close it again with Super R, but Super L appears to do nothing at all.   In Xfce, something similar was possible by adding a custom keyboard shortcut for Super L and setting the command to xfce4-popup-whiskermenu, which would open and close a menu with favourite applications. Unfortunately, I don't know the command that opens and closes the Show Applications menu.   Is there any way to add such a shortcut in the new Gnome Shell?


Suppose that $x_1=1$ and $x_{n+1}=1/2(x_n+\frac{c}{x_n})$, show the sequence converges to $\sqrt{c}$   Attempt:  Let $r$ be the limit of the sequence. I think I need break into two cases:  $0\leq x_n<r$ and $x_n>r$ to reach $0<x_n<x_{n+1}<r$ and $x_n>x_{n+1}>r$ so that I can apply the monotone convergent theorem.  I think I need to show $x_{n+1}=1/2(x_n+\frac{c}{x_n})\leq x_n$ but I don't quite sure how to show this is true for $0\leq x_n<r$. To show $x_{n+1}<r$, I don't see any information I can apply. Can anyone give me a hit or suggestion to do this question? Thanks

Show that Newton's method can be used to compute the square root function $\sqrt a$ using the formula   $$x_{n+1} = \frac{1}{2}\left(x_{n} + \frac{a}{x_{n}}\right)$$  show that the error is  $$\sqrt a - x_{n+1} = -\frac{1}{2x_{n}}\left(\sqrt a - x_{n}\right)^2$$  edit: As pointed out below $x^2-a$ has $\sqrt a$ as a root.  I have done as suggested below and plugged in $\sqrt a + \epsilon$ for $x_n$ giving me  $$x_{n+1} = \frac{2\epsilon\sqrt a + \epsilon^2}{2(\sqrt a + \epsilon)}$$ and once again not sure where to proceed.


My CS professor told to the class that the OS has no idea that an application has launched threads. Is this true?

What is the technical difference between a process and a thread?  I get the feeling a word like 'process' is overused and there are also hardware and software threads. How about light-weight processes in languages like ? Is there a definitive reason to use one term over the other?


whenever i add a mesh on another object,  the object is always linked :  when i add a cylinder on a cube and whenever i scale or transform the cylinder also the cube will scale or move, but just in the current project, maybe i changed somethings but i dont know what.

In my scene all of a sudden I must have hit a random hot key, because random objects are now parented and when I move an object others move as well.


I am very new to cmd prompt and I was asked to find out how to script cmd to pull files from a website.    Honestly, I am totally at a loss, so any help would help me escalate the project I am working on.    Currently, I am using this script to go to the website but, but I am probably making some kind of mistake.  I am on Windows 7.  @echo Off TITLE Download Treasury Files Pause CD C:\Users\wkhan\desktop START http://www.treasury.gov/ofac/downloads/t11sdn.pdf

Without using any non-standard (Windows included) utilities, is it possible to download using the Windows command line?  The preferred version is Windows XP, but it's also interesting to know for newer versions.  To further clarify my question:   It has to be using HTTP The file needs to be saved Standard clean Windows install, no extra tools   So basically, since everybody is screaming , I want simple Wget functionality, without using Wget.


Can somebody help me to figure out a command to find a file recursively that is embedded in a tgz file which is within another tgz files recursively:  MainFile.tgz → SubFile1.tgz → SubFile2.tgz → SubFile3.tgz → abc.txt  My goal is to be able to list abc.txt without extracting MainFile.tgz nor SubFileX.tgz.  The command below is only listing the first level of files (i.e. SubFile.tgz); therefore the grep command cannot find abc.txt in the list:  tar tvf MainFile.tgz | grep abc

I'm trying to find out what modules  in cpan. So I've used  to mirror it. My problem is that I need to iterate through the archives that are downloaded, and grep the files that are in the archives. Can anyone tell me how I might do this? preferably in a way that tells me which file in the archive and what line it's on.  (note: they aren't all tarballs some are zip files)


There's currently an outstanding need:  when a question needs clarification, and I'm discussing this with the OP, I receive notifications of their comments, but not edits.   And this is despite the fact that edits are the recommended way to reply to clarification requests! This has led some OPs to employ a kludge: in addition to editing the post, do a comment like "see the update".   Related:    - talks about answers, too. This one is only interested in the question  - same on the purpose but it's completely blank what the OP wants to see as a result. In the end, they - and the answer - go off on a tangent about "commenting and not showing up" and some extravagant mechanisms. This one proposes a straightforward and simple solution: notify on edits as well as comments.  - focuses on distinguishing between "major" and "minor" edits instead which is a lost cause

I often have the situation that I read a question and leave a comment requesting an edit to provide more information by the OP.   Currently, I add the phrase that he/she should please also write a comment containing "@ByteCommander" to notify me when they're done. This is not optimal as it's additional typing and often the OP does not follow it.  I know that the star/favorites feature allows me to bookmark questions and see on my user profile site how many/which questions had a recent change. But I think this is pretty complicated. I don't want to fill up my list of favorites with tons of questions and I don't really want to check that section out regularly.  My suggestion is to add a button similar to the "watch"-button on GitHub that enables notifications on edits, answers and/or comments without ping to appear in my global inbox instead of being hidden somewhere down in my profile.  Do you think this would improve the usability of the sites and increase the question solving rate? I do.


How can I draw a coloured concave lens in pdflatex?

Is there a library (or something similar) available for optics including e.g. convex and concave lenses? I fount  but it seems that this is not available as an official library …


I'm trying to get productive with blender. Now I have this challenge I can't solve. I imported parts of a cnc chair I'm designing. Precisely positioning the parts is my goal. How can I do this ?   So I want to go from here:   To here:    In the last screenshot the part look aligned but not exactly :( I tried to figure out snapping but I get the impression that's not gonna cut it, I'd love something like sketchup style moving/rotating/positioning.  I've been also looking into the NP-station add on, I can't get that to work though.  Edit:   Thanks for the answers and replies. It looks like I want/need something like np-station or mesh align plus. Tiny-CAD only seems to work in edit mode (?) while I need to align and position objects. Getting into origin and the 3D cursor was useful too.  But I placing my bets on getting mesh align plus to work for now.

How do you snap an object on top of the surface of another object? I tried using the shrinkwrap modifier but that produced weird results.  If I have a cone, and a cube - I want to move the cone around so that it snaps perfectly along the faces of the cube


The fourth, fifth, and sixth derivatives of position are known as snap (or, perhaps more commonly, jounce), crackle, and pop. The latter two of these are probably infrequently used even in a serious mathematics or physics environment, and clearly get their names as humorous allusions to the characters on the Rice Krispies cereal box. Wiktionary, Wikipedia, and etymonline all confirm the existence of the terms, but do not include references to the first usages. I would like to know, if possible, what the earliest source is that used these terms (crackle and pop).  The references on the Wikipedia page for , are to academic papers published after the year 2000 and reference the terminology as being nonstandard or facetious. They do not, however, refer to earlier uses in other publications.

According to , the derivatives of position with respect to time are position, velocity, acceleration, jerk, snap, crackle, pop.  Who came up with snap, crackle, and pop?  What about higher order derivatives?


I am studying for an exam in a graph theory class. Here is the exercise I need some help with.     Let $G$ a triangle free graph with $n$ vertices and $m$ edges.      (a) Prove that there exists vertices $x,y$ in $G$ such that $  \displaystyle{ \text{deg(x)} + \text{ deg(y)} \leq n}$.      (b) Prove that: $\displaystyle{ \sum_{v \in V(G)} \text{ deg } ^{2} v  \leq mn }$   I have done (a) but I have some trouble with (b).

For graph G without a triangle(with no triangle) with n vertices and m edges  Prove that:  1)$ \forall xy \in E , d(x)+d(y) \le n$  2)$(\sum_{v\in_V}^{ }d(v)^2)\le mn$


I am trying to build a ICMP ping program in python while I was researching about how to write a "receiving ping" method. I saw  many people are using this part "recPacket[20:28]" and I do not think I have ever seen this form before. Is recPacket[20:28] this supposed be an array? I get that it is 8 bytes but what does "[:]" this do? I am trying to search the meaning of this and could not find it in textbook or anywhere.

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


I am trying to run below code:  Map<String, Object> requestMap = new HashMap<>(); Long unixTime = System.currentTimeMillis() / LONG_1000; requestMap.put(KEY_TIME, unixTime); JWTSigner signer = new JWTSigner(SECRET); String token = signer.sign(requestMap); String url = BASE_URI + "/Data/Categories?d=" + token; StringRequest stringRequest =  new StringRequest(Request.Method.GET, url, new Response.Listener<String>() {     @Override     public void onResponse(String response) {         Log.d(TAG, response);     } }, new Response.ErrorListener() {     @Override     public void onErrorResponse(VolleyError error) {         Log.e(TAG, error.getLocalizedMessage());     } });  RequestQueue mRequestQueue = Volley.newRequestQueue(getActivity()); mRequestQueue.add(stringRequest);   But I am getting following error:  [6056] NetworkDispatcher.run: Unhandled exception java.lang.NullPointerException: Attempt to invoke interface method 'java.lang.Object java.util.Map.get(java.lang.Object)' on a null object reference java.lang.NullPointerException: Attempt to invoke interface method 'java.lang.Object java.util.Map.get(java.lang.Object)' on a null object reference     at com.android.volley.toolbox.HttpHeaderParser.parseCharset(HttpHeaderParser.java:243)     at com.android.volley.toolbox.HttpHeaderParser.parseCharset(HttpHeaderParser.java:262)     at com.android.volley.request.StringRequest.parseNetworkResponse(StringRequest.java:70)     at com.android.volley.NetworkDispatcher.run(NetworkDispatcher.java:133) java.lang.NullPointerException: Attempt to invoke interface method 'java.lang.Object java.util.Map.get(java.lang.Object)' on a null object reference   I have no idea what is to problem. Can anyone help?  Thanks in advance.

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


I've worked with observations as vectors with both continuous and categorical variables. In both cases one can use dimensionality reduction techniques such as PCA (in the latter case through Correspondence Analysis).  This has been very useful for me to draw the observations in the plane (by taking the 2 first components).  But I don't know an equivalent method for drawing points from a distance matrix. I know the result won't preserve all distances in general, but just an approximation is fine (as when removing components from PCA). To put a concrete example, words with "edit distance" (there are variations which are true metrics).  Is it reasonable to just do PCA on the distance matrix itself and draw the first 2 components? Or is there a better way?  Bonus: in the best case scenario, I would like to work without evaluating my distance function for all pairs (I've read there are space partitioning data structures, but haven't tried them; this is related to the efficient solution to kNN I believe).

How are PCA and classical MDS different? How about MDS versus nonmetric MDS? Is there a time when you would prefer one over the other? How do the interpretations differ?


I have list of rows and one cell with select. One row is hidden. I use it as a form to add new row. On document ready I select all select fields and add on change event for all of them: const supplierFields = $('select[name$="supplier"]'); supplierFields.on('change', async (select) => {         //custom logic here..     });  When I use hidden row to add new row I select it and add data: const emptyForm = EstimatesTable.visualization.formSet.find( '.empty-form').prev('tr');  When new row is added event on select field disappears, but other events on inputs for example stays. Where could be an issue? When I inspect elements on browser hidden row and other old rows has events. After refresh event appears because of on document ready function.

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


As you can see in the image that I've attached, there are two materials used for the soil and the grassland. please be kind enough to tell me, how to make the boundary looks better ? how to make a proper diffusion or a realistic gradient between these two ?  Im so sorry if this is a dumb question, but im new to blender. -peace-

I have created this with cycles:  But the edge between the glowing and non glowing materials is very sharp. The material was manually applied to faces in edit mode. Is there any way I can smooth the edge between them in cycles?


Running Win10 (V 1511 b 10586.589)...  When I delete files from File Explorer > Desktop, the files remain on my desktop. If I try to open them from the actual Desktop (and not the folder in Explorer), an error message pops up saying the file has been removed. I need to manually right click on the root window and do a "Refresh". It seems very odd to me that major state changes on the primary UI don't trigger a UI refresh.    This equal parts gripe and genuine curiosity. I'd like to know if there is a programmatic reason behind this. Is it because Win10 is multi-platform and is associated with some weird table<>laptop UX conflict? Is it too computationally expensive to do a refresh? Might it trigger a long-latency IO (disk or network), so to hide the latency they associate it with a user-initiated action? Or is it a gross oversight?  This is not a duplicate of the Win7 question () because I want to know WHY this is the case. I already know how to fix it. I'd like to know if there is an underlying strategy for this odd UI behavior, specifically from windows super-users.

I am using Windows 7.  If I delete something from the desktop, then the icon remains there.  I have to hit F5 or right-click->Refresh to make the desktop refresh.  After the refresh, the icon disappears.  Any suggestions?


I want function to be available on a object, but I don't it to be visible if if I console.log it or send it to another function.  var obj = function() {   this.name = 'Bob';   this.age = 23; } obj.prototype.say = function() {   console.log(this.name, this.age, 'thats me..'); }  var pers = new obj(); console.log(pers); // { name: 'Bob', age: 23 }  pers.say(); // Bob 23 thats me..   Would this be good for solution and good practice for that? Or is it a better way to accomplish this in javascript?

To make a JavaScript class with a public method I'd do something like:  function Restaurant() {}  Restaurant.prototype.buy_food = function(){    // something here }  Restaurant.prototype.use_restroom = function(){    // something here }   That way users of my class can:  var restaurant = new Restaurant(); restaurant.buy_food(); restaurant.use_restroom();   How do I create a private method that can be called by the buy_food and use_restroom methods but not externally by users of the class?  In other words, I want my method implementation to be able to do:  Restaurant.prototype.use_restroom = function() {    this.private_stuff(); }   But this shouldn't work:  var r = new Restaurant(); r.private_stuff();   How do I define private_stuff as a private method so both of these hold true?  I've read  a few times but it doesn't seem like "private" methods can be called by public methods and "privileged" methods can be called externally.


What would the syntax be to make a fraction, for example if I wanted to make a program that takes a fraction and adds it to another fraction. I am talking about mathematical fractions btw.

I'm trying to work with  in Java.   I want to implement arithmetic functions.  For this, I will first require a way to normalize the functions.  I know I can't add 1/6 and 1/2 until I have a common denominator. I will have to add 1/6 and 3/6.  A naive approach would have me add 2/12 and 6/12 and then reduce.  How can I achieve a common denominator with the least performance penalty?  What algorithm is best for this?    Version 8 (thanks to ):     Improvements include:         the equals() method is now consistent with the compareTo() method      final class Fraction extends Number {     private int numerator;     private int denominator;      public Fraction(int numerator, int denominator) {         if(denominator == 0) {             throw new IllegalArgumentException("denominator is zero");         }         if(denominator < 0) {             numerator *= -1;             denominator *= -1;         }         this.numerator = numerator;         this.denominator = denominator;     }      public Fraction(int numerator) {         this.numerator = numerator;         this.denominator = 1;     }      public int getNumerator() {         return this.numerator;     }      public int getDenominator() {         return this.denominator;     }      public byte byteValue() {         return (byte) this.doubleValue();     }      public double doubleValue() {         return ((double) numerator)/((double) denominator);     }      public float floatValue() {         return (float) this.doubleValue();     }      public int intValue() {         return (int) this.doubleValue();     }      public long longValue() {         return (long) this.doubleValue();     }      public short shortValue() {         return (short) this.doubleValue();     }      public boolean equals(Fraction frac) {         return this.compareTo(frac) == 0;     }      public int compareTo(Fraction frac) {         long t = this.getNumerator() * frac.getDenominator();         long f = frac.getNumerator() * this.getDenominator();         int result = 0;         if(t>f) {             result = 1;         }         else if(f>t) {             result = -1;         }         return result;     } }     I have removed all previous versions.  My thanks to:


It doesn't recognize object types and I can't use reference-finding. I have the Omnisharp plugin installed and updated.

I followed the official step-by-step "Visual Studio Code and Unity" guide, but it seems I messed up something, because Intellisense doesn't see any Unity related stuff.  Like the MonoBehaviour class and its members (like .transform), or the Unity callbacks, like Start or Update.


How to set the display   /bin/bash -c "export DISPLAY=:99"  or   /bin/bash -c 'export DISPLAY=:99'   Both are not working. Colon seems to be creating the issue. I am not sure how to fix this. After checking the env DISPLAY variable is not seen to be set. Can anybody please help

I'm trying to write a shell script that, when run, will set some environment variables that will stay set in the caller's shell.  setenv FOO foo   in csh/tcsh, or  export FOO=foo   in sh/bash only set it during the script's execution.  I already know that   source myscript   will run the commands of the script rather than launching a new shell, and that can result in setting the "caller's" environment.  But here's the rub:  I want this script to be callable from either bash or csh.  In other words, I want users of either shell to be able to run my script and have their shell's environment changed.  So 'source' won't work for me, since a user running csh can't source a bash script, and a user running bash can't source a csh script.  Is there any reasonable solution that doesn't involve having to write and maintain TWO versions on the script?


can we write a script in python that runs dos commands/dos mode? Eg: I have a command   megarec.exe -cleanflash .1   which supposed to run only on dos mode.I do it manually.Now i need to write a script which automates the above procedure.can i do it?

How do you call an external command (as if I'd typed it at the Unix shell or Windows command prompt) from within a Python script?


I asked this question earlier and asked people to not tell me the answer. After a few more hours of attempts, I cannot figure this out. Can someone please tell me how to solve this proof?  Suppose $(6,a) = (6,b) = 1$. Prove $24 \mid (a^2-b^2)$.

I suppose I need to use prime factorization.  I want to show $p^2-q^2=24k$ for some integer $k$ .  How can I start this proof?


Is #!/usr/bin/env followed by python|bash|perl|whatever more portable than #!/usr/bin/{python|bash|perl|whatever}?

I notice that some scripts which I have acquired from others have the shebang #!/path/to/NAME while others (using the same tool, NAME) have the shebang #!/usr/bin/env NAME.  Both seem to work properly.  In tutorials (on Python, for example), there seems to be a suggestion that the latter shebang is better.  But, I don't quite understand why this is so.  I realize that, in order to use the latter shebang, NAME must be in the PATH whereas the first shebang does not have this restriction.  Also, it appears (to me) that the first would be the better shebang, since it specifies precisely where NAME is located.  So, in this case, if there are multiple versions of NAME (e.g., /usr/bin/NAME, /usr/local/bin/NAME), the first case specifies which to use.  My question is why is the first shebang preferred to the second one?


I am trying to figure out how to measure the performance of several python threads in my application. I currently have several tasks that are executing on different threads based on user input and I would like to measure the execution time, maybe even memory consumption of each of the threads. I have tried to use cProfile (on each instantiation of the thread, then I would write the data to a file and then aggregate all results) with limited success. Also, I have an added problem of having some blocking IO which is skewing my results. Is there anyway to effectively profile my application?

I'm developing an inherently multithreaded module in Python, and I'd like to find out where it's spending its time. cProfile only seems to profile the main thread. Is there any way of profiling all threads involved in the calculation?


I was planning to shift from Windows 10 to Ubuntu. Usually when you install new version of Windows, you do that in C:/ drive.(100GB) The other drives (d:/ and e:/) about 350GB are are not touched. So when I tried to install Ubuntu.. I did guess a question of formatting the disk. But little did I know that the whole Hard drive will be formatted. After installing Ubuntu, all my data from d:/ and e:/ are also erased. Somebody please help me out. :( :(

I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions  (C:) Vista  (D:) Entertainment  (E:) Work  (F:) Sources   and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB.  I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost  I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse?   I need these data badly as I don't have a backup for them.


Prove that every graph in which each vertex has degree at least 2 must contain a cycle. Graph has a finite number of vertices  I need some clarification, I understand that a vertex with degree 2 means having 2 neighbors. So this means that every vertex has two neighbors does this mean that the shape is a triangle with 3 vertices and 3 edges all connected or a square where each vertex is connected to two other vertices. Since they are connect it forms a cycle. However Im having trouble proving it, how will I go about proving this? Thanks in advance

Prove that every graph in which each vertex has degree at least 2 must contain a cycle.  I know that a vertex is a node and the only way for it to have a cycle is that when there are three vertices and three edges and that the shape is of a triangle. However I dont know how to prove it.  Thanks in advance


I am looking for a way to lock BD disks, so I can do a backup and not be worried that someone may access the data on them.  I thought to make a zip and protect it with password, then burn it, but this is dangerous, since if the disk gets damaged, and the archive can't be read, then all the data on it will be impossible to retrieve.  So I was wondering if there was a way to "format" a disk to be password protected and encrypted; so you can burn it and then access to it anywhere, using the password. If the disk is damaged, you can still recover other files, beside the ones on the damaged blocks.  I did a search but all that I get is how to protect a disk with a movie on it; which is not what I am trying to achieve.  I use Windows 7, the best would be something that can be read by OSX and Linux too, but would be great just to have something for either OSX or Windows 7

I've tried Nero SecurDisc for writing Copy Protected, Password Protected files on DVD which requires Nero SecurDisc Viewer to decrypt them. But It doesn't seem to have an option to protect/encrypt filenames.  Is there any similar utility that has both options, for example like WinRAR has an option to encrypt names + data?  I was thinking about compress the files into .rar with encryption and then write them on DVD. Would it do the same that i'm trying to do?


I am a motivated student and I had a well running project with a nice exposé presentation at a conference. I could do some more work on this and publish further papers, but eventually I would like to do this on my own after my studies as side project in my free time. Is it generally possible to make submissions to scientific conferences without a scientific supervisor or/and without a scientific institution?  If you know please tell if it depends on the conference or the research area.  Thoughts about if doing this makes sense to you can be placed here, too.  The research field is related to computer science, human computer interaction and music.  Thanks in advance!

Assume you have already completed your undergrad and have been working for a number of years. Does one need to be part of a university or a learning institution to publish papers?


Its all in the title. I messaged a friend on Facebook the other day. I told him "Jennifer and Amy is Going" Should I have used are or is?

How are the wife and kid?   How is the wife and kid?      Which is more correct?


I have applied all transforms before converting to curves. The left side of the ladder looks like what I am aiming for, but the right pole seems to have some squished spots. I am thinking that maybe there is a way I can get the curve directions to be more consistent? Google searching has helped me understand the curve directions, but I cannot identify what I need to do to these curve points to get the desired consistency. Any possible ideas? Thank you in advance.

I'm stuck. Can't figure out how I can extrude a closed curve onto a NURBS curve without it looking tapered.   I notice that when it's set to "2D" there is no tapering, but I want to do it on 3d.  Thanks for help.


Assume that $M$ is connected. Ideally, I would like $U$ to be connected, though that's not strictly necessary.  If this were true, it would instantly make integration on compact oriented manifolds much easier, since we can simply pass to Euclidean space $\mathbb{R}^n$ in order to evaluate the integral. Intuitively, it seems like it must be true. Consider the following examples:   $\mathbb{S}^n$ – we use the stereographic projection $\mathbb{T}^n \cong (\mathbb{R}/\mathbb{Z})^n$ – we consider $U=(0,1)^n$ $\mathbb{RP}^n$ – we consider $U_0=\{[1:x^1:\cdots:x^n]\, \big\vert\, x^1,\ldots,x^n\in\mathbb{R}^n\}$ If $M$ and $N$ have smooth charts $(U,(x^i)$ and $(V,(y^j))$ defined almost everywhere, respectively, then $M\times N$ has smooth chart $(U\times V, (x^1,\ldots,x^n,y^1,\ldots,y^m))$ defined almost everywhere.   However, I have no clue about how to prove a statement like this, and I suspect that any counterexample would be very difficult to find.

I observed some naive examples. Spheres, for example, when we cut out one point, can be embedded into $\mathbb{R}^n$. And if we cut out a measure zero set of a projective space, it can be embedded into the Euclidean space of the same dimension. So I wonder if all manifolds can be embedded into a same dimensional Euclidean space when we cut out a measure zero set? Can anyone prove it or disprove it by giving me some counterexamples?


I am using the following jQuery code in the search bar of my website. Since I am a beginner, I am unable to relate to other code examples, hence I need help in fixing the code. jQuery(document).ready(function ($) {     //Open Link in Search Results in New Window     jQuery('div.search_result_item_content').click(function () {         console.log("I am executed");         var menuLink = $('div.col.col-9.search_result_item_content').data('link');         window.open(menuLink, "_blank");     }); });  The code without .ready() seems to work on the console. But not on the index.js file of my website. The same file has many other jQuery functions, which are all working smoothly. Any idea, what is causing the issue?

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


I have a very simple 2D game, similar to old-school Mario or Metroid. I'm having a lot of trouble figuring out the proper way to handle player jumping. I've tried several different methods. The first method being that as soon as the player presses the space bar, his position on the Y-Axis is automatically updated so that he is now 50 pixels higher. This didn't work, because his player model immediately jumped up instead of going for that smooth up/down look. The second method I tried was using a Timer. With this, once the player pressed the space bar, his position on the Y-Axis would be incremented every x milliseconds. This also didn't work, for the exact same reason that the first way didn't work. It shot straight up without looking smooth. The last method I tried was a resemblance of my movement on the X-Axis. Instead of waiting for player input, the Y-Axis is constantly being added, but when the player isn't jumping, the yVelocity = 0. When input does come in, an amount is added yVelocity and the player jumps up. I didn't expect this to work, obviously, but it looked better.  So how do you apply jumping correctly? This is something that I've been struggling with for a while, and I just want to get it right. Please don't confuse this question like  as they're both different. I need an efficient way to handle jumping so that he looks smooth (as in one motion) going up and down. I can make his falling look good, just not the going up part. Can anybody explain to me how they make jumping look good?  Note: I wrote this question without code because I want a general description of how one might do it. If you do need code or extra details, or anything to understand the question, I'll be happy to add any extra details that you might need.

Okay, so I'm making a platformer, and I wanna know how I can make a arc'd jump easily. Like what Mario does in super Mario Bros 1. Any ideas on a simple way to accomplish this?


To prove that, a graph $G$ is bi-colored iff, when in it doesn't have a cycle of odd lengths. How to prove this theorem, I need some hints/resource recommendation.

i think if the graph G has an odd cycle, it's not two-colorable, otherwise it can be two colorable.   i read in one notes that the following is True: we couldent two-colorable any graph G that has cycle.    anyone could clarify me ?


I am creating a form with inputs type radio. I have retrieved the previous responses from the database and I put them in an array. And this is the result:  array(19) { ["1.1"]=> int(5) ["1.2"]=> int(2) ["1.3"]=> int(5) ["1.4"]=> int(2) ["1.5"]=> int(2) ["1.6"]=> int(4) ["1.7"]=> int(1) ["1.8"]=> int(3) ["1.9"]=> int(5) ["2.1"]=> int(5) ["2.2"]=> int(3) ["2.3"]=> int(1) ["2.4"]=> int(4) ["2.5"]=> int(2) ["3.1"]=> int(5) ["3.2"]=> int(5) ["3.3"]=> int(4) ["3.4"]=> int(3) ["4.1"]=> int(4) }    I have got here the question number 1.1 and the value 5. That its perfect, but when I send the form, new results by POST, are changing from 1.1 to 1_1 and so on like this:  array(19) { ["1_1"]=> string(1) "5" ["1_2"]=> string(1) "2" ["1_3"]=> string(1) "5" ["1_4"]=> string(1) "2" ["1_5"]=> string(1) "2" ["1_6"]=> string(1) "4" ["1_7"]=> string(1) "1" ["1_8"]=> string(1) "3" ["1_9"]=> string(1) "5" ["2_1"]=> string(1) "5" ["2_2"]=> string(1) "3" ["2_3"]=> string(1) "1" ["2_4"]=> string(1) "4" ["2_5"]=> string(1) "2" ["3_1"]=> string(1) "5" ["3_2"]=> string(1) "5" ["3_3"]=> string(1) "4" ["3_4"]=> string(1) "3" ["4_1"]=> string(1) "4" }    I am putting in the input, name="$variable", a variable that it gives me exactly the same 1.1, but I do not know what it's changing it it.  <input type="radio" name="<?php echo $que_code; ?>" value="1"   In order to compare them I would like to change them back to 1.1, 1.2..and so on.

If I pass PHP variables with . in their names via $_GET PHP auto-replaces them with _ characters. For example:  <?php echo "url is ".$_SERVER['REQUEST_URI']."<p>"; echo "x.y is ".$_GET['x.y'].".<p>"; echo "x_y is ".$_GET['x_y'].".<p>";   ... outputs the following:  url is /SpShipTool/php/testGetUrl.php?x.y=a.b x.y is . x_y is a.b.   ... my question is this: is there any way I can get this to stop? Cannot for the life of me figure out what I've done to deserve this  PHP version I'm running with is 5.2.4-2ubuntu5.3.


I am puzzled since in my eyes I cannot prove that there can be a function which is homomorphic regarding multiplication. Do you know any functions that could be?  I was thinking that the quotient field has the format:   < ax+b | x^2 = -2>   Am I missing something?

Trying to solve a problem, I got stuck on the following question.     If $P\in\mathbb R[X]$ is an irreducible polynomial and $\operatorname {deg} P=2$, then is it true that $$\mathbb{R}[X]/(P)\cong\mathbb C?$$   I believe it must be true from the bits I've been hearing throughout my studies, but of which I haven't seen proofs. I've been unable to find anything on the internet other than . It tells me that there is something called Weierstrass' theorem which should be relevant, but can't find even the precise statement of the theorem, let alone the proof.  Here's what I have tried.   First of all, I can assume that $P$ is monic, because for any polynomial of degree $2$ there's a monic polynomial generating the same ideal in $\mathbb R[X].$ So I have  $$P(x)=x^2+bx+c$$  for some real numbers $b,c$ such that $b^2<4c$.   I want to assume there is an isomorphism $\phi:\mathbb R[X]/(P)\to\mathbb C$ and work out what it should look like. I will denote by $[S]$ the coset of $S\in \mathbb R[X]$ in $\mathbb R[X]/(P).$ I'd like to find $S$ such that $\phi([S])=i.$  I have   $$ [x^2+bx+c-1]\mapsto -1, $$  So the coset that is mapped to $-1$ has to be a square root of $[x^2+bx+c-1]$ in $\mathbb R[X]/(P).$ Such a coset must be represented by a linear polynomial $kx+l$. Thus $$(kx+l)^2-(x^2+bx+c-1)\in (P),$$  that is $$ (kx+l)^2-(x^2+bx+c-1)\equiv a(x^2+bx+c) $$  for some real number $a$, and further  $$ (k^2-1-a)x^2+(2kl-b-ab)x+l^2-c-ac+1\equiv 0. $$  This gives   $$ \begin{cases} k^2=1+a\\ l^2=(1+a)c+1\\ 2kl=(1+a)b \end{cases} $$  The problem is that solving this gives formulas that are very difficult to handle. And I need to handle them if I want to prove that what I'm constructing is indeed an isomorphism. Is there a better way of doing it?


I got two 8-byte strings.  One which is decrypted is:  FF FF FF FF FF FF FF FF   and one which is encrypted is:  16 05 78 B0 0A C2 78 7F    Encryption mode is CipherMode.ECB  I need the key used in DES encryption.

Given a message and DES encrypted form of said message, is it possible to efficiently compute the key used to encrypt the data?


How do you copy/duplicate a form in Cognito Forms?

Is it possible to duplicate an existing Cognito form? If so, how?


I'm using the \mathcal{L} to get a curly L (the upper "L" in the image below). However, I get the other "L" (the lower "L" in the image below). I do include \usepackage{amssymb} in my .tex file.   My template can be found

Why, with Springer's  svmono template, do the letters written with the \mathcal font change? It seems that \mathcal becomes \mathscr.  Edit: Look at this image:    With the svmono template \mathcal returns the first alphabet and not the (classical) latter.  Here the packages I use in my document:  \documentclass[envcountsame,envcountchap]{svmono}  \usepackage{subfiles} \usepackage[utf8]{inputenc}  \usepackage{mathptmx} \usepackage[bottom]{footmisc} \usepackage{microtype} \usepackage{stmaryrd}    \usepackage{amsmath} \usepackage{courier} \usepackage{mathrsfs}  \usepackage{amssymb}  \usepackage[all,cmtip]{xy} \usepackage{faktor} \usepackage{graphicx} \usepackage{mathdots} \usepackage[colorlinks={true},linkcolor={blue},citecolor={blue}]{hyperref} \usepackage[frame,width=15truecm,height=23.5truecm,center]{crop}   With this settings I have the above strange behavior of \mathcal.


I want to find files in the /tmp directory. I use -path and -prune to exclude the subdirectory sgid from the results.  So I do something like this:  [root@ tmp]# find ./ -path ./sgid -prune -o -name 'foo*' ./sgid ./foo1 ./dir1/foo2 ./sgid0/foo1 ./sgid0/foo ./sgid0/foo2   However the output still contains the sgid subdirectory, which is not what I expect.  But when i do like the following：  [root@ tmp]# find ./ -path ./sgid -prune -o -name 'foo*' -print ./foo1 ./dir1/foo2 ./sgid0/foo1 ./sgid0/foo ./sgid0/foo2   The output matches my expectation. Why does the command have to include the -print option?

I need to exclude .git from my find search. To achive that, I am using the -path ./.git -prune switch:  $ find . -path ./.git -prune -o \( -type f -o -type l -o -type d \) | grep '.git' ./.git   However, even though this skips the contents of the .git directory, it lists the directory itself. It works when I add -path ./.git -prune -o -print -a  find . -path ./.git -prune -o -print -a \( -type f -o -type l -o -type d \) | grep '.git'   Why is this necessary. I thought that both commands should have same output. The second syntax is quite ugly.


In my statistics notes , they used the following result in an exercise $E[X|X]=X$ , where $X$ is a normal random variable. They simply stated that if I know $X$, the expected value is $X$. How can I prove that more rigorously?

I tried to show that $E(X\mid X=x)=x$, which would lead me to get $E(X\mid X)=X$ but I am having trouble doing so. I know that the definition of conditional expectation (continuous case) is: $$E(X\mid Y=y)=\int_{-\infty}^{\infty}x f_{X\mid Y}(x\mid y)\,dx$$ This led me to write: $$E(X\mid X=x)=\int_{-\infty}^{\infty}x f_{X\mid X}(x\mid x)\,dx$$ but I don't know what $f_{X\mid X}(x\mid x)$ is (if that's even a valid notation...)  I do note though that I don't know anything about $\sigma$-fields or Borel sets, as someone had tried to explain me once. Is it possible to prove this in an "elementary" way?


Why doesn't Dr. Strange fight people by opening portals in front of moving body parts (punched fists, running legs, jumping heads) and then closing the portals?  In fact, he can even open a portal anywhere, move it around his target, and close it.  It seems to me this would be so efficient.  , top answers suggest it's too difficult.  I don't care about Thanos-specific situations, I want to know why Strange doesn't employ it in all his fights. Why is this not something he practises?

There are so many "Why didn't Dr. Strange" questions related to the Thanos fight.   But I wondered, when they fought Thanos and tried to pull off the gauntlet, why didn't Strange just create and close a portal around Thanos' arm? Like in the city fight where that dude's arm was cut?  I guess it all has a reason because Strange saw many different outcomes but still, I really wonder.  PS: i am not asking why Strange didnt use the ring to port back to Earth. I mean specifically why he didnt cut Thanos' arm off.


I have a RecyclerHolder called EventHolder which I use in multiple layouts. It works perfectly in one activity. In the second activity, while the RecyclerView displays everything correctly, it throws a null pointer exception when I click on one of the items in the list in an attempt to move to the 'ViewSingleEvent' activity. I cannot figure out why this is, especially since it works for the first layout.  Code from EventHolder class:      @Override     public void onClick(View v) {          //handle the on click event for the ViewHolder - get single event details and switch activity         if (this.event != null) {             //getting the ID of the particular event clicked             String indEventId = this.event.id;             //using an intent to pass data between values             Intent i = new Intent(context, ViewSingleEvent.class); //nullpointerexception here             i.putExtra("id",indEventId);             context.startActivity(i);         }     }   The line Intent i = new Intent(context, ViewSingleEvent.class); holds the error. Is this something to do with getting the context of the second activity? Please help.  ALSO: I have already looked at multiple similar NullPointerException questions already, and have not found the answer to my question, so please don't mark this question as a duplicate - I'm stumped.  Edit: Code from EventHolder class where I get the context.  private Context context;      public EventHolder(final Context context, View itemView) {         super(itemView);          this.context = context;   I THINK this is how I pass the context from the first activity (the one that works):          //declaring the layout manager         RecyclerView.LayoutManager layoutManager = new LinearLayoutManager(this);         eventsListview.setLayoutManager(layoutManager);   This is what I did for the one that doesn't work. Note that it is a fragment, not an activity.          //declaring the layout manager         RecyclerView.LayoutManager layoutManager = new LinearLayoutManager(getActivity());         eventsListview.setLayoutManager(layoutManager);

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


I am a Computer science student working on LIGO data. I have seen this well describing link     On how to extract the masses from the data.   But I still find it a little difficult despite the good explanation.  Can anyone give me a much simpler explanation on how to extract the masses from this data ?    A simple step by step solution would be really helpful   Thanks in advance

The  was observed, giving us the frequency and amplitude of the event. Because LIGO has two detectors a  could be derived.  But how do these three factors allow for the mass of the black holes and their distance to be calculcated? If the wave strengths are in a square relationship to distance, then couldn't there be an infinite number of other masses and distances which would give the same signals?


The internal speaker of my MacBook Pro suddenly stopped sounding. I just tried PRAM reset, but it doesn't work.   The audio works when I plug in earphones and goes when plug out.  I don't think, it's a hardware problem, because, the startup chime sounds when I start the computer. (correct me if I am wrong in this point).  Anyone have any idea why this may happen and how to fix it?  Image : It also disappeared from the output list:      Not a hardware problem: Some people are referring this as a duplicate of a post, which has a hardware issue, I already mentioned above, the sound works for me while startup (startup chime). So it's not a hardware issue. (Pls explain in comment, if I am wrong in this point, other than marking as duplicate without any will to help).

My Macbook (the unibody aluminum version) has lost its internal speakers. When I open System Preferences -> Sound -> Output, all I see is "Digital Out". If I plug in a pair of headphones, this switches to "Headphones". I don't see "Internal Speakers" at all any more. Headphones seem to work fine.  In System Profiler -> Audio -> Available Devices, I do see "Speaker: Connection: Internal".   I just clean-installed Snow Leopard, so it appears to be a hardware problem.  Is there anything I can do to fix this, short of taking it back to Apple? It's out of warranty.


Also, $\left\langle A,\leq_{A}\right\rangle $ doesn't have a maximal element.  Is it true that $\left\langle A,\leq_{A}\right\rangle $ has a minimum? (strictly because of the proprerty that  $\{b\in A\mid b\leq_{A}a\}$ is finite for each $a \in A$)?

It's true that a set with a linear order where every initial segment is finite is necessarily countable? I don't think so but I can't find a counterexample (or make a proof)


Here is the question. Given any $\alpha>0$ and $u\in H^1(\Omega)$, $\Omega=B(0,1)$ in $n$ dimensions. Then we have $$\int_\Omega |u|^2 dx\leq C(\alpha)\int_\Omega |\nabla u|^2dx $$ provided that the set $M:=\{x\in \Omega, \,\, u(x)=0\}$ has measure more then $\alpha$, i.e., $|M|>\alpha$.  I have a solution  but my solution requires that $\alpha$ large enough, i.e., I need $\alpha\geq c>0$ for some constant $c$ and I don't know how to remove this additional assumption...  Anyhow, here is my approach: Let $$u_\Omega:= \frac{1}{|\Omega|} \int_\Omega u dx$$ i.e., the mean value of $u$ in $\Omega$.  Then I have $$|u_\Omega|^2 =   \frac{1}{|\Omega|^2} \left(\int_{\Omega\setminus M} u dx\right)^2\leq \frac{|\Omega\setminus M|}{|\Omega|^2} \left(\int_{\Omega\setminus M} u^2 dx\right)\leq \frac{|\Omega\setminus M|}{|\Omega|^2} \left(\int_{\Omega} u^2 dx\right)$$ The Last inequality is by Holder.  Thus I have $$\int_\Omega |u|^2 dx\leq 2\int_\Omega |u-u_\Omega|^2dx + 2\int_\Omega |u_\Omega|^2dx \leq 2\int_\Omega |\nabla u|^2dx + 2\frac{|\Omega\setminus M|}{|\Omega|} \left(\int_{\Omega} u^2 dx\right)$$ and hence I need to make  $$2\frac{|\Omega\setminus M|}{|\Omega|} <1$$ which require $\alpha$ large enough... But question state that this is true for any $\alpha>0$. Where am I missing?  Edit: The below answer is really nice. But here let me point out a more generally Poincare inequality which I learned recently. Actually the Poincare inequality hold for any $E\subset \Omega$ such that $|E|>0$, then $$ \int_\Omega |u-u_E|^2 dx\leq C\int_\Omega |\nabla u|^2dx  $$ Hence we could take $E$ to be the $0$ set of $u$.

I have trouble proving the following problem (Evans PDE textbook 5.10. #15). Could anyone kindly help me solving the problem? I know that I should somehow use Poincaré inequality but I still cannot solve it.   Fix $\alpha>0$ and let $U=B^0(0,1)\subset \mathbb{R}^n$. Show there exists a constant $C$ depending only on $n$ and $\alpha$ such that $$ \int_U u^2 dx \le C\int_U|Du|^2 dx,  $$ provided that $u\in W^{1,2}(U)$ satisfies $|\{x\in U\ |\ u(x)=0\}|>\alpha$.


I am trying to remove all reference to 'Business Objects' on my machine as my previous install was not right and doesnt give option to uninstall.    I am able to delete one by one with find next (F3 => and delete), but this takes long time.  Is there a good way to search all references and delete them all at a time?  I am on Windows 2008 Server R2.

I need to clean the Windows registry after manually removing a program. What I need to do is following.   Find all keys, values, and data containing "something". Delete all keys, values, and data matching the description.   Can I use the Reg command in CMD for this somehow?  By "something" in this case, I mean "office12".


I'm getting this error below whenever I try executing the commands drush config-import staging on the CLI. I'm basically in the process of migrating a drupal 7 DB to Drupal 8 and currently following this guide since I'm still new with migration.       Drupal\Core\Config\ConfigImporterException: There were errors validating the config synchronization. in         [error] Drupal\Core\Config\ConfigImporter->validate() (line 728 of /Applications/XAMPP/xamppfiles/htdocs/drupal-eight-iom/core/lib/Drupal/Core/Config/ConfigImporter.php). The import failed due for the following reasons:                                                                [error] Site UUID in source storage does not match the target storage. Entities exist of type Shortcut link and Shortcut set Default. These entities need to be deleted before importing. The core.extension configuration does not exist. Can not uninstall the Configuration module as part of a configuration synchronization through the user interface.     $databases['default']['default'] = array (   'database' => 'drupal-eight-iom',   'username' => 'root',   'password' => '',   'prefix' => '',   'host' => '127.0.0.1',   'port' => '3306',   'namespace' => 'Drupal\\Core\\Database\\Driver\\mysql',   'driver' => 'mysql', );  $databases['upgrade']['default'] = array (     'database' => 'drupal-seven-iom',     'username' => 'root',     'password' => '',     'prefix' => '',     'host' => '127.0.0.1',     'port' => '3306',     'namespace' => 'Drupal\\Core\\Database\\Driver\\mysql',     'driver' => 'mysql',   );   $settings['install_profile'] = 'standard'; $config_directories['staging'] = 'sites/default/config'; $config_directories['sync'] = 'sites/default/files/config_zB_DnNUK68i5Owp5a8FzTiClQfp3d3jrwcy0_HuS1hNCGv9Y_Iva2Ahm8LCH-P0j0M2jwmQAsA/sync';

When I run drush cim -y on my staging instance of my site I get the following error:     Drupal\Core\Config\ConfigImporterException: There were errors   validating the config synchronization. in Drupal\Core\Config\ConfigImporter->validate() (line 728 of /var/www/xeno/docroot/core/lib/Drupal/Core/Config/ConfigImporter.php).   The import failed due for the following reasons: Site UUID in source storage does not match the target storage. Entities exist of type Paragraph and Paragraph type Image. These entities need to be deleted before importing.   This is what I did:   Copied the database from staging and pulled the latest code Ran drush cex -y Committed configuration Went to staging and pull latest code Ran drush cim -y and get the error stated above   When I run drush cget system.site uuid on local and staging I get the same uuid so I am not sure why I am getting this error.  How can I fix the error?


I'm writing a simple code to test the value that was inputted to my constant value.  I declared this code as my constant value.  String LetMeThrough = "drunk"; String GotAnID = "drunk";   This is the whole code.  import java.util.Scanner;  public class Main {  public static void main(String[] args) {     Scanner DrunkTest = new Scanner(System.in);      String InputDrunk;     String InputDrunkAgain;      String LetMeThrough = "drunk";     String GotAnID = "drunk";        System.out.print("Type drunk: ");     InputDrunk= DrunkTest.next();     System.out.print("Re Type drunk: ");     InputDrunkAgain = DrunkTest.next();      if(InputDrunk == LetMeThrough & InputDrunkAgain == GotAnID){         System.out.print("You're not DRUNK");     }     else         System.out.print("You're F***** DRUNK");  }}   The problem is that if I type "drunk" on both. I will get "You're F****** DRUNK" instead of the "You're not DRUNK". When the inputted values is the same as my constant values.

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


as a self-study student I want to know the differences between two language features in c# and c++, I want to know by a simple example if someone know that please share it with me.

I mostly use Java and generics are relatively new. I keep reading that Java made the wrong decision or that .NET has better implementations etc. etc.  So, what are the main differences between C++, C#, Java in generics? Pros/cons of each?


I've been pulling my hair to know where I configure the auto mount configurations for when I plug in my external harddrive. As I really don't want to have atime changed when I have my external hdd.  I've been using Fedora 26 and I need to know the location of configuration files to allow me to edit the rules for mount options.

I have quite a bit of removable media (flash drives, external hard drives, etc) that I want to adjust auto mount options for. How does one do this? Is there something similar to /etc/fstab?


I am trying to learn overloading in javascript. I Googled it and there is a way to do that using arguments length and then by adding switch condition. But I am not interested in doing it like that. Actually I saw one good answer at   but he did not give any example of overloading using his opinion. So, how do you do overloading in javascript.  Here is my code. I need to overload a method using the above solution. He said to do like that:   function foo(a, b, opts) {  }   foo(1, 2, {"method":"add"}); foo(3, 4, {"test":"equals", "bar":"tree"});   How I will achieve this in my code?  function foo(a, b, opts) {  }  function foo(a) {     console.log("one argument pass"); }  function foo(a, b) {     console.log("two argument pass"); }  function foo(a, b, c) {     console.log("three argument pass"); }   foo(1); foo(1,2); foo(1,2,3);   here it is written  The best way to do function overloading with parameters is not to check the argument length or the types; checking the types will just make your code slow and you have the fun of Arrays, nulls, Objects, etc. What most developers do is tack on an object as the last argument to their methods. This object can hold anything.

What is the best way(s) to fake function overloading in Javascript?   I know it is not possible to overload functions in Javascript as in other languages.  If I needed a function with two uses foo(x) and foo(x,y,z) which is the best / preferred way:   Using different names in the first place Using optional arguments like y = y || 'default' Using number of arguments Checking types of arguments Or how?


I considered clamping an attachment point, but it's not recommended for carbon fiber and the clamp is too small to attach to the metal point at the end (bottom in the photo). Seat post is carbon fiber.  I could switch to aluminum post and use a canilevered rack, but that should be limited to less than 5 kilograms (10 pounds)  (That's an okay but not ideal solution) Any ideas?

I got a carbon-framed  recently but I also want to use it for commuting to and from work and I want a place to put my lock and other stuff on the bike. Is it possible to have a rack on this kinda bike.


I recently updated my phone to version 10.1.1, and ever since I have gotten the attached error.  i enter my iTunes username and password and I still get the error.  I have tried restarting the phone as well.  How do i make this go away?  My carrier is Verizon

I received a strange Pop Up message. The unsettling part is password will be sent in clear text.  Is my phone affected with any malware or app virus ?


Prove the following: $$ gcd(n^a-1, n^b-1) = n^{gcd(a, b)}-1 $$ I am not even sure where to start. I tried some stuff, but I always reach dead ends.  How should I go about proving this?


Talking about Luke and Leia.  Padme - Alien (right?) did not age when Anakin turned puberty.  Because their mom is an alien that doesn't age.  Does it work like half/half?  Do they live longer than normal humans?

I see no reason they should be (they come from different planets), but if so, how can they have children?