The problem  On EE.SE, but probably most SE sites, we have a common problem:  A (usually new) user asks an ambiguous question.  Other users ask for more information in comments to the question.  The OP writes additional information in more comments.  Many people aren't going to read a lengthy and tedious comment chain, so they continue to see just the ambiguous question.  Sometimes they ask for the same additional information someone else already did.  Experienced users are frustrated with the OP's lack of cooperation.    I think we've all seen this.  The root cause of the problem is that the new user answers comments with more comments, instead of adding pertinent information to the question itself.  The solution  Don't let users post comments to their own question.  There is really very little legitimate reason for doing this.  This site isn't a KaffeKlatsch, so comments aren't for chit-chat anyway.  Just about all comments to a question by the question author are to add information to the question.  This information belongs in the question.  If you really want users to still be able to comment on their own question, then at least pop up a message explaining that additional information to a question should be added to the question itself, and provide something to click on that opens the editor on the question instead.  Another alternative is to allow commenting on your own question after some rep level.  The message about adding information to the question should still pop up regardless.  Of course anyone that posted a comment to a question should automatically get notified when that question is changed.  The only times I remember that I've written comments to my own question were to ping someone that I added the information they requested to the question.  Similar discussions  I see that something similar was requested in .  However, that seeks to prevent someone from commenting on all their own posts, not just questions.  It is also trying to address a different problem.  The problem addressed here is real pertinent information to a question getting hidden in comments.  That problem isn't even mentioned as one of the issues in the question linked to above.  Example  See  at EE.SE.  The OP's use of "negative amplitude sine wave" was confusing and unclear.  Clarification was asked for in a comment.  The OP did answer, but that answer is buried in a comment.  I came along later, read the question, and asked about the same thing again.  In the end, the question was closed as unclear, because it was.  I doubt I'm the only one that often doesn't read comments to a question just to answer it or ask for more information.  I've found that comments are usually a waste of time, and they certainly aren't supposed to contain pertinent information to the question.  Of course the help explains what you should do, and there is no excuse for not having read the help before posting a question, but it is easy to think that you should reply to a comment with a comment.  By far new users commenting to their own question are responding to things asked by others in comments.  The current situation is a lot worse than new users getting a popup when trying to comment on their own question.  This propoal should be considered separately from the other, since it proposes something different, to address a different problem.

Unsurprisingly, most long discussion threads under a post involve the OP — and preventing them from commenting on their own question or answer will help to reduce comments being used for discussion.  If the OP wants to discuss someone's comment, they should have the immediate option to 'take discussion to chat' instead, and be able to @reply from there.  Obviously this would change the commenting behaviour of the OP, but there may be a significant side benefit: a reduction is comments that solicit discussion from other users as we come to realise that we can't simply start a discussion thread on the post any more. All the  would still work, as none usually require discussion:        Request clarification from the author;   Leave constructive criticism that guides the author in improving the post;   Add relevant but minor or transient information to a post (e.g. a link to a related question, or an alert to the author that the question has been updated).


I am trying to build a personal website and I have been using the parallax scrolling effect from . I have a div for each of my sections, but there is a 20px gap between each div and I'm noth sure why. Any help would be amazing.   I replaced the parallax images with colors because I have the images saved locally and links might expire. Also I have jquery 3.3.1 but that probably wouldn't matter for this; I'm only using jquery to smooth scroll on anchor clicks.  CSS & HTML:    html, body {     padding: 0;     margin: 0 auto 0 auto;     height: 100%; }  #header {     width: 100%;     margin: 0px;     padding: 12px 0px;     float: left;     background: rgba(238, 238, 238, 0.5);     position: fixed;     font-family: Arial;     font-size: 20px; } #header-right {  float: right; } #header a {     vertical-align: middle;     margin: 15px;     text-decoration: none;     color: #000000; } #header a:hover {     color: #909090; }  .parallax-window {     min-height: 400px;     background: transparent; }  .content {     padding-top: 60px;     display: block;      background-image: url('kalle-kortelainen-242413-unsplash.jpg');     background-attachment: fixed;     background-position: center;     background-repeat: no-repeat;     background-size: cover; }  #intro {     min-height: 800px;     padding-top: 60px;     background-color: #ef69a1;     background-attachment: fixed;     background-position: center;     background-repeat: no-repeat;     background-size: cover; }  #about {     min-height: 800px;     padding-top: 60px;     background-color: #82ff9e;     background-attachment: fixed;     background-position: center;     background-repeat: no-repeat;     background-size: cover; }  #projects {     min-height: 800px;     padding-top: 60px;     background-color: #2092e4;     background-attachment: fixed;     background-position: center;     background-repeat: no-repeat;     background-size: cover; }  #contact {     min-height: 800px;     padding-top: 60px;     background-color: #dfee80;     background-attachment: fixed;     background-position: center;     background-repeat: no-repeat;     background-size: cover; } <!DOCTYPE html>      <meta charset="utf-8">   <title></title>   <meta name="author" content="">   <meta name="description" content="">   <meta name="viewport" content="width=device-width, initial-scale=1">    <link href="test.css" rel="stylesheet">
     Bob
       About       Projects       Contact       Resume

     aksdhgflha

About

Projects

Contact

So essentially does margin collapsing occur when you don't set any margin or padding or border to a given div element?


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

I've been trying to keep some files in a separate folder as shortcut, so that I can keep track of my favourite media files and images etc in a specified folder as shortcut. I don't want to always copy these files everytime to that location so I was thinking of making it easier by adding a shortcut to the "send to" menu... I have windows 7 on my pc.  I'm trying to create a shortcut similar to the "send to Desktop (create shortcut)" that can simply place a shortcut in my "C:\Fav Media" folder, or similar location AS A SHORTCUT. Methods I had in mind:   Create a batch file that takes any file as input and creates a shortcut of that file in that folder. Thus any file can be dropped to the batch.bat.lnk shortcut and it's shortcut is sent to that folder. If file drop is successful, then I believe that send to option will do the same thing. I checked the "desktop (create shortcut).desklink" and it's extension is as already mentioned: .deskling.    I don't intend to play with registry, so if there's any file like a xml or txt or bat in windows that manages .desklink kind of extensions and does place shortcut from sendto menu no matter what the shortcut.desklink is named as, then maybe I could edit that xml and place the "C:\fav folder" as an addition in extensions to that xml with extension: ".favlink" ...  Is this possible? Can this be done in windows 7?  Thanks for any help.


Im trying to install Apache 2.4.12 or apache2.4 at least. I see some listings for apache2.2 in the apt-cache, but I don't see apache2.4. How can I verify the actually version that sudo  apt-get install apache2 will install, without having to install?

How can I check the version of the available package in the Ubuntu repositories without installing it?


I would like a way to force at least 1 decimal to appear in the result of an integer division.  int a = 2, b = 1; std::cout << a/(double)b; >>>> 2   int a = 2, b = 1; std::cout << (1.0*a)/(1.0*b); >>>> 2   I would like to print 2.0 but only gets 2 trying above tricks.  Answer:  std::cout.precision(1); std::cout << std::fixed << a/(double)b;

In my  I was printing a double using cout that got rounded when I wasn't expecting it.  How can I make cout print a double using full precision?


I am trying to run some C++11 code (not mine), with four .cpp files:datainfo, pcim,  demo,  traj and a Makefile. The files compile with no errors, but then  g++  -lboost_serialization -lpthread -o demo datainfo.o pcim.o demo.o traj.o  gives a multiple errors that look like this: datainfo.o: In function boost::archive::detail::pointer_iserializer<boost::archive::xml_iarchive, datainfo>::load_object_ptr(boost::archive::detail::basic_iarchive&, void*&, unsigned int) const': datainfo.cpp:(.text._ZNK5boost7archive6detail19pointer_iserializerINS0_12xml_iarchiveE8datainfoE15load_object_ptrERNS1_14basic_iarchiveERPvj[_ZNK5boost7archive6detail19pointer_iserializerINS0_12xml_iarchiveE8datainfoE15load_object_ptrERNS1_14basic_iarchiveERPvj]+0xa3): undefined reference toboost::archive::detail::basic_iarchive::next_object_pointer(void*)'  The boost lib files are in /usr/lib/x86_64-linux-gnu and the .hpp files are in /usr/include/boost $. I am running on a server with Mint 17.2 rafaela. I am not very familiar with C++, but I am guessing it might be a linking issue?.

Why does the order in which libraries are linked sometimes cause errors in GCC?


So i want to create 2 bootable usb sticks: one for windows 7 and one for ubuntu 14.04. I want to boot those usb's in UEFI mode, both having 64bit ISO's, and install the two OS's in UEFI mode dual boot. (different story-different question). I have found that i must use a FAT32 or a FAT16 format for the usb.  So i go to disk utility (using master boot record) => edit partition. But there's so many partition type options.  My questions are:    Do i use FAT16 or FAT32? If we take FAT16 for example, what option should i choose between the following:    FAT16 <32M (0x04) Hidden FAT16 <32M (0x14) FAT16 (0x06) Hidden FAT16 (0x16) w95 FAT16 (LBA) (0x0e) Hidden w95 FAT16 (LBA) (0x1e) EFI (FAT -12/16/32)    Thanks a lot for the upcoming support!

I'd like to create a Windows bootable USB stick, but I don't have a Windows machine with me at the moment to do so. How could I achieve the same using Ubuntu?


Do the frictional forces vary from each other when different objects try to move on a surface? The materials, sizes, shapes are different from each other.

I recall studying a law of friction some years ago, in engineering school. All I remember is that when first approximation was taken, the popular $f=k \times N$ was derived. Why would such an approximation be deemed so useful as to be taught as "engineering truth"? What is the proof that contact area does not significantly affect friction force? EDIT: So, the book is about designing a friction clutch. This device consists of a number z of disc pair, one connected to the input shaft and the other disc from the pair connected to the output shaft. If I understand the formula and meanings of the variables correctly, the maximum torque the device can transmit is proportional to $F \times z$. F is the force, pushing the disc package together.


$p \in \mathbb{N^*}$,  $u_n = \frac{1}{n(n + 1)...(n + p)}$ Determine $\sum_{n=1}^{+ \infty}u_n$ Hint: write $pu_n$ in the form $v_n - v_{n+1}$  I couldn't see how to use the hint, I tried to use $ln$ but I did not proceed much to write it in the from of $v_n - v_{n+1}$

