I am trying to understand what could be the possible reason which would have caused tempdb ldf file grow full and went out of space on the drive it resides.  Compared the pattern for last month and today was the unusual behaviour of tempdb.   From third party tools i have all the SQl that were running in that 8 hour window but what exactly is the correct way to find the culprit process?

I would like to know how to identify the exact query or stored proc which is actually filling up the transactional log of TEMPDB database.


A  proposes Practiced Spellcaster to keep increasing the more valuable (Wizard) class.   The Practiced Spellcaster feat (Complete Arcane, p. 82) increases CL by 4, up to the character level. The  prestige class increases CL at levels 1, 4, 7 and 10, without any such limitation.   Can I count Practiced Spellcaster first, to reach my class level, then increase it by four, or is the feat completely wasted, is the difference between my CL and character level less than 4?

I have seen quoted several places on the internet a rule that one can apply bonuses and penalties in the most beneficial order.  An example I come across frequently (as a druid) is the combination of Natural Bond and . Natural Bond increases your effective druid level for determining the stats of animal companions but cannot increase it beyond your character level. Choosing an alternative animal companion lowers your effective druid level for determining the same stats. The "most beneficial order" rule is used to justify applying the level penalty before the natural bond bonus in order to get around the character level cap on natural bond.  Does this rule actually exist? If so, where does this rule originate? I would like to be able to cite a reliable source for my GM.


I don't know why I keep receiving the following error messages, when running apt-get update:  W: Failed to fetch http://ppa.launchpad.net/ferramroberto/sopcast/ubuntu/dists/trusty/main/binary-amd64/Packages  404  Not Found W: Failed to fetch http://ppa.launchpad.net/ferramroberto/sopcast/ubuntu/dists/trusty/main/binary-i386/Packages  404  Not Found

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


I cannot create the tcolorbox like above. Thanks to everyone for help

I would like to clone this box used on the tcolorbox manual, but I couldn't find the configuration in the manual.    Can you help me?


I just made a batch of macarons. This is my third total batch of them, and they become increasingly better - alas compared to my previous batch, these don't show much if any improvement even though I've changed how much I mix the macaron mass and how I pipe them.  Recipe:     ~150g egg-whites   ~70g finest sugar (not powdered!)   Mix with an older Kenwood chef until stiff and glossy   1 very flat teaspoon of vanilla extract (so about half a deep spoon)   ~3g of powdered green food coloring   More mixing with the Kenwood until well mixed, still stiff and glossy        ~150g sifted almond meal   ~250g sifted powdered sugar   pinch of salt   Mix well         Mix the almond/sugar stuff into the egg-whites using a rubber spatula until the consistence allows me to pour a figure-eight without globs breaking off        Pipe onto trays, let sit some 10-15min and rap every ~5min (rap 4 times, turning tray 90 deg after a few hits/raps)        Bake for 20min, middle height of oven1, at 150C   The first tray went into the oven as soon as the latter hit 150C:   The second tray had to wait for some ~20min while the other baked, during that time I rapped it a few times more but mostly let it sit:   What can I do to prevent my macarons cracking / how to change my recipe and/or process?  I see that there are positive results by letting them sit for more time, so I'm thinking about letting them sit ~1 hour next time I make a batch, and def rap them every 15min or so. What other changes/improvements should I make to my recipe?    1what's that called in english? I call it "Mittlere Backofenrille" in German

I've tried to make macarons eight times in a row and I failed. I used  (text version is in the description below the video).  They all cracked on top and the surface collapsed as you see in the picture. I did some research and watched youtube videos to find out what I am doing wrong. As I figured the following factor could be the reason behind ugly macaroons:   I read somewhere that the time you let the batch sit and dry before putting i the oven is an important factor. I let it rest for 45 minutes to one hour instead of 20-30 minutes, but the result was the same, if not worse. The other factor is beating egg whites to stiff peaks. There, I think this is where my problem come from. So I beat the egg whites with a pinch of salt to medium peak stage, then add in the sugar in 3 batches while mixing with hand mixer. After watching several videos I know what stiff peaks look like, or at least I think so. But trying the recipe keeping that point in mind it still had the same result:      What else is important in making macarons that avoid them crack? What am I missing?  The weird thing is, my first batch was a success without precise measurements and so on! Here is the picture:


On my Lava mobile, I run Android 4.2.2 as it came installed.  However, I want to remove Google completely. FWIW, I am not too pleased with the ToS and Privacy Policy of Google. Moreover, I almost don't use any Google services.  So, is there any way in which I can completely remove Google from Android?  I am a newbie. So, step-by-step instructions would be useful.

I have a Sony Xperia Z with version 4.1.2 running.  My question is about removing all of the Google baggage from the phone.  I have no Google account tied to my phone and would really like to get rid of all traces of Google from my phone for a few reasons:   Battery performance: Google services ranks in the top 3 of what uses up my battery Privacy: I try to minimize what Google siphons from my phone with the exception of Google maps Less Dependency: I don't want to be dependent on one company for all my needs.   So are there any Android versions out there that are minimalistic and do not invade your privacy?


I need to lock a file in unix/linux OS. I have googled and read about java.nio.channels Filelock and Reentrant File Lock . But both works in Windows but not in unix. Is there any other way of implementing a lock on file in unix? Any sample code would be highly appreciated.  Thanks, Vignesh

I have a Java process that opens a file using a FileReader. How can I prevent another (Java) process from opening this file, or at least notify that second process that the file is already opened? Does this automatically make the second process get an exception if the file is open (which solves my problem) or do I have to explicitly open it in the first process with some sort of flag or argument? To clarify: I have a Java app that lists a folder and opens each file in the listing for processing it. It processes each file after the other. The processing of each file consists of reading it and doing some calculations based on the contents and it takes about 2 minutes. I also have another Java app that does the same thing but instead writes on the file. What I want is to be able to run these apps at the same time so the scenario goes like this. ReadApp lists the folder and finds files A, B, C. It opens file A and starts the reading. WriteApp lists the folder and finds files A, B, C. It opens file A, sees that is is open (by an exception or whatever way) and goes to file B. ReadApp finishes file A and continues to B. It sees that it is open and continues to C. It is crucial that WriteApp doesn't write while ReadApp is reading the same file or vice versa. They are different processes.


Recently i asked . there i got to know that if question is changed completely then a person with edit privilege can roll back the question to old one. Now my question is suppose a partial answer is given (of significance) then the OP makes changes from my answer to his code and waits for rest part of his solution. this makes my answer look irrelevant since already the changes that my answer suggested are reflected in question. so what can be done?

Please have a look at . When the question was asked by the OP, it had a scope related problem in the code snippet posted in it. 2 answers were posted for that question. But after the answers were posted, a friend of mine from Stack Overflow, edited the question(not sure with what intention) in such a way that the bug in the code was gone(it actually self answered the question). Please have a look at the question revision history, where I've rolled back the question to the original state, which has the problem in place.  My question is that, should such a practice be allowed/encouraged that an edit to a question renders all the answers posted for that question, totally irrelevant? As anybody who comes to have a look at the question later, will be highly confused as to why a question was asked without any problem and there were so many answers posted to it(not everybody cares to go through the revision history)? I happened to notice that, but not everybody would notice it.


Consider the ODE  $$y'=f(y(t)),y(0)=a\in\mathbb{R}$$ Where $$f:\mathbb{R}\rightarrow\mathbb{R}$$  Which of the following statements are necessarily true?  $A.$ There exist a continuous function $f:\mathbb{R}\rightarrow\mathbb{R}$ and $a\in\mathbb{R}$ such that the above problem does not have a solution in any neighbourhood of $0.$  $B.$ The problem has a unique solution for every $a\in\mathbb{R}$ where $f$ is lipscitz continuous.  $C.$ When $f$ is twice continuously differentiable, the maximal interval of existance for the above I.V.P. is $\mathbb{R}.$  $D.$ The  maximal interval of existance for the above problem is $\mathbb{R}$ when $f$ is bounded and continuously differentiable.  According to me $A$ is false by Picard existance theorem, and $B$ is true and for $C$ $y'=y^{2}$ is counterexample. I have no idea about option $D.$ Please help me to handle option $D.$ In answer key option $D$ is given correct. Thanks in advance.

Consider the IVP $$y'(t)=f(y(t)), \ \ \ \ y(0)=a \in \mathbb{R}$$ $$f : \mathbb{R} \rightarrow \mathbb{R}$$ Which of the following is/are true $(A)$  There exists a continuous function $f : \mathbb{R} \rightarrow \mathbb{R}$ and $a \in \mathbb{R}$ such that the above problem does not have a solution in any nbd of $0$. $(B)$  The problem has unique solution for every $a \in \mathbb{R}$ when $f$ is Lipschitz continuous $(C)$ When $f$ is twice continuously differentiable the maximal interval of existence for the above IVP is $\mathbb{R}$ $(D)$ The maximum interval of existence  for the IVP is $\mathbb{R}$ when $f$ is bounded and continuously differentiable.  It is obvious to me that $A \ \& \ B$ are false from traditional existance and uniqueness theorems (viz Picards Theorem). I am not sure about $C \ \& \ D$ and this is really bugging me. Please could anyone shed light on this. PS: Multiple correct options are allowed.


I learned that to start a thread the recommended way is to invoke start() method on thread object. But this in turn invokes the run() method. So why not directly invoke run() method?  Here's what I tried but I fail to bring any conclusion :  public class Tester {       public static void main (String[] args) {         Runner r = new Runner();          Thread t1 = new Thread(r, "Thread A(runnable)");         Thread t2 = new Thread(r, "Thread B(runnable)");          Thread s1 = new Strider("Thread C");         Thread s2 = new Strider("Thread D");          t1.run(); // t1.start();         t2.run(); // t2.start();         s1.run(); // s1.start();         s2.run(); // s2.start();       }     }      class Runner implements Runnable {       private int counter;       public void run() {         try {           for (int i = 0; i != 2; i++) {             System.out.println(Thread.currentThread().getName() + " Runnable: "                    + counter++);             Thread.sleep(1000);           }         }         catch(InterruptedException e) {           e.printStackTrace();         }       }     }      class Strider extends Thread {          private int counter;       Strider(String name)    {         super(name);       }       public void run()   {         try {           for (int i = 0; i != 2; i++) {             System.out.println(Thread.currentThread().getName() + ": "                  + counter++);             Thread.sleep(1000);           }         }         catch(InterruptedException e)     {            e.printStackTrace();         }       }     }   OUTPUT (using start()) : varies  Thread A(runnable): 0 Thread C: 0 Thread B(runnable): 1 Thread D: 0 Thread B(runnable): 3 Thread D: 1 Thread A(runnable): 2 Thread C: 1   OUTPUT (using run()) : always remains same  main Runnable: 0 main Runnable: 1 main Runnable: 2 main Runnable: 3 main: 0 main: 1 main: 0 main: 1   Also kindly provide your opinion on why not to use run() directly ?

