We keep getting this error in our production server.     The timeout period elapsed prior to obtaining a connection from the pool. This may have occurred because all pooled connections were in use and max pool size was reached   this is how i read from database      objDataEngine.InitiateConnectionAsync();         SqlParameter[] Parameters = new SqlParameter[3];         ...         var execResult = await objDataEngine.ExecuteCommandAsync("WebBrandListSelect", CommandType.StoredProcedure, Parameters);           while (execResult.Read())          {            //read from datareader          }           objDataEngine.CloseConnection();   code for InitiateConnectionAsync is:         public async Task InitiateConnectionAsync()             {                  SqlConnectionStringBuilder builder = new SqlConnectionStringBuilder();                 builder.DataSource = ConfigurationManager.AppSettings[this.database];                 builder.InitialCatalog = this.database;                 builder.UserID = this.username;                 builder.Password = this.password;                 Connection.ConnectionString = builder.ConnectionString;                 await Connection.OpenAsync();             }   function for ExecuteCommandAsync    public async Task<SqlDataReader> ExecuteCommandAsync(string commandText, CommandType type, SqlParameter[] parameters = null)         {             SqlCommand cmd = new SqlCommand();             cmd.CommandTimeout = 400;             cmd.Connection = Connection;             cmd.CommandType = type;             cmd.CommandText = commandText;             cmd = AssignParameters(cmd, parameters);             SqlDataReader Reader =await cmd.ExecuteReaderAsync();             this.ObjReader = Reader;             this.ObjSqlCommand = cmd;             return Reader;         }   and finally the code for CloseConnection  public  void CloseConnection() {     this.Connection.Close();     this.Connection.Dispose();     if (this.ObjReader!=null)     {         this.ObjReader.Close();         this.ObjReader.Dispose();         this.ObjReader = null;      }     if (this.ObjSqlCommand!=null)     {         this.ObjSqlCommand.Dispose();     }  }   please help if you find anything wrong in my code. Is there any probability my datareader is not properly disposed?

I'm getting this error every few days. I won't see the error for a few days then I'll get a flurry of 20 or so all with in a minute or so.  I've been very thorough going throw my code so that I'm using this basic setup for my DB access.  try {   myConnection.Open();   mySqlDataAdapter.Fill(myDataTable);   myConnection.Close(); } Catch (Exception err) {   if (myConnection.State != ConnectionState.Closed) myConnection.Close();   throw err; }   The way I understand it this should execute my queries and immediately release the connection back to the pool but if something goes wrong with the query then I catch the excpetion close my connection then throw the error up, which eventually gets trapped at the application level and logs and emails me the error.  Even using this throughout my code I'm still running across the issue. What can I do to diagnose the root cause of the issue?


If cut a cut down the middle, both halves are symmetrical.  Why is it that most animals are symmetrical?  Is there an energetic reason for this? (as in, it is energetically favorable to create the same thing twice instead of making something new)

Just wondering ; I get the impression a large number of multicellular organisms are multi-lateral in their physical structure. Why would evolution/mutation have retained multi-lateral symmetry in an organism? What advantage/s does symmetry provide an organism?  EDIT:  By multi-lateral symmetry I mean at-least bi-lateral symmetry (as in the case of many beings such as elephants, crabs and fishes), but perhaps more than bi-lateral too (starfish come to mind)  END EDIT:


An old complex analysis exam question:  Evaluate   $$\large I(a) = \int_{-\infty}^{\infty} e^{-\frac{1}{2}x^2+iax}dx$$  So far, I have completed the square in exponent, and now I have the integral   $$\large I(a) = \int_{-\infty}^{\infty} e^{(x+\frac{ia}{2})^2-\frac{3}{2}x^2+\frac{a^2}{4}}dx$$  Perhaps completing the square above gives me an integral where I now don't have to worry about whether a is positive or negative -- and so I don't need to break the integration out into two cases.  But I'm not sure what to do from here.  Most integration that I come across in old exam questions is an application of the Residue Theorem, but currently the integrand looks pole-free / entire, so there'd be no residues to compute.  One last thing I thought of so far is that the integral looks a bit like the  Gaussian integrals.  Would this be the better / correct path to follow?  If so, what should I start with?  The $iax$ term makes it tricky to know what sort of substitution I could go with to perhaps get something like $e^{-ax^2}$    Any hints or suggestions are welcome.  Thanks,

I would like to work out the Fourier transform of the Gaussian function   $$f(x) = \exp \left(-n^2(x-m)^2 \right)$$  It seems likely that I will need to use differentiation and the shift rule at some point, but I can't seem to get the calculation to work. Does anyone have any advice?  By the way, I am using   $$\mbox{FT}(f)(k)=\int_{-\infty}^\infty f(x)e^{-ikx}\,\mathrm d x$$  as my definition of a Fourier transform. Many thanks.


Please note that I have created a forum by installing the phpbb software in bluehost server in a folder named (lets give an example) "examplefolder" and thus the URL of a post is: www.example.com/examplefolder/viewtopic.php taking into consideration that this post appeared at first positions of google, bing, etc search enginees (after searching for the topic of this post), could you please let me know if the search engines' position of this post will be changed in case that I will change the name of "examplefolder" to something else.

I'm refactoring my ASP.net application from ASP.net 3.5 to 4.0. Also I'm changing the URLs to user friendly URLs /product.aspx?id=100 to /product-name/100.  All my pages are indexed by search engines and the site has already been online for 6 years. I'm planning to do 301 redirect from the old pages to the new one.  I want to make sure I won't lose the rankings and traffic.  Any suggestion how to do it properly?


every time I try to install mysql-workbentch on terminal using the sudo apt install mysql-workbentch command, the following error occurs: $ sudo apt install mysql-workbench-community  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:  mysql-workbench-community : Depends: libc6 (>= 2.29) but 2.28-10 is to be installed                              Depends: libmysqlclient21 (>= 8.0.11) but it is not installable                              Depends: libstdc++6 (>= 9) but 8.3.0-6 is to be installed                              Depends: libzip5 (>= 0.10) but it is not installable E: Unable to correct problems, you have held broken packages.  I am a little new to the ubunto and this problem has already taken a lot of my time, and many unsuccessful attempts. Whoever can help me, I will be forever grateful.

After upgrading from 10.04 to 12.04 I am trying to install different packages.  For instance ia32-libs and skype (4.0).  When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message.   Output of commands:  sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   After running this:  sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.


Is there a name for sentence forms that tell you that they’re about to tell you something? For example:  “What he did was, he went to the bus stop to meet his friend.” “What she’s doing is, she’s priming the canvas with gesso.” “What I’ll do is, I’ll call you if I’m running late.”  These sentences could be described as “unnecessarily wordy” or maybe “circuitous”, but is there a technical, grammatical term for these sentence forms? If not, then is there a term for the italicized phrases?

Let's assume that John gave me a cat. I can rephrase the fact with:     What John did was to give me a cat   What John did was give me a cat   What John did was, he gave me a cat   But can I say the following phrase?  What John did was gave me a cat


Let me start by saying that I understand pointers. I know what they are and how they work. But I know them because I visually imagine how they are being used in memory by saving the address of something else and so on.  I'm trying to find information online and I can seem to find any information on how references are treated.  Could someone either link or explain how they work having memory management in mind?  thx

I know references are syntactic sugar, so code is easier to read and write. But what is the difference between a pointer variable and a reference variable?


I have a bunch of table rows

  Few of which are of class = "node"  Only one of the tr.node will be of class = "active"
...

...

...

...

...

...

...

...

...

...

...

...

...

...

...

...

...

...

...

...
   I want to select all the
's from tr.node.active to next tr.node excluding the tr.node's themselves.  This question uses jquery    Is there any way of doing this using CSS only, as using javascript would be difficult in the given scenario of my project?

I have a document with headings and unordered lists. How can I use JQuery to select a given heading (by its unique class name) AND all content between that heading and the next heading? Update: Your suggestions are great, but aren't what I'm looking for. In the below code, for example, I would like to access only the "h1" with id of "heading2" and everything up to, but not including the "h1" with id of "heading3". The jQuery examples provided above will access everyting after the first "h" tag that is not an "h" tag. ... or, correct me if I'm wrong :)
...

...

...

...

...

...

...

...

...

...

...

...

...

...

...


hi i have implemented this equation with XOR and Not gate but i'm not getting the correct answers (A.B.C)+(A'.B'.C')    What is the Problem ?  thank you

For 3 input XOR gate and XNOR gate, by solving the equations I got the result as in the picture.  So according to the solution the outputs of the 3 input XOR and XNOR gates are same. This solution holds good when number of inputs to the gates are odd.   For the case of even number of inputs XOR and XNOR are complement to each other.   With this assumption the answer to the circuit in the picture should be option A,B, and C. but the correct answer is D. I am confused as to how?   Thanks in advance for the help.


I am looking for a concrete example of a transparent matter and wave length of a radiation at which the  (if they exist, of course). There are several similar questions around, e.g.  however I have not found an answer to my question.

What I really can't understand, What are the properties of a medium with ? how does it affect light rays which fall on them?