I have to prove that  $$\sum_{k=1}^\infty \frac{1}{k(k+1)(k+2)\cdots (k+p)}=\dfrac{1}{p!p}$$  How can I do that?


$$lim_{n \rightarrow \infty} (1+\frac{3}{n})^n$$  $lim_{n \rightarrow \infty}\ \frac{3}{n}=0$, and $lim_{n \rightarrow \infty}\ 1^n=1$, which is why I thought the above limit would evaluate to 1. The answer is apparently $e^3$. Why is this?  Any help will be greatly appreciated, thanks in advance.

I am trying to identify what the flaw is exactly when reasoning about a limit such as the definition of $\mathbf e$:  $$ \lim_{n\rightarrow \infty}\left(1+\frac{1}{n}\right)^n={e} $$  Now, I know there are ways of proving this limit, such as by considering the binomial expansion of $(1+\frac{1}{n})^n$ and comparing that to the Maclaurin series of $e$. So to make this clear, I am not looking for a proof of the limit definition of $e$.  I tried searching for "limit laws/rules" but none of the rules I found described the above case. Hence, I am looking for a specific rule (or perhaps a certain perspective) that will help me realize why the above does not in fact evaluate to 1.  My train of thought is as follows: at a first glance, if I wasn't already familiar with what the limit evaluates to, I probably would evaluate the expression inside the brackets first, and then apply the limit to the power. So, $$\displaystyle\lim_{n\to\infty}\frac{1}{n}=0\quad\text{and then}$$  $$\displaystyle\lim_{n\rightarrow \infty}\left(1+0\right)^n=\lim_{n\to\infty}1^n=1$$  Why is my reasoning flawed?


Prove that $$0 \le xy+yz+xz - 2xyz \le 7/27, \:\:\:x,y,z \ge 0$$ with $x+y+z=1$.    Attempt:  We must prove $xy + yz + xz \le 2xyz + 7/27$  Assume $x,y,z>0$, since the case when all equal $0$ is clear.  Next, I have that $xy = \sqrt{x^{2}} \sqrt{y^{2}} \le (x^{2} + y^{2})/2$ by AM-GM. Same also for the $yz, xz$. Summing the inequalities we get $$ xy+ yz + xz \le x^{2} +y^{2} +z^{2} $$   Ley $\alpha =xy+yz+xz$, now   $$ x^{2} +y^{2} +z^{2} =(x+y+z)^{2} - 2 \alpha$$ so we also have $$ 3 \alpha \le 1 \implies \alpha \le 1/3= \frac{9}{27}.$$  Also $xyz \le (x+y+z)^{3}/27 = 1/27$ (by AM-GM).  So  $$  \alpha =xy + yz + xz \le 7/27 + 2/27$$  In order to finish the proof we must have  $$ 1/27 \le xyz$$ but instead we have  $ xyz \le 1/27$. This is the tricky part..    This problem is from IMO 1984:there is a solution in this link  that manipulates $xy+yz+xz-2xy$ into something with $(1-2x)(1-2z)(1-2y)$ and then use AM-GM. This only proves for the case $x,y,z < 1/2$.    How to finish the proof?

I tried to solve this inequality because I find exotic.  Actually, I didn't look at the right solution.  Because before I look at the right solution, I want to know if my solution is right or not.  Prove that $0 ≤ yz + zx +xy -2xyz≤\frac{7}{27}$, where $x,y$ and $z$ are non-negative real numbers for which $x + y + z = 1.$  Attempts: If $x=0$. The left side of the inequality is correct. So, I can accept $x,y,z≠0$. It is enough to prove $\frac 1x+\frac1y+\frac1z≥2$ We have,  $x+y+z≥3\sqrt[3]{xyz}\Longrightarrow xyz≤\frac1{27}$ $\frac 1x+\frac1y+\frac1z≥\frac3{\sqrt[3]{xyz}}≥9≥2$ The left side proved.  It is obvious at least one of the numbers is less than $\frac 12.$  So, we can choose $y$, such that $y≤\frac 12$.  Therefore, we have  $yz + zx +xy −2xyz ≤ \frac7{27}$ $x(y+z)+yz(1-2x)-\frac7{27}≤0$ $x(1-x)+y(1-x-y)(1-2x)-\frac7{27}≤0$ $x-x^2+y-xy-y^2-2xy+2x^2y+2xy^2-\frac7{27}≤0$ $x^2-x-y+xy+y^2+2xy-2x^2y-2xy^2+\frac{7}{27}≥0$ $x^2(1-2y)+x(3y-2y^2-1)+(y^2-y+\frac7{27})≥0$ $2(\frac12-y)\left(x+\frac{y-1}{2}\right)^2+\frac{1}{108} (3y-1)^2(6y+1)≥0$  Of course, I'm not sure the solution is correct.  Can you verify the solution? Thank you.


How to import excel in SharePoint List programatically in SharePoint 2013. Excel having more than 40000 entry.

I have an excel spreadsheet that I would like to use as data for a SharePoint 2010 list. I know how to do this without code, but for this particular task, I need a coded solution.  Does anyone know how to create a SharePoint 2010 list and populate the list with items from an excel spreadsheet? Here is what I have so far:  using (SPSite site = new SPSite(@"http://sitecollection/"))         {             SPWeb web = site.RootWeb;             Guid listGuid = web.Lists.Add("List Title", "List Description", SPListTemplateType.GenericList);         }   Now how do I add the SPListItems that are populated using the excel spreadsheet?


Suddenly, Visual Studio 2008 doesn't execute "find all" (Ctrl + Alt + F) for the solution correctly. This happened two days ago in the office and now on the computer at home.  I'm looking for a method, which is definitely declared in code, but Visual Studio 2008 outputs in Find Results window:  Find all "wlOutFile", Subfolders, Find Results 2, "Entire Solution", "*.*"   No files were found to look in.   Find was stopped in progress.   The options looks like this:

Sometimes while developing in Visual Studio IDE, when you use "Find in Files"  dialog to find something, the search fails and you will see the following message in the "Find Results" window.      No files were found to look in. Find stopped progress   Once this message shows up, all the subsequent searches will result in the same message. Nothing fixes the problem including restarting the computer except pressing Ctrl + ScrLk.   What causes Visual Studio to get into this state and is there a setting to permanently prevent it from happening?


After my paper was accepted, I was sent page proofs with few corrections to some words and some references. Is it possible to add something to this page proofs. I want to change wording of a line that they didn’t mention so it makes better sense is that possible?

When I receive galley proofs of a paper, I look at possible errors introduced by the copy-editing team. But while I proofread the article, there are sometimes small mistakes I'd like to fix, which were not introduced by them (i.e. they were already present in the accepted version of the manuscript).  Usually, the proofs are accompanied by instructions saying that extensive changes should not be introduced at that time, and any such changes would have to be approved by the editor (hence, I suppose, delaying publication). However, the limit is not very clear to me. What is considered extensive changes? In particular, what do you think of the following items (from my experience):   Slight changes in wording, to improve clarity Updating a citation, because an “in press” or “ASAP” article now has page numbers Adding an important (but not crucial) citation one had missed, in the introduction Adding a citation to a paper that has been published since the manuscript was submitted; possibly adding a short sentence to the text     What I have done so far is change everything that I think should be changed to improve the paper (including all the above items), and let the typesetter decide whether he wanted to send it back to the editor. I never received any complaint or comment on my changes, which could indicate that it was the correct course of action.


In Naruto Shippuuden, does the Summoning: Reanimation Jutsu bring a dead person to the real world at any wanted age? (Young/Adult/Old) Or does it bring the person back at the age they died?  Because we have seen that Reanimation Jutsu brought back the Third Hokage as on old geezer. Which was the same as when he was at deathbed. But Madara Uchiha was revived as a younger version of himself, instead of his old age.

From Naruto manga and anime, I know that Uchiha Madara died as an old person after he helped Uchiha Obito.   But it was bit weird for me, when Kabuto summoned Uchiha Madara-sama with Edo Tensei, Madara was a younger person.  Again, when Chiyo was summoned, she was older as when she died.  How can it be possible?


I was reading Wilcox and Myers' "Introduction to Lebesgue Integration and Fourier Series" (Dover). On p.18, the authors try to prove that every non-empty open subset $G$ of the reals can be expressed uniquely as a countable union of pairwise disjoint open intervals. Their proof is quite similar to the one in  or the one in Steven Krantz's "A Guide to Topology" (MAA). So, I guess this is a rather usual proof.  At some point, the authors have shown that when $G$ is bounded, $G$ can be written as a disjoint union of non-empty open intervals $\cup_{x\in G}I_x$, where either $I_x\cap I_y=\phi$ or $I_x=I_y$ for any $x,y\in G$. Then they write:     That this collection is countable follows from the fact that one can choose a rational number in each $I_x$ (using the axiom of choice), and the disjointness of the intervals guarantees that no duplication will occur in the choice of rationals.   Why do we need the axiom of choice? If we denote $I_x=(a_x,b_x)$ and define \begin{align} n_x&=\left\lceil\frac1{b_x-a_x}\right\rceil+1,\\ q_x&=\min\left\{\frac{j}{n_x}\in I_x:\ j\in\mathbb Z\right\}, \end{align} doesn't it suffice to pick $q_x$ as a representative of $I_x$? What am I missing?

There are several proofs I have seen of this, but they all seem to use choice subtely at some point. Is there any way to prove this without choice, or is it possibly unproveable?


I cannot find this file. A lot of people say that there is a .bin folder, but there is none on my pc.  Please help!

I have a problem.I can not find my jar folder for minecraft.I have 1.7.4.So does anyone know where the jar file is?


I am an Indian who has booked my flight tickets from someone else credit card from Turkish Airlines which travels from Istanbul to other city in Turkey. Will there be problem since I am not the credit card holder?

I have return tickets flying out of SFO on Turkish airlines for the whole family. The credit card I used to book the tickets has since been replaced by the bank with a new card.   In order to board, can I present the new credit card (same name) at the checkin counter, or must I present the original credit card (which is no longer valid and has been discarded)?  By 'discarded' - I mean cut up and thrown away in trash. It was no longer valid, since it was replaced with a new card. So can I use the new card to travel on a booking that was made using the original card?    The new card has a new number; and the ticket was purchased through an agent.


, my MacBook became unstable due to limited disk space caused largely by a single 330 GB text file ~/Library/Containers/com.apple.mail/Data/Library/Logs/Mail/imap-mail.outlook.com-<GUID>.txt  I have successfully deleted this file, but a mere day later this file is already nearly 1GB. How do I prevent this file from growing so large?