When would you call Java's thread.run() instead of thread.start()?


Never give up on someone with a mental illness. When "I" is replaced by "We", Illness becomes Wellness.

What is the rule for comma placement before a quotation mark? When should the comma go before and when should it go after the quotation mark?


Im running OSX 10.13 and my preferred browser is Google Chrome, i have set this as my default browser.   Every time i open Chrome i get the following alert (see screenshot) is this normal ? And can i set it to remember my answer so it doesn't keep asking me ?

In previous versions of the OS in the security pane, you are provided an option of:    But in this version there is no option anywhere:    Is there a way that I can turn on anywhere? (via Terminal maybe?)


So today, I asked a question on  and received the following  about this being a legal issue and not being allowed on UX. Why wasn't this post migrated to the Legal Stack Exchange? How do you migrate and why isn't it done more?

I posted a question which was closed as off-topic and it seems like it could fit on another site in the network. How can I go about moving it there?   What is migration? When can a question be migrated, and who can migrate it? When should I consider migration, and when is it inappropriate? What causes a migration to be blocked and what happens after? What causes a migration to be rejected and what happens after? Anything else I should know about migration?


I have a project to do and at the moment i have 2 tif images and their geografic data(longitude latitude) of their upper left pixel.What i want to do is get the common geografic place of the 2 images...so i want to get lonitude,latitude so that i can only keep the parts of the images that show the same geografic place.  The 2 images show deferent information for that place...for example the first one i a simple image and the second one shows the humidity level. I want first to find the common place for each picture so that later i make the pictures to have the same width and length so that i can go back and forth on these 2 pictures looking at the same place but different information.  So, is my idea of finding the common place by each pixel'l geodata a good idea?   if yes...how would i do that?  if no...how should i do it?

I have a set of aerial images which I am trying to clip by their overlapping areas, for use in a more involved program I am writing.  Is there a command line based tool out there with an easy method for extracting the overlapping areas from a pair of images?  The images themselves do not have georeferencing, but they DO come with a shapefile containing bounding boxes of the image collects, as well as IMU data from image collection.  I know this may be difficult since the images will have slight perspective differences, but I was hoping it would still be possible--especially since I am trying to maintain and utilize these perspective differences for something else.


My main activity      public void removefunction(){     List<CartItem> cartItems = getCartItems(cart);     cart.remove(cartItems.get(position).getProduct());     cartItems.remove(position);     cartItemAdapter.updateCartItems(getCartItems(cart));     cartItemAdapter.notifyDataSetChanged();     tvTotalPrice.setText(Constant.CURRENCY+String.valueOf(cart.getTotalPrice().setScale(2, BigDecimal.ROUND_HALF_UP))); }   Adapter code    btnremove= (Button) convertView.findViewById(R.id.btnrem);      btnremove.setOnClickListener(new View.OnClickListener() {         @Override         public void onClick(View v) {              ((ShoppingCartActivity) context).removefunction();           }     });   Cause null pointer exception in tvTotalPrice.setText      FATAL EXCEPTION: main                                                                             Process: com.android.tonyvu.sc.demo, PID: 7601                                                                             java.lang.NullPointerException: Attempt to invoke virtual method 'void   android.widget.TextView.setText(java.lang.CharSequence)' on a null   object reference at   com.android.tonyvu.sc.demo.ShoppingCartActivity.removefunction(ShoppingCartActivity.java:263)                                                                                at   com.android.tonyvu.sc.demo.adapter.CartItemAdapter$1.onClick(CartItemAdapter.java:98)                                                                                at android.view.View.performClick(View.java:6205)                                                                                at android.widget.TextView.performClick(TextView.java:11103)

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


I want to define a template class with complex behavior. I have trouble with template specialization. To avoid giving the definition of the member functions to the final user, I went for the classic header declaration and source definition. However, how can the user instantiate the class with his custom objects while he does not have the template class definition ? Hereinafter an example with strong types.  // metatype.h #ifndef METATYPE_H #define METATYPE_H  #include <utility>  template<typename Type, typename Parameter> class MetaType { public:     MetaType(const Type &value);     Type &get(); private:     Type value; };  #endif // METATYPE_H  // metatype.cpp template<typename Type, typename Parameter> MetaType<Type, Parameter>::MetaType(const Type &value) : value(value) { }  template<typename Type, typename Parameter> Type &MetaType<Type, Parameter>::get(const Type &value) {     return value; }  // main.cpp #include <iostream> #include "metatype.h"  using Real =MetaType<double, struct RealType>;  int main() {     Real a(3);     std::cout << a.get() << std::endl;     return 0; }   Problem is I have compiling errors due to missing definition of the template specialization. Is there a way to avoid giving the definition to the final user, especially when a complex behavior of the template class is defined ?  Thank you for your anwsers.

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


I want to grant a tech person ssh root access to my Oracle Linux Server 7.7 in the Oracle Cloud Infrastructure to configure something. How can I protocol/log for a ssh user everything he does?  I am aware that he may tamper with protocols (root rights) but I am not expecting him to do so.

I want to monitor all user's activity in my server.  Even when the user executes a shell command from some editor like vim I want to see them in the log file.  I have checked the tool acct but it is not listing the complete commands. (Please correct me if I have missed some options which does already).  Which Linux tool I should be looking at to solve this problem?


I'm running Homebrew on macOS High Sierra 10.13.6. I use a bash alias brewup to periodically check on my installation.  brewup is defined as below:  alias brewup= 'brew update; brew upgrade; brew prune; brew cleanup; brew doctor'   Recently, when running brewup, the output from the brew prune portion of the command has been:  Pruned 0 symbolic links and 2 directories from /usr/local.  Every single time I run the brewupcommand, even after restarting, hand checking /usr/local for excess directories, recreating the brewup alias, and completely reinstalling Homebrew and all my packages, I  always get the output Pruned 0 symbolic links and 2 directories from /usr/local.    The mystery deepenes even further, because when I run just brew prune, I get, as expected, no pruned results whatsoever. Something in the order of the commands contained in brewup is causing phantom excess directories to appear, over, and over, and over again.  Can someone help me exorcise these phantom directories?

I am running Homebrew on 10.13.6, with the prefix /usr/local.    When I run brew upgrade, two directories are created in /usr/local/share.  These are: /usr/local/share/man/man2, and /usr/local/share/man/man6.  There are no files in these directories.  Meanwhile, whenever I run brew prune --verbose, I get the output:  rmdir /usr/local/share/man/man6 rmdir /usr/local/share/man/man2 Pruned 0 symbolic links and 2 directories from /usr/local   Whenever brew upgrade, these two troublesome directories are then re-created! The cycle continues, on and on and on.  I have repeatedly run brew update, brew cleanup, and brew doctor.  I have even reinstalled Homebrew and all my packages.  Yet, the eternal battle between brew upgrade and brew prune continues.  How can I get them to stop fighting?


So i am working on an implementation of a singly linked list and i have run into the dreaded null pointer exception. Here's my code:  class Link {    public Object data;    public Link next; }  class List {    private Link _head;    private Link _tail;    private int counter = 0;     public List()    {       _head = null;       _tail = null;    }     public void insert(Object item, int pos)    {       if (pos == counter)       {          insertAtEnd(item);          return;       }        Link temp = _head;       for (int i = 1; i < pos; ++i)       {          temp = temp.next;       }        Link added = new Link();       added.data = item;       added.next = temp.next;       temp.next = added;       ++counter;    }     public void insertAtEnd(Object item)    {       if (_head == null)       {          Link added = new Link();          added.data = item;          added.next = _tail;          _head = added;       }       else       {          _tail.next = new Link();          _tail = _tail.next;          _tail.data = item;       }       ++counter;     }     public void deleteRange(int start, int end)    {       Link temp = _head;       Object deleted;        for (int i = 1; i < start - 1; ++i)       {          temp = temp.next;       }       for (int i = start; i < end; ++i)       {          deleted = temp.next.data;          temp = temp.next;          --counter;       }       temp.next = temp.next.next;    }     public void deleteAll(Object item)    {       Link temp = _head;       Link temp2 = _head;       Link prev = null;       Object deleted;       int times = 0;        for (int i = 1; i <= counter; ++i)       {          if (temp.data.equals(item))             ++times;          temp = temp.next;             }        for (int i = 1; i <= counter; ++i)       {          prev = temp2;          if (temp2.data.equals(item))          {             deleted = temp2.data;             temp2 = prev;          }          temp2 = temp2.next;        }       counter = counter - times;    }     public Object retrieve(int pos)    {       Link temp = _head;        for (int i = 1; i < pos; ++i)       {          temp = temp.next;       }       return temp.data;    }     public List find(Object item)    {       Link temp = _head;       Link prev = null;       int count = 0;       boolean found = false;       List positions = new List();       positions.insertAtEnd((Integer) count);       return positions;     }     public int getSize()    {       return counter;    }     public String toString()    {       Link temp = _head;       String s = "";       while (temp.next != null)       {          s += temp.data + ", ";          temp = temp.next;       }          return s;       }   When calling the toString method to test my code, the null pointer exception pops up. I think my problem lies in my insertion methods but i am not completely sure. I am fairly new to programming and i just can't fully wrap my head around the singly linked list dynamic data structure  Thanks in advance!


In the UK (and sometimes Australia), a vacuum cleaner will be called a hoover, regardless of its brand. Likewise, the verb "to vacuum" is replaced with "to hoover".  With a brand name being used in such a way, does it still require a capital letter? Why or why not? Does its capitalisation depend on region?

When using a trademark as a verb ("hoovering", "xeroxing", "photoshopping" and "googling"), should it be capitalized or uncapitalized?  Strictly speaking, Google and Adobe are opposed to their trademarks being used as verbs or as generic trademarks, but that's a separate topic.


I'm trying to update to Ubuntu 15.04 from 14.04. I created a live usb, booted to it, and chose to upgrade to 15.04 in the install menu. It's been stuck on "Removing conflicting operating system files" for around 5 hours so far. Is it supposed to take this long? If not, what can I do about it?