I have problem with my code. Each query for the OpenWeatherMap service should save variable oftemperature and date to the base.Unfortunately, I have a problem with a nullpointer. I found information on the Internet that you can not perform in Quartz jobs operations on a database, but i dont have any idea how to change this code.  Its my quartz job class  @Component @NoArgsConstructor public class QuartzJob implements Job {      private final String prefix = "https://api.openweathermap.org/data/2.5/weather?q=";     private final String key = "&units=metric&appid=b25d9b1a1e64e5e91ed9d14b74c1ca01";      @Autowired     private WeatherModelRepository weatherModelRepository;      @Autowired     private CityModelRepository cityModelRepository;       @Override     public void execute(JobExecutionContext jobExecutionContext) throws JobExecutionException {          String cityName = String.valueOf(jobExecutionContext.getJobDetail().getKey()).substring(8);          String myUrl = prefix+cityName+key;          Weather weather = new Weather();          try{              URL url1 = new URL(myUrl);              ObjectMapper objectMapper = new ObjectMapper();              JsonNode jsonRoot = objectMapper.readTree(url1);             JsonNode jsonMain = jsonRoot.path("main");             JsonNode jsonTemperature = jsonMain.path("temp");              Date date = new Date();              weather.setTemperature(jsonTemperature.asText());             weather.setTimestamp(new Timestamp(date.getTime()));             //weather.setCityModel(cityModelRepository.findByCityName(cityName));             System.out.println(cityName);             //weatherModelRepository.save(weather);         } catch (MalformedURLException e) {             e.printStackTrace();         } catch (IOException e) {             e.printStackTrace();         }     } }   Null Pointer is in line, where is comment. Can you give me advice how to solve this problem?

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


Prove the orthogonal complement of the row space of $A $is ${0}$ implies $Ax = 0$ has only the trivial solution

I am trying to understand how to find the orthogonal complement of a subspace $M$ of a vector space $V$.   From my understanding, $M^\perp$ is also a subspace of $V$ where all its vectors are perpendicular (orthogonal) to the columns of $M$, which would mean that the dot product of those vectors with each column of $M$ is $0$.  However, how do I find the $M^\perp$ subspace, when $M = \{ \vec{x} \in \mathbb{R}:  2x_2 + 3x_1 = 0\}$? In general, if there's a general approach, how does one attempt to find $M^\perp$ of an arbitrary $M$?  From my understanding, in this case, $M$ is the set of vectors in a plane that satisfy that equation, where $x_1$ and $x_2$ should respectively be the first and second components of the vector $\vec{x}$.


I need to develop an app for iphones. I have a laptop that runs on ubuntu. Can we develop the complete code, run and test it on ubuntu machine?   Thanks

Can I develop for iOS on Ubuntu?  I was told that since it was Unix based, that I could develop for iOS on Linux. But can I also upload iOS games to the Apple's App Store on Linux?


Should I declare an Android class member protected? What would be the benefits? All examples I see just declare the field type and its name ("package protected").  protected TextView mName;   vs   TextView mName;   I don't need to extend such class.

In Java, are there clear rules on when to use each of access modifiers, namely the default (package private), public, protected and private, while making class and interface and dealing with inheritance?


So I'm writing a report and changed my OS a while back and had to reinstall latex. I used the texlive installer for linux. I am user biber for my bibliography and this used to work, I now however get this error;  ERROR - Error: Found biblatex control file version 3.0, expected version 3.5. This means that your biber (2.12) and biblatex () versions are incompatible. See compat matrix in biblatex or biber PDF documentation.   I cannot figure out how to down/upgrade the package correctly. Texlive is completely up to date (biblatex 3.12) + (biber 2.12). There's no obvious downgrading option with tlmgr, how do I fix this?  Edit1;  In the compatibility matrix it tells me 2.12 and 3.12 should work together... What's the issue here?  Edit2;  Sorry I am a total derp, I was removing the wrong .aux/.bcf etc files from another project which is almost identical. That's what I get for not having my morning coffee I suppose...

I can't get citations to work with 32-bit MikTeX and TexMaker. It seems like my Biber and biblatex versions are out of sync but I don't know how to sync them, other than by using the "synchronize" command in the MikTeX Package Manager.  Input  \documentclass{turabian-thesis}  % PDFLaTeX \usepackage[english]{babel} \usepackage[utf8]{inputenc} \usepackage{csquotes}   \usepackage{filecontents} \begin{filecontents}{\jobname.bib}     @book{turabian_manual_2013,         author = {Turabian, Kate L.},         edition = {8th edition},         title = {A Manual for Writers of Research Papers, Theses, and Dissertations: Chicago Style for Students and Researchers},         shorttitle = {A Manual for Writers of Research Papers, Theses, and Dissertations},         publisher = {University of Chicago Press},         year = {2013}} \end{filecontents}  \usepackage{biblatex-chicago} \addbibresource{\jobname.bib}  \begin{document} \end{document}   Log  Process started  Use of uninitialized value $bltxversion in concatenation (.) or string at C:\Users\benna\AppData\Local\Temp\par-62656e6e61\cache-564dd4103627c1c374effa6d52fc299ad25d4d4a\inc\lib/Biber.pm line 415.  INFO - This is Biber 2.5 INFO - Logfile is 'Citation_sample.blg' INFO - Reading 'Citation_sample.bcf' ERROR - Error: Found biblatex control file version 3.0, expected version 3.1.         This means that your biber (2.5) and biblatex () versions are incompatible.         See compat matrix in biblatex or biber PDF documentation. INFO - ERRORS: 1  Process exited with error(s)


Well my dad just bought some phone for me "x-touch ocean" and I've beeeeeen trying to download apps but it keeps saying "insufficient memory on the device" I tried deleting apps I already found in the phone but still.. I got a new memory card with nothing in it but it still says the same thing over and over.. I haven't downloaded anything at all by the way. And I tried to move apps to the memory card but none of them can be moved unfortunately. Please some one help  #frustrated 15 year old #

After one of the latest updates (not sure if it was the last one or a previous one) of the Google Play app, I am having an error trying to update a large app (42MB). It says:     Error Downloading . There is insufficient space on the device.   My device is a Samsung P1000 running Froyo. It's rooted, but the error was there before rooting it.  A quick Google search showed several Samsung users having the same problem (the app in question that was giving me the headache is Smurf's village). Some said that removing the updates to the Android Market (Google Play) app would fix it, but to me it was of no avail.  I also tried the procedure in  to no avail.  Now I am stuck with a prehistoric version of the Market (that works on small apps) and still cannot update Smurf's Village or install big apps. How can I fix this?  EDIT: device has over 2GB of internal SD storage, 27GB of external SD card, so space is not an issue.


This problem is from prmo 2021  find sum of all positive integers n for which $|2^n+5^n-65|$ is a perfect square  My method $2^n+5^n-65=\pm m^2$ case 1 $2^n+5^n=65-m^2$ This is satisfied by n=2 only case 2 $2^n+5^n=65+m^2$ This condition gave me value for many n on counting right from n=1 to large number which increases the chance of missing a number. Is there a better way to calculate without actually counting all numbers

Find the sum of all positive integers $n$ for which $|2^n + 5^n– 65|$ is a perfect square.  It is easy to check for $n<3$ only $n=2$ works. Looking at $n≥3$, $2^n + 5^n– 65= a^2$ For odd $n$, LHS has unit digit $2$ or $8$ but RHS has unit digit $0,4$ or $6$. Hence $n$ cannot be odd. For even $n$ we can rewrite our expression as follows ($n=2k$):  $$(a – 2^k)(a+2^k)=5(5^{2k–1} – 13)$$ But I wasn't able to finish off after this. Both LHS and RHS have the same unit digit ($0$). Through trial and error I found that $n=4$ works, but $n=6,8$ don't. Since the questions asks for the sum as is common in Olympiad number theory it's highly unlikely that any other larger values satisfy. I also tried some alternative ways like looking at the equation modulo $4$ but that didn't help.


For D&D 5e, TFD states that when I move more than 20’ away, TFD      ...follows you so that it remains within 20’...   I cast TFD and place one end of a 25’ long beam on it. On the other end is a seat and wheels.  Will TFD move toward me in perpetuity at my normal movement until I dismount from the far end of the beam?

So Tenser's floating disc "follows you so that it remains within 20 ft" if you are more than 20 ft away.  So let's get a bit of carpentry skill together, and (whilst keeping the total weight under 500-1000 pounds) rigging up a cart that is 25 feet long. The underside of the carriage is 3 ft tall, and the wheels are 3 ft diameter.  The wizard casts Tenser's Floating Disc, and the party's barbarian picks up the carriage, and puts the rear end on top of the floating disc (let's strap it in with some ropes for good measure).  The wizard then climbs on the carriage, and moves towards the front.  As soon as he gets > 20 feet away, what happens? What speed does the happening occur at?  Bonus question: Assuming the above answer is that the carriage moves, at a high enough speed to be useful, any ideas how to steer such a device other than the wizard moving back within 20 feet to stop it and turning it manually like a peasant?  To alleviate concerns that the carriage is an obstacle to the disc, an alternate construction could instead use a 50 ft plank, not touching the ground, with the disk in the middle, the wizard at the front and an equal weight counter balance on the other end. That way, the disk is carrying things, but it not touching anything other than the things it is carrying.


I need to show that a real, bounded, convex function whose domain is $\mathbb{R}$ is constant.  I don't know where to start.  Thanks in advance!

How can we show that a bounded and convex function on $\mathbb R$ is constant? Derivatives are of no use since the function does not have to differentiable. I saw an answer here I think a while ago but did not understand it at all.  Since derivatives are useless, we would have to use the definition and somehow show that the function lies between two values which are equal to each other. But I am unable to progress any further.


When I call session_start() or session_regenerate_id(), PHP generates what appears to be a random string for the session ID. What I want to know is, is it just a random sequence of characters, or is it like the uniqid() function?  Because if it's just random characters, couldn't you theoretically run into a conflict? If User A logged in and then User B logged in and, though highly unlikely, User B generated the same session ID, then User B would end up accessing User A's account.  Even if PHP checks to see if a session with the same ID already exists and, if so, regenerates an ID again... I don't think I want a system that EVER produces the same ID twice, even after garbage collection -- maybe I want to store a table of them and check against them for possible hijacking or whatever.  If it isn't unique, how should I go about enforcing uniqueness? I'd rather implement it using PHP configuration than in every script I make. Nice thing about PHP sessions is not worrying about the technical details behind the scenes.

How unique is the php session id? I got the impression from various things that I've read that I should not rely on two users never getting the same sessionid. Isn't it a GUID?


Supposed in a population, I take a sample with a size of 1500 to build a 96% confidence interval for the true mean $\mu$. Then such an interval is assumed to range from 6.8 to 8.0. Assume the sample mean is $\overline{x}$. Then I conclude that:  if a sample with a size of 1500 were repeatedly constructed, then over   a long run 96% of the confidence interval formed would contain the true  mean $\mu$. (Another trivial interpretation is that I am 96% confident  that the true mean will lie between 6.8 and 8.0 so I don't want to  bother to mention this interpretation).  Am I correct with my above conclusion? Thank you!

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


Given $f, g \colon \mathbb{R} \rightarrow \mathbb{R}$ be a periodic function. If $\lim\limits_{x \rightarrow \infty} \left(f(x) - g(x)\right) = 0$, prove that $f = g$.

If $f(x)$ and $g(x)$ are two periodic functions, that is, $f(x+T_1)=f(x)$ and $g(x+T_2)=g(x)$ for every $x \in \Bbb R$. Now that $\displaystyle\lim_{x\to\infty}(f(x)-g(x))=0$.  Conjecture: $f(x) \equiv g(x)$.


Some people told me that metaphor is a type of analogy. If so, is it too general if I consider a technique as an analogy at school when I have to find techniques and analyse them (provide names of the techniques, examples and effects)? Should I just consider an analogy as either a metaphor or simile or some other specific techniques (other types of analogy that I still don't know)? Thank you so much!

Many a time I've asked what the difference is between an analogy and a metaphor. I've asked it to my teacher, on internet sites, to my parents, so on and so forth. I got a different answer every time, and I never fully grasped what the difference is, so what is the difference?


I have created an Active Directory Group and created it as a user, we'll call it "AD SQL", in my DB. I can successfully login in using Active Directory Authentication and read/write.  However, Intellisense is not working for any Active Directory users.  If I log in using my Active Directory Admin, "AD ADMIN", Intellisense works fine.  Can anyone tell me what permissions/roles/view/etc are needed for a user to have access to Intellisense?  My "AD SQL" user the following roles/permissions:   db_owner db_datareader db_datawriter GRANT CONNECT (DATABASE) GRANT VIEW DEFINITION (DATABASE)   And I have already tried Refreshing Cache/Restarting SSMS.

This problem is really proving to be a tricky one (and quite annoying).  In SQL Server Management Studio 2008, up until a few days ago my IntelliSense was working great.  Then all of a sudden it stopped.  The icon as it as enabled on the toolbar menu, and under Tools -> Options -> Text Editor -> T-SQL -> IntelliSense it says it is enabled there.  I have tried refeshing the IntelliSense cache with Ctrl-Shft-R but that doesn't work either.  Any ideas what happened to my IntelliSense and what I need to do to get it back?


After upgrading to TeX Live 2013 one of my books does not compile any longer. I do load etex, but still have not enough room. What can I do? Back in 1994 I had a colleague who hacked the LaTeX source code and increased the number of registers there, but this is probably not the way to go. Is there anything I can do? Loading eetex or even eeetex? =:-) I can compile the document when I do not load soul, but I need \st.  Edit: This is the error message  ! No room for a new \dimen . \ch@ck ...\else \errmessage {No room for a new #3}                                                   \fi  l.322 \newinsert\@indexbox  ? x  Here is how much of TeX's memory you used:  22107 strings out of 493316  370083 string characters out of 6137929  515169 words of memory out of 5000000  25110 multiletter control sequences out of 15000+600000  10432 words of font info for 28 fonts, out of 8000000 for 9000  957 hyphenation exceptions out of 8191  75i,1n,77p,581b,275s stack positions out of 5000i,500n,10000p,200000b,80000s No pages of output.   This is an example:  \documentclass{scrbook}  \usepackage{etex}   \usepackage{ifthen} \provideboolean{draft} \setboolean{draft}{false}  \usepackage[latin1,utf8x]{inputenc}  \usepackage[T1]{fontenc} \usepackage{times}  \usepackage[T1]{tipa}  \usepackage{amssymb}  \usepackage{eurosym}  \usepackage{jambox}  \usepackage[paperwidth=170mm,paperheight=240mm,textwidth=126mm,textheight=196mm,tmargin=25mm,driver=dvips]{geometry} \usepackage{natbib} \usepackage{scrpage2}  \usepackage{ngerman}\selectlanguage{german} \usepackage[german]{varioref}  \usepackage{graphicx}  \usepackage{subfig} \usepackage{tikz-qtree}  \usepackage[figuresright]{rotating}   \newdimen\widelabel \widelabel=0.0pt   \usepackage{tree-dvips,pstricks,pst-node,lastpage,float,comment,soul}   \usepackage{ogonek}    \usepackage{authorindex} \usepackage[bookmarks=true,hyperindex=true,% breaklinks=true, draft=false,plainpages=false,hyperfootnotes=false,% pdfauthor={Stefan Müller},% pdftitle={Grammatiktheorie},% pdfkeywords={PSG, GB, GPSG, HPSG, LFG, TAG, LTAG, Syntax, Deutsch}, ps2pdf=true  %ohne diesen Treiber geht der Zeilenumbruch in URLs ]{hyperref}% for pdf files  \usepackage{breakurl}  \usepackage{array} \usepackage{calc} \usepackage{varioref,ifthen} \usepackage{xspace}  \usepackage{index}  \begin{document}  Unfortunately there was no room left for the book.  \end{document}   I think it is this one call to \newdim, which I extracted from a non-CTAN stylefile that I use, that makes the difference ...

I have this error message:  ! No room for a new \dimen . \ch@ck ...\else \errmessage {No room for a new #3}                                                 \fi   which I can not find a cure for.


I was wondering if anyone has tried multiple cards in the FZ200 to find out just how fast it needs to be to make the camera as fast as possible? I bought a kit that looks like it includes a generic class 10 32GB card and I am considering buying a new one that is rated at 600x class 10 UHS-I made by transcend for about $29 USD. But if it won't make any difference besides reading it into the computer faster using a usb 3.0 card reader, I won't worry about it.   I read that some people using the high speed video modes, like 720p at 120fps had problems with it getting a write error on slower cards after about 15 seconds since the card couldn't keep up with the writing of the video, but I believe this was with a class 6 card they were trying to use. The camera users manual says it is compatible with Class 10 UHS-I, but a lot of times that just means it will work, not that it is necessarily better. It says it requires a class 4 or higher when recording motion pictures, but then I read about someone with a class 6 not being fast enough in some cases. I hope someone out there has tested some different cards and that you can help enlighten me on the subject. Maybe someone knows a place that tested different cards in the FZ200 and you could point me in that direction.   I have found reviews on various new UHS-I cards, but that doesn't really matter since I know it doesn't need the fastest class 10 UHS-I card there is, since it says it should work with a class 4. I really just want to feel confident that I can get all of the performance out of the camera that I can without slower burst speed or getting video errors unlike people with a faster card.  Thanks

Cameras rarely specify exactly what speed cards you should be using in them - I just checked the manual for my DSLR, and all it says is to use an SDHD card, and a "high speed" card should be used for recording video.  On the other hand, there are a number of different rating systems for memory card speed (33x! 150x! Class 2! Class 10!) and price seems to increase with speed.  Is there any way to test the maximum write speed the camera is capable of?  Are the read/write speeds documented anywhere?


I am having trouble simplifying an induction question. The question is:  Let $P(n)$ be the statement that $n! < n^n$ where $n$ is an integer greater than $1$.  My work so far:  Base case $n = 2$  $2! = 2$  $2^2 = 4$  $2 < 4$. Therefore the base case is true  Inductive Hypothesis  $P(k) = k! < k^k$ for some $k > 1$  Inductive step  $P(k+1) = (k+1)! < (k+1)^{k+1}$  $k!(k+1) < k^k(k+1)$  (so from my understanding and based on previous questions, I want to take $k^k(k+1)$ into  $(k+1)^{k+1}$ as next inductive step.  $k^k(k+1) = k^k+1 + k^k$ using distribution.   I'm not sure where to go from here.   Thanks!

Call $P(k): k!<k^k$, for $k\geq 2$ Test it out with 2, and it's true ($2<4$).   Assume that $P(k)$ is true for some $k\geq2$.  Then show that $P(k+1)$ is true.   $P(k+1): (k+1)!<(k+1)^{k+1}$  Ministep: $(k+1)!=k!(k+1)$ Ministep: $(k+1)^{k+1}=(k+1)^{k}(k+1)$    $k!(k+1)<(k+1)^{k}(k+1)$  Can I just pull out that (k+1) and call it a day? That will make $k!<(k+1)^{k}$.   We're already assuming that $k!<k^k$, for some integer $k\geq 2$, and I don't think I need to prove that $k^{k}<(k+1)^{k}$. I mean, I guess I could go prove that as well, but let's assume for the moment that I don't have to. Since we're assuming the original $P(k)$ is true, I should be able to write $k!<k^{k}<(k+1)^{k}$ right? That would prove the $k+1$ case. Is this the correct way to go about things? It seems too easy, but makes sense.  Thanks for confirmation and/or pointing out mistakes!


I am on Ubuntu 14.04 and it always show me the little icon for updates, I do it and every time it show me this message :   W:Failed to fetch (http)://ppa.launchpad.net/c-korn/ppa/ubuntu/dists/trusty/main/source/Sources 404 Not Found , W:Failed to fetch (http)://ppa.launchpad.net/c-korn/ppa/ubuntu/dists/trusty/main/binary-amd64/Packages 404 Not Found , W:Failed to fetch (http)://ppa.launchpad.net/c-korn/ppa/ubuntu/dists/trusty/main/binary-i386/Packages 404 Not Found ,       E:Some index files failed to download. They have been ignored, or old ones used instead.   I googled and didn't find any "accurate" solution for this error, do you think is my nvidia driver the problemes ( I use the nvidia driver giving in software and updates : proprietary, tested) ? Because I have some little problems to make my Nvidia drivers work well.

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?


Is there any way I can add a static extension method to a class. specifically I want to overload Boolean.Parse to allow an int argument.

I'm a fan of extension methods in C#, but haven't had any success adding an extension method to a static class, such as Console.  For example, if I want to add an extension to Console, called 'WriteBlueLine', so that I can go:  Console.WriteBlueLine("This text is blue");   I tried this by adding a local, public static method, with Console as a 'this' parameter... but no dice!      public static class Helpers {     public static void WriteBlueLine(this Console c, string text)     {         Console.ForegroundColor = ConsoleColor.Blue;         Console.WriteLine(text);         Console.ResetColor();     } }   This didn't add a 'WriteBlueLine' method to Console... am I doing it wrong? Or asking for the impossible?


I have a table with a structure like:  | id | textfield | text_group |  | 1  | yes       | 123        |  | 2  | y         | 123        |  | 3  | no        | abc        |  | 4  | n         | abc        |    I'd like to return all records, but such that I get:  | colA  | text_group |  | yes y | 123        | | no n  | abc        |   Is this possible simply with a query, or will I need to use some programming to format it as such?  I would have done a group by, but then I lose the information in result ColA

Using MySQL, I can do something like:  SELECT hobbies FROM peoples_hobbies WHERE person_id = 5;   My Output:  shopping fishing coding   but instead I just want 1 row, 1 col:  Expected Output:  shopping, fishing, coding   The reason is that I'm selecting multiple values from multiple tables, and after all the joins I've got a lot more rows than I'd like.  I've looked for a function on  and it doesn't look like the CONCAT or CONCAT_WS functions accept result sets.  So does anyone here know how to do this?


i heard somewhere that for example to tell that a function has a big theta of n it has to have complexity of n in both its best and worst cases, so linear search would not be big theta of n because it has best case O(1), but i doubt this information, so if you have any code which you want to analyse, when to say that this code has a big theta of some function ?

Sometimes I see Θ(n) with the strange Θ symbol with something in the middle of it, and sometimes just O(n). Is it just laziness of typing because nobody knows how to type this symbol, or does it mean something different?


Assume I have checked an email using is_email and the result is true, should I sanitize with sanitize_email? if yes, then why?

I'm using  to check if a user-provided email address is valid. For example:  $email = $_POST['email']; if ( is_email( $email ) )     // Do something.   To the best of my knowledge, nothing in this function writes info to the database. Should I be sanitizing $email before I pass it to the function?


While installing sbt I am encountering these errors  E: Malformed entry 1 in list file /etc/apt/sources.list.d/sbt.list (Suite) E: The list of sources could not be read.   I opened sbt.list  it has these two lines:  deb http://dl.bintray.com/sbt/debian/ deb http://dl.bintray.com/sbt/debian/   It is missing distribution and component details. How should I alter it to fix the problem?

I have unistalled and reinstalled the Ubuntu Software Center as per info I found in a similar thread and I got the same response about line 91 or something like that.  I just tried to upload a screen shot but since I'm new it won't allow me to.  I also can not figure out how to cut and paste anything so I have to hand type what the error screen says, both when I attempt to open the software center and nothing happens, when I try to enter commands into the terminal to uninstall, reinstall, whatever I get the same following:  COULD NOT INTITIALIZE THE PACKAGE INFORMATION An unresolvable problem occured while initializing the package information Please report t:his bug against the 'update-manager' package and include the following error message: 'E: Malformed line 91 in source list/etc/apt/sources.list (dist parse)  E: The list of sources could not be read.,  E: The package list of status file could not be parsed or opened.   How do I report bugs?  What can be done about this.  I have searched and everything everyone says to do leads me back to the same line error message.  So, I don't know how to get to line 91 in the source list; to tell you what it says. Sorry, I'm really new to this. That is what I need is to find out how to get there and fix what it says. I would really like to NOT have to re partition my hard drive and start from scratch, so I'm really looking forward to getting this problem solved. I need to be able to install new software.


I am running into a problem at work where end users are unable to email Hotmail or MSN email addresses.  We are running an Exchange 2007 server and the message itself is in HTML and contains no attachments.  If messages are sent to a distribution list, those recipients who use other email providers are able to receive and view the message.  Now the kicker is that sometimes we are able to reach the addresses, though not with any regularity.  For instance, a user may not be able to send a message in the morning, but will be able to in the afternoon or perhaps a couple of days later.  Other times, we are unable to reach the addresses at all no matter how many times we try.  Here's some of the information that will get sent back during an unsuccessful attempt:     Delivery has failed to these recipients or distribution lists:      An error occurred while trying to deliver this message to the recipient's e-mail address. Microsoft Exchange will not try to redeliver this message for you. Please try resending this message, or provide the following diagnostic text to your system administrator.      The following organization rejected your message: snt0-mc1-f7.Snt0.hotmail.com.   Also, our mail server generates diagnostic information that the Hotmail (or MSN) server returned a "#500 Unrecognized command ##"    Has anyone encountered anything like this or know what the problem may be?  Update  I've looked at the issue a little more and it appears that the SPF record is good (or at least passable).

This is a  about how to handle email sent from your server being misclassified as spam.  For additional information you may find these similar questions helpful:                    Sometimes I want to send newsletters to my customers. The problem is, that some of the emails get caught as spam messages. Mostly by Outlook at the client (even in my own Outlook 2007).  Now I want to know what should be done to create "good" emails. I know about reverse lookup etc., but (for example), what about a unsubscribe link with an unique ID?  Does that increase a spam rating?


if I call my pocket for an 8 ball shot. I shoot my 8ball toward the pocket. its going toward the pocket but hits another ball that's on the table and still goes in do you lose the game.  not a combo shot to make the 8ball  it just hits it on the way

Regular 8 call pocket pool you are on the 8 ball for the win. You call your pocket. You shoot and hit the 8 ball. It's going for the pocket you called, but hits another ball on the way and still goes in the pocket that was called. Do you lose the game


Let $E \subset \mathbb{R}^2$ be a connected convex open subset with $(0, 0) \in E$, and $f(x, y)$ be a differentiable function on $E$. Suppose $f$ satisfies $$x \frac{\partial f}{\partial x} + y \frac{\partial f}{\partial y} = 0$$ then prove $f$ is constant on $E$.    We are given $E$ is convex and connected with $(0,0) \in E$, so it only seems natural to start with a line from the origin to $(x, y)$. Let this be $\gamma(t) = (tx, ty)$. We wish to show that the derivative across this line is zero so that $f(0,0) = f(x,y)$. So, take $h(t) = f(\gamma(t))$ and $h'(t) = f'(\gamma (t))\gamma'(t)$.  Now  $f'(\gamma (t)) = \frac{\partial f}{\partial x}\frac{\partial x}{\partial t} + \frac{\partial f}{\partial y} \frac{\partial y}{\partial t} = x \frac{\partial f}{\partial x} + y \frac{\partial f}{\partial y} = 0$  $\gamma'(t) = \gamma$ since $\gamma$ is a linear operator.  Now do I just say that the whole thing equals to zero and be done with it?

Assume  $D \subset \mathbf{R}^2$ is a convex domain which contain original point. $f \in C^{(1)}(D)$,if $$x\frac{\partial f(x,y)}{\partial x}+y\frac{\partial f(x,y)}{\partial y}=0, \left((x,y)\in D\right)$$ show that $f(x,y)\equiv \text{constant}$


I'm trying to use the \begin{center} command twice on the same page, but weirdly it's not working, the second time it gives trouble. When I take it away from the first time, then the other one does work fine. Some code of a simple case to illustrate:  \documentclass{report}  \begin{document}  \vspace*{2em} \begin{center} \section*{Abstract} \end{center} \noindent bla bla   \vspace*{2em} \begin{center} \section*{Acknowledgements} \end{center} \noindent bla bla  \end{document}   Then the error I get is: ! LaTeX Error: Something's wrong--perhaps a missing \item. Which points to the second \end{center}. If I don't use centering of the first heading, but keep the centering for the second, then everything works fine.   Thanks in advance.

I would like to use titlesec  to center my sections as follows (MWE):  \documentclass[10pt,a4paper,twoside]{book} \usepackage[latin1]{inputenc} \usepackage{lipsum} \usepackage{titlesec} \titleformat{\section}% command to format the section titles         [block]% shape/type of title         {\LARGE\bfseries}% formatting commands applied to both label and title         {\begin{center} \thesection \end{center}}% section number; here set inside an invisible box with a constant width         {0em}% separation between number and chapter title; we've already covered this with the box         {}% additional formatting command for title itself not applied to number         [         ]% \begin{document} \chapter{The first chapter} \lipsum[1-5] \section{First section} \lipsum[3] \section*{Section} \lipsum[4]  \end{document}   But this does not center the title of the section, and it is not very beautiful either. How can I beautifully center sections using titlesec?


I want to use commuting diagrams and the classicthesis package.  I've edited the classicthesis document so that tikz, tikzcd and the braids packages are included after the classicthesis package.  However I get the error:  ! Package pgfkeys Error: I do not know the key '/tikz/"f"' and I am going to ignore it. Perhaps you misspelled it.   Here's a minimal example:  \documentclass[     oneside,openright,titlepage,numbers=noenddot,headinclude,%1headlines,     %footinclude=true,     cleardoublepage=empty,     dottedtoc, % Make page numbers in the table of contents flushed right with dots leading to them     BCOR=5mm,paper=a4,fontsize=11pt, % Binding correction, paper type and font size     ngerman,american, % Languages, change this to your language(s)     ]{scrreprt}   % Includes the file which contains all the document configurations and packages - make sure to edit this file \input{classicthesis-config}   \begin{document}     \begin{center}     \begin{tikzcd}                 U                 \arrow[r,hook, "f"]               & V \end{tikzcd} \end{center} \end{document}   However: If I write   \documentclass[     oneside,openright,titlepage,numbers=noenddot,headinclude,%1headlines,     %footinclude=true,     cleardoublepage=empty,     dottedtoc, % Make page numbers in the table of contents flushed right with dots leading to them     BCOR=5mm,paper=a4,fontsize=11pt, % Binding correction, paper type and font size     ngerman,american, % Languages, change this to your language(s)     ]{scrreprt}   % Includes the file which contains all the document configurations and packages - make sure to edit this file \input{classicthesis-config}   \begin{document}     \begin{center}     \begin{tikzcd}                 U                 \arrow{r}{f}               & V \end{tikzcd} \end{center} \end{document}   everything works fine. This makes me rather confused. What is it, I'm missing?  Here's a stripped-down version of my classicthesis-config:  \PassOptionsToPackage{utf8}{inputenc}  \usepackage{inputenc}  \PassOptionsToPackage{eulerchapternumbers,listings,drafting, pdfspacing, subfig,beramono,eulermath,parts}{classicthesis}  \newcounter{dummy}  \providecommand{\mLyX}{L\kern-.1667em\lower.25em\hbox{Y}\kern-.125emX\@} \newlength{\abcd}     \PassOptionsToPackage{fleqn}{amsmath}  \usepackage{amsmath} \usepackage{amsthm} \usepackage{amsfonts}  \PassOptionsToPackage{T1}{fontenc}  \usepackage{fontenc}  \usepackage{textcomp}  \usepackage{scrhack}  \usepackage{xspace}  \usepackage{mparhack}  \usepackage{fixltx2e}   %\PassOptionsToPackage{pdftex}{graphicx} %\usepackage{graphicx}   \usepackage{tabularx}  \setlength{\extrarowheight}{3pt}  \newcommand{\tableheadline}[1]{\multicolumn{1}{c}{\spacedlowsmallcaps{#1}}} \newcommand{\myfloatalign}{\centering} % To be used with each float for alignment \usepackage{caption} \captionsetup{font=small} \usepackage{subfig}    \usepackage{classicthesis}  \usepackage{tikz} \usepackage{braids} \usetikzlibrary{cd}

The MWE below gives error language@active@arg" has extra }.  \documentclass{article}     \usepackage[T1]{fontenc}     \usepackage[utf8]{inputenc} \usepackage[english,slovene]{babel}%     \usepackage{tikz} \usetikzlibrary{quotes}  \begin{document}     \begin{tikzpicture} \draw (0,0) edge ["right", ->] (2,0);     \end{tikzpicture} \end{document}   Cause for it is option slovenian in babel which seem to redefine " somehow (if I remove this option, MWE work fine). Please, help me fix this error.


my first language isn't English and there's a question no teacher has been able to answer me; when exactly do you use "Whom" instead of "Who" and why? Thanks. Also, I'm new here and if you have any tips on how to post my questions correctly it would be of great help. Thanks again.

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?


Just writing a PHP website and using mySqli for my database connectivity. Really enjoying it as I can use Prepare statements and then do a $result = $stmt->get_result(); which loads results into an associated array. However, thought it best be time to upload a few pages and the DB to hosting site to test speed and such to find that it does not support the $stmt->get_result(); command, having it needing to use the mysqlnd driver which my host does not support.   Looking into this nor does many host providers either. Now when I started the website I looked back at some of my old PHP code and apparently the normal mySql code that I used to use has become obsolete and was told on the internet to use mySQLi instead only to find that support for this is dropping to?! so it would see, so what is the best mySql connectivity to use?

In our place we're split between using mysqli and PDO for stuff like prepared statements and transaction support. Some projects use one, some the other. There is little realistic likelihood of us ever moving to another RDBMS.  I prefer PDO for the single reason that it allows named parameters for prepared statements, and as far as I am aware mysqli does not.  Are there any other pros and cons to choosing one over the other as a standard as we consolidate our projects to use just one approach?


I installed nginx 1.1.19 on my ubuntu 12.04 Server.  Now I want to upgrade it to 1.7.6, I add nginx_signing.key and apt source for nginx, then run sudo apt-get install --only-upgrade nginx. But I got this error:  The following packages were automatically installed and are no longer required:   libjpeg8 libgd2-noxpm nginx-full libjpeg-turbo8 nginx-common Use 'apt-get autoremove' to remove them. The following packages will be upgraded:   nginx 1 upgraded, 0 newly installed, 0 to remove and 168 not upgraded. Need to get 0 B/466 kB of archives. After this operation, 904 kB of additional disk space will be used. (Reading database ... 47117 files and directories currently installed.) Preparing to replace nginx 1.1.19-1ubuntu0.6 (using .../nginx_1.7.6-1~precise_i386.deb) ... Unpacking replacement nginx ... dpkg: error processing /var/cache/apt/archives/nginx_1.7.6-1~precise_i386.deb (--unpack):  trying to overwrite '/usr/sbin/nginx', which is also in package nginx-full 1.1.19-1ubuntu0.6 No apport report written because MaxReports is reached already                                                               dpkg-deb: error: subprocess paste was killed by signal (Broken pipe) Errors were encountered while processing:  /var/cache/apt/archives/nginx_1.7.6-1~precise_i386.deb E: Sub-process /usr/bin/dpkg returned an error code (1)   What's the problem and how to fix it?

The Software up-to-date Option automatically download the upgrade for nginx. but While installing it's giving me the following error:  Reading package lists... Done Building dependency tree        Reading state information... Done The following NEW packages will be installed:   nginx 0 upgraded, 1 newly installed, 0 to remove and 0 not upgraded. Need to get 0 B/434 kB of archives. After this operation, 977 kB of additional disk space will be used. (Reading database ... 291344 files and directories currently installed.) Unpacking nginx (from .../nginx_1.4.7-1~precise_amd64.deb) ... ----------------------------------------------------------------------  Thanks for using nginx!  Please find the official documentation for nginx here: * http://nginx.org/en/docs/  Commercial subscriptions for nginx are available on: * http://nginx.com/products/  ---------------------------------------------------------------------- dpkg: error processing /var/cache/apt/archives/nginx_1.4.7-1~precise_amd64.deb (--unpack):  trying to overwrite '/etc/logrotate.d/nginx', which is also in package nginx-common 1.4.6-1+precise0 dpkg-deb: error: subprocess paste was killed by signal (Broken pipe) Errors were encountered while processing:  /var/cache/apt/archives/nginx_1.4.7-1~precise_amd64.deb E: Sub-process /usr/bin/dpkg returned an error code (1)   Actually that file /etc/logrotate.d/nginx does not exist in this folder.


It is easily proved by using the notion of determinant.But without using determinant, how to prove it? Actually,this proposition is from section 2.3 0f Linear Algebra and Its Applications by Lay D.C.The notion of "rank" is not taught before section 2.4. What has been taught is  basic concept 0f linear transformation(including surjective and injective) and matrix multiplication. Thanks in advance!

If $A$ and $B$ are square matrices such that $AB = I$, where $I$ is the identity matrix, show that $BA = I$.    I do not understand anything more than the following.   Elementary row operations. Linear dependence. Row reduced forms and their relations with the original matrix.   If the entries of the matrix are not from a mathematical structure which supports commutativity, what can we say about this problem?  P.S.: Please avoid using the transpose and/or inverse of a matrix.


Let's say I have an adventure, involving four 4-level heroes.  From the CR description I can assume that one CR 4 monster would be a decent challenge for them, in terms of a combat encounter. Can one CR 4 monster be replaced with four CR 1 monsters or two CR 2 monsters? (I guess it doesn't work like that, it is just an example)  And what if my party has only 3 players (and 3 heroes), how can I scale down the encounter? Should it be a CR 3 monster, or (respectively) three CR 1 monsters?

I recently just finished DMing Lost Mines of Phandelver with a 3 player party and it went great. Just removed a couple of enemies here and there and it was smooth. I ordered PotA and have started reading the handbook and I realised that the higher level encounters have extremely tough enemies!  I just don't want them to get to the Prophets or the Princes of Elemental Evil and getting absolutely crushed. I can remove enemies from encounters but:  To what point will I have to scale down the encounters so I don't get a TPK after 10 minutes of starting the adventure? How do I scale down a very powerful enemy so 3 players can handle it?   Related:


How can I ensure the position of key-value pairs inside a NSDictionary when defining it?  For example if I define:  [detailsView setDatasource: @[     @[@"Details",       @{ @"title_1":@"description1",          @"title_2":@"description2",          @"title_3":@"description3",          @"title_4":@"description4" }],    @[@"Actions",       @{ @"Action_1":[NSNull null],          @"Action_2":[NSNull null],          @"Action_3":[NSNumber numberWithBool:false] }] ];   Then at runtime I have different order of items  [detailsView setDatasource: @[     @[@"Details",       @{ @"title_2":@"description2",          @"title_3":@"description3",          @"title_4":@"description4",          @"title_1":@"description1" }],    @[@"Actions",       @{ @"Action_3":[NSNumber numberWithBool:false],          @"Action_1":[NSNull null],          @"Action_2":[NSNull null]}] ];   This behaviour is unpredictable...  How NSDictionary is initialised when initialising it with literals , and is there a way of ensure that a key-value pair will be at defined position when using literals ?  -- EDIT --  Not a brilliant solution but works. I ended-up doing like this:  @[     @[ @"Route details",          @[               @[@"route-direction", @"Route direction", [NSString stringWithFormat:@"%@ → %@", journey[@"from"], journey[@"to"]]],               @[@"poi-count", @"Points of interest", journey[@"pois-count"]],               @[@"date-created", @"Date created", journey[@"created-at"]],           ]      ],     @[ @"Actions" ,          @[              @[@"favourite", @"Favourite", ( [journey objectForKey:@"favourite"] ? [journey objectForKey:@"favourite"] : [NSNumber numberWithBool:false])],              @[@"load",@"Load now",[NSNull null]],              @[@"delete",@"Delete",[NSNull null]],           ]      ], [NSNumber numberWithInteger: indexPath.row]]];

I have an NSDictionary (stored in a plist) that I'm basically using as an associative array (strings as keys and values).  I want to use the array of keys as part of my application, but I'd like them to be in a specific order (not really an order that I can write an algorithm to sort them into).  I could always store a separate array of the keys, but that seems kind of kludgey because I'd always have to update the keys of the dictionary as well as the values of the array, and make sure they always correspond.  Currently I just use [myDictionary allKeys], but obviously this returns them in an arbitrary, non-guaranteed order.  Is there a data structure in Objective-C that I'm missing?  Does anyone have any suggestions on how to more elegantly do this?


Which is right:   They would’ve got away with it. They would’ve gotten away with it.   I am interested in what we would say in the United Kingdom of Great Britain and Northern Ireland, not in the United States of America.

I see these two expressions are used almost identically in different contexts. Is there a difference between I have got and I have gotten?


I have a website hosting some competition where there are lots of participants. The url to access participant is: www.abc.com/participant/participant_id/  Now, the participants gets lots of page views. Competition is only for a month so the participants url will be removed after competition gets over and all the views from that participant url is no more in use. I am confused about appropriate way to structure urls. I want to use the following url so that all the views recieved is for participants page not for single participant. www.abc.com/participant?participant_id=****  Can someone suggest me which one is the best way to structure url?

Let’s take an example of a movie site. So a well structured set of URLs for this site can be:     Movie page - example.com/movies/the-matrix Review for movie - example.com/movies/the-matrix/reviews Trailers for movie - example.com/movies/the-matrix/trailers Specific trailer for movie - example.com/movies/the-matrix/trailers/trailer1   where it’s possible to navigate the resource even by directly deleting/appending resource name seamlessly.  For SEO purpose I read somewhere that for two given pages, Google will prefer the page which have search query up in the URL hierarchy among other things. So for the given 2 URLs and the query "the matrix trailer"    example.com/movies/the-matrix/trailers example.org/trailers/the-matrix/    `     Google might prefer the second URL as it has the keyword "trailer" at first level comparing to first URL which has "trailer" at 3rd level (a resource deeper in URL hierarchy may be less important).    If it is correct, one may be tempted to create URL hierarchy somewhat like      Movie page - example.com/movies/the-matrix Review for movie - example.com/reviews/the-matrix/ Trailers for movie - example.com/trailers/the-matrix/ Specific trailer for movie - example.com/trailers/the-matrix/trailer1     which will break the seamless hierarchy.    My questions are:   Is it true that resource deeper in URL hierarchy is tend to be less important when comparing to URLs of other site?   Is sacrificing meaningful, seamless hierarchy worth for this SEO optimization?


we are given that $S ⊆ T ⊆ \Bbb R$ and they are u.b prove that .$$\sup S ≤ \sup T$$ What I did : sps. $M$ is the u.b of $T$ which means for all $x$ in $T : x≤M$ and from $S ⊆ T$ we can say that $M$ is also an u.b of $S \implies$ for all $x$ in $S : x ≤  M$ I stopped here ): what should I do to prove it

I am taking a course in Real Analysis this semester and thought I would work ahead a little bit.  I am just reading for the moment, but came across an interesting exercise, and was wondering if I could see how one of you would solve it.  Assume that $A$ and $B$ are nonempty, bounded above, and satisfy $B⊆A$. Show $\sup B≤\sup A.$  Not so much that the question perplexes me, but rather I wanted to see an example of a rigorous proof for this question.


This is related to this question:   There's more to it: when you click to reopen, the pop-up "do you want to reopen?" shows twice. To be sure, I clicked "OK" twice. The second time, I got a message: "you have already voted to reopen this question".

When reviewing a question in the Reopen Votes queue, there are two main options: Leave Closed and Nominate for Reopening.  If I click Nominate for Reopening, a message box appears asking me if I am sure I want to vote to reopen:    If I click cancel, a second message box appears with the same question.   If I click cancel on the second message box is dismissed the message box, but nothing else happens.  If I click okay, a second message box appears with the same question.   If I click okay on the second message box is dismissed the message box, and a vote to reopen is cast. If I click cancel on the second message box is dismissed the message box, and a vote to reopen is cast.    I haven't yet exhausted all possible ways of interacting with these message boxes, but there is definitely at least one bug here.    A similar, and possibly related issue exists with the Leave Closed option. If I click Leave Closed, a message box appears asking me if I am sure I want to vote to reopen:    If I click cancel, the message box is dismissed, and my vote to leave closed is cast.  If I instead click okay the message box is dismissed, and my vote to leave closed is cast, but I occasionally see the error, "An error occurred when reviewing this item. Please try again."    Using Google Chrome Version 27.0.1453.116 m


When a user is suspended, they cannot do any action on the site where they were suspended. (Or on any site, in the case of networkwide suspension.) Still, they can visit the site and they can log in. Question: Does the suspended user still get notification into the inbox? Do they work in the same way as for an account that is not suspended?

I have some questions about a suspended user's earning and activity.   Can suspended users get reputation back after the suspension period? If a user is suspended for 7 days and he/she earns reputation during this period. Then will it be calculated after completing suspension period? If a suspended user has awarded a bounty to other user and the awarded bounty marked as illegal. Then will that bounty rolled back to their account?  Can suspended users get any alert from comments or chat room using @username method? Can suspended users post comments on his/her question/answer? If another user replies or ask a question on suspended user's post. Then, can a suspended user give response back?


By not materialistic I mean someone who just doesn't have interest in material things for the sake of the value it would give them from their possession, but rather acquires them for their functionality or simply because they like it for them. An example of getting something for for the type of materialistic reasons I'm talking about would be... A Fancy car not solely for the purpose as means to get from point A to B, or comfort or practicality, but rather to show off). Similar to getting a nice house or a phone or watch or anything material. It's not "spiritual" because such person can NOT be spiritual. Nor is it "ascetic" because it's effortless and comes naturally. No desire of things beyond their practical usage. There is no "discipline" involved. No if you let yourself go, and became lax, you'd fall back to materialism. The word I'm looking for would describe a person to be not materialistic by nature. Whether they let themselves go or not, it would be unnatural for them to be materialistic. No disciple required. Just no desire to attain material things as a tool to increase their self worth by way of using those goods to gain recognition. As an anology, if they were offered a Rolls Royce or a 1989 Chevy Caprice (but they can't sell the car they choose or give it away), they'd choose the Chevy Caprice simply because they like it more.

I consider myself to be this type of person. A search did not yield anything, but I did find this website. What is the word you use to describe someone who does not like excess, in the sense of quantity of material possesions and / or in purchasing something more expensive because it has a couple of extra features that are not really needed?


Is it possible to calculate the effective aperture size by the parameters below?   f-stop sensor size focal length of lens size of circle of confusion   If yes, what is the equation?  If no, what are the extra parameters needed in order to calculate the aperture size?

I understand that the simple idea that f-stop is focal length divided by aperture really applies to a simple single-glass lens, not the compound lens systems used to provide good image quality in modern lenses.  I've heard that in this case, what matters is the ratio of the aperture as it appears through the front element. Why the front element, and not the back (which would be the "point of view" of the sensor or film)?  What about for effects such as diffraction? Does the literal physical aperture size matter, or is it the effective size?


The Dictionary class is now obsolete,   replaced    by  java.util.Map interface –   why?

What is the difference between a Hash Map and dictionary ADT. And when to prefer one over another. For my programming assignment my instructor has asked to use one of them but I don't see any difference in between both. The program is supposed to work with a huge no. of strings. Any suggestions?


During the trailer launch of Game of Thrones season 8. A feather is shown with a good amount of significance. We have seen this feather related to Robert Baratheon visiting the Crypt of Winterfell but that's the old story.  How is the feather related to season 8 so far what has been aired?

In the  we see a feather which is being held in Lyanna's statue's hands which falls to the floor as Jon walks past it.      Jon does turn to look behind him when the feather hits the floor as well.   We then see the feather being the first thing to start to freeze as the cold, and possibly the White Walkers, approach.    That is the last we see of it, however, a lot of focus is put on this feather. So, where did it come from and considering its focus in the trailer is there any significance to it?


I have a server hosting an intranet web site where one of the features will be the ability to upload files.  The files will be saved in a restricted access folder and managed through the web back-end.  To avoid name collisions, I plan on assigning UUIDs and storing the original filename along with the UUID in a database for future retrieval.  However, I do have 2 concerns:   The possibility of duplicate files (at the actual byte level, not just by name), and Ensuring file integrity.   I thought if I ran some type of hash / checksum (MD5, SHA256, etc.), that could address both concerns.  I could store the hash and compare the file at a future date and verify it had not gotten corrupted, and if I found another file with the same hash, I would know if the file was a true duplicate.  So my questions are:   Are my concerns about file corruption unfounded? Also, is this a good strategy for identifying duplicate files?

This is a  about  the use of a *AMPP's stack.    I recently had a talk with some experienced people and they suggested to me not to use a WAMP stack, and instead install apache, mysql and php separately.  I don't understand why they have suggested this, though, so can anyone tell me?  Is there a particular disadvantage of WAMP, or a particular advantage to installing all of them separately?  Since a WAMP stack itself is composed of apache, mysql and php, then what's the difference between using the WAMP stack and installing them all separately?


If I have both the kinetic and static coefficients of friction between cardboard and steel and between rubber and steel (for the same steel in both cases), is there a way to find the coefficient between cardboard and rubber? For example, can this be done by equalising the force on cardboard/steel and the force on rubber/steel? Thanks a lot!

For a physics engine I am working on, I need to know two object's friction coefficient (for bouncing, collision detection, friction in general etc.). Since this physics engine will have lots of different materials, it would be inefficient to have a list of every pair of materials, with their friction coefficient. So, I would like to know if there is any value I can assign to each material, which would mean I could work out the friction coefficient between the two objects, using the two material's values.


I'd like to install Vagrant software on Ubuntu 16.04, but their , only lists Debian and Cent OS. Is it possible to run this software on Ubuntu?

is a tool to build and manage virtual machines for developers.  It has a  guide that contains iffy-looking suggestions like  $ sudo ln -s /usr/bin/ruby1.8 /usr/bin/ruby  # wtf???   or installing RubyGems from source rather than from Ubuntu packages, and then using gem install to install vagrant itself.  I'm not feeling comfortable just following those instructions.  Is there perhaps a PPA?  Are there, perhaps, alternative tools that are packaged for Ubuntu?


Why? They are not a form of EMR, are they. Or are the rapidly changing ones the only ones we can detect?

I know from reading about the gravitational waves detected by Ligo, that when an object has angular acceleration, it produces gravitational waves.  I'm wondering if an object creates gravitational waves when only accelerating in one direction, however?   I'm also curious as to how the nature of the waves would differ in this case.


I have a list of tuples like this:  [ ('a', 1), ('a', 2), ('a', 3), ('b', 1), ('b', 2), ('c', 1), ]   I want to iterate through this keying by the first item, so, for example, I could print something like this:  a 1 2 3 b 1 2 c 1   How would I go about doing this without keeping an item to track whether the first item is the same as I loop around the tuples? This feels rather messy (plus I have to sort the list to start with)...


I'm trying to copy to clipboard  using Javascript. With Internet Explorer it's possible using   window.clipboardData.setData("Text", serialNumString);   Is there a similar way for copy to clipboard in Firefox and Chrome?

What is the best way to copy text to the clipboard (multi-browser)? I have tried: function copyToClipboard(text) {     if (window.clipboardData) { // Internet Explorer         window.clipboardData.setData("Text", text);     } else {         unsafeWindow.netscape.security.PrivilegeManager.enablePrivilege("UniversalXPConnect");         const clipboardHelper = Components.classes["@mozilla.org/widget/clipboardhelper;1"].getService(Components.interfaces.nsIClipboardHelper);         clipboardHelper.copyString(text);     } }  But in Internet Explorer it gives a syntax error. In Firefox, it says unsafeWindow is not defined. A nice trick without using :


I am trying to understand the following JavaFX example. I do not understand why it is not necessary to create an object (at "openButton.setOnAction", at "handle", at "openFile") - because "openFile" is not a static method ?!  Thanks.  public final class FileChooserSample extends Application {  private Desktop desktop = Desktop.getDesktop();  @Override public void start(final Stage stage) {     stage.setTitle("File Chooser Sample");      final FileChooser fileChooser = new FileChooser();      final Button openButton = new Button("Open a Picture...");     final Button openMultipleButton = new Button("Open Pictures...");      openButton.setOnAction(         new EventHandler<ActionEvent>() {             @Override             public void handle(final ActionEvent e) {                 File file = fileChooser.showOpenDialog(stage);                 if (file != null) {                     openFile(file);                 }             }         });      openMultipleButton.setOnAction(         new EventHandler<ActionEvent>() {             @Override             public void handle(final ActionEvent e) {                 List<File> list =                     fileChooser.showOpenMultipleDialog(stage);                 if (list != null) {                     for (File file : list) {                         openFile(file);                     }                 }             }         });       final GridPane inputGridPane = new GridPane();      GridPane.setConstraints(openButton, 0, 0);     GridPane.setConstraints(openMultipleButton, 1, 0);     inputGridPane.setHgap(6);     inputGridPane.setVgap(6);     inputGridPane.getChildren().addAll(openButton, openMultipleButton);      final Pane rootGroup = new VBox(12);     rootGroup.getChildren().addAll(inputGridPane);     rootGroup.setPadding(new Insets(12, 12, 12, 12));      stage.setScene(new Scene(rootGroup));     stage.show(); }  public static void main(String[] args) {     Application.launch(args); }  private void openFile(File file) {     try {         desktop.open(file);     } catch (IOException ex) {         Logger.getLogger(             FileChooserSample.class.getName()).log(                 Level.SEVERE, null, ex             );     } }   }

What is the main difference between an inner class and a static nested class in Java? Does design / implementation play a role in choosing one of these?


I'm trying to understand PDO prepared statements. Did I implement them correctly in the code below? $guestFirstName = $_POST['guestFirstName']; $guestLastName = $_POST['guestLastName']; $guestMessage = $_POST['guestMessage'];  //remove whitespace from beginning and end $guestName = trim($guestName); $guestMessage = trim($guestMessage);  $errors = validate_inputs($guestFirstName, $guestLastName, $guestMessage); //if there are no errors received.     if (empty($errors)) {       try {         //open the database         $db = new PDO(DB_PATH, DB_LOGIN, DB_PW);         $db->setAttribute(PDO::ATTR_ERRMODE, PDO::ERRMODE_EXCEPTION);          //insert the first name, last name, and message into the database         $stmt = $db->prepare("INSERT INTO guest_users(first, last) VALUES(:f,:l);");         $stmt->bindParam('f', $guestFirstName);         $stmt->bindParam('l', $guestLastName);         $stmt->execute();          $insertID = $db->lastInsertId();               $stmt2 = $db->prepare("INSERT INTO guest_message (comment, user_id, date_sent) VALUES (:m,:i, now());");        $stmt2->bindParam('m', $guestMessage);        $stmt2->bindParam('i', $insertID);        $stmt2->execute();          $displayName = $db->query("SELECT * FROM guest_users where id = '$insertID'")->fetch(PDO::FETCH_ASSOC);         $displayMessage = $db->query("SELECT * FROM guest_message where id = '$insertID'")->fetch(PDO::FETCH_ASSOC);   Below this is just HTML code where I'm inserting variables like $displayName['first'], $displayMessage['message'], etc. To display information from the database.

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


I have a question about the tagged argument in : Let $g$ be a semisimple Lie subalgebra of $gl(V )$.  For any $x \in g$ we have J-C decomposion $ x= x_s +x_n$ but that's not clear to me why $ x_s ,x_n  \in n_{gl(V)}(g) $ where $  n_{gl(V)}(g) = \{y \in gl(V) | [y,x] \in g $ for every $ x \in g \} $.  By the way: it would be enough to prove $ad(x_s)(g) ⊆ g, ad(x_n)(g) ⊆ g$, but I don't now how...

Good evening everybody,  I have a question about the red tagged argument in : Let $g$ be a semisimple Lie subalgebra of $gl(V )$.  For $x \in g$ we have J-C decomposion $ x= x_s +x_n$ but that's not clear to me why $ x_s ,x_n  \in n_{gl(V)}(g) $ where $  n_{gl(V)}(g) = \{y \in gl(V) | [y,x] \in g $ for every $ x \in g \} $.  My idea: We know that $ x_s = P(x) ,x_n = S(x) $ for appropriate polynomials without constant terms. Thats clear that $x \in n_{gl(V)} $ so because $ g$ is a subspace it would be enough to show that $[z,x^n] \in g $ for every $z \in g$. But how?


If $f$ is continuous, is it (Lebesgue) measurable ? Namely, $\{x\ :\ f(x)<\alpha\}\in\mathcal M\ \forall\alpha$ ?  If not what are some counter examples?

Let $f: \mathbb{R} \to \mathbb{R} $ be a continuous function. I need to show that is a measurable function.   I tried working with the definition:  Let $f: X \to \mathbb{R}$ be a function. If $f^{-1}(O)$ is a measurable set for every open subset $O$ of $\mathbb{R}$, then $f$ is called a measurable function.  Since $f^{-1}(O)$ also lies in $\mathbb{R}$, I think it is sufficient to show that every subset of $\mathbb{R}$ is measurable. But is this possible?   So far I concluded that $\mathbb{R}$ itself is measurable, since $$\mu(A) = \mu(A \cap \mathbb{R}) + \mu(A \cap \mathbb{R}^c) = \mu(A) + \mu(\emptyset) = \mu(A).$$ How do I need to approach?


When I cancel an edit, I get this dialog box:    (I'm using Chrome on Ubuntu if that matters.)  So I need to click "OK" to cancel the edit, and "Cancel" not to cancel the edit.  I initially suggested changing the labels on the buttons, perhaps to "Yes" and "No" to reflect the question being asked. But apparently the button labels are controlled by the browser.  The same problem still exists: The "cancel" link that's shown while editing has the opposite meaning of the "Cancel" button in the dialog box.  Given that, what would you think about changing the "cancel" link to something like "abandon edit"? (This doesn't apply to the .)

If you are editing a question and decide to close the tab/window/whatever, SO opens up a dialog box asking you if you are sure. The buttons for this dialog are "OK" and "Cancel". However, what these map to is not entirely obvious. It would make more sense to change them to action words describing what they do. For example, it could be "Close this Question" and "Stay Here". This would eliminate the need to explain which button does what in the dialog itself and require less work from the user.


Can someone explain why this script doesn't produce the output I was expecting?   #!/bin/bash  #  var=0  ls -1 /tmp| while read file do      echo $file      var=1 done  echo "var is $var"   I get a list of files followed by var is 0  Why isn't var equal to 1? Is it because the while loop spawns a sub-shell?

Why do I get different values for $x from the snippets below?  #!/bin/bash  x=1 echo fred > junk ; while read var ; do x=55 ; done < junk echo x=$x  #    x=55 .. I'd expect this result  x=1 cat junk | while read var ; do x=55 ; done echo x=$x  #    x=1 .. but why?  x=1 echo fred | while read var ; do x=55 ; done echo x=$x  #    x=1  .. but why?


Between the two phrases, "I never once proclaimed that killing is ethical" and "I never once proclaimed that killing was ethical", I believe the former is grammatically correct, although I'm not completely sure.

I know the past tense carries the past tense in every dependent clause, but referring specifically to places or to things that are eternal, like the Earth, seems a bit weird and therefore we sometimes (I believe incorrectly) say     He didn't know that New Jersey was actually on the East Coast.   Because it still is. Or     He thought the Earth was round.   So is it square now?  Logically speaking, would you consider the use of past tense here a bit confusing in a day-to-day speech in these examples? Would you instinctively opt for using the present tense?


I'm trying to compare the performance between the matching with precompiled pattern and a normal matching with regex using the following code. I use JUnit for benchmark testing and it looks like the nonPrecompiled code works faster.  Any ideas why? Do I run the tests in the correct way?  Class code:  import java.util.regex.Pattern;  public class StringSplitter {     private Pattern spacesPattern;     private static final String REGEX_STRING = "\\s+";      public StringSplitter() {         this.spacesPattern = Pattern.compile(REGEX_STRING);     }      public String[] nonPrecompiledTest(String bigS) {         return bigS.split(REGEX_STRING);      }      public String[] precompiledTest(String bigS) {         return this.spacesPattern.split(bigS);      }  }   And the tests code:  import org.junit.BeforeClass; import org.junit.Test; import com.carrotsearch.junitbenchmarks.AbstractBenchmark;  public class PatternBenchmarkTest extends AbstractBenchmark {      private static String bigS;     private static StringSplitter pt;      @BeforeClass     public static void prepare() {         char[] bigString = new char[10000000];         for (int i = 0; i < bigString.length; i = i + 2) {             bigString[i] = 'a';             bigString[i + 1] = ' ';         }         bigS = new String(bigString);         System.out.println("Created big string");          pt = new StringSplitter();         System.out.println("Created test class");     }      @Test     public void testNonPrecompiled() {             pt.nonPrecompiledTest(bigS);     }      @Test     public void testPrecompiled() {             pt.precompiledTest(bigS);     } }   And I get the following result:  Created big string Created test class PatternBenchmarkTest.testPrecompiled: [measured 10 out of 15 rounds, threads: 1 (sequential)]  round: 0.33 [+- 0.04], round.block: 0.00 [+- 0.00], round.gc: 0.00 [+- 0.00], GC.calls: 9, GC.time: 0.76, time.total: 8.83, time.warmup: 5.56, time.bench: 3.27 PatternBenchmarkTest.testNonPrecompiled: [measured 10 out of 15 rounds, threads: 1 (sequential)]  round: 0.28 [+- 0.04], round.block: 0.00 [+- 0.00], round.gc: 0.00 [+- 0.00], GC.calls: 5, GC.time: 0.27, time.total: 4.37, time.warmup: 1.56, time.bench: 2.82

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 running version 4 of the Kernel on Ubuntu 15.04 but I keep getting updates from 3.19. How can I prevent it checking for updates for this older kernel?

I keep getting update of numix-icons-theme package everyday, how to stop it?   I've installed that update many times still it keeps showing up.


Note: there is an .  This question asks how to convert a number into a formatted string.  Given a decimal variable, how can I convert that into a formatted string, such as a currency string, i.e. 2000 would become "$2,000.00"?  I would have thought this would be an easy task, given the formatting options available in visualforce, e.g. <apex:outputtext value="{0,number,$#,###.##}">, but there doesn't seem to be analagous functionality for apex.  Is there a simple method for achieve this?  I first looked at the decimal.format() method, but this doesn't take any parameters.  Was hoping for something like this   Decimal input = 2000; String output = input.format('$#,###.##');   I also looked at the String.format(formatString, inputArray) but you can only use string data types for the input array.  Was hoping for something like this  Decimal input = 2000; String output = String.format('$#,###.##',new Object[] { input });

goal: write the most concise function that formats a (String) decimal into a currency format in Apex. Feel free to trainwreck the code for points, I've kept mine exploded for readability purposes.


Suppose that $X_1 \sim \Gamma(\alpha_1,\beta)$ and $X_2 \sim \Gamma(\alpha_2,\beta)$ and let $Z = \frac{X_1}{X_1 + X_2}$ ($X_1$ and $X_2$ are assumed to be independent). I want to prove that $Z$ is beta distributed as follows: $Z \sim Beta(\alpha_1, \alpha_2)$. I don't want to use the Jacobian as shown there: . Instead, I know that $Z = \frac{X_1}{X_1 + X_2} \Rightarrow X_2  = X_1\frac{1-Z}{Z}$ and the joint of $X_1$ and $X_2$ is: $$P(X_1,X_2) = \frac{\beta^{\alpha_1 +\alpha_2}}{\Gamma(\alpha_1)\Gamma(\alpha_2)}X_1^{\alpha_1-1}X_2^{\alpha_2-1} \exp[-\beta(X_1 + X_2)]$$ By integrating the joint I get: $$P(Z) = \int_0^{+\infty} P(X_1,X_1\frac{1-Z}{Z}) dX_1 = \int_0^{+\infty} \frac{\beta^{\alpha_1 +\alpha_2}}{\Gamma(\alpha_1)\Gamma(\alpha_2)}X_1^{\alpha_1-1}\Bigg(X_1\frac{1-Z}{Z}\Bigg)^{\alpha_2-1} \exp[-\beta X_1/Z]dX_1$$ Using that $Beta(\alpha_1,\alpha_2)\Gamma(\alpha_1 + \alpha_2) = \Gamma(\alpha_1)\Gamma(\alpha_2)$ and pulling the constant outside of the integral: $$P(Z) = \frac{Z^{\alpha_1 - 1} (1-Z)^{\alpha_2 - 1}}{Beta(\alpha_1,\alpha_2)} \int_0^{+\infty} \frac{\beta^{\alpha_1 + \alpha_2}}{\Gamma(\alpha_1+\alpha_2)}\Bigg( \frac{X_1}{Z} \Bigg)^{\alpha_1-1}\Bigg(\frac{X_1}{Z}\Bigg)^{\alpha_2-1} \exp[-\beta X_1/Z]dX_1\\ = \underbrace{\frac{Z^{\alpha_1 - 1} (1-Z)^{\alpha_2 - 1}}{Beta(\alpha_1,\alpha_2)}}_{\text{Beta distribution}} \underbrace{\int_0^{+\infty} \frac{\beta^{\alpha_1 + \alpha_2}}{\Gamma(\alpha_1+\alpha_2)}\Bigg( \frac{X_1}{Z} \Bigg)^{\alpha_1 + \alpha_2 - 2} \exp[-\beta X_1/Z]dX_1}_{\text{Almost a gamma distribution that should integrate to 1}}$$ How do I get the Beta distribution from there? I have tried a change of variable $Y = \frac{X_1}{Z}$ but it does not seems to lead to the result.

Let $X_1,\dots,X_{k+1}$ be mutually independent random variables, each having a gamma distribution with parameters $\alpha_i,i=1,2,\dots,k+1$ show that $Y_i=\frac{X_i}{X_1+\cdots+X_{k+1}},i=1,\dots,k$, have a joint ditribution as $\text{Dirichlet}(\alpha_1,\alpha_2,\dots,\alpha_k;\alpha_{k+1})$   Joint pdf of $(X_1,\dots,X_{k+1})=\frac{e^{-\sum_{i=1}^{k+1}x_i}x_1^{\alpha_1-1}\dots x_{k+1}^{\alpha_{k+1}-1}}{\Gamma(\alpha_1)\Gamma(\alpha_2)\dots \Gamma(\alpha_{k+1})}$.Then to find joint pdf of $(Y_1,\dots,Y_{k+1})$ I can not find jacobian i.e.$J(\frac{x_1,\dots,x_{k+1}}{y_1,\dots,y_{k+1}})$


After a reboot my network interface eth1 is now called p18p1 messing up my network setup. What causes this change of name?  I'm using Linux 4.0.5 on Ubuntu 15.04.

When I run ifconfig -a, I only get lo and enp0s10 interfaces, not the classical eth0  What does enp0s10 mean? Why is there no eth0?


Prove that:    $$\lim_{n \to \infty} \root n \of {{a_1}^n + {a_2}^n + ... + {a_k}^n}  = \max \left\{ {{a_1},{a_2}...{a_k}} \right\}$$   I am familiar with the theorem which says that if $$\mathop {\lim }\limits_{n \to \infty } {{{a_n}} \over {{a_{n - 1}}}} = L$$   then, $$\mathop {\lim }\limits_{n \to \infty } \root n \of {{a_n}}  = L$$  So, I tried evaluating the expreesion: $${{{a_1}^n + {a_2}^n + ... + {a_k}^n} \over {{a_1}^{n - 1} + {a_2}^{n - 1} + ... + {a_k}^{n - 1}}}$$  but pretty much got stuck here. Is this the right path to go?

If we are in a sequence space, then the $ l^{p} $-norm of the sequence $ \mathbf{x} = (x_{i})_{i \in \mathbb{N}} $ is $ \displaystyle \left( \sum_{i=1}^{\infty} |x_{i}|^{p} \right)^{1/p} $.  The $ l^{\infty} $-norm of $ \mathbf{x} $ is $ \displaystyle \sup_{i \in \mathbb{N}} |x_{i}| $.  Prove that the limit of the $ l^{p} $-norms is the $ l^{\infty} $-norm.  I saw an answer for $ L^{p} $-spaces, but I need one for $ l^{p} $-spaces. Besides, I didn’t really understand the $ L^{p} $-answer either.  Thanks for your help!


public class PP_SI_Wrapper {     public class checkBoxWrapper{         @AuraEnabled public String que;         @AuraEnabled public Boolean val;     }         public class empWrapper {          public Integer intId;          public String strName;          public String strEmpName ;          public String strGloId;      } }

I have written below Wrapper class.  global class BI_VA_AutomationWrapper {      global class BI_VA_AutomationRequest {      webservice String userName;     webservice String emailId;     webservice String buinessUnit;     webservice String orgName;     webservice String country;     webservice String environment;     webservice String myShopNumber;     webservice String BidsId;//for testing     webservice String Type; //for testing  }  global class BI_VA_AutomationResponse {      webservice String responseStatus;     webservice String myShopNumber;     //webservice list<Error> errorMessages;     webservice String  errorMessages;//for testing   } global class BI_VA_Error {      webservice String type;     webservice String message;    }}   And test class is,  @isTest public class BI_VA_AutomationWrapperTestClass  { public static testMethod void unitTest(){      BI_VA_AutomationWrapper.BI_VA_AutomationRequest wrap= new BI_VA_AutomationWrapper.BI_VA_AutomationRequest();        wrap.userName='Test@test.com';     wrap.emailId='Test@test11.com';     wrap.buinessUnit='AH';     wrap.orgName='ORD';     wrap.country='US';     wrap.environment='QA';     wrap.myShopNumber='123456789';     wrap.BidsId='123';     wrap.Type='ResetPassword';              BI_VA_AutomationWrapper.BI_VA_AutomationResponse res= new BI_VA_AutomationWrapper.BI_VA_AutomationResponse();     res.responseStatus = 'Success';     res.myShopNumber = '987654321';     res.errorMessages = 'Test error';      BI_VA_AutomationWrapper.BI_VA_Error error = new BI_VA_AutomationWrapper.BI_VA_Error();     error.type = 'Test';     error.message = 'Test';  }}   Code coverage is 0% only.


I get this message:     It looks like you might need a break - take a breather and come back   soon!       You've asked 4 questions recently, some of which have not been   received very well by the community. Everyone learns at their own   pace, and it’s okay to make some mistakes. However, the reception your   questions have received thus far might ultimately block your account   from asking questions entirely.       It's been 4 days since you asked your last question. We ask that you   wait 2 days before asking again. Use this time to revisit your   previous questions, editing to address any issues that folks have   pointed out in comments.       Recommended reading:          tips on asking great questions as well as our guidance on    which questions are allowed here          Additional advice          Examining highly-scored questions in the tags that interest you is a great way to study how to ask better questions, that also get better   answers much sooner!    We don’t demand perfection, but please make sure you use proper grammar, spelling and capitalization, it really helps!    Improve downvoted questions rather than deleting them.    Do not delete your account, create new accounts, or otherwise attempt to circumvent these restrictions.    Do not contact us regarding these restrictions, they cannot be lifted.          Failure to heed this advice may increase the severity of these   restrictions.       For more information       See: Why won’t the system allow me to ask questions for several days?       It sometimes takes a few attempts at a good question in order to fully   learn how our system works, and what the community expects from folks   seeking answers. Just do your best to make sure you've improved the   quality of your existing questions, and we'll see you in 2 days!   It's clear the system doesn't want me here. Is there an appeal process? Is there a proxy service for asking questions so other people can take some of the heat? I didn't do anything wrong.     This question may already have an answer here:      What can I do when getting “We are no longer accepting   questions/answers from this account”? 1 answer No, my question is   different. I will edit to explain how.   I explain why it is different in the comments to this question.

If you are reading this, you may have been affected by one of our post quality bans. If so, it is important that you  to understand what has happened and how to regain the permissions that you lost. While trying to ask a question, one could see:  We are no longer accepting questions from this account. See  to learn more.  Likewise, for answers:  We are no longer accepting answers from this account. See  to learn more.   Why am I getting this message? Are deleted posts taken into account too? Is a question/answer ban the same as a suspension? How do I avoid getting a question ban? How long do I have to wait before I can post again? What can I do to release the ban? How can I reactivate my account? Can I simply create a new account? I'll just ask somewhere else on the SE network, and they'll migrate my question to the correct site! Will a ban on one Stack Exchange site affect my standing on other sites in the network? Does this apply to meta sites too? My account is in good standing. Why am I still blocked?


If one downloads videos from YouTube using youtube-dl, they get .mp4 files which are a ISO Media, MPEG v4 system, version 2.  Can these files be converted to audio-only, ideally with no quality loss? The goal is to save space by throwing out the unneeded visual part.

Is there a way to search and then download from YouTube, with the situation that I only need to download the audio only, not the video.


I am curious to know the percentage of Female Latino/Hispanic with Ph.D. degrees in the USA. Does anyone know? What is the percentage of male/female out of the approx. 6% of Latino/Hispanic population with a Ph. D. (out of the of the 1.6% of all Americans with Ph. D. degrees)?  Thank you

,      < 2% of people in the US have a #phd   Of those, 6.5% are Hispanic   By defending my PhD yesterday, I just became part of the 0.13% in the US that is #LatinoPhD   I find this statistic hard to believe, or if it is true maybe it is intentionally represented to look like a racial problem (although in my opinion Latino is not a race). Regarding my field, almost 40% of references are from Spanish surnames, 40% Chinese, and 20% European. Based on this analogy (maybe false) I think her statement is wrong. Is there any way or any source that can prove her claims?


I've recently written an email asking someone to do certain things.  At the end of my email I ask my correspondent to let me know that they have received my email.  I wrote this - > Please can you confirm that you have received this email. Although this clearly has the form of a question, the sense is not so much a question as a (polite) command. For this reason I've found myself wondering whether this line should end with a question mark, an exclamation mark or just a simple full stop ?  My instinct is the last of these.

Some sentences begin with a construction like "May I suggest that...." These are phrased as questions but are really statements. Should such a sentence end with a question mark or a period [full stop] (and what is the rationale)?


Mobile phones with USB OTG are not uncommon today. I am wondering that how can a battery operated device like mobile phone power a pen drive? From what I know, the power consumption of pen drive on 5V VBUS is around 100mA. The 5V can be derived from the battery voltage using boost converters, but are these converters so efficient and offer such a high current?  This question came to my mind when I came across a topic "connecting a pen drive to my android phone" when browsing for USB OTG.  Any thoughts?  Thank you.

I just got a brand new Nexus 4 phone and am a bit dissappointed that it doesn't support USB OTG. One reason is that is doesn't supply 5 V out of its USB port, as opposed to other Android devices I tested.*  Since I have an extra USB OTG cable lying around, I am thinking about modding it to supply the 5V from somewhere else (e.g. from a USB power supply adapter). How would I do that?   I think I should connect Vcc from the power cable to Vcc from the child, and also  connect all the grounds together (so that host (the Nexus 4) and child have the same 0V potential, relative to which D+ and D- are measured). (Is that sufficient to pull host and power supply to the same potentials? What potential do I end up with anyways? I find that a bit confusing.) Do I connect the host Vcc with the power supply+child Vcc, or do I leave it dangling? It seems there is no power on it anyway, so I can regard it as not connected (in USB mode). Is there anything special I have to do with the Sense, D+, or D- pins, or can I leave them connected as they are?   Sorry if this is a stupid question!  Here is a schematic of a regular USB (OTG) cables for reference:  From     *) There might be other problems related to its Slimport feature, though.


I've tried every way to install imap php extension but I couldn't do it. I am using amazon web service EC2 instance and it has CentOS. while yum search *-imap.* I found a package from cyrus-imap.* but it's not working. I've installed it but it seems to be not the package I want. I have tried many things but there are no package with php-imap on cent os. My application badly needs php-imap extension. My php config # php -v  PHP 7.2.31 (cli) (built: Jul  2 2020 23:17:00) ( NTS ) Copyright (c) 1997-2018 The PHP Group Zend Engine v3.2.0, Copyright (c) 1998-2018 Zend Technologies  Can anyone help? Thanks in advance.

I'm running a dedicated server with CentOS 7 64bit, here is the output when trying to install IMAP:    yum install php-imap   Loaded plugins: fastestmirror   Loading mirror speeds from cached hostfile    * base: ftp.ciril.fr    * extras: ftp.ciril.fr    * updates: ftp.ciril.fr   No package php-imap available.   Error: Nothing to do       Also the same when disabling exclusions:    sudo yum install --disableexcludes=all php-imap Loaded plugins: fastestmirror Loading mirror speeds from cached hostfile  * base: ftp.ciril.fr  * extras: ftp.ciril.fr  * updates: ftp.ciril.fr No package php-imap available. Error: Nothing to do