I am fixing an acquaintance's computer that ran out of disk space. Space was so critical that the OS did not launch any apps. I booted in Safe Mode (holding Shift during startup), deleted 1.5 GB of applications, and was able to launch the OS in normal mode and inspect the file system.  A search with du -sh * by hand revealed log files in ~/Library/Containers/com.apple.mail/Data/Library/Logs/Mail, in the format imagp.gmail.com-<UID>.txt that were 29 GB and 6 GB. I understood from  that these files are simply a log of all connections to the Gmail server:     Gmail is having trouble with the mac Mail client for quite some time. ... The Mail logs keep a record of the connection process, they're useful to to diagnose problems, ... It's safe to delete those logs.   I inspected the files: they contain both the records of the connections (error codes, server names) and also the content of emails (headers, plain text bodies, and mime-type attachments).  To prevent these problems in the future, does the OS have a way to limit the size of those logs, e.g. keeping only the last 30 days of connection, or doing a first-in-first-out of lines up to a certain file size?


Area 51 gave me this:  which is weird, since I got there by navigating to a user's profile (which was also "unsafe"), then edited the url (to the one in the above image). some info that might be useful:  does the freehand circle say it all?  Ok, so the problem is different The problem is that from the chats, links to profiles on a51's Meta are still to discussion.area51.stackexchange.com (or whatever the link is).

I recently tried to visit a person's profile from chat room.  I clicked the link to his profile(points to area51) and the link is dead.    The link points to discuss.area51.stackexchange.com and the link should be area51.meta.stackexchange.com (as pointed by Shadow Wizard in Tavern on meta).  This link points to an HTTPS error page       I am able to reproduce this issue only for users with main profile in area51.   And I think someone missed it in the recent meta url changes from meta.x.se to x.meta.se


I know this: When you use == to compare two objects it will compare the two instances of the object and check if they are the equal.  When you use .equals() it will compare the states of the 2 objects.   Let's say this is my code:  String string1 = new String("abc"); String string2 = new String("abc"); Integer integer1 = new Integer(5); Integer integer2 = new Integer(5); int int1 = new Integer(6); int int2 = new Integer(6);  if (string1 == string2)     System.out.println("The strings are equal"); if (integer1 == integer2)     System.out.println("The integers are equal"); if (int1 == int2)     System.out.println("The ints are equal");   Why will this code only print "The ints are equal"?

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


I was reviewing first posts and noticed that I could not edit one of the posts (I had too many pending edits), normally there is an error message to explain this, however there isn't in the review queue (this is reproducible by me?):    I realise this is similar to  and  however I do know why it is disabled (I checked by trying to edit on a normal question) and the feature has status-completed (and is working outside of the review queues)  Is this a bug or intentional behaviour?

While reviewing First Posts on Super User, I noticed that I couldn't edit this question (see below). Clicking the "edit" link simply does nothing. Editing is not possible for me right now because I have already five suggested edits pending. It used to be the case that the link would've been grayed out (and the reason shown as a popover). , and while I'm not sure it's an improvement, the current implementation needs some fixing at least.  This bug appears regardless of the actual reason that the edit isn't possible; for instance,  is another user experiencing the same bug who couldn't suggest an edit because of an already pending one. Apparently, I'm far from the only one who experiences this issue. As of last Sunday morning,  have been posted networkwide (and are still alive) and  is #16.


Let $A$, $B$ be symmetric real matrices $n \times n$-type. Let's consider the polynomial $$ f(t)=\det(A-tB). $$  If $B$ is positive definite, then it is known that $f$ has only real roots. Is the same true for nonsingular $B$ (and $A$, $B$ symmetric)?

Let $\mathbf A, \mathbf B$ be Hermitian matrices of the same size. What is the characterization of $\mathbf A, \mathbf B$ such that $p(\lambda)=\det(\mathbf A-\lambda\mathbf B)=0$ has only real roots?   If $\mathbf B$ is positive definite (I corrected this), it is easy to see $p(\lambda)$ has only real roots.


Assuming a child goes to college and everything is paid from a 529 college savings plan. Once that child graduates and there's leftover money in the savings account, what can be done with that money? Assuming there are no more educational expenses to be paid for.

I read somewhere that overfunding a 529 account could be subject to taxes and a 10% penalty. Does anyone know how this works? Obviously, it is very difficult to predict the tuition costs 10 or 15 years ahead. I understand you can apply the overfunds to a another child or relative, but what if this is not these? Do you pay taxes + 10% penalty on all leftover funds?


Might be an obvious (or impossible) request, but does anyone know if there's an equivalent of the "less than or greater than" symbol but for "succeeds or precedes?" Thanks!  I've tried using detexify (which would just come back with the \lessgtr symbol) and looking through as many of the math symbol pdf guides as I can find. I might just be missing it, but I've tried searching a few different ways. Alternatively, if the sumbol doesn't exist, is there an easy (and at least somewhat elegant) way to force a \succ and \prec on top of each other?

I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?


I am on hard mode and I have been exploring underground jungle for 3 days.  I cant find any Bulbs, and I think I am prepared to kill it now.  How do I find the Plantera Bulb in the easiest way?

I have been playing on hardmode for a while and have beaten the three  a couple of times. But I have yet to find a . It's getting really frustrating.  Does anyone have any methods to finding a Plantera Bulb?


I'm trying to implement a function upperCase that takes a string and capitalises any characters without returning an extra string. Running the code below I get 'Segmentation fault (core dumped)' when the memcpy command runs. Am I using memcpy incorrectly? The commented out printArrChar just loops through the array and outputs its values, which outputs the intended letters from charArray. void upperCase(const char *s){     int i=0;     size_t len = strlen(s)+1;     char charArray[len];     while (*(s+i) != '\0'){         if (*s >=97 && *s <= 122){             charArray[i] = *(s+i) -32;         }         else         {             charArray[i] = *(s+i);         }         i++;     }     charArray[len-1] = '\0';     // printArrChar(charArray, sizeof(charArray)/sizeof(charArray[0]));     memcpy(s, &charArray, len); }  Edit: Full code for context.  I realise I made a mistake declaring my function as taking a const but giving it a non-constant array, but removing the const doesn't seem to fix the error.

The following code receives seg fault on line 2:  char *str = "string"; str[0] = 'z';  // could be also written as *str = 'z' printf("%s\n", str);   While this works perfectly well:  char str[] = "string"; str[0] = 'z'; printf("%s\n", str);   Tested with MSVC and GCC.


Consider the polynomial $( f(x) = x^7 - 4x^3 + x + 1 )$. All the zeroes of the above polynomial are plotted in the complex plane i.e., the Argand plane. How many are within a unit distance from the origin?  Details and Assumptions:  The repeated roots are counted with multiplicity i.e.,$ ( (2x - 1)^2 = 0 )$ has two solutions within a unit distance from origin and not one.  There is a very neat and simple way of doing without W|A. Please refrain from using any such mathematical computational software.

If roots of the equation   $$x^7 - 4x^3 + x + 1=0$$        are plotted on the Argand plane, how many of them have distance from the origin less than $1$?     I found, by plotting the rough curve of $y= x^7 - 4x^3 + x + 1$ that it has three real roots, out of which two of them have modulus greater than $1$ and one has modulus less than $1$. But I don't know how to do the same for non - real roots. The answer given in my book is that $3$ roots have modulus less than $1$.


I am  attempting to create following rule:     if Utiltiy (look up field) =  abc  then ONLY allow certain users to edit these date fields  date field1 and date field2. Following rule doesnt work..... ***i logged in as user NOT specified in the following rule i was able to edit the date  fields. The rule should only allow users specified below should be able to edit the date fields.  AND(     Utility__c = 'PREPA - PR',     OR(         ISCHANGED(Net_Meter_Agreement_Date__c),         ISCHANGED(Received_Date__c)     ),     $User.Id  <> "005E00000050ir2",     $User.Id  <> "005E0000006kdYD" )

I have a requirement where a certain field can be edited without the validations firing for a particular user. Now I tried to write rule like LastModifiedId != '005000000000000AAA' but the validation was still firing. Then I realized that until the record saves, the LastModifiedId does not change and the validations still fire, as the LastModifiedId would not be updated to the exempted User.   Is there any workaround or a way to check the Id of the User who is currently editing the record?