The process is not stuck because the terminal shows "progress", it keeps trying to remove files that it can't find, the messages read something like: /..../file x: Warning: Source ID XXXXXX was not found when attempting to remove it  The reason I am reinstalling is because my installation was messed up when I installed ubuntu-touch and the system wouldn't reboot.   I was able to fire up a live USB through grub and start the installation process, I figured it would be possible to simply reinstall but it seems to be taking forever. Is this normal behavior? Should I stop it and simply go with a fresh install instead?  Thanks!


I am currently write some papers, and i just find out that some of DOI links doesn't get breaked.  I have already breaklinks=true in hyperref, but it still doesn't work...  looks like this:   here is a minimal example for it:  \RequirePackage{filecontents}  \begin{filecontents}{bib.bib} @ARTICLE{fspresult_fitting,      author={Riss D. and Hamzavi J.S. and Selberherr A. and Kaider A. and Blineder M. and Starlinger V. and Gstoettner W. and Arnoldner C.},      journal={Otology \& Neurotology},      title={Envelope versus fine structure speech coding strategy: a crossover study},      year={2011},      volume={32},      number={7},      pages={1094-1101},      doi={10.1097/MAO.0b013e31822a97f4},      month={September}, }  \end{filecontents}   \documentclass[12pt, a4paper, bibliography=totoc, listof=totoc, numbers=noendperiod, abstracton, parskip=half, headsepline %, plainheadsepline ]{scrreprt} \usepackage[hmargin=2cm, vmargin=3cm]{geometry} % for back reference in bibliography \usepackage[hidelinks,breaklinks=true]{hyperref}  % for biblatex with biber \usepackage[backend=biber,sorting=none, maxnames=5]{biblatex}   \addbibresource{bib.bib}  \begin{document} cite test \cite{fspresult_fitting}.  %%% bibliography \printbibliography \end{document}

I've prepared my bibliography using biblatex, and my DOI addresses are not breaking their lines properly. I know that using pdflatex will solve this issue, I have to compile my document using latex -> dvips -> ps2pdf due to using pstricks.  Using the information from  , I tried using the breakurl package, and discovered that URLs line-break properly, but the DOIs still do not.  Any help would be appreciated.   Here is a MWE  \documentclass{article} \PassOptionsToPackage{hyphens}{url}\usepackage{hyperref} \hypersetup{colorlinks,linkcolor=[RGB]{0,0,150}, citecolor=[RGB]{0,123,0},urlcolor=[RGB]{80,0,100}} \usepackage[anythingbreaks]{breakurl} \usepackage[citestyle=authoryear-comp,]{biblatex} \usepackage{filecontents}  \begin{filecontents}{\jobname.bib} @article{liu2013condition, title={Condition-based maintenance for continuously monitored degrading blah blah blah longer title}, author={Liu, Xiao and Li, Jingrui and Al-Khalifa, Khalifa N}, journal={IIE Transactions}, volume={45}, number={4}, pages={422--435}, year={2013}, publisher={Taylor and Francis}, doi = {10.1080/0740817X.2012.690930}, url={https://tex.stackexchange.com/questions/20768/how-to-allow-line-break-in-a-long-hyperlink-in-a-pdf-compiled-by-latex-dvips-ps2} } \end{filecontents} \addbibresource{\jobname.bib} %Loads bibliography file \usepackage[utf8]{inputenc} \nocite{*}  \begin{document}  \printbibliography \end{document}


I spent the last three days trying to install Ubuntu 18.04.5 LTS alongside Windows 10 Home, but without any success. The problem is that as soon as I boot Ubuntu from the USB and I start the installation process it freezes. The mouse does not move, the keyboard stops working, etc, and it justs reboots. I have tried all possibilities. Changed USB, tried Ubuntu 20.04 instead, various parameters before booting from GRUB, including:  nomodeset nouveau.modeset=0 acpi=off  but nothing seems to work. My system is a custom build pc with the following specs:  CPU: AMD Ryzen 3900 GPU: NVIDIA RTX 3060 ti SSD: NVME Vyper 1TB MB:  ASROCK PHANTOM GAMING 4 RAM: 32 GB  Any help would be much appreciated. I really tried all I could, but I am running out of options now. Thanks!

I want to burn Ubuntu Minimal CD ISO to an old, 1 GB USB thumbdrive. Regular ISO doesn't fit. I already tried Startup Disk Creator and Unetbootin but both failed. I tried installing GRUB and pointing it to boot like this:  insmod part_msdos linux /linux initrd /initrd.gz   but it doesn't work. I also tried dd but I ended up with not bootable drive.  Rufus worked on Windows with the same thumbdrive but I no longer use Windows.  What else can I do?


Gravity causes anything with energy to accelerate toward the source. Black holes, for example, have such strong gravity that they pull in light and don't let any escape. But can acceleration still apply to light? The speed of light is constant, of course, but why are photons affected by gravity yet aren't accelerated by it?  Edit: My main question is why photons aren't affected in the same way as most other particles. I'm perfectly aware that it cannot surpass lightspeed, but I want to know what makes it unaffected by acceleration while other particles are affected.

We know that gravity speeds up a body; for instance, a meteor which enters the earth gets constantly accelerated up by earth's gravity. And from relativity we know that light bends near a massive body, because Newton's law of gravitation is just an approximation and actually gravity depends on energy and momentum. So my question is: If a ray of light is aimed exactly at the center of a body, then will it get accelerated like a meteor? And if does get accelerated, then won't it surpass the universal speed limit of 3,00,000 km/s (approx.)?


Prove that $\{\mathbb e^{r_1x}, \mathbb e^{r_2x}..., \mathbb e^{r_nx}\}$ are  linearly independent where $r_1,r_2,...r_n$ are not equal.  now I know that this question has been asked before but it's not the same this doesn't end up to be a  Vandermonde matrix. so is there a workaround this as well.

Given $\left\{ a_{i}\right\} _{i=0}^{n}\subset\mathbb{R}$ which are distinct, show that $\left\{ e^{a_{i}t}\right\} \subset C^{0}\left(\mathbb{R},\mathbb{R}\right)$,  form a linearly independent set of functions.   Any tips on how to go about this proof. I tried a working from the definition of an exponential and combining sums but that didn't seem to get me anywhere. I saw a tip on the internet that said write it in the form  $\mu_{1}e^{a_{1}t}+\dots+\mu_{n}e^{a_{n}t}=0$ to try to show $\mu_{1}=\dots=\mu_{n}=0$ considering each term of the left hand side must be positive, but I can't get my head around that because while I understand $e^{x}>0\forall x\in\mathbb{R}$ I cannot see why $\mu_{i}$ must be positive in any case. I have thought about differentiating but that doesn't seem to help. The question did originally ask for a "rigourous" proof but I'll take any hints right now and the provided the solution of 'is obvious' is most unhelpful to me.  Any input would be fantastic. Thank you.


I am trying to create a page on where i try to let the footer stick at the bottom of the page. It will stick but the problem is that if the browser will be minimized that the footer will go through the content of the page, but actually i want that it stays at the bottom of the page and when the browser is minimized that there will be a scroll bar.   A picture what happens when browser is minimized:    If the browser is big enough then it is ok:    This also happens with the menu:    Can anyone hint me which settings are wrong? I use this setup:

   This is the code:    Thanks for help

I have a simple 2-column layout with a footer that clears both the right and left div in my markup.  My problem is that I can't get the footer to stay at the bottom of the page in all browsers.  It works if the content pushes the footer down, but that's not always the case.


Since in modern day programming we use ArrayList more often, what would be a use   case where vector would be used.

I've always been one to simply use:  List<String> names = new ArrayList<>();   I use the interface as the type name for portability, so that when I ask questions such as these I can rework my code.    When should  be used over  and vice-versa?


I have server from OVH, the HOST-64L, that has an Intel Xeon D-1520 and 64GB DDR4 ECC 2133 MHz ram. I have it configured with three 600GB SAS drives. I believe this is an overshot to sell VPN's. What are the bare minimum needs that a server might have to run decent to good VPNs? The server I have now is not cost effective as I have yet to start selling. Thanks.

This is a  about  Related:      I have a question regarding capacity planning. Can the Server Fault community please help with the following:   What kind of server do I need to handle some number of users? How many users can a server with some specifications handle? Will some server configuration be fast enough for my use case? I'm building a social networking site: what kind of hardware do I need? How much bandwidth do I need for some project? How much bandwidth will some number of users use in some application?


I already have Ubuntu and I want to dual boot windows alongside this beautiful operating system. Can I get a tutorial from someone where I don't have to re-install Ubuntu and start from scatch? Thank you, Ubuntu users.

I have Ubuntu on my laptop. Now I want install Windows 7 in a dual-boot. How can I do this? I can't lose my Ubuntu files, and I'm afraid that I might break . Go  for UEFI only!


On Ubuntu 18.04 when rearranging dock by drag and drop, icon drags but does not drop-- flies back to former place.

In Ubuntu 17.10, how do I rearrange the application icons in the dock area? I have tried many ways but failed, such as:   right-click the icons left-click or right-click the empty space in the dock


So, i am not talking abut time to load or anything like that but time taken by logic. Here is an example i created: Main.java public class Main{     public static void main(String[] args) {         double prev, curr, value;         value = 0;         prev = System.nanoTime();         for(int i=0;i<100000000;i++){             value = value + i;         }         curr = System.nanoTime();         System.out.println("(ADD)Time taken : " + (curr-prev));     } }  Very simple thing. But the output is : java Main.java (ADD)Time taken : 1.306895E8 java Main.java (ADD)Time taken : 1.299587E8 java Main.java (ADD)Time taken : 1.300052E8 java Main.java (ADD)Time taken : 1.292961E8 java Main.java (ADD)Time taken : 1.297695E8 java Main.java (ADD)Time taken : 1.297917E8 javac Main.java java Main (ADD)Time taken : 1.283857E8 java Main (ADD)Time taken : 1.282398E8 java Main (ADD)Time taken : 1.282053E8 java Main (ADD)Time taken : 1.281581E8 java Main (ADD)Time taken : 1.285055E8  So there is a slight difference in compiled and the other but there is this difference. But an answer () states that :  java HelloWorld.java is informally equivalent to   javac -d HelloWorld.java java -cp hello.World  So both should be same? And for my simple example the difference is negligible but how does this delay scale with the code? One more thins if i increase the iterations the trend continues:- For 1000000000 iterations. java Main.java (ADD)Time taken : 1.26232E9 java Main.java (ADD)Time taken : 1.2705406E9 java Main.java (ADD)Time taken : 1.4233682E9 java Main.java (ADD)Time taken : 1.2820972E9 java Main.java (ADD)Time taken : 1.2658335E9 javac Main.java java Main (ADD)Time taken : 1.2689425E9 java Main (ADD)Time taken : 1.2650758E9 java Main (ADD)Time taken : 1.2631577E9 java Main (ADD)Time taken : 1.2649529E9 java Main (ADD)Time taken : 1.2782424E9 java Main (ADD)Time taken : 1.264107E9