I working in some project. I need get all classes with styles of any html element Example Element: <a href="#" class="btn btn-transparent-white font-weight-bold py-3 px-6 mr-2">     Agregar Medicamento </a>  Code JS var classes = e.target.className.split(' ');  console.log(classes);  Result: ["btn", "btn-transparent-white", "font-weight-bold", "py-3", "px-6", "mr-2"] With my code I can get styles of classes .btn transition: color 0.15s ease 0s, background-color 0.15s ease 0s, border-color 0.15s ease 0s, box-shadow 0.15s ease 0s;  .font-weight-bold font-weight: 500 !important;  .py-3 padding-bottom: 0.75rem !important;  .px-6 padding-left: 1.5rem !important;  .btn-transparent-white undefined  But I have a problem with combined styles for example .btn.btn-white-transparent Any idea how I can to search any coincidences of element? Edited: Thanks for you anwers but I can search single classes , my problem is when I want to search .btn-white-transparent. this is a combined style, I want to seach .btn-white-transparent and the anwer will be .btn.btn-white-transparent { color:#FFF}

I would like to return a string with all of the contents of a CSS rule, like the format you'd see in an inline style. I'd like to be able to do this without knowing what is contained in a particular rule, so I can't just pull them out by style name (like .style.width etc.)   The CSS:  .test {     width:80px;     height:50px;     background-color:#808080; }   The code so far:  function getStyle(className) {     var classes = document.styleSheets[0].rules || document.styleSheets[0].cssRules     for(var x=0;x<classes.length;x++) {         if(classes[x].selectorText==className) {             //this is where I can collect the style information, but how?         }     } } getStyle('.test')


Like it or not, Meta Stack Exchange favicon was changed recently to , however in the app the old icon is still showing:        Can it please be updated?

Observe the site icon from the sidebar:        ...but if you thought that was an old icon, wait until you see it in the app feed!


I am working with a database on a virtual server on Hyper-V where the mdf and ldf files are on C:.  It's my understanding that these files should not be on C: and would perform better if on separate drives.  Is there good information that I can use to support my understanding?

We're planning to install a SQL Server on this physical architecture:  A hyper-v cluster based on windows server 2019 A cluster shared volume where all VMs live A full-flash SAN that contains the CSV  I've always read that is a common best practice to have multiple disks for data files, log files, temp db files ect... But that best practice is referred to a bare-bone installation. So, what I'm asking is: what are the actual benefits of doing so on the above described architecture (if any)?


Consider the following code: const testArray = ['string1', 'string2', 'string3'];  for (let iterator in testArray) {     console.log(iterator == 0); }  My IDE (Visual Studio Code), complains about the console.log, that it will always return false (error: ts(2367)) But if I input this code directly either here, or in a JSBin, or in my current browser, I always get the true result on the first iteration. Anyone can explain me, if my IDE is to blame for this, or maybe there is some legacy javascript, where that condition indeed always returns false? Based on this table  it also seems that the above code is valid, and will run as expected.   const testArray = ['string1', 'string2', 'string3'];  for (let iterator in testArray) {     console.log(iterator == 0); }

I've been told not to use for...in with arrays in JavaScript. Why not?


I'm upgrading linux from 18.04.4 to 20.  I have backed up all of my data. How do I backup my Thunderbird (68.10)  data????  I saw an article stating that copying the file Home/rich-500-164/.thunderbird would do the trick.  And to restore it just to copy it back once the upgrade was completed. In using this method, would this include all of my emails (as with anyone, very valuable), folder structure, filters, etc.? Also, found "ImportExportTools NG".  Does anyone know anything about this and does it work????

Ubuntu 14.04 is seriously misbehaving, and I only have access to the terminal. I propose to do a full reinstall, but want to backup the Thunderbird inbox for reinserting if it is otherwise lost in the process. This web access is from a trial version of 14.04 on DVD, and 'backups' is available. The HDD is shown on the desktop as a mass storage device, within which all the system folders appear to be accessible. What do I have to do to pull out the inbox (at least) and transfer it (or a copy) to an external mass storage device.  Thanks for any help,  Derek F.


Integer arithmetics in C# can be set to throw an  using checked, as in the following example:   int a = foo(); int b = bar() int result = checked(a * b); // Will result in OverflowException if this overflows   I'm currently getting more into C programming and just found a bug that was due to an integer overflow - which would have been much more easier to find with something like checked - and I ask myself: Why is nothing similar implemented in C? Can someone explain it to me or point me out (some standard reference, etc.) where it is stated why such a construct is not part of the C language?   Or am I completely wrong and there is some built-in functionality to check for (integer) overflows on arithmetic operations?

I was writing a program in C++ to find all solutions of ab = c, where a, b and c together use all the digits 0-9 exactly once. The program looped over values of a and b, and it ran a digit-counting routine each time on a, b and ab to check if the digits condition was satisfied.  However, spurious solutions can be generated when ab overflows the integer limit. I ended up checking for this using code like:  unsigned long b, c, c_test; ... c_test=c*b;         // Possible overflow if (c_test/b != c) {/* There has been an overflow*/} else c=c_test;      // No overflow   Is there a better way of testing for overflow? I know that some chips have an internal flag that is set when overflow occurs, but I've never seen it accessed through C or C++.    Beware that signed int overflow is undefined behaviour in C and C++, and thus you have to detect it without actually causing it. For signed int overflow before addition, see .


I'm trying to find an <h1> tag within an iframe with an id of f1.   Simply trying $("#f1").find("h1") returned an empty set.   So I thought maybe it was because the iframe didn't have jquery in it, so I couldn't use those methods.   So I tried a couple of different things.  Without jquery:  var el = document.getElementById; el.getElementsByTagName("h1");   no luck. Sort of doesn't really make sense either since getElementsByTagName is a method of the document. Though I sort of thought maybe an iframe would be a separate document.   Lastly I tried to add jquery  var el = document.getElementById("f1") var s = document.createElement("script"); s.src = "http://ajax.googleapis.com/ajax/libs/jquery/2.0.2/jquery.min.js"; el.appendChild(s);   which gets jquery appended to the iframe. I can see it in the inspector in the head of the document embedded in the iframe. Yet   var el = document.getElementById("f1"); el.find("h1");   gets the typeError Object #<HTMLIFrameElement> has no method 'find  How can I get the value of my <h1> tag?

I would like to manipulate the HTML inside an iframe using jQuery.  I thought I'd be able to do this by setting the context of the jQuery function to be the document of the iframe, something like:  $(function(){ //document ready     $('some selector', frames['nameOfMyIframe'].document).doStuff() });   However this doesn't seem to work. A bit of inspection shows me that the variables in frames['nameOfMyIframe'] are undefined unless I wait a while for the iframe to load. However, when the iframe loads the variables are not accessible (I get permission denied-type errors).  Does anyone know of a work-around to this?


I have the following question from a past qualifying exam:  If $X$ is a Banach space and $X^*$ denotes its dual space show that if $x_1\ne x_2\in X$ there is an element $y\in X^*$ such that $y(x_1)\ne y(x_2).$  So i'm trying to construct a linear functional $y:X\rightarrow\mathbb{K}$ with the above property, but I don't seem to be getting anywhere. Perhaps there are elements of the dual space that always exist and which I can take advantage of here? Unfortunately, we didn't talk very much about Banach spaces in my course, so if anyone could point me in the right direction, I'd appreciate it.

Let $(X, \|\cdot\|_X)$ be a normed vector space and $(X^{\ast},\|\cdot\|_{X^{\ast}})$ its dual space. I have to prove, that  $$ \forall x\in X:\quad \|x\|_X = \sup_{T\in X^{\ast}}\{|T(x)| : \|T\|_{X^{\ast}}=1\}$$  How can I show this using Hahn-Banach theorem?


I'm currently running Win10 Pro and I'm looking to upgrade to Win10 Enterprise (to get rid of Windows bloatware and telemetry etc). Is it possible to install Enterprise while keeping my installed programs? I'm not worried about my files as I have them on a separate drive. I'm just worried about registry stuff because I really want to avoid the hassle of reinstalling and reactivating all my software. I've recently discovered Win10 Education but a) I'm not sure if I can keep it forever, and b) it doesn't include Cortana and I'm not sure if the taskbar search bar is part of Cortana because if it is I don't want to lose it because I use it a lot.  Recap: I'm on Win10 Pro, I want Win10 Enterprise but without losing my programs. Win10 Education is an option but I'm not sure if a) there is a time limit and b) if it removes the search bar at the bottom.  Can anyone shed any light on this?

I wonder, if it is possible to upgrade from Windows 10 Home to Windows 10 Enterprise like with Windows 8.1 where you can add features by entering a valid key for Pro. I'd test it, if I wouldn't have to reinstall everything in case it doesn't work...   I ask, because I need Remote Desktop for work, which Win10 Home hasn't.


I have a spreadsheet which I want to upload onto my company's intranet for others to view. Everytime the spreadsheet opens, it runs a background script which updates the information. The problem is - the script runs for about 10 minutes because it looks at 2 huge tables. Is there a way for the spreadsheet to be refreshed once a day (example 2am) without someone having to open it?

I have an Excel file that want to update and save automatically with out having to open it or manually interact with.  Manually, I open the file up and hit data refresh which goes and does a SQL query and then hit F9 for the formulas to update and then I just close/save.    (I then would mail the file out to people using a perl script or use SAS JMP to run some numbers/charts and also mail them out.  Basically I need to script some things which require the XLS file to be updated.)


I would like to clear my doubts about these 2 parameters: validation_data and validation_split of the Keras' fit() method, whether I'm using them in the right sense. Here's how I go about splitting my data set (two scenarios). 1.) I split the whole dataset into 80% train and 20% test. Keeping this 20% test set for evaluation, I then fit the model on the train, setting validation_split=0.2 essentially saying take 0.2 (20%) of the train and use it for validation. In the end, I then evaluate my model on the 20% test split (imagine this as newly collected data). 2.) In the second experiment, also splitting the whole dataset into 80% train and 20% test, I fit the model setting validation_data=test i.e. validating on the 20% test split. Then at last, I evaluate the model on this same 20% test (again..!). But it seems to me that in the second experiment I'm just mixing up things. The model was validated on this test during the training phase and then evaluating again on it... Does that make sense? Overall am I using these parameters validation_data and validation_split of fit() in the correct sense? I have the doubt that validation_split can only be used in a k-fold cross-validation scenario. Please explain.

I am in the machine learning business for a long time, but still, this fundamental fact gets me confused, since every paper, article and/or book describe different kind of usages for validation and test sets. I aim to set my mind at ease forever on this issue:   Let's say I have a relatively small Convolutional Neural Network and I want to train it on MNIST dataset. Naturally, I want to learn the best hyperparameters for the given CNN, like the weight decay coefficient $\lambda$, the learning rate $\alpha$, etc. Naturally, MNIST has 60K training images and 10K test images. The basic practice is allocating 10K of the training set as the validation set for MNIST.   Assume that we are doing a grid search on $\lambda$ and $\alpha$ hyperparameters and assume that we have fixed a $(\lambda^*,\alpha^*)$ pair. Then we start training the CNN using SGD, using the 50K training set and measuring the performance on the 10K validation set in the end of each epoch (a complete pass over the 50K training set). Usually we either stop training if a fixed budget of epochs has been depleted or we start to lose accuracy on the validation set. And then, only for a single time in the training process of the CNN with the $(\lambda^*,\alpha^*)$ pair, we measure the real performance on the test set. We pick the one with best performance. This usage is intuitive and does not cause the network to unfairly overfit on the test set. But the problem is, we did not ever used the 10K validation set in the actual training with SGD.  So, now, what is the correct way to use the validation set here? After we finish training with the $(\lambda^*,\alpha^*)$ pair, either by running out of allowed epochs or early exiting due to overfit on validation set, should we merge the validation set and training set, and train a few epochs more? At this point, our learning rate may already be very small due to decaying it gradually. Should we train everything from scratch by using the 60K training + validation set, setting the learning rate to its initial value?   Another alternative may be to train the CNN with every $(\lambda,\alpha)$ pair in consideration of our grid search, using only 50K training samples in the SGD and 10K validation samples for measuring the accuracy. No interaction with the test set is allowed. Let's assume that after we train with every $(\lambda,\alpha)$ pair, we pick the pair which yields the highest accuracy on the validation set. Then we train the CNN with the picked hyperparameters, from scratch, this time using the 60K training + validation samples directly in SGD, for an amount of fixed epochs. After the training ends, we use the test set once and for all to declare our final accuracy performance.  This method, in my mind, would cause the following issue: The hyperparameters we have picked would be the optimal ones for the 50K training samples! Since we have used a smaller subset of the actual training set, most probably the model would more easily overfit, seeing a lower data variation, so our hyperparameter search may tend to find a higher $\lambda$. And with this $\lambda$ we would probably see a lower accuracy on the actual test set with the full 60K training samples, since the model won't be able to compensate for the variation of the extra 10K samples, due to high $\lambda$.  So, I am not certain what the ultimately correct way to use the validation-test sets. What would be the valid - logical approach here?