How do you write (and run) a correct micro-benchmark in Java?  I'm looking for some code samples and comments illustrating various things to think about.  Example: Should the benchmark measure time/iteration or iterations/time, and why?  Related:


I'm trying to show that $ |g(z) +g(-z)| \leq 2|z|^{2}, z\in \mathbb{D}, g:\mathbb{D} \rightarrow\mathbb{D}, g(0)=0$ I applied Schwarz's lemma and got $|g(z)| \leq |z|$ and $g(-z)\leq |-z|=|z|$. $$|g(z)+g(-z) | \leq |g(z)| +|g(-z)| \leq 2|z|$$ the first inequality follows from the triangle inequality. But, I'm now stuck as I cannot just say that $2|z|\leq 2|z|^2$ since $z\in \mathbb{D}$ where it it is not true. Where do I go from here?

Let , $\Delta = B(0,1)$.  If $f:\Delta \rightarrow \Delta$ is holomorphic, and $f(0)=0$, prove that $|f(z)+f(-z)| \leq 2|z|^2$.  My attempt so far:  $\displaystyle f(z) = \sum_{n=0}^{+\infty} a_n z^n = \sum_{n=0}^{+\infty} a_{2n} z^{2n} + \sum_{n=0}^{+\infty} a_{2n+1} z^{2n+1}$  $\displaystyle f(-z) = \sum_{n=0}^{+\infty} a_n (-z)^n = \sum_{n=0}^{+\infty} a_{2n} z^{2n} - \sum_{n=0}^{+\infty} a_{2n+1} z^{2n+1}$  Then, $\displaystyle f(z)+f(-z) = 2  \sum_{n=0}^{+\infty} a_{2n} (z^2)^n =: 2 g(z^2)$  If $g(\Delta) \subset \Delta$, as $g(0) = 0$, I can invoke Schwarz Lemma and I win. However, I don't know how to prove this. Could anyone help me? Thanks!


I mean, how can I find the total list of description for AcceptedAnswerId in the post schema?

Stack Exchange releases "data dumps" of all its publicly available content roughly every three months , and also makes that information queryable over the Internet at the  (SEDE) (updated weekly, on Sunday). Over time, as new features and other bits of data are introduced to Stack Exchange sites, the "anatomy" of the data dump is likely to change.


I'm building a MVC application for managing a creative portfolio (Going to put it on git hub). I need something to secure the DB connections, basically I have one class to manage ALL DB transactions.   I need to either create a class or find a class that can protect all SQL queries from XXS or SQL Attacks. What suggestions do you have for securing PHP Database connections?

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


I was trying to determine whether or not the following sum, $$\sum_{n=1}^{\infty}\left(\frac{\sin(n)}{n}\right)$$, would converge or diverge. I thought that this function would diverge, as it is comparable to the harmonic series, which is $$\sum_{n=1}^{\infty}{\frac{1}{n}}$$, but I remembered that the ranges from 0 to 1. So, it can be viewed as having $(-1)^n$, which means this sum would converge as $$\lim_{n\to\infty}{\frac{\sin(n)}{n}} = 0$$  So, what value would the sum converge to?

I noticed that a lot of the time, people ask whether the following sum converges:  $$\sum_{n=1}^\infty\frac{\sin(n)}n$$  Though I've never stopped to ask what it equaled.  According to this , the sum is given as  $$\sum_{n=1}^\infty\frac{\sin(n)}n=\frac{\pi-1}2$$  The solution involves realizing $\sin(n)=\Im e^{in}$ and the Taylor expansion for the natural logarithm.  While thats great and all, how can I prove this using only real numbers?


Let say I want to truncate SHA256 to 128 bits. What would be the best way to minimize a probability of a collision and improve collision resistance?   Taking the last 16 bytes Taking the first 16 bytes XORing the first 16 bytes and the last 16 bytes together   And should I assume that the same logic will apply for other hash functions from the SHA-2 set (like SHA516) as well as other hash functions in general, for example, SHA-1 or MD5?

I have the need for a hexadecimal token that is smaller than the normal length of the hexadecimal representation of a  hash.  Should I take the first bits or the last bits? Which of them contain the most entropy?


I've read about closures many times .  But I'm really confusing to know exactly what do closure mean?   Is variable a closure ? Or, is function is a closure ? Or, both can be called a closure ?

How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help.


I am new to HLSL and Directx. I was trying to write a simple gradient Shader by modifying one of Microsoft samples.  1.I can not understand why SV_POSITION is float4? If it is pixel coordinates shouldn't it have only x and y ? What are the 4 parts? I think SV_POSITION is not between 0,1 and the maximum val is bufferWidth,bufferHeight ... then how can I get the position between 0,1?   The first code does not work because distance between float2 and float4 is impossible. While the second one works I get a warning. How can I avoid the warning message because I believe something is wrong!   Fist code (Of course it should not work):  float4 VS( float4 Pos : POSITION ) : SV_POSITION {      return Pos; }  float4 PS(   float4 Pos : SV_POSITION) : SV_Target {     float distfromcenter=distance(float2(0.5f, 0.5f), Pos);     float4 rColor = lerp(float4(0,0,0,1),float4(1,1,1,1), saturate(distfromcenter));     return rColor; }   The second one :  float4 VS( float4 Pos : POSITION ) : SV_POSITION {      return Pos; }   float4 PS(   float2 Pos : TEXTCOORD  ) : SV_Target {     float distfromcenter=distance(float2(0.5f, 0.5f), Pos);     float4 rColor = lerp(float4(0,0,0,1),float4(1,1,1,1), saturate(distfromcenter));     return rColor; }   Why do I get this warning ? How can I compile this Shader using SV_POSITION to avoid the warning message ?  D3D11 ERROR: ID3D11DeviceContext::Draw: Vertex Shader - Pixel Shader linkage error: Signatures between stages are incompatible. The input stage requires Semantic/Index (TEXTCOORD,0) as input, but it is not provided by the output stage. [ EXECUTION ERROR #342: DEVICE_SHADER_LINKAGE_SEMANTICNAME_NOT_FOUND]

What are the uses for SV_POSITION in the pixel shader?  Previously this was the POSITION semantic and it wasn't readable in the pixel shader, but now that it is, what can it be used for?  In an SM2 deferred renderer, you'd typically take the texture coordinates, transform them to the [-1, 1] range and then use an inverse view/position matrix to get the world position of a pixel.  Would SV_POSITION be usable here to reduce any of the calculations?  And if so, how would you do that?


I want to try out a different desktop environment that my brothers using as it was looking pretty good but I have no experience using it. So I was just wondering if I could install it on my pc without deleting existing ones. I have KDE and gnome installed in pc and is it possible to install one more without deleting any of the existing two? If possible that also mention how many desktop environment can be installed in one system.  My current os is ubuntu 18.04.3  thank you!

I am using Ubuntu 12.04. I want to try out KDE and other desktop environments.   But I'm not sure if I'll like them enough to switch permanently. I want to be safe and make a transition in a piecemeal fashion.  Is it possible to install KDE on Ubuntu and yet not do away with the default Unity shell?  Could I install multiple desktop environments and switch between them by tweaking some startup configuration and then rebooting?


We are using Google Custom Search and we have found that often the total results iterates between two values, even for the same query. The different values can be slightly different or more than double.  The parameters I am using look like this:  https://www.googleapis.com/customsearch/v1? q=something cx=XXXXXXXXXX lr=lang_en siteSearch=www.mydomain.com start=1 fields=context%2Citems%28fileFormat%2CformattedUrl%2Clink%2Cpagemap%2Csnippet%2Ctitle%29%2Cqueries%2CsearchInformation%28searchTime%2CtotalResults%29%2Cspelling%2FcorrectedQuery key=YYYYYYYYYYYYYYY filter=0   This is problem because of calculating the number of result pages. How can I get the same results for the same query?

I have generated a code from  .  I want to fetch the results for a keyword exactly same as the results on www.google.com So I put www.google.com in sites to search textfield and english is the language and then create the code.  But when I am using this code and fetching results on my websites these results are different from google.com.


I'm working through problems in the book Einstein Gravity in a Nutshell by Zee, and I'm stuck on one of the harder problems. The problem is  Calculate $[J_{(mn)}, J_{(pq)}]$.  We are given that $[J_{(mn)}, J_{(pq)}] = i(\delta_{mp}J_{(np)} + \delta_{nq}J_{(mp)} - \delta_{np}J_{(mq)} - \delta_{mq}J_{(np)})$, and that $J^{ij}_{(mn)} = -i(\delta^{mi}\delta^{nj} - \delta^{mj}\delta^{ni})$.  I started off writing the commutator definition: $[J_{(mn)}, J_{(pq)}] = J_{(mn)}J_{(pq)} - J_{(pq)}J_{(mn)}$.   I'm rather new to indices and I keep getting stuck on how to write the above equation in index notation. I'm also a little confused on how to move between the $\delta_{ij}$ and $\delta^{ij}$ in the problem. Is there a trick I'm missing or is this just a problem involving a lot of algebra?  I see that there is another question here that is very similar, although I think my question is more about doing the algebra with the indices. This might be the wrong place to ask such a question, though.

How does one show that the bracket of elements in the Lie algebra of $SO(n,m)$ is given by  $$[J_{ab},J_{cd}]  ~=~ i(\eta_{ad} J_{bc} + \eta_{bc} J_{ad} - \eta_{ac} J_{bd} - \eta_{bd}J_{ac}),$$  where $\eta$ has is the definite symmetric form with signature $(n,m)$?


I am attempting to get a list of "last logon time" of "all users" on Windows Server 2012. This is 'not' for Active Directory; This server's purpose is only for RDP Connections/RDP Logins. I currently only know of how to list a single user login, which is:  net user username | findstr /B /C:"Last logon"  Any ideas? Thanks in advance.