I think this question has been asked a couple of times such as:       however I'm trying to determine if things have changed since.  I've booked a package holiday with Expedia that consists of a hotel, and flights from London Heathrow to Lisbon and back with the departure date this Thursday. The problem I'm having is trying to get a refund from TAP Portugal with regards to both flights.   The flights were cancelled by the airline at the start of the month and Expedia sent me an email for credit vouchers. There obviously no good to me as I don't have any intentions of flying to Portugal for the next two years and the chance of the airline surviving after this could also be questionable.  I've spoken to Expedia today who have said they can't do anything with regards to the refund as they follow the airlines policy - however I spoke to TAP who are suggesting I speak to Expedia for a refund.   What would be the best way to go through with this? I had booked everything using an American Express Card too - would raising a chargeback still be appropriate or should I ring up TAP or Expedia and find out why I can't get a refund under the specific EU laws?  Edit  Not sure why this question has been closed. The previous question was asked before this crisis got worse with rules changing daily.

My international conference in Europe this May has been canceled due to the COVID-19. I have a ticket, purchased from TAP air Portugal, from Toronto, Canada to Lisbon. Because it is a non-refundable fare, they don't want to give a refund.  They won't allow me to reschedule later than May 31 of this year. This won't be useful for me.  What options do I have? I'd prefer to get a full refund.  (I am a US citizen if it matters)  Note: They offered to refund just the taxes, which is about 10% of the value. That's not horrible, but I'd rather have the whole thing returned.


I have searched the web but I have failed to find a conclusive answer for this question.   Is there any difference between CREATE INDEX and ALTER TABLE ADD INDEX?  Are there any problems that may arise when I use one or the other or do both work the same way?  Server version: 5.5.32 - MySQL Community Server (GPL)

Just came across a weird issue, whereby depending on how I create an index, an index name is required.      CREATE INDEX `random_name` ON `my_table` (`my_column`); # Requires an index name  ALTER TABLE `my_table` ADD INDEX (`my_column`); # Does not require an index name   It seems to me that the CREATE INDEX call, should not make index name required. I'm wondering if this is a MySQLism, or a SQL standard?


For string concatenation we can use either the concat() or concat operator (+).  I have tried the following performance test and found concat() is faster and a memory efficient way for string concatenation.  String concatenation comparison for 100,000 times:  String str = null;  //------------Using Concatenation operator------------- long time1 = System.currentTimeMillis(); long freeMemory1 = Runtime.getRuntime().freeMemory();  for(int i=0; i<100000; i++){     str = "Hi";     str = str+" Bye"; } long time2 = System.currentTimeMillis(); long freeMemory2 = Runtime.getRuntime().freeMemory();  long timetaken1 = time2-time1; long memoryTaken1 = freeMemory1 - freeMemory2; System.out.println("Concat operator  :" + "Time taken =" + timetaken1 +                    " Memory Consumed =" + memoryTaken1);  //------------Using Concat method------------- long time3 = System.currentTimeMillis(); long freeMemory3 = Runtime.getRuntime().freeMemory(); for(int j=0; j<100000; j++){     str = "Hi";     str = str.concat(" Bye"); } long time4 = System.currentTimeMillis(); long freeMemory4 = Runtime.getRuntime().freeMemory(); long timetaken2 = time4-time3; long memoryTaken2 = freeMemory3 - freeMemory4; System.out.println("Concat method  :" + "Time taken =" + timetaken2 +                    " Memory Consumed =" + memoryTaken2);   Result  Concat operator: Time taken = 31; Memory Consumed = 2259096 Concat method  : Time taken = 16; Memory Consumed = 299592   If concat() is faster than the operator then when should we use concatenation operator (+)?

Assuming String a and b:  a += b a = a.concat(b)   Under the hood, are they the same thing?  Here is concat decompiled as reference. I'd like to be able to decompile the + operator as well to see what that does.  public String concat(String s) {      int i = s.length();     if (i == 0) {         return this;     }     else {         char ac[] = new char[count + i];         getChars(0, count, ac, 0);         s.getChars(0, i, ac, count);         return new String(0, count + i, ac);     } }


Hi i have tried on several occasions to get in touch with the colombian consulate in london and to no avail. My british passport is an electronic passport but my colombian one is not. I plan to travel to colombia in a months time. Is it possible to travel with my british passport to colombia and my non electronical colombian passport which states it expires on the 2017? i have my colombian cedula identity card up to date. Will i have problems entering Colombia?? please someone help and advise

I am a citizen of two different countries, and have two passports.  How should I use my passports when traveling?


Let us be working over the field of complex numbers. Suppose $f(x)= a_n x^n + \cdots +a_1 x + a_0$ is a degree $n$ polynomial with $n$ distinct roots $z_1,\ldots,z_n$.  Is the following matrix always invertible?  $$\left( \begin{array}{ccc} 1 & 1 & \cdots & 1 \\ z_1 & z_2 & \cdots & z_n \\ \vdots & \vdots &  & \vdots \\ z_1^{n-1} & z_2^{n-1} & \cdots & z_n^{n-1}  \end{array} \right) $$  Motivation: I was learning how to solve linear recurrence relations with constant coefficients, and the standard method involves writing down the characteristic polynomial and then solving for the roots. After which, we use the initial conditions to solve for the constants ->this is the step which I am wondering about: is it always possible to do that? This quesiton amounts to the same question above.  Edit: I guess I can extend my question since I am concerned with general linear recurrence relations with constant coefficients. If the roots of the characteristic polynomial are repeated, then we use $z^n, nz^n, n^2z^n,...$ for our "guesses", so the general matrix to invert is something like:  $$\left( \begin{array}{ccc} 1 & 0 & \cdots & 1 \\ z_1 & z_1 & \cdots & z_k \\ \vdots & \vdots &  & \vdots \\ z_1^{n-1} & (n-1)z_1^{n-1} & \cdots & z_k^{n-1}  \end{array} \right) $$  How do we know this matrix is invertible?

This is an exercise from Ian Stewart's Galois Theory, $3^{rd}$ edition:     If $z_1,z_2,\ldots,z_n$ are distinct complex numbers, show that the determinant $$D=\left|\begin{array}[cccc]  11&1&\cdots&1\\ z_1&z_2&\cdots&z_n\\ z_1^2&z_2^2&\cdots&z_n^2\\ \vdots&\vdots&\ddots&\vdots\\ z_1^{n-1}&z_2^{n-1}&\cdots&z_n^{n-1} \end{array}\right|$$   is nonzero.       Hint: Consider the $z_j$ as independent indeterminates over $\Bbb C$. Then $D$ is a polynomial in the $z_j$, of total degree $0+1+\cdots+(n-1)=\frac{1}{2}n(n-1)$. Moreover, $D$ vanishes whenever $z_j=z_k$ for $k\neq j$, as it then has two identical rows. Therefore $D$ is divisible by $z_j-z_k$ for all $j\neq k$, hence it is divisible by $\prod_{j<k}(z_j-z_k)$. Now compare degrees.   My question is how to do this. I follow the hint and I'm thinking of $D$ as a cofactor expansion; is that the idea? Also, the fact that $D$ vanishes whenever $z_j=z_k$ for $k\neq j$ follows since it would have two identical columns, right? I don't see why $z_j=z_k$ would imply it has two identical rows, as the hint suggests. The fact that it is divisible by $(z_j-z_k)$ is easy since that would make $z_k$ a root for $k=j$, but I'm not quite sure I follow why the degrees would be different. I think the degree of the product would be $1+2+\cdots+(k-1)$, but then add these up for all $k<n$?   I appreciate any clarification that you can provide!


What story features Col. Henry Bone at the end of the universe, with all remaining creatures fighting in deadly earnest over all scraps?  There seems to be something of a western theme, as well as a character who/which does not recognize Col. Bone in time before making a fatal mistake.

I read this story in an anthology in the eighties or early nineties.  It was about an old man who lived outside a western-like town, though that might have just been how I imagined it.  He goes to town and some ex-military thugs are there causing problems.  Flaunting some odd interdimensional military tech of some sort.  He doesn't want to intervene as doing so would be bad but in the end he must.     By intervening, his military identity is revealed and that causes him (some paradox or causality law) to have to go back and fight the war again.   The war is at the end of time or the universe.  The man is maybe a colonel of the sky something... Not much to go on; I have been searching my collection and wracking my brain for years trying to recall the story.


I encountered this book about thirty years ago at school. It was probably a young adult novel rather than anything more serious and I think it was not part of any series.   The details are:    A boy finds himself progressively unable to interact with physical objects, slowly moving away from his physical reality into an alternate reality. There was a mosaic poster of Mars made from images returned by Viking featured as well.   What is the name of this book?

Trying to identify a novel I read years ago (probably in the '80s) in which the protagonist (late teens, early 20s?) is gradually forgotten by and ceases to be able to interact with the rest of the world (all of which gradually fades to gray).  In the beginning, as he is slowly fading out (not realizing it) he goes down to breakfast with his parents, and his mother has only set out two plates (one for his father and one for herself) — she'd forgotten to set one out for him.   He reminds her.  Foreshadowing, eh?   But gradually everyone forgets about him and ceases to be able to hear or see him, and fade to gray.  Some other things apparently similarly get "forgotten" however — e.g., occasionally he finds colored, not gray, cans of food in grocery stores, which he can interact with and eat — so he survives.  He then meets a girl who has similarly been forgotten by the world, and they spend time together and fall in love.  At the end,       he is gradually starting to fade back into the world (she isn't) and she puts writes a note about them and puts it in his pocket, in the hope it will fade back into the world with him.  It does, and he sees it one day — but has no idea what it is or any memory of her.  Sad.


In GNU Bash, both !$ and $_ expands to the last argument of the last command.  I think they're identical and I need someone to tell me if there is any difference.

The question is about special variables. Documentation says:     !!:$      designates the last argument of the preceding command. This may   be shortened to !$.        ($_, an underscore.) At shell startup, set to the absolute pathname used  to invoke the shell or shell script being executed as passed in the    environment or argument list. Subsequently, expands to the last argument to the previous command after expansion. Also set to the full pathname  used to invoke each command executed and placed in the environment    exported to that command.    There must be some difference I cannot catch, because:  $ echo "hello" > /tmp/a.txt $ echo "!$" echo "/tmp/a.txt" /tmp/a.txt  $ echo "hello" > /tmp/a.txt $ echo $_ hello   What is the difference?


I'm working on a  and would like to know how to structure my map data. I suppose this question could also be extended to any sort of top down 2d game. Anyways! My game will contain object types like terrain, doors, switches, monsters, and items. How should the objects be stored within a map?   Some ideas I've gathered online:   The map is a 2d array. Each cell in the array can store multiple references to objects occupying it. The map contains several layers of 2d arrays, and each layer stores references to objects of a specific type. Like 1. but only store static terrain information in the 2d array. The rest of the objects are dynamic and stored in lists for each type.

I'm developing a 2D platformer with some uni friends.  We've based it upon the XNA Platformer Starter Kit which uses .txt files to store the tile map.  While this is simple it does not give us enough control and flexibility with level design. Some examples: for multiple layers of content multiple files are required, each object is fixed onto the grid, doesn't allow for rotation of objects, limited number of characters etc. So I'm doing some research into how to store the level data and map file.  This concerns only the file system storage of the tile maps, not the data structure to be used by the game while it is running.  The tile map is loaded into a 2D array, so this question is about which source to fill the array from.  Reasoning for DB: From my perspective I see less redundancy of data using a database to store the tile data.  Tiles in the same x,y position with the same characteristics can be reused from level to level.  It seems like it would simple enough to write a method to retrieve all the tiles that are used in a particular level from the database.  Reasoning for JSON/XML: Visually editable files, changes can be tracked via SVN a lot easier. But there is repeated content.  Do either have any drawbacks (load times, access times, memory etc) compared to the other?  And what is commonly used in the industry?  Currently the file looks like this:  .................... .................... .................... .................... .................... .................... .................... .........GGG........ .........###........ .................... ....GGG.......GGG... ....###.......###... .................... .1................X. ####################   1 - Player start point, X - Level Exit, . - Empty space, # - Platform, G - Gem


I'm looking for cardinality of $P_{fin}(\Bbb{N})=\{x|x\subset\Bbb{N}$ and $x$ finite$\}$. I was told in my classes that it's $\aleph_0$, but how to prove it?

Show that the set of all finite subsets of $\mathbb{N}$ is countable.   I'm not sure how to do this problem. I keep trying to think of an explicit formula for 1-1 correspondence like adding all the elements in each subset and sending that sum to itself in the natural numbers, but that wouldn't be 1-1 because, for example, the set {1,2,3} would send to 6 and so would the set {2,4}.  Multiplying all the elements in each subset and sending that product to itself in the natural numbers wouldn't work either since, for example, {2,3} would send to 5 and so would the set {1,5}. Any ideas?


Let {$x_n$} be monotone increasing sequence of positive real numbers. Show that if {$x_n$} is unbounded, then $\sum_{n=1}^{\infty}(1-\frac{x_n}{x_{n+1}})$ diverges.

So I've been trying to figure out how to prove the following.     Let $(a_n)$ be a sequence of positive numbers such that $\sum\limits_{n=1}^\infty a_n =\infty$, and define $s_n=\sum\limits_{i=1}^n a_i$. Then $\sum\limits_{n=1}^\infty\frac{a_n}{s_n} =\infty$ as well.   I can prove it by comparing it to $\int_1^\infty \frac{1}{x} \, dx $ if the sequence $a_n$ is bounded by some $M$, but that's as far as I've been able to get.


I can't change the CSS of the accordion title because of the shadow DOM in lwc. Is there any way to accomplish that?  Here is the code:  <lightning-accordion onsectiontoggle={handleToggleSection} active-section-name={itemConfig} allow-multiple-sections-open >     <lightning-accordion-section name="MyForm" label="MyForm" class="accordionPadding_small"></lightning-accordion-section> </lightning-accordion>

Say we have a LWC with the following template in a component named example:  <template>     <lightning-textarea class="test"></lightning-textarea> </template>   And some css to go with it:  .test textarea {     min-height: 500px; }   The expected behavior is that the lightning-textarea will be 500px tall because the nested textarea has been made 500px tall.  The actual behavior is that nothing happens. The reason for this is that the compiled css will be:  .test[c-example_example] textarea[c-example_example] {     min-height: 500px; }   And the compiled (relevant parts of the) html will be:  <lightning-textarea c-example_example lightning-textarea_textarea class="test">     <textarea lightning-textarea_textarea></textarea> </lightning-textarea>   It's obvious that the  has scoped the textarea element to its parent, lightning-textarea and not our example component. This is an issue because the CSS processor has appended [c-example_example] not only to the .test part of the selector, but textarea as well.  It makes sense that CSS would be scoped downward, which is how Aura components handled scoping, but in LWC it's actually entirely isolated, so neither parent nor child elements can target it.  Is there any way around this? Or plans to support targeting child components? Being able to override and tweak the CSS of the standard component library was a very handy feature of Aura components, allowing customized appearances without having to rewrite the base component from scratch.  On top of that, this means that you can't reuse your own components in different contexts, giving them different styles in each. The component itself must be responsible for  all of its styling. While this is possible it requires a lot of conditional class assignments which is frustrating.


Since solar system (and our galaxy) is constantly in motion at a great speed, is it possible that we can look at our own image as it was sometime ago? Since the light of that age takes sometime to reach us, is it possible that we can look at earth as it was at that point in time. In more simple case, if I go to Mars and start looking at earth in detail, I will be looking at past as seen from earth, correct? Now, relative to current position of earth, past position would have been very far (much farther than distance between Mars and Earth). So, can we look at past?  As the distance increase, we are looking at older past. Please correct me if I'm wrong.  [Not a homework. Curious question]

From my understanding of light, you are always looking into the past based on how much time it takes the light to reach you from what you are observing.  For example when you see a star burn out, if the star was 5 light years away then the star actually burnt out 5 years ago.  So I am 27 years old, if I was 27 light years away from Earth and had a telescope strong enough to view Earth, could I theoretically view myself being born?


I just read the following sentence from :      A 95% confidence interval does not mean that for a given realized interval there is a 95% probability that the population parameter lies within the interval (i.e., a 95% probability that the interval covers the population parameter).   Instead, the correct interpretation would be      The confidence interval can be expressed in terms of samples (or repeated samples): "Were this procedure to be repeated on numerous samples, the fraction of calculated confidence intervals (which would differ for each sample) that encompass the true population parameter would tend toward 90%.   But then my question is: if the current confidence intervals are an instance of an procedure that contains the true parameter value 90% of the time when time tends to infinity, like the second quote implies, then why can't we say that the current intervals contains the true parameter with 90% probability (the probability referring to the CI calculation, not to the parameter)? Isn't that the frequentest definition of probability?

It seems that through various related questions here, there is consensus that the "95%" part of what we call a "95% confidence interval" refers to the fact that if we were to exactly replicate our sampling and CI-computation procedures  many times, 95% of thusly computed CIs would contain the population mean. It also seems to be the consensus that this definition does not permit one to conclude from a single 95%CI that there is a 95% chance that the mean falls somewhere within the CI. However, I don't understand how the former doesn't imply the latter insofar as, having imagined many CIs 95% of which contain the population mean, shouldn't our uncertainty (with regards to whether our actually-computed CI contains the population mean or not) force us to use the base-rate of the imagined cases (95%) as our estimate of the probability that our actual case contains the CI?   I've seen posts argue along the lines of "the actually-computed CI either contains the population mean or it doesn't, so its probability is either 1 or 0", but this seems to imply a strange definition of probability that is dependent on unknown states (i.e. a friend flips fair coin, hides the result, and I am disallowed from saying there is a 50% chance that it's heads).  Surely I'm wrong, but I don't see where my logic has gone awry...


Is everyone able to learn philosophy?  If not, what kind of person is able to learn philosophy?    Does learning philosophy require a certain intelligence or talent? If I start at the age of 18, is it too late?   I am a student of vocational high school, majoring in informatics engineering. I rarely read books other than textbooks, and just recently read a non-textbook book titled Sophie's World. That is what led me to this question.

What is a comprehensive definition of Philosophy? Alternatively, is it impossible to define Philosophy? This is a pseudo- question, but it seems like it belongs here.


In Google Sheets, pressing the Enter key moves the cursor down a cell.  For example:   position cursor on the cell type to enter text press Enter key   Expect: Cursor stays on the cell I was just editing Actual: Cursor moves down to next row    Is there any way to turn off this behaviour in Google Sheets so the Enter key doesn't move the cursor?  In Excel, there's a setting to choose what happens when the Enter key is pressed (to control if it moves to another cell or not).

In Microsoft Excel, the default behavior of pressing the Enter (return) key is this:     If you are in a cell, and tab over as   you input data, at the end of the   series when you click Enter, the focus   will go to the cell directly under the   cell that you began the series of   tabs.      For example, if you are in cell A1,   tab over to C1, and then click Enter,   the focus will go to cell A2.   Is there any way to get this behavior in Google Spreadsheets?


I have the following command: \newcommand{triangles}[2]{triangles $\triangle #1$ and $\triangle #2}, such that \triangles{ABC}{DEF} produces triangles $\triangle ABC$ and $\triangle DEF$. I would like to expand that command such that it can take any number of arguments and such that \triangles{ABC}{DEF}{GHI}{JKL} produces triangles $\triangle ABC$, $\triangle DEF$, $\triangle GHI$ and $\triangle DEF$. I have seen a solution somewhere for a shoppinglist that makes use of \makeatletter and some TeX command, but this is more difficult, I think, because before you add the current argument, you need to know whether it is the last argument (if not: put a comma, if yes: put "and").

I have a situation where I want to define a command that takes a variable number of arguments, where the number of arguments is known programmatically via a \count, and process the parameters in some way (say as if they are a list).  As an example, say I'd like to output the parameters as a comma-separated list.  \newcommand{\makecsv}[N]{#1, #2, ..., #N}   The code that I've come up with to do this kind of operation (in a generic-ish way) essentially takes a command, \csv and expands it recursively N times. \csv needs to know how to continue the recursion, and has some state that I'd like to thread through the recursion (rather than using \global).  \documentclass{report} \usepackage{etoolbox}  \makeatletter \newcommand{\ifzero}[3]{%   % #1: count   % #2: state for #3   % #3: macro to expand to   % - should take at least 2 parameters   % - ##1: count threaded through   % - ##2: macro state threaded through   \ifnum\c > 0     \def\tmp@f##1##2##3{##1{##2}{##3}}%     \advance#1 -1%   \else     \def\tmp@f##1##2##3{)}% note closeparen here (could be param)   \fi   \tmp@f{#3}{#1}{#2}% } \makeatother  \newcommand{\csv}[3]{   % #1: count   % #2: separator state   % #3: string to concat   %    #2#3\ifzero{#1}{, }{\csv}% }  \newcommand{\makecsv}[1]{%   \ifzero{#1}{}{\csv}% }  \makeatletter \newcommand{\decl}[3]{%   % #1: decl id   % #2: decl symbol   % #3: # params   \csgdef{decl@#1}{#2}%   \global\expandafter\newcount\csname decl@#1@nparams\endcsname%   \csuse{decl@#1@nparams} #3\relax% }  \newcommand{\usedecl}[1]{%   \newcount\c   \c \the\csuse{decl@#1@nparams}   \csuse{decl@#1}(\makecsv{\c}% } \makeatother  % declare some interface routines \decl{foo}{FOO}{3} \decl{bar}{BAR}{4}  \begin{document} \usedecl{foo}{p1}{p2}{p3}\par \usedecl{bar}{p1}{p2}{p3}{p4}\par \end{document}   Is this a reasonable thing to do in 2e, or is there some sort of standard approach to this that is normally used?  Edit 1  It seems like my original MWE wasn't adequate to describe why someone might want this. I've updated the MWE with a use case. \decl allows authors to declaratively define a C-style function, and \usedecl allows the author to generate a use of the function, with its parameters bound to specific arguments.  This is similar enough to what I'm doing that it should help motivate the example.


i run into some problems with the shading in the tail of the airplane. but i did not know what cause the problem. can any help?

While rendering a mesh with smooth shading on, I get a dark region/shadow on certain faces. The effect is more evident when smooth shading is applied to a mesh containing ngons, with the ngons turning black when rendered.   The blackening effect is visible in the viewport too.  How can I solve this problem?


I came across this story some 15 years ago, but can not remember the author or the original title (although I was certain it was "Please insert card").  The Story:   A man buys a book named "The Murder of Thomas Brook" (or some other name in the title) A few days later he receives a notice "Please Insert Card (for identification). Payment pending, please pay for your purchase". (each time he receives a message from the computer, it starts with words "Please Insert Card") He doesn't want to pay, because he already paid for it, so he sends an answer demanding to speak with a human being. He again receives automated answer "Please pay, or we will have to take this to court, bla bla bla..." After much conversation the case ends up at the civil court where it is taken by another computer. This entire time the man tries to reach a human being to try and correct the error, but all answers come from a computer. At the court happens another error - the case is wrongly forwarded to criminal court, instead of civil court. As the result, the charge is not for "Pending payment for 'The Murder of Thomas Brook'", but for "Murder of Thomas Brook". At the end the man stands trial for murder and is sentenced to death. Two clerks (or some other two persons) finally realize the error five minutes after the execution.   I have to think about this story each time when I order something from Amazon, but haven't been able to remember the name of the story.

I'm looking for a short story about a man who forgets to return his library book.  A computerised system takes over and everything goes from bad to worse.  The book he did not return is 'Kidnapped' by Robert Louis Stevenson, so the man ends up on a kidnapping charge, which changes to a murder charge when the computer learns that RLS is dead.  It must be from the 60s or 70s.


The definition of affine quasi-projective variety is that it is a quasi-projective variety that is isomorphic to an affine variety. Then is an affine quasi-projective variety necessarily projective? Is there any examples?

I was trying to proof the following without any luck. I would appreciate good hints.  A projective variety that is isomorphic to an affine variety is a finite number of points.


static void Main(string[] args) {     var repo = new StudentRepository();      List<Student> students = new List<Student>();       var myLock = new object();     //version 1-----------------------------------------------     for (int i = 1; i <= 20; i++)     {         var stud = repo.GetStudentById(i);         students.Add(stud);      }      //version 2-----------------------------------------------     var ids = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20 };     Parallel.ForEach(ids, id =>     {         var stud = repo.GetStudentById(id);         lock (myLock)         {             students.Add(stud);         }     });      //version 3------------------------------------------------ -     List<Task> tasks = new List<Task>();     for (int i = 1; i <= 20; i++)     {         tasks.Add(Task.Factory.StartNew(() =>         {             var stud = repo.GetStudentById(i);             lock (myLock)             {                 students.Add(stud);             }         }));      }     Task.WaitAll(tasks.ToArray());       students.ForEach(s => Console.WriteLine(s.Id + "---" + s.Name));     Console.ReadLine(); }   Output With version 1   Output With version 2    Is there any difference between version 1 and version 2 (performance wise)? While version 2 gives proper results version 3 stores null in student list(i.e. students). What wrong I am doing here?

I met an interesting issue about C#. I have code like below.  List<Func<int>> actions = new List<Func<int>>();  int variable = 0; while (variable < 5) {     actions.Add(() => variable * 2);     ++ variable; }  foreach (var act in actions) {     Console.WriteLine(act.Invoke()); }   I expect it to output 0, 2, 4, 6, 8. However, it actually outputs five 10s.  It seems that it is due to all actions referring to one captured variable. As a result, when they get invoked, they all have same output.  Is there a way to work round this limit to have each action instance have its own captured variable?


In  when something acts on one particle the other one reacts also, just in reverse (more or less). From what I've read though, anything acting on either particle will collapse the entanglement, right? So how do we know they were ever linked? Or is it just measurements that collapse it?  The reason I ask is because given the public impression of the topic it would suggest on of two things. That the information causing the reaction is superluminal or that the particles are occupying the same space since they are in different states. If the second were true then distance must be a human construct and somehow they must still be in the same place regardless of the virtual distance between them.   To clarify, I don't mean information in regards to communication such as QC. Just particle information.

I have never found experimental evidence that measuring one entangled particle causes the state of the other entangled particle to change, rather than just being revealed.  Using the spin up spin down example we know that one of the particles will be spin up and the other spin down, so when we measure one and find it is spin up we know the other is spin down. Is there any situation after creation that the particle with spin up will change to spin down?


I'm trying to have a FragmentActivity where User's input in an Editext can store in an array then will show to Listview but after entering a value and click the button, the application stopped.  I'm having this kind of output in my logcat  02-16 21:53:05.950    1315-1315/com.tipmanila.cite.traventurev2 E/AndroidRuntime﹕ FATAL EXCEPTION: main     Process: com.tipmanila.cite.traventurev2, PID: 1315     java.lang.NullPointerException             at com.tipmanila.cite.traventurev2.NotesFragment$1.onClick(NotesFragment.java:53)             at android.view.View.performClick(View.java:4442)             at android.view.View$PerformClick.run(View.java:18473)             at android.os.Handler.handleCallback(Handler.java:733)             at android.os.Handler.dispatchMessage(Handler.java:95)             at android.os.Looper.loop(Looper.java:136)             at android.app.ActivityThread.main(ActivityThread.java:5105)             at java.lang.reflect.Method.invokeNative(Native Method)             at java.lang.reflect.Method.invoke(Method.java:515)             at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:792)             at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:608)             at dalvik.system.NativeStart.main(Native Method)   My FragmentActivity look like this  @Nullable @Override public View onCreateView(LayoutInflater inflater, ViewGroup container, Bundle savedInstanceState) {     View v = inflater.inflate(R.layout.notes_fragment, container, false);      txt = (EditText) v.findViewById(R.id.txtInput);     show = (ListView) v.findViewById(R.id.listView);     save = (Button) v.findViewById(R.id.btnSave);     save.setOnClickListener(new View.OnClickListener() {         @Override         public void onClick(View v) {             String getInput = txt.getText().toString();              if (addArray.contains(getInput)) {                 Toast.makeText(getActivity(), "Note already added", Toast.LENGTH_LONG).show();              } else if (getInput == null || getInput.trim().equals("")){                 Toast.makeText(getActivity(), "Input field is null", Toast.LENGTH_LONG).show();              } else {                 addArray.add(getInput);                 ArrayAdapter<String> adapter =  new ArrayAdapter<String>(getActivity().getApplicationContext(), android.R.layout.simple_list_item_1, addArray);                 show.setAdapter(adapter);                 ((EditText) v.findViewById(R.id.txtInput)).setText("");              }           }     });       return v;

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?


Please, I would like to transfer a bulk amount from my NRE account to my parents account, For Taxation purposes,Do they need to pay only for interest accrued thereof or for the entire lumpsum amount received as income?

I transfer some amount of cash to my parents for their groceries every month. What are the tax implications for this amount? Do I get any tax exemptions for this sum?


For below singleton class where would be the memory taken from (Stack or Global memroy)  class Singleton {     public:          static Singleton* get()         {             static Singleton instance;             return &instance;         } };

In what segment (.BSS, .DATA, other) of an executable file are static variables stored so that they don't have name collision? For example:   foo.c:                         bar.c: static int foo = 1;            static int foo = 10; void fooTest() {               void barTest() {   static int bar = 2;            static int bar = 20;   foo++;                         foo++;   bar++;                         bar++;   printf("%d,%d", foo, bar);     printf("%d, %d", foo, bar); }                              }   If I compile both files and link it to a main that calls fooTest() and barTest repeatedly, the printf statements increment independently.  Makes sense since the foo and bar variables are local to the translation unit.  But where is the storage allocated?  To be clear, the assumption is that you have a toolchain that would output a file in ELF format.  Thus, I believe that there has to be some space reserved in the executable file for those static variables. For discussion purposes, lets assume we use the GCC toolchain.


Hey I want the easiest method to prove $\exp(x)\geq x+1$.  The only method I use is to consider a new function $F$, that realizes $F(x)=\exp(x)-x-1$ then calculate the derivative then use its monotony to prove that  $F(x)<0$ I'm only a high school student, if you could use function study it would be easier for me to understand. So do you have any better method? this one takes me some time to write down I would love a easier method

The elementary but very useful inequality that $1+x \le e^x$ for all real $x$ has a number of different proofs, some of which can be found online. But is there a particularly slick, intuitive or canonical proof? I would ideally like a proof which fits into a few lines, is accessible to students with limited calculus experience, and does not involve too much analysis of different cases.


Suppose I have command like cd abc/def, So I want to create own command like 'a'.  If I run 'a' command it ,should run command cd abc/def  optiplex-3020:~$ a   So could it be possible and I want to use python as scripting language

I've always wondered why cd isn't a program, but never managed to find the answer.  Anyone know why this is the case?


I am an Indian national with Irish residence permit.      Can I visit the UK without visa?   I plan to visit the London for 1 week.  I know that Irish citizens can visit UK without any restrictions, but what about Non-EU nationals holding valid residence permit issued by irish authorities?  I just learned that Ireland neither part of UK, nor in Schengen zone.

I hold an Indian passport and am living and working in Ireland with a valid work permit.   Do I need a visa to go to the UK? Do they have border control?


Is this sentence correct?  If an employee experiences an ethical dilemma, they can request a reassignment.  Is it correct to use 'they' when talking about 'an employee'? Or should the subject be plural?

Is there a pronoun I can use as a gender-neutral pronoun when referring back to a singular noun phrase?  Each student should save his questions until the end. Each student should save her questions until the end.


I am creating a map for a game I have been working on and I really like the Material I have made for it. I have learned about Cycles baking but the mesh is so large (5 miles x 5 miles) that it won't bake at a high enough resolution without crashing, it gets a blurry pixelated look to it. I know I can't import the nodes I used into Unity. I'm open to learning Unreal Engine 4 but so far I have heard it doesn't import nodes into it, but it does have a material editor that maybe someone would know how to recreate. Answering any of the following questions would help: Would it be possible to import the material I am using into Unity and keep the texture (without baking)?  Is it possible to import the material into Unreal Engine?  Is there a game engine that would work best with blender and imports all the materials (I know blender has a game engine but I haven't heard great things about it)?  Is there a way to recreate the same texture in Unity or Unreal Engine (it isn't too complicated of a material, picture of the nodes is below)?  Thanks very much for the help, I'm new to game development and I just can't seem to get past importing the meshes to a game engine.

I have been experiencing an issue that once I have a material created and looking the way I want it, I cannot seem to export it correctly with the textures mixed.  I don't know the correct words to use, but in blender I have the material created using the nodes editor, and I have placed two textures inside of there (one for the rock texture and one for moss, my object is a rock). When I export this model and import to Unity (the game engine I am using), I find a materials folder but the material inside of it does not have the textures assigned, it's just a plain white material?  How can I export my material from blender in a way that it will allow me to import it WITH TEXTURES into Unity?


I am trying to make an SQL request with a LIKE clause, using prepared statement.  Here is the code :   using (SqlConnection Connection = new SqlConnection(ConnectionString))       {          Connection.Open();          string Query = "SELECT TOP 10 Field FROM Table WHERE Field LIKE '@pseudopart%'";                 using (SqlCommand Command = new SqlCommand(Query, Connection))                 {                     Command.Parameters.AddWithValue("@pseudopart", pseudoPart);                     using (SqlDataReader Reader = Command.ExecuteReader())                     {                         if (!Reader.HasRows)                             return PossibleMatch;                         while (Reader.Read())                         {                             PossibleMatch.Add(Reader["Field"].ToString());                         }                     }                 }             }   Reader is always empty, what am i doing wrong ?

Parameterized Queries in .Net always look like this in the examples:  SqlCommand comm = new SqlCommand(@"    SELECT *     FROM   Products     WHERE  Category_ID = @categoryid ",     conn); comm.Parameters.Add("@categoryid", SqlDbType.Int); comm.Parameters["@categoryid"].Value = CategoryID;   But I'm running into a brick wall trying to do the following:  SqlCommand comm = new SqlCommand(@"    SELECT *     FROM   Products     WHERE  Category_ID IN (@categoryids)        OR  name LIKE '%@name%' ",     conn); comm.Parameters.Add("@categoryids", SqlDbType.Int); comm.Parameters["@categoryids"].Value = CategoryIDs; comm.Parameters.Add("@name", SqlDbType.Int); comm.Parameters["@name"].Value = Name;   Where   CategoryIDs is a comma separated list of numbers "123,456,789" (without quotes) Name is a string, possibly with single quotes and other bad characters   What's the right syntax for this?


While studying the properties of Bessel's function I came across a proof as :-  $ J_0^2+2(J_1^2+J_2^2+ . . . . )=1$  I have tried this with the recurrence relations, but I didn't have any idea how to proceed.  Thankyou.

The generating function for a Bessel equation is:      $$g(x,t) = e^{(x/2)(t-1/t))}$$      Using the product $g(x,t)\cdot g(x,-t)$ show that:      a) $$[J_0(x)]^2 + 2[J_1(x)]^2 + 2[J_2(x)]^2 + \cdots = 1$$      and consequently:      b)      $$|J_0(x)|\le 1, \forall x$$      c) $$|J_n(x)| \le \frac{1}{\sqrt{2}}; n=1,2,3,\cdots$$   For a) I tried the product:  $$e^{(x/2)(t-1/t))}\cdot e^{(x/2)(-t+1/t))} = 1$$  I at least arrived at the right side of the equation. Since this generates the bessel functions, I should arrive at something related to $J_n$ in the left side. I know that  $$e^{(x/2)(t-1/t))} = \sum_{n=0\infty}^{\infty} J_n(x)t^n$$  $$e^{(x/2)(-t+1/t))} = \sum_{n=0\infty}^{\infty} J_n(x)(-t)^n$$  but it's not just a matter of multiplying coefficients from the two infinite series, right?  For $b$, I tried to use  but it's not as obvious  I have no idea how to deal with $c$, could somebody help me?