I am attempting to get a list of "last logon time" of "all users" on Windows Server 2012, but currently only know of how to list a single user login, which is:  net user username | findstr /B /C:"Last logon"  Any ideas?  *P.S. This servers only purpose is to host the RDP connections; not tied to a domain/AD.


So my english isn´t the best so the upper formulation was the best I could write xD. When you move an object for example 3 Units to the right, the 3 axes also move 3 Units to the right. But in the Project I´m currently working on(IPhone SE or something like that) the axes now always stay at the global Center which is pretty annoying, and I have had this Problem for a few times already and I never found the solution :X

I am just learning Blender. I am going through the .  The first part was good. I was able to follow it. Coming from SketchUp, it is taking some adjustment. But I am getting it.  I am just starting the second video. At the beginning, the instructor selects the top of the mug to extrude it. When he presses the E key and Enter, the red, green blue axis moves to the center of those vertices. That does not happen when I press the E key and Enter.   This is only 1:30 into the video.  How can I get the axis in the middle of this circle of vertices?  The next step is to scale. I need the reference point in the middle of this circle of vertices. I cannot left-click accurately enough to position the axis/reference point.  I am using 2.69. The video uses 2.64.


I have seen circuits involving crystal oscillators connecting two capacitors between each of the crystal legs and ground. I would like to know how to design the value of these capacitors for different crystal frequencies.

If a crystal has a rated load capacitance of 6 pF, is the right thing to do to put a 6 pF capacitor to GND on either leg of the crystal? I'm using it as the clock source (TOSC) for an XMEGA and it's got a max ESR of 50 kOhm (which is within recommendations).


I download the file to some location in Google Chrome (version 71.0.3578.98). Now I open the file from chrome (from the download bar or from the download manager). Where can I set the associated app? Or at least force the browser to follow the OS default setting?  EDIT: I checked that with pdf files, it doesť work.