I am trying to find an $x$ and $y$ that solve the equation $15x - 16y = 10$, usually in this type of question I would use Euclidean Algorithm to find an $x$ and $y$ but it doesn't seem to work for this one. Computing the GCD just gives me $16 = 15 + 1$ and then $1 = 16 - 15$ which doesn't really help me. I can do this question with trial and error but was wondering if there was a method to it.  Thank you

I tried the solution using other ways like:  $12x+5y=7$  $12x=7-5y$  $x=7-5y/12$  putting the value of $x$  $12(7-5y/12)+5y=7$  both $12$ will cancel out  $7-5y+5y=7$ here comes the problem please help me ?


I had an anthology of short stories from the 70's or 80's. It included a humorous short story about a space fleet captain who received notice of an upcoming inspection of his ship.  After checking his ship he found the only thing missing was an "offog".  Despite his best efforts he and the crew could not identify this missing item.  To avoid a black mark he sent in a report that the "offog" had broken up due to gravitational stress and the remnants used in the engines for propulsion mass.  After getting notice of a fleet wide emergency grounding of all spaceships he received a notice demanding further details on how the ships "Official Dog" had broken up.  I cannot remember the name of the story, author or the anthology it was in.  Any help would be appreciated thank you.

Years ago I read a short story about a spaceship crew who were reviewing a checklist of equipment but couldn't figure out what one of the items was supposed to be (it was some sort of abbreviation). It was a military spaceship, so inspectors were used to make sure that no equipment was lost (and it would be a huge problem for them if they had to tell the inspector that they "lost" this item).  Rather than admit they couldn't find this piece of equipment they devised a scheme to report it as destroyed, and then they would be issued a new one and figure out what it was. They claimed it was destroyed in an FTL jump (or something similar). When this was reported, the high command immediately ordered all other spaceships grounded until the cause could be determined.  The reveal turned out to be that the item they were missing was      the ship's dog, who of course was perfectly fine and had been on the ship the whole time. They didn't realize it was the dog because the checklist item used an abbreviation. The high command ordered all ships grounded because they were concerned that there was a problem with the FTL technology that would harm dogs and humans.   I believe the story was written several decades ago, perhaps in the 70s or so. I think the author is fairly well known.  What is the title of this short story?