As  and  Chrome no longer lets you automatically open downloaded pdfs in your System viewer.  In general, I like using the built-in Chrome PDF viewer, but for some longer and more complex PDF documents I much prefer to use my system PDF viewer (i.e., Skim).  I used to be able to save the PDF and it would automatically open in Skim (once I selected automatically open). Or I could save it and click the icon at the bottom. Now you have to manually download and then select "open in system viewer".   Is there a plugin to open the currently opened PDF in Chrome in the system viewer? Is there a way of overriding the behaviour in Chrome to force downloaded PDFs to open automatically in the system viewer? (note that I don't want to disable the Chrome PDF viewer in general)   Update: Note that this question is not about disabling the built-in chrome pdf viewer entirely which is covered by .  The distinction between the two questions is made quite clearly in .


There are a number of deleted scenes (specifically in the prequels) that add a lot of interesting information to the backstory of events and characters in the films.   One that jumps out at me is the meeting in Episode 3 between many of the founders of the Rebel Alliance.     However, there is a scene where Shaak Ti is killed by General Grevious.    But she appears in the video game, The Force Unleashed. I realize though that the Force Unleashed is considered non-canon as of now but I'm still curious considering that these seem to both be from lower sources of canon and were both created before the Disney buyout.  What is the canonicity and status of these scenes? Obviously they can't be considered G Canon because of times where we have alternate scenes that contradict the locations/characters of actual movie scenes.

For all types of derivative works, namely:   Movies Novels Comic books Other written works (including RPG materials) Cartoons Video games Derivative movies (such as the infamous Ewok movies and even more infamous )   According to what rules does something become "canon" and who is responsible for the evaluation of a published work?


I can see all my upvotes in the "votes" tab of my user page. For example,   This includes the questions, answers and comments. Is there a way to list all comments those I have upvoted?

Yesterday I upvoted a comment that had interesting links. I didn't do any other activity in that question apart from giving my upvote to that comment because it had some links I wanted to check later.  Now a day has passed and I want to view that comment to bookmark those links, but I can't see any way on Stack Overflow to see comments that I've upvoted. Can I see these votes? If not, why is this feature missing?


How can we prove formally, that $a \gt 0 \implies \frac{1}{a} \gt 0$? In general, what is the process one may take to do this with confidence?

This is my attempt to prove that, if $a > 0$, then $\frac{1}{a} > 0$, using just field and order axioms.  $$a > 0 \implies a \cdot \left(\frac{1}{a}\right)^2 > 0 \cdot \left(\frac{1}{a}\right)^2 \implies a \cdot \left(\frac{1}{a}\right)^2 > 0 \implies a \cdot \left(\left(\frac{1}{a}\right) \cdot \left(\frac{1}{a}\right)\right) > 0$$  By associativity of multiplication:  $$\left(a \cdot \left(\frac{1}{a}\right)\right) \cdot \left(\frac{1}{a}\right) > 0$$  We know that $a \cdot \left(\frac{1}{a}\right) = 1$, because one is the multiplication inverse of the other.   So we have:  $$1 \cdot \left(\frac{1}{a}\right) > 0 \implies \frac{1}{a} > 0 $$  Which is what we wanted to prove.   My question are:    In the field axioms, there's no axiom that says that $0$ times another number is $0$, but I have used this property. How would you translate it to field and order axioms? I have assumed that $\left(\frac{1}{a}\right)^2$ is positive, have you noticed? Note that I need a positive number in order not to change the $>$ sign. But this is not present in the field or order axioms. How would you explain this?


I've been taught to say "I am" and "I aren't", but that doesn't make any sense to me. I think it should have been "I amn't" as am+not=amn't, but why isn't it?

Why do we say "ain't I" or "aren't I" instead of "amn't I"? What's the history of this usage? Are there any other similar patterns in English?  I'm guessing it has something to do with the dispreference of two consecutive nasal consonants, but a more authoritative answer would be great.


I want to create a SVG icon similar to this:    Instead of drawing the lines, I want to create the shapes formed by the negative space (the white shapes).  What I did was:  Ellipse Tool > drew a circle > Fill: White Ellipse Tool > drew a vertical ellipse and centered it Line Segment Tool > drew 3 horizontal lines   Then I thought to myself "voila!" only to realize I had no idea how to use what I drew on the upper layers to "burn" through and create transparent lines on the bottom layer (which is the white circle). In photoshop I would copy paste and delete the lines to get desired effect as pictured above, but I'm not sure how to proceed in AI.  Question: How can I use upper layer lines / ellipses (or other shapes) to create transparent lines in the bottom layer?

This is an odd request and something I've never had to worry about in Illustrator until now. I'm building out a logo that will be printed on a shirt. Instead of having a solid black border around the vector hand, the client wants the black border to be "transparent" so when it is placed on top of a pattern, you see the pattern background. I have an example below of what I'm trying to accomplish.      The second photo I mocked up in Photoshop to show what I'm trying to do. It's very easy to select the border path in Photoshop and simply wipe it out. Does Illustrator have a "transparent" fill option in the Path area? Selecting a color and dropping the transparent percentage didn't do the trick.


I have the starter set and I am wondering if a pregenerated character's attack bonus is wrong.  The character is the Human Fighter with the Folk Hero background.  The attack bonus for the Greatsword is +4: +2 from STR and +2 from proficiency, so this seems correct.  The attack bonus for the Longbow is printed as +7, but I only see +3 from DEX and +2 from proficiency. Am I missing something?  There are a couple of others that seem to be off as well.

I am somewhat new to D&D 5e and had a question about attack bonuses of the pre-gen characters in the Starter Set. I was under the impression that attack bonus for a sword is strength bonus plus proficiency bonus (if the character is proficient with that weapon) and for something like a crossbow it would be dexterity bonus plus proficiency bonus.  What I am struggling with are the attack bonuses listed for the pre-gen characters. They don't seem to make sense all of the time.  For instance, the wizard has a +4 attack bonus for the shortsword even though their strength bonus is +0. Should it not be only +2 for proficiency (they are proficient in short sword)?  Or take one of the fighter's longbow bonus. They have +3 dexterity and +2 proficiency bonus, yet their attack bonus is listed as +7.  I feel like there is a simple explanation. What is it?


We have the factorization $561=3*11*17$. Because $\text{gcd}(a,561)=1$, there are integers $x,y$ such that $ax+561y=1$. So $ax=1\mod 561$. Since the gcd is $1$, we have $a\not \in 3\mathbb{Z}, 11\mathbb{Z}, 17\mathbb{Z}$. Therefore, $a^{560}\not \in 3\mathbb{Z}, 11\mathbb{Z}, 17\mathbb{Z}$. So $b^{560}=1\mod 561$. Is my reasoning correct? I have seen a problem that was similar to this that used Fermat's Little Theorem, but that can only be used when the number we  mod out by is prime.

I'm trying to understand a solution I was given in a tutorial regarding a problem with Carmichael numbers and I was wondering if you guys can help clarify things:  A composite number $m$ is called a Carmichael number if the congruence $a^{m-1} \equiv 1 \pmod{m}$ is true for every number a with $\gcd(a,m) = 1$.   Verify that $m = 561 = 3 \times 11 \times 17$ is a Carmichael number.  Solution given:  Apply Fermat's Little Theorem to each prime divisor of $m$: \begin{align*} a^2 &\equiv 1 \pmod{3}\\ a^{10} &\equiv 1 \pmod{11}\\ a^{16} &\equiv 1 \pmod{17} \end{align*} This somehow then implies that $a^{80} \equiv 1 \pmod{561}$ then accordingly $a^{560} \equiv 1 \pmod{561}$.  I am lost as to how the 3 congruences imply $a^{80} \equiv 1 \pmod{561}$ ($80 = \mathrm{LCM}(2,10,16)$).  Can somebody clarify this for me?   Thanks!


I tried command 'sort' in two virtual machines, but one gave all upper-case words before all lower-case words, and another sort in an ignore-case way.  Not ignore case:  [@sjs_100_189 tanglianrui]# sort test.txt  A T a b t   Ignore case:  [@sjs_88_171 sortedOutput]# sort -f test.txt  a A c t T   I'd like to know if there is a config file controlling the behavior of sort? If so, which one is it and how to config it? Thank you so much.

Using the same sort command with the same input produces different results on different machines.  How do I fix that?


I have built a flowchart on a ShareLatex project using tikz library and it's working fine.   I need to put this flowchart on a slide for a presentation (using PowerPoint, Google Docs or whatever), so I would like to export my flowchart as an image (png, jpeg, ...).  Is there a method which can help me with this issue?  I know that I can take a screenshot of the flowchart but I would like to know if a better solution exists.

I have created a tikz picture as a standalone.  Can I export the tex file as an image instead of as a pdf?


In a class of mine the lecturer introduced the term of "minimal residue" as follows:  Definition: If $p$ is an odd prime there is just one residue of $n \text{ mod } p$ between $-\frac{1}{2}p$ and $\frac{1}{2}p$. It is called minimal residue.  I do not see why such a minimal residue should necessarily exist or why it should be unique. I tried to google the term but I could not find anything about it. Could you tell me why this definition makes sense?

Show that if $m$ is odd then $\frac{(-m+1)}{2}, \frac{(-m+3)}{2}, \cdots, \frac{(m-3)}{2}, \frac{(m-1)}{2}$ is a complete residue system modulo m.  I understand the definition of a complete residue system but is having a hard time incorporating the odd part of this statement.


Christopher Colombus has made a big mistake and I am confused when I am told there is an Indian in the US because how do I know that is a real Indian from India now working in Silicon Valley or a real Indian living in this continent for many many years and never leaving?

How to distinguish between American Indians and Indian Indians in native English (language) parlance?  Can I say Indian Indian to say Indian from Asia compared to the Native Americans?


I am trying to loop through my list of lists, and change the values. I want this to print [['1','2'],['3','4']]. but it prints [['3','4'],['3','4']]. Can anyone please explain why this is happening? When I put a print statement, count increase for each iterations.   edit: it works if I manually create a list like [[0,0],[0,0]]. So what is the [[0]*2]*2 doing differently? They both look like 2d lists.  class Sudoku:     def __init__(self):         self.board=[[0]*2]*2  s=Sudoku() count=1 for i in range(2):    for j in range(2):        s.board[i][j]=count        count+=1 print(s.board)

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


Ubuntu LTS versions receive 5 years of support.  Occasionally, new point-releases are made for LTS versions.  For example, Ubuntu 14.04.1 LTS was released on July 24 2014, which replaces 14.04.  How long are security updates provided for the original 14.04 release (or other LTS versions)?  The  has no end of life date defined for 14.04.  Edit:  that point-releases are just snapshots of the bug fixes released so far, thus all versions receive the same duration of support.

There are so called "point releases" for LTS versions of Ubuntu. 10.04.3 for instance.  What are those "point releases" releases?


In the paper, entitled "Artificial uniaxial and biaxial dielectrics with use of two-dimensional subwavelength binary gratings" by Eric B. Grann, M. G. Moharam, and Drew A. Pommet. ,  they mention this formula:        Does anyone know where this formula comes (references if possible) from (and maybe how it can be derived) ?

I am reading the paper, entitled "Artificial uniaxial and biaxial dielectrics with use of two-dimensional subwavelength binary gratings" by Eric B. Grann, M. G. Moharam, and Drew A. Pommet.   In the paper they mention this formula:        Do you know how it can be derived and where it comes from ?


This bit of code produces an array of size 512, it converts a string that was originally 1024 characters in length and has hex data.  byte[] content = Enumerable.Range(0, data.Length) .Where(x => x % 2 == 0) .Select(x => Convert.ToByte(data.Substring(x, 2), 16)) .ToArray();   I like to know how to reverse this so taking a byte[512] I want to produce the 1024 length string containing the hex data.

How can you convert a byte array to a hexadecimal string, and vice versa?


I know very well that my question is in the duplicate department, but I need to be sure on the usage of "Who/Whom" in this particular example.     She met my brother, who/whom she later married.    Please strike-through the wrong option.  The source where I encountered this example states that both options are valid.  My understanding is that we say "She married to him", so "whom" is the correct option.  Please advise.

I can never figure out whether I should use who and whom. Most people use who for both colloquially, but some people say this is not correct.  What’s the rule for using who and whom correctly?


I know this is a commonly asked question but I can not find the solution for this plus the fact that I'm a beginner in programming.   I'm trying to make text wrap around image work but I get null point exception error   Attempt to invoke virtual method 'void android.widget.TextView.setText(java.lang.CharSequence)' on a null object reference   when passing TextView id to MainActiviy  So I have this Fragment.xml  <RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android" xmlns:app="http://schemas.android.com/apk/res-auto" xmlns:tools="http://schemas.android.com/tools" android:layout_width="match_parent" android:layout_height="match_parent" tools:context="make.appaplication.Fragment4">    <!-- TODO: Update blank fragment layout -->  <ImageView     android:layout_width="150dp"     android:layout_height="150dp"     android:src="@drawable/nature"     android:id="@+id/imageView"     android:layout_weight="1"     android:layout_marginRight="17dp"     android:layout_marginEnd="17dp"     android:layout_alignParentTop="true"     android:layout_alignParentRight="true"     android:layout_alignParentEnd="true" />  <TextView     android:id="@+id/textView3"     android:textSize="17dp"     android:layout_width="match_parent"     android:layout_height="wrap_content"     android:text="@string/text_page_1"     android:layout_below="@+id/textView5"     android:layout_alignParentLeft="true"     android:layout_alignParentStart="true"     />   and passing its values to MainActivity like so  String text = getString(R.string.text_page_1);      Drawable dIcon = ContextCompat.getDrawable(getApplicationContext(),R.drawable.nature);      int leftMargin = dIcon.getIntrinsicWidth() + 10;      SpannableString ss = new SpannableString(text);      ss.setSpan(new MyLeadingMarginSpan2(3, leftMargin), 0, ss.length(), 0);      TextView messageView = (TextView) findViewById(R.id.textView3);     messageView.setText(ss);   And I have these two lines of code       TextView messageView = (TextView) findViewById(R.id.textView3);     messageView.setText(ss);   after    setContentView(R.layout.activity_main);   and in onCreate method  Can anybody help me to solve this problem, please?

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


I'm completely new to LINQ, i want to rewrite some of mine SQL querys into LINQ (just to learn) and i'v already stuck at the beginning.  Here is SQL query :  declare @typMon varchar(200) set @typMon = 'moneta'  select *  from [db1].[dbo].[Picking]  where number = 1000 and Group IN (Select grupa                from [db2].[dbo].[groups]                where typ = @typMon)   Subquery returns 3 output rows :   And here is what i'v write in LINQ   This part works ok :  var query = from x in db.grupyTowarowes             where x.typ == typMoneta             select new             {                 x.grupa             };   Problem is here:  var test = from z in dbContext.PICKINGs            where z.Number == 1000             && z.group IN output from 1st query            select new            {                z.id            };

I'm a bit stuck on this. Basically I want to do something like the following SQL query in LINQ to SQL: SELECT f.*  FROM Foo f WHERE f.FooId IN (     SELECT fb.FooId     FROM FooBar fb     WHERE fb.BarId = 1000 )  Any help would be gratefully received.


I want to run an identical ubuntu on USB that allows me to update. Afaik a live USB with persistent storage does not allow system file mods or updates.

If you are hurrying to reply, System → Administration → StartUp Disk Creator -- no, that's not what I'm talking about.   I want to try Ubuntu 11.04's Unity without touching my existing Ubuntu install.  To do this, I need to install the nVidia drivers first (sigh).  To do this, I need changes to persist a reboot.  To do this, I need to really install Ubuntu on a USB key.  How do you do that?    What I tried   I tried to make a USB key from , then boot from it, then choose "Install Ubuntu." The installer refused to install to the installation media itself. I tried, from my installed copy of Ubuntu:  sudo kvm /dev/sdb --cdrom .cache/testdrive/iso/ubuntu_natty-desktop-i386.iso   ...but the installer didn't detect the disk properly.


I am currently thinking about investing my money in various things. I have a monthly income of 900€ and only 40€ regular expenses including food, spotify premium and a web domain. From what I can observe I have quiete a lot of money for a person of my age and I can deal with it pretty wisely. I also have some one-time expenses which stretched to something around 300€ per month in 2019. I do think that it will be much lower in 2020 though. At least I hope, huh? Some people on the internet were asking if they should buy an expensive car at my age and basically everyone said it was a bad idea which I would agree with but at the same time concerns me a little bit about investing at my age.  My first investment I am looking for is buying some shares I have very deep knowledge about. But I don't want to pull out everything at once so I would estimate that something around 10k would be a good start. This would equal a little bit more than 20% of my money.  The second thing would be a 5k investment into a small business I would like to start  which I hope to be profitable in one and a half years.  The last thing I am currently planing to do is building a small laboratory of technology for myself where I can learn new skills and test some ideas which I could be using in a business I am eyeing for in a more distant future but which would require a lot more money. I really enjoy learning new things from scratch by myself and figured that this is the most efficient way for me to learn. This laboratory would cost roughly 2-3k but I am not entirely sure yet how much I actually need this.  Please let me know what you think and feel free to make some modifications or give me advice. What would you do? Would you keep the money and have a large and safe backup or would you use it now? Thanks in advance.

I am young, just started my career, and looking to begin investing so I can make my money work for me. I'm still living like I did in college (occasional purchase on myself, but most of it goes into savings) and I would like to take the extra money and invest it.   What would you suggest are the best options for me to begin? I was considering getting a personal investor [a financial advisor] for perhaps a year or so, but I've heard that they really are not worth the money. I wanted to get the input of the great minds here.


I have a situation like this. I have an asset library and I want to use a workflow so that, every time a user upload a file, it is automatically moved to a folder by the file type (extension).  For example, I now have a .png image and I want the workflow to recognize the file type and move it to a folder named Pictures.    As you can see, I've tried to the point of setting the to part with the hard link to my folder and end with the /_vti_bin/officialfile.asmx suffix. And yet, the workflow couldn't run.   Any idea why?  I'm currently running Sharepoint 2013.  Thanks in advance for your help.

I am looking to use a workflow to move documents within a document library to a specific folder in the same document library (this to manage access rights on different documents via the libraries). Could anyone advise how I can setup a workflow to move a document to a folder? I expected this to work similar as moving documents between document libraries, but it appears to be more complex.  Appreciate your input.


Regarding cryptographic schemes in elliptic curve cryptography, is there a problem with having the order of an elliptic curve being equal to its prime field modulus?  That is, an elliptic curve where $\#E(\mathbb{F}_p) =p$ for some prime $p$?  As I understand it, this seems to be an optimal curve because by the lagrange's theorem the order of an elliptic curve's subgroup must be divisible by the order of the elliptic curve. But if the order of an elliptic curve is prime, that then that means that any point in this curve is a generator that produces all of the points in $E$ and has a cofactor of $1$. For example, .  So, is there some kind of 'gotcha' with this sort of elliptic curve? Something that might allow an attacker to easily solve it by some math trick? Of course, assume for an elliptic curve some large prime $p$ but with the same properties.

The Problem is as follows:  sage: p=235322474717419 sage: a=0 sage: b=8856682 sage: E = EllipticCurve(GF(p), [a, b]) sage: P = E(200673830421813, 57025307876612) sage: Q = E(40345734829479, 211738132651297) sage: P.order() == p True   As we can see, P.order() is equal to p, so obviously we can use Smart's attack to calculate the value of k, so i implement the Smart's attack according to the paper .  And when we use this kind of attack we will get k = 9762415993955:  sage: SmartAttack(P,Q,p,8) 9762415993955   But actually the correct value of k is 152675955744921:  sage: P*152675955744921 == Q True   So my question is:     Why Smart's attack doesn't work on this ECDLP?   P.S. The implement of Smart's attack is correct cuz it can calculate the correct value of k in some former CTF games.


I was reading a book on C programming language where I found:  #define cat(x,y) x##y #define xcat(x,y) cat(x,y)   calling cat(cat(1,2),3) produces error whereas calling xcat(xcat(1,2),3) produces expected result 123.  How are both working differently ?

As mentioned in many of my previous questions, I'm working through K&R, and am currently into the preprocessor. One of the more interesting things — something I never knew before from any of my prior attempts to learn C — is the ## preprocessor operator. According to K&R:     The preprocessor operator ##   provides a way to concatenate actual   arguments during macro expansion. If a   parameter in the replacement text is   adjacent to a ##, the parameter is   replaced by the actual argument, the   ## and surrounding white space are   removed, and the result is re-scanned.   For example, the macro paste   concatenates its two arguments:      #define  paste(front, back)  front ## back      so paste(name, 1) creates the token   name1.   How and why would someone use this in the real world? What are practical examples of its use, and are there gotchas to consider?


I am currently trying to compile a latex document but get the following error message.  Command \iiint already defined. ...{\iiint}{\DOTSI\protect\MultiIntegral{3}}   Can anyone please tell me how to resolve this?

For example I want to use \iint from ams package  and also mathabx package in one file together. Actually I want a command that neutralizes ams package effect and replace it with mathabx package effect from here on in my file. Thanks for your responsibility.  This is my example minimal file:  \documentclass[12pt,a4paper]{report} \usepackage{amsmath}  \usepackage{mathabx}  \begin{document} i want this one in ams style:        \[ \iiint\,\iiint\, \iiint\,\oint\, \] text text text text text text text text text text text text   and this one in mathabx style:   \[ \iiint\,\iiint\, \iiint\,\oint\, \]   but both of them are the same and i don't like it ..... \end{document}


Is it possible to simulate key press using JavaScript? For example, How can I simulate Ctrl+Alt+ArrowKey? I want to simulate special keys. Is there any API/Framework available?  Lets say, I am building a web based virtual keyboard.

Is it possible to simulate key press events programmatically in JavaScript?


I want to prove that if a topological space $(X, T)$ is separable then the space has the $CCC$ (i.e., there are is no uncountable collection of mutually disjoint open subsets of $X$.)  My attempt of a proof:  We proceed by contrapositive, namely that $X$ does not have the $CCC$ condition.  This implies that there exists an uncountable collection of mutually disjoint subsets, $C$.  Suppose $X$ is a separable space.  Then there exists a dense countable subset of $D$.  Since $D$ is dense there is a non empty intersection with all non empty open sets of $X$ so, that means that all of the sets of $C$ has a non empty intersection with $D$.  This means that, since there is only a countable amount of elements of $D$ then there are some sets of $C$ that are intersecting more than one element (since there are uncountable sets that are containing only countable amount of elements).  This contradicts that those sets are mutual disjoint and hence $X$ has the $CCC$ condition.   Does that proof make sense, if not where are my mistakes?  If it does, how can I make it more concise and clear.

I thought I had the proof of this in my head, but it doesn't sound right on paper. Can someone see if my argument could be improved.  Let $(X,\tau)$ be a topological space that is separable, then it contains a countable dense subset $\{D_n\}_{n \in \mathbb{N}}$. Then $X$ is CCC if it does not contain any uncountable collection of disjoint open sets.  My argument:      By contradiction, suppose $X$ is separable but is not CCC.       Since a countable dense subset could only intersection countably many   open sets, there exists some open sets $U$ that $D_n$ fails to   intersection.      Therefore, $X$ is not separable as claimed.    My problem with this statement is that: Since a countable dense subset could only intersection countably many open sets...  Is there to make the middle paragraph rigorous? The whole proof feels wrong, please assist!


I have a string "Monday, May 18, 2015". I want to convert it into datetime fromat of python keeping the format same. I mean exact replica of the string but the type changed to datetime. How can I do that?

I've got a huge list of date-times like this as strings:  Jun 1 2005  1:33PM Aug 28 1999 12:00AM   I'm going to be shoving these back into proper datetime fields in a database so I need to magic them into real datetime objects.   This is going through Django's ORM so I can't use SQL to do the conversion on insert.


in my code in python  for i in array_config(1,len_config):     print array_config[2]   shows  TypeError: 'list' object is not callable   (array_config is an array of configuration file) (len_configs value is 7)  how to remove that error?

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


What happens in this current branch? In circuit analysis how to deal with branches like this?

– Schematic created using   Does any current flow from point A to point B?   My guess is no. Because both of those points are connected to a ground symbol by blank wires, they both have potential of 0V.


I don't know how to solve the following exercise, which is stated in Vakil's The Rising Sea: Foundations of Algebraic Geometry:     11.1.I. EXERCISE. Show that if $Y$ is an irreducible closed subset of a scheme $X$, and   $\eta$ is the generic point of $Y$, then the codimension of $Y$ is the dimension of the local ring $\mathscr{O}_{X,\eta}$.   The result is general, so I want to prove directly by definition but failed. I've also thought about proving by affine case, but I don't know the relation of codimensions if reduced to affine case.  Can anyone give me a solution?

I have a problem with the following exercise: Let $X$ be a noetherian scheme and $Y \subset X$ an irreducible closed subset. I have to prove that $$ \operatorname{codim}(X,Y)=\dim(\mathcal{O}_{X,\eta}), $$ where $\eta$ is the generic point of $Y$. We can replace $X$ with an open affine $U_\eta$, neighbourhood containing the generic point $\eta$. So we have that $$\operatorname{codim}(X,Y)=\operatorname{codim}(U_\eta, U_\eta \cap Y) ,$$ but I don't know how to conclude the proof. In particular if $Z$ is an irreducible component of $X$, can I conclude that $\operatorname{codim}(Z,X)=0$? Thanks in advance!


Problem:  Given $2018$ elements not necessarily distinct from $\mathbb{Z_4}^9=\mathbb{Z_4} \times \mathbb{Z_4}\times \mathbb{Z_4}\times \mathbb{Z_4}\times \mathbb{Z_4}\times \mathbb{Z_4}\times \mathbb{Z_4}\times \mathbb{Z_4}\times \mathbb{Z_4}$, Prove that there exist 4 elements from these $2018$  which sum to $\text{0}= (0,0,0,0,0,0,0,0,0)$. Obviously you cant use an element more than the number of times it is available. Origin: This problem originates from a 'number theory' question: Given $2018$ integers all of whose prime factors are $\leq 23$ show that there are $4$ whose product is a fourth power. My attempt:  The only slightly fruitful approach I had was to attach this problem coordinate-wise.. Since, there are 2018. There will be an integer in $\mathbb{Z_4}$ that occurs at least $2018/4$ that is $505$ times. Now starting with these $505$ we go to the next coordinate and so on. But in this way I will need about $4^9 > 2018$ integers to do my job. I feel a more global approach is needed. I tried some contradiction but that also didnt bear any fruit. Please help. Thanks.

Given a set $M$ of $1985$ distinct positive integers, none of which has a prime   divisor greater than $26$, prove that $M$ contains at least one subset of four distinct elements, whose product is the fourth power of an integer.   I couldn't even start.


I am reading a book on combinatorics and one of the exercise questions asks:  Suppose a positive integer N factors as $p_{1}^{n_1}.p_{2}^{n_2}...p_{m}^{n_m}$ where $p_1, p_2, ..., p_m$ are distinct prime numbers and $n_1, n_2,..., n_m$ are positive integers. How many different positive integers are divisors of N?  I thought of writing the prime factors separately:  $$p_1p_1p_1...p_1{\times}p_2p_2...p_2{\times}p_3...p_mp_m...p_m$$  Then for each of the p's you could choose to include it or not include it, giving a count of:  $$2^{n_1+n_2+...+n_m}$$  But this is of course overcounting it since, if I chose 2 $p_1$'s, I could have chosen any two from the $n_1$ $p_1$'s and it would result in the same number.  How do I proceed from here?  Thank you.  EDIT: Questions answered in the comment.  Answer is $(n_1+1)(n_2+1)...(n_m+1)$ since one can chose to include between 0 to $n_i$ instances of the $i^{th}$ prime.

Let $d(n)$ be the number divisors of a natural number $n$. Now let $m$ be a natural number. Find least natural number $n$ such that $d(n)=m$.  Thank you


I have a 1TB HDD and 240GB SSD and both have 2 equal partitions. I've installed Windows 10 on one of my SSD drives and want to install Linux on the other. Once the installation completed and I restarted computer. I expected Grub to appear at first and let me choose what OS to boot but it didnt, it instantly boots on Windows 10. I don't know about UEFI but I know it's relevant to this issue, would you explain to me how to solve it?

I installed Ubuntu on a Dell XPS 13 laptop that had Windows 10 preinstalled on it. I installed it from a USB flash drive on a partition. When I boot my computer I can only boot into Windows 10 and Ubuntu is nowhere to be seen.  If I boot into my USB then I can see that Ubuntu is installed, but I can't get to it from the BIOS boot menu.


How can I remove duplicate arrays? it's different from array unique because that is removing duplicate values inside array..  i get an array list like this  1. array('item' => 6, 'quantity' => 1, 'price' => 120) 2. array('item' => 6, 'quantity' => 1, 'price' => 120) 3. array('item' => 6, 'quantity' => 1, 'price' => 120) 4. array('item' => 22, 'quantity' => 8, 'price' => 30) 5. array('item' => 22, 'quantity' => 8, 'price' => 30)   how do i make like this while keeping the values?  3. array('item' => 6, 'quantity' => 1, 'price' => 120) 4. array('item' => 22, 'quantity' => 8, 'price' => 30)     code  $get = file_get_contents('URL');     $json = json_decode($get, true);     $results = print_r($json);     file_put_contents('file.json', print_r($json, true), FILE_APPEND);

How can I remove duplicate values from a multi-dimensional array in PHP?  Example array:  Array (     [0] => Array     (         [0] => abc         [1] => def     )      [1] => Array     (         [0] => ghi         [1] => jkl     )      [2] => Array     (         [0] => mno         [1] => pql     )      [3] => Array     (         [0] => abc         [1] => def     )      [4] => Array     (         [0] => ghi         [1] => jkl     )      [5] => Array     (         [0] => mno         [1] => pql     )  )


I have a very complex scene and every time I try to render in either Eevee or Cycles all I get is this solid blue color. Changing my lights and environment colors/settings don't change the look/color of the blue render. I've deleted almost everything from my file except these few elements and purged all the garbage but it's still happening. Can someone help me figure out how to fix this and how I can avoid it in the future? Thank you in advance for your help. -I have removed my original file link and placed it here instead.

A scene I made is not rendering, at all. This grey screen stays the same and nothing changes.  Here are my settings:  [


My Problem  I'm a Windows 7 user and to get it out of the way, Windows 7.exe is not a Windows 7 file. It's a smart virus that is using all my CPU.   What I've Tried  Every time I hit end process in a task manager, it comes back up and takes all my CPU again within seconds. I thought I could delete the file so I went to file location, but all I found was an empty file called windows 7. This file can't be found on My Computer. I then attempted to stop all services associated with Windows 7.exe, however when I went to services from the taskmanager, none of the current services were highlighted. When I disconnect from the internet, this process isn't able to start up.   My Question  I've run out of ideas on how to practically get rid of it and may have to clean install windows. I'm wondering if there is a less bothersome way to do this.

What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits.


When I try to start a program with start command without specifying path, for some programs it works and for some programs it doesn't work.  I know that if those programs are in my PATH list or in current directory, I don't have to type the path.  But start command works for some programs even if those aren't in current directory or in my PATH list. What is the reason for this?

Assume Microsoft Office is installed. Consider the following batch file:  REM the following line successfully launches Microsoft Word start winword  REM none of the following commands work to launch Microsoft Word winword winword.exe winword.com winword.bat winword.cmd winword.vbs winword.vbe winword.js winword.jse winword.wsf winword.wsh winword.msc   What is it about the "start" instruction that allows the launching of Microsoft Word using the name "winword"?  My curiosity stems from my interest in the mechanics of the "start" verb - I don't need suggestions on other ways to start Microsoft Office.  Please don't suggest that I add the Microsoft Office directory to my PATH environment variable - I know what that would do.    How is start finding "winword" when cmd cannot find it directly?


My question got a downvote. Can I see somewhere why this happened?  This is my question:

Note: If you're looking for a simple explanation as to why comments aren't required on downvotes, see .   I used to get "upset" (though that is too strong a term) when I got downvoted without comment. If my answer isn't good enough then I'd like to know why. Not only does it improve the answer for the OP but it improves my knowledge too.  Where the down-vote has been explained I've found it useful & it has improved my answer, or forced me to delete the answer if it was totally wrong.  So is there any way we can encourage people to leave a comment? Perhaps they don't lose rep if they explain their down-vote?  I must admit though that I haven't always explained my down-vote either so you could call me a hypocrite. I've also grown a thicker skin over the months of using SO (it seems to have come with the higher rep score ;-)), so I'm less bothered about this now.


Bought iMac from new. Works perfectly and installed bootcamp by dividing the 1TB drive 50/50. iMac came with 4GB RAM. Made enquiries and have found that there are 4 memory slots. Kept the 4GB and added 2 4GIG Ram modules to make full memory 12GIG. Installed Windows 32 bit and Office etc In MAC states I have 12GIG Ram: In Windows native (I.e. booting to Win 7 without bootcamp) I see it states I have 12 GIG RAM but only 2.32 USABLE RAM.  The whole point of upgrading the RAM was to get more available in the machine when bootcamp running. When running Win7 in bootcamp it simply says there is 2.32 usable RAM. BUT ... presumably Win 7 should run the full 4GIG when in native mode.  I note somewhere here that if certain hardware is installed the RAM may be limited to 2.32 in Win 32 bit and someone upgraded to Win 64 bit to see then a magical change. Is that what I will have to do Seems not right that Win 7 limits itself to 2.32 RAM particularly when it knows that 12 GIG RAM is installed. Any ideas how to make it recoginise the full 4GIG that Win 7 32 bit is supposed to work with? csr

I recently upgraded my computer's RAM to 4 GB. My 32-bit Windows installation shows only 3574 MB of the memory. How can I make Windows use the full amount of RAM?


Construct a $2$ $\times$ $2$ matrix $A$ ($\neq$ $I$) with entries from $\mathbb{R}$ such that $A^3=I$.  First give me some hint. How to construct this kinds of matrices, is there any rule...

Is there any $2 \times 2$ matrix $A \neq I$ such that $A^3=I$?  In my opinion: no. Thank you very much.


It's been a while since I last used Java, as I'm primarily a C# developer. To get back into the game, I was working on a very simple application to touch on most of the key features of the language. I ran across the following problem:  for (Player player : teamRed.getPlayers()) {     System.out.format("> %s\n", player.getName()); }   Where getPlayers() is defined as follows:  public Iterable<Player> getPlayers() {     return Collections.unmodifiableList(this.players); }   At some point in the past, either C# or Java had a performance issue when you used a getter in your for each like this, as it would execute the method every iteration. I cannot find anything about this anymore, so I wonder:   Has Java ever been subject to this issue, or was it the case for C# only?  Personally, I feel the compiler should be smart enough to optimize this properly and actually store the result of getPlayers in a temporary variable before iterating over it. But if not, I have no trouble helping the compiler a hand :P

Consider:  List<String> someList = new ArrayList<String>(); // add "monkey", "donkey", "skeleton key" to someList     for (String item : someList) {     System.out.println(item); }   What would the equivalent for loop look like without using the for each syntax?


After this I get this  $ sudo apt update $ sudo apt upgrade $ sudo apt install -f $ sudo apt install vlc   billn@billn-N107:~$ sudo apt install vlc Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  vlc : Depends: vlc-nox (= 2.2.2-5) but 2.2.4-6~ubuntu16.04.1~ppa1 is to be installed        Recommends: vlc-plugin-notify (= 2.2.2-5) but it is not going to be installed        Recommends: vlc-plugin-samba (= 2.2.2-5) but it is not going to be installed E: Unable to correct problems, you have held broken packages. billn@billn-N107:~$

Trying to install VLC 16.04  sudo apt update sudo apt install vlc  This is what I am getting  The following packages have unmet dependencies:    vlc : Depends: vlc-nox (= 2.2.2-5) but 2.2.4-6~ubuntu16.04.1~ppa1 is to be installed        Recommends: vlc-plugin-notify (= 2.2.2-5) but it is not going to be installed        Recommends: vlc-plugin-samba (= 2.2.2-5) but it is not going to be installed E: Unable to correct problems, you have held broken packages.   Thanks for any help...


In a recent , Teresa Dietrich announced this process for policy changes:     We have defined a standard process for new policy or process review that includes Community Managers, employees who are long-time community members, and Moderators before being shared and put into place. Our plan is to provide new policies to the planned Moderator Council for feedback periods before they are made official. We will then share it with all Moderators through the Stack Moderators Team for advance notification. We value the deep understanding that moderators on the network have of their communities and users, and welcome honest, respectful feedback from the greater Stack Exchange Community.   One of the complaints that I have heard most frequently in the past few months is that users find out about policy changes only after the discussion and debate have been completed in secret, without them. The above process seems to indicate that this will continue - that moderators are the only ones who will receive advance notice of proposed changes and be allowed the opportunity to provide feedback before a final decision is made.  Let's add a community feedback stage. After feedback has been received from moderators, the proposed change should be posted on Meta or another suitable place for community feedback. To be clear, I'm not asking for the community to be given absolute veto power over a change, but only asking for advance notice and an opportunity to be heard before a final decision is made.

The blog post  sheds a little light on how the current process for making changes on Stack Exchange works.  Today, our research process might look something like this for a high-impact, high-cost project.     What's our current research approach? Strategy (Survey; User interview; Comparative site analysis; Historical context research; Data analysis), Design (User interviews), Build (User interviews), Ship (Survey; A/B tests; Meta feedback)  And later on it says:  Meta feedback. We monitor Meta for bug reports and small usability/copy issues after shipping changes to the site.  Now, as was mentioned in the blog post, this is a marked departure from how things worked in the past.   What was our past research approach? Strategy (Meta feedback), Design (Meta feedback), Build (Meta feedback), Ship (Experiments)  Before, every stage of the process was simply "Meta feedback". Now, the Meta feedback has been relegated to... bug reports and usability issues. Please consider gathering Meta feedback earlier in the process. Meta feedback is important.  Now, as an avid Meta user, I may be biased. However, Meta represents the most engaged users - the ones who have been here for years in most cases, often current or former moderators on the network, and those who are, most importantly, the ones that the site most heavily relies on for moderation. Meta feedback represents the feedback of those most engaged users. The feedback of your most engaged users, especially on a "high impact" project, is important. Those users are in the best position to tell you how it well affect their use of the site as someone who uses it very regularly, and they may let you know about something that is very important to them but less so to other people. I'm thinking of cases such as the incident where the Worldbuilding.SE robot, Slartibotfast, was going to be removed due to the design changes to the site. Due to  from those most invested in the community, the robot was saved and an important part of the site identity was preserved. Journeyman Geek put it nicely in :  I'd also like to point out that, well, the designer is not going to have the same grasp of a site's "uniqueness" as someone who has been on it a while will have.  As I mentioned before, this is a marked departure from how SE worked in the past. You are taking a group who has, for ten years+, been deeply involved in every stage of a change, and suddenly telling them "you're only giving feedback after it's done and we won't be making any big changes because of your feedback. Sorry!"  That's not going to go over well. Especially in the current climate of the community having broadly lost trust in the company, removing their feedback from any changes is only going to serve to further deteriorate any remaining trust.  On the other hand, including them in the process and working with the community will massively help improve trust and relations between the engaged community and the company. We, the Meta community, are the people most invested in these sites. The way our feedback is treated should reflect that. Please consider gathering Meta feedback earlier in the process for making "high-impact" changes.