I was trying out bubble sort. I want to figure out how to determine the Big(o) of a particular algorithm.   public class BubbleSort {      public int[] bubblesort(int[] numbers){         int temp;         for(int i =0; i< numbers.length; i++){             for(int j = 1; j< numbers.length-i; j++){                 if(numbers[j-1] > numbers[j]){                     temp = numbers[j-1];                     numbers[j-1] = numbers[j];                     numbers[j] = temp;                 }             }         }         return numbers;     }      public static void main(String args[]){         int[] n = new int[]{4,3,2,1};          long startTime = System.nanoTime();         System.out.println(Arrays.toString(new BubbleSort().bubblesort(n)));         long endTime = System.nanoTime();         System.out.println("bubblesort : " + (endTime - startTime));     } }   The optimized bubble sort does this:   compare & swap 4,3; compare & swap 4, 2; compare & swap 4, 1; start again  compare & swap 3, 2; compare & swap 3, 1; start again  compare & swap 2, 1; done    From Wiki i see that worst case analysis is O(n^2). how they came to a conclusion that the worst case analysis of this algorithm is O(n^2). I want to see this programmatically on how they are coming to worst case analysis of a giving algorithm.  The algorithm does EXACTLY (n^2) operations from what i understand, is there a way to programmatically get the result?

I wonder whether there is any automatic way of determining (at least roughly) the Big-O time complexity of a given function?  If I graphed an O(n) function vs. an O(n lg n) function I think I would be able to visually ascertain which is which; I'm thinking there must be some heuristic solution which enables this to be done automatically.  Any ideas?  Edit: I am happy to find a semi-automated solution, just wondering whether there is some way of avoiding doing a fully manual analysis.


hello . how to get rid of this grey plane that hides my interior. in 3d view it doesnt appear but when i rendered it shows. I try to make some changes in render then camera setup.  please can anybody tell what to do.

Have Blender on about 4 machines rendering animations. Just spotted on one of the machines its rendering something different from the actual scene that I have setup.    Top window shows a different set of layers objects to whats actually being rendered in the rendering window below.  In my scene contents, layers objects 1-5 are not visible, but these are the ones that look like they are being rendered.  The only thing I can assume is that perhaps it might be because I did not save the document before clicking render, but I would not have expected that behaviour (you dont need to save your word document before printing it).  Can anyone confirm why this is happening?


I'm new to Ubuntu, I need to run Quicken till I find a good replacement for it. Ii heard we can run windows apps over wine. So I install Wine and then over wine I install Quicken?

Can .exe and .msi files (Windows software) be installed in Ubuntu?