I am a material science Masters graduate i have a double bachelor degree and double Masters degree (From 3 countries) now i am working at a reputable automotive company. However, My passion is in research, I tried many times to get a PhD with no luck (in Germany and parts in europe). until i gave up and started working in the industry.   My questions are: If i want to work in research (and not necessary continue in the academic track). Does it make sense to still try and get a PhD?   If i want to go back to industry again, Will my PhD title affect my chances to go back in the industry and will i have to stick to academic career?   Would it be just easier to get a job at a research company/facility and just work there without a PhD degree?   I keep hearing mixed opinions about all the questions i asked. I would really love to hear feedback particularly from with a background in material science

I'm coming from a biomedical engineering background, and I'm noticing that almost all job postings ask for either an MS or a PhD, and from speaking with my friends with masters it seems that masters are often favored, because they demand less pay. In fact, the only positions that specifically seek out PhDs seem to be research positions in industry.  Based on that, I'm curious to see if this exists beyond just engineering. Are there any non-research industry positions that actively seek to hire PhDs over masters students?


Let , $f$ be analytic for $|z|<2$. Show that $$\frac{1}{2\pi i}\int_{|z|=1}\frac{\overline{f(z)}}{z-a}\,dz=\begin{cases}\overline{f(0)} &\text{ if } |a|<1\\\overline{f(0)}-\overline{f(1/a)}&\text{ if }|a|>1\end{cases}$$   By putting $z=e^{i\theta}$ , $\displaystyle\int_{|z|=1}\frac{\overline{f(z)}}{z-a}\,dz=\int_0^{2\pi}\frac{\overline{f(e^{i\theta})}}{e^{i\theta}-a}ie^{i\theta}\,d\theta=i\int_0^{2\pi}\frac{\overline{f\left(\overline{e^{-i\theta}}\right)}}{1-ae^{-i\theta}}\,d\theta$.  Now putting , $e^{-i\theta}=t$ , it becomes $\displaystyle =-\int_{|t|=1}\frac{\overline{f(\bar t)}}{1-at}\,dt$. As $f(t)$ is analytic so $\overline{f(\bar t)}$ is also analytic. Now we can apply the residue theorem and finally I got the desire integral $=-\overline{f(0)}$ when $|a|<1$.     My problem is about the sign. I got an extra negative sign. Please verify my proof & detect where I made mistake ...

By considering the conjugate of its parametric form, evaluate $$\frac{1}{2\pi i}\int_{\gamma(0;1)}\frac{\overline{f(z)}}{z-a}dz$$ when $|a|<1$ and $|a|>1$, where $f$ is holomorphic in in the disk $(0;R),  R>1$.  Typically when doing these kinds of integration and parametrization, $|z|=n$ is given, but it's different in this case (or is it not?). Can someone help me out?


I would like to create a circuit that is able to charge any USB connected device from my 5V rail with 1A current limit. There are many different USB devices, asking different kinds of currents, so:  1) I planned doing it with a dedicated chip, that handles all the enumarations and sets current limits that I can provide.    BUT I feel it's an overkill, as I want to set my current limit to 1A (So any device could get only 1A max). And this probably asks a lot of firmware.  This is the schematic I initially planned to use:     2) Then there are wall-chargers which seems to power anything quite nicely wihout any 'smartness' - also acting as DCP.   Question was - Couldn't I just short the D+ D- pins, basically act as a dedicated charging port ? Without the chip? Because as I've read, devices set their modes very differently on D+/- pins so there's no One way of defining it. Which was assured to be true. Probably any device I plug in with USB cable, might ask more than I can supply (since it's acting like a wall adapter) and could destroy my board.   SOLUTION_1: So Shorting D+/- is an option (not 100% universal). This is also visible on some of the teardowned AC/DC USB wall adapters seen . Some have resistor dividers, some seem to have other magic going on (depening on manuf. I guess).  All cheap 'travel' adapters seem to have D+/- shorted.   The drawback is that I have to physically limit the current if any device wants to get >1A and that can be troublesome on the design side (heating of protection components, added current consumption, possible physical faults which renders the port useless).   SOLUTION_2 Suggested also here in the answers, was to use a dedicated DCP chip (such as TPS2514x) which can communicate my 1A current limit and act as a DCP (I would still have a resettable fuse on the VUSB line though). See also    That way I think, I get more control over the current I allow the device to take. (a bit more expensive, but much safer).   Thanks for the info, I believe I've reached my verdict for using solution 2 in my case (wouldn't want to destroy any phones or my own board).

I have found that many USB wall chargers use a resistive voltage divider to set the D+ and D- pins to a specific voltage, usually between 2 and 3 volts.  Other USB wall chargers short the D+ and D- pins together with no connection to anything else.  From my experience some devices will not accept a charge rate above 500mA on the chargers using the voltage dividers, but will charge up to their max input on a charger with the data pins shorted. I have read things that suggest the opposite may be true as well, but have been unable to verify this. I am hoping to figure out which method provides the best compatibility with all USB devices.


How do I remove the noise on renders?  All my output has noise on the shadows.     This is a png render using cycles renderer.

I know that this question is a bit old or maybe overdone, but I'm running the latest edition of Blender and when I use the Cycles engine I get really fuzzy results and I can't find a simple, non-compromising solution to the quality.  I don't know exactly what I'm doing wrong here, but I'm sure others share my frustration.  Leaving everything in default settings, I started a new project and switched to the Cycles render.  I duplicated the cube and set colors for two Diffuse BSDF shaders, then went ahead and made walls and a floor all sharing the same diffuse shader.  I made two windows to emit blue light.  The screenshot has gaps between the walls because of the setup:  I'm aware that it's considered very incomplete and many have come to terms with some amount of noise, but is this normal?  Furthermore, with default settings or not, I can't change the amount of noise produced.  Supposedly, using "progressively refine" in the rendering tab should make it refine itself indefinitely, however Cycles only counts to 10 refines and then stops, creating a render which is a pixel-perfect match of the ordinary rendering method when it's completed.  I understand that there are tricks that can be used to reduce noise, but at the cost of extra processing time and usually small quality conflicts, like blurring.  My question essentially boils down to is this Cycles' current limit?


I was trying to make a simple Python program which gets a user input through the variable "user_input" and then it determines the variable type through the function "type()." Here is a sample of the code:  user_input = raw_input('Enter something: ') if type(user_input) == 'int':     print "integer" elif type(user_input) == 'str':     print "string"   So you see, the code prompts the user to type down something, and if what they type down is an integer, it will print "integer" and if the input is a string type, it will print "string". The code does execute without an error message, but when I type down either a string value or an integer, it prints nothing, no spaces, no messages, N-O-T-H-I-N-G. Here is an example:   >>> Enter something: hello >>>   So since it is not working, I have to ask, is it possible for Python to even compare variable types of a user input and then go through an if / else statement?

What is the best way to check whether a given object is of a given type? How about checking whether the object inherits from a given type?  Let's say I have an object o. How do I check whether it's a str?


I have 4 series/variables over time. They are in totally different units (monetary, quantities, elasticities, and percentages). I want to make a line plot for each of them. I know it makes no sense to put in the same graph, not even when using different axes, as they are messy.   What troubles me the most is the selection of the scale of the y-axis (x-axis is time). You can zoom in or out and get visually different degrees of apparent variability of the series (and careless readers might be fooled by this).  Of course, that's why we care about the standard deviation. But still, I want to make a graph of the series alone that are somewhat informative.  My question is: is there some logical scale at which the y-axis is to be presented? For example, do I select the mean and then select the y-axis to cover 2 standard deviations up and down from that mean? Is there some standard here?   PS: I've seen , , and  question, but I find no answer to mine there. For instance, the last one, suggested by Nick Cox, has all variables in exactly the same units. In my case, they have for different units. The suggestion of percentage change is not helpful either, because some variables are known to vary much more than others. Ideally, I want to plot the series themselves, and not the changes.

Looking at the following dataset:   Date        Visits   Carts      carts       Orders                       Created   converted    Created 2011-11-11    12277     161        9          36   2011-11-12    11871     93         5          19     2011-11-13    13072     107        8          8      2011-11-14    13594     112        4          34     2011-11-15    12741     129        8          43     2011-11-16    15491     261        16         57  2011-11-17    13418     186        17         42       I've been asked to plot this on a graph, using the Date has the X-Axis and the rest of the data on the Y-Axis. The problem is that the scale of the data is dramatically different. where Visits are in the thousands and Orders Created are in the low tens, the data doesn't plot well on a graph.     I was wondering what a statistician would do in this scenario, I could divide the the Visits by a 1000 and then put in the description (Visits (K)), but then I start to have the same problem with Carts Created, as they are in the hundreds and everything else is in the low tens.  What kind of thing is done in this scenario?


How do you determine when to use which proposition? (in on at...)  Its easy to say I'm sitting on a box or in a box  But sometimes its confusing  Like for example, do you say -I'm in school Or -I'm at school  -there was an accident on this road Or -there was an accident at this road

I am really confused.  Which preposition is correct?     She is in/at the park.   They are in/at the park.   I am in/at the park.   Should I use in or at in these sentences?


What is the interval of convergence of this series or for what values of $x$ does it converge?   $$\sum_{n=1}^\infty x^{\ln(n)}$$   I tried the ratio and root test but they were inconclusive, any help would be appreciated.

If $x>0$, find the set of all values of $x$ such that series is convergent$$\sum_{n=1}^{\infty} x^{\ln{n}}$$   My attempt:- I used Ratio test for finding the set of all values of $x$ such that series is convergent.   $$\lim_{x\to\infty}\frac{x^{\ln{n+1}}}{x^{\ln{n}}}$$  $$=\lim_{x\to\infty}x^{\ln\frac{n+1}{n}}$$ This quantity must be less than one for getting a convergent series, I am not able to judge. Can you please help me to find the interval of convergence?


The following question was asked in my linear algebra quiz and I was not clear about that option. So, I am asking it here. I will write only that option instead of writing whole question.  Let A$\in M_{n\times n } (\mathbb{C})$. Then is the following option true or not (with reasons):   There exists B $\in M_{n\times n } (\mathbb{C})$ such that $B^2 =A$ .  I tried by taking a $2\times2$ matrix with $a_{11}=i, a_{22}=i, a_{21}=0, a_{12} =0 $ but $B$ will exist in that case. So, I am not sure what concept should I use now. Please tell how to proceed.

What is the neccessary and sufficient condition for a matri$A \in C^{n  \times n}$ so that it has a "square root" , that is there is a matrix $B \in C^{n \times n}$ such that $A=B^2$.  I am not quite sure but I was thinking that it would be that A and B are similar.


I am running a Facebook group and we do not accept spam posts. Sometimes, a spammer will post 100+ status updates in just 1 minute. It is very difficult to remove all (100+) posts one by one.  Is there any way that I can delete all of this user's posts very fast from within Facebook?

I'm an admin for a group on Facebook. A user has recently requested that all his content be removed from the group (he is no longer welcome to post to the group so I can't tell him to just remove the posts himself).  Is there a quick way to delete all of his posts (and comments)? I can delete them one by one but it'd take me ages. He's already been banned from the group, but I still see his posts. (Is it just because I'm an admin?)


You know this how you can express a sum of consecutive terms like this: $1 + 2 + 3 + ... + n = \frac{n(n + 1)}{2}$? In other words, only using $n$? I would like to know if there is a way to shorten, or to express such a sum of sums: For example, for $n = 4$ $$\sum_{i = 1}^{4}\frac{i(i + 1)}{2} =1 + (1 + 2) + (1 + 2 + 3) + (1 + 2 + 3 + 4) = 20$$ Can I express this using only $n$?

Does anyone know the sum of all triangle numbers? I.e  1+3+6+10+15+21...  I've tried everything, but it might help you if I tell you one useful discovery I've made:   I know that the sum of alternating triangle numbers, 1-3+6-10... Is equal to 1/8 and that to change 1+3+6... Into 1-3+6... You would subtract 6+20+42+70... which is every other triangular number (not the hexagonals) multiplied by two.   1/8 plus this value is 1+3+6+10+...  A final note: I tried to split the triangle numbers into hexagonals and that series and then I got the squares of the odd numbers. Using dirichlet lambda functions This gave me 0 but I don't think this could be right. A number of other sums gave me -1/24 and 3/8 but I have no idea


I downloaded and extracted the .NET framework 3.5 bootstrapper files.  There are no errors while publishing, but I get the following two warnings:     The value of the 'PublicKey' attribute in '.NET Framework 3.5 SP1'   does not match that of file 'C:\Program Files (x86)\Microsoft Visual   Studio   14.0\SDK\Bootstrapper\Packages\DotNetFX35SP1\dotNetFX30\XPSEPSC-amd64-en-US.exe'.   and     The value of the 'PublicKey' attribute in '.NET Framework 3.5 SP1'   does not match that of file 'C:\Program Files (x86)\Microsoft Visual   Studio   14.0\SDK\Bootstrapper\Packages\DotNetFX35SP1\dotNetFX30\XPSEPSC-x86-en-US.exe'.   What can I do to address these warnings?

I am getting a warning when trying to include the .net 3.5 sp1 prerequisite for my setup project.  The warning states Prerequisite could not found for bootstrapping.  Any suggestions?  Thanks


Note : This is not a duplicate question to . After filtering a custom filed, I need to order by another custom filed. (The above link explains filtering by two custom fields. But I need to filter by a custom filed and then order by another custom filed.  This is a my current wp query array.  $args = array(  'post_type' => array('post', 'video'),  'meta_key' => 'pp_like_count',  'orderby'  => 'meta_value_num',                         );   I have order by custom filed called pp_like_count. This works fine.  But I need to display only if 'pp_lang' custom filed equals to 'english'. How to modify this to add it?  (Order by pp_like_count also should be there.)

Basically on my site I have a bunch of song lyrics and in a static page I want to show them listed by album  and album position of the song and I have two custom fields with that data, sd_album_title and `sd_album_track_n. Plus some of the songs don't have an album yet, so both values are void, and I wish to list those ones at the foot of the others, sorted by alphabetical order.  The latest thing I tried at least to sort everything by the two field is this one:  $key = 'sd_album_title'; $themeta = get_post_meta($post->ID, $key, TRUE);  add_filter( 'pre_get_posts', 'my_get_posts' ); function my_get_posts( $query ) {     if ($themeta != '') {         $query->set( 'post_type', 'lyric' );         $query->set( 'meta_key', 'sd_album_title' );         $query->set( 'orderby', 'meta_value' );         $query->set( 'order', 'ASC' );         $query->set( 'meta_query', array(               array(                     'key' => 'sd_album_title'               ),               array(                     'key' => 'sd_album_track_n',                     'value' => 'target_value',                     'compare' => '>=',                     'type' => 'numeric'               )         ));     }     return $query; }  $getlist= 'my_get_posts'; $posts = get_posts( $getlist );   And my intention was to put an else at the end of it with an array ordered by title for the other songs, but it returns nothing as it is. Could something like this work with some corrections or am I on a totally wrong path?


I have a directory in /media/project where I would like to share some stuff with other users. They should also be able to read, write and execute files in that path as well. Are you able to give default permissions in that particular path when someone creates a new file/directory? For example if I create a file called test, it would automatically have me as an owner and all the permissions, but also all the permissions for a certain group as well (let's say I have used chown -R user:usergroup /media/project before this) and no permissions for others. Also if someone from that usergoup creates a file they will have same permissions as well. How am I able to achieve this? I don't think umask is the solution since it takes affect everywhere and I want the rule to apply in this path only. I know this could be achieved using chmod on the root of this directory, but it seems kind of redundant to do that everytime someone makes a new file. EDIT: I noticed there is a solution to a similar question in this link  I can´t comment there yet since I have not enough reputation points. However I could not find a solution for making the files & folders executable as default. I have made an example somedir-folder: setfacl -Rd -m u:user:rwx,g:usergroup:rwx,o::r somedir After this I create a file: touch somedir/afile and it has the wrong kind of permissions: -rw-rw-r--+ 1 user usergroup 0 Dec  2 15:57 afile How do you get the execution permission as default for the group and the user?

I am having a problem with permissions on a Linux server. I am used to BSD. When a directory is owned by a group the user who owns it isn't in such as www-data, files created in it will be owned by that group. This is important because I want files to be readable by the webserver (which I will not run as root) but so a user can still put new files in the directory. I can't put the users in www-data because then they can read every other users websites.   I want the webserver to read all websites, I want users to be able to change their own.  The permissions are set like this on the folders at the moment....  drwxr-x--- 3 john www-data 4096 Feb 17 21:27 john   It is standard behavior on BSD for permissions to work this way. How do I get Linux to do this?


Does it make sense to make an Interface readonly?  While using Resharper 8.0, i got the following suggestion and I was not sure how this will help me.    What I've found from researching (still not clear how it works against an Interface):   It's simply a check to ensure that once the object is fully constructed, that field cannot be pointed to a new value. The real advantage of this keyword is to generate immutable data structures. Immutable data structures by definition cannot be changed once constructed The readonly keyword is used to declare a member variable a constant, but allows the value to be calculated at runtime. Use readonly if you don't want to have to recompile external DLLs that reference the constant (since it gets replaced at compile time)   Cited:

What are the benefits of having a member variable declared as read only?  Is it just protecting against someone changing its value during the lifecycle of the class or does using this keyword result in any speed or efficiency improvements?


I try to filter some files I don't want to copy to another folder (a123*.zip in this case) and want to copy all other *.zip files  if [[ ! -f ./a123*.zip ]];   then      # copy all files without a123*.zip  fi   How do I trigger the copy?

Say I want to copy the contents of a directory excluding files and folders whose names contain the word 'Music'.  cp [exclude-matches] *Music* /target_directory   What should go in place of [exclude-matches] to accomplish this?


MongoDB vs MySQL, Master-Master or Master-Slave?  I’m currently developing a service in Laravel for online learning. Basically imagine   Now, my users are going to be doing lots of reads and writes. The writes are going to be small, with 4 ints, 1 string (approx. 30 chars) and a bool (statistics for answered questions by my users). The reads on the other hand will at most be texts of at most 1000 words, together with 1 question (~20 words) and 4 options (~20 words). The PHP is not very advanced. I have implemented SuperMemo 2, however it’s not going to be much more resource intensive than that.  When I’m launching the site, I’d like to have the possibility for 500 simultaneous users (reading and writing simultaneously), and while I do have moderate experience in managing servers as a hobby, I’ve never actually launched anything for production.  The most important factor in the server setup that I’ll be starting off with is that it should be very scalable. I’m (probably) going to be using Linode because of their location, performance and reputation. My budget to start off with is going to be $120/mo (for 500 users) but I want it to be able to scale horizontally easily and fast if needed.  What I’m actually wondering is what my base server setup should look like (hopefully with the capability of being able to withstand 500 simultaneous users). Should I use a MongoDatabase for the user answers(writes) and a MySQL DB for their accounts? Should I go with just MySQL and some sort of replication? Should I use Master-Master or Master-Slave? What should the Redis setup look like? How should I divide my resources to get the maximum bang for the buck?  I’m currently considering the following setup:   1 Linode Load-balancer ($20) 2 Nginx + PHP-FPM backends (2 x $20) 2 MySQL Servers (2 x $20) 2 Redis Cache Servers (2x $10)   I’d like to be able to just add on more servers as needed without any down time (I realize that the Load balancer is a weak spot but that’s fine).  Now, later on I’ll be able to spot weak links in my setup but I just want to make sure that I’m prepared in the beginning for decent load.  Thanks in advance, Axel

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


Since both players have the same pair, should it go down to the suits, or are they supposed to split the pot?

In Texas Hold'em poker, there are some cases where a particular card, often called kicker, acts as a tiebreaker between players to determine who wins the pot, or if the pot has to be shared.  For some combinations such as three or four of a kind, there is no doubt: the kicker is the 5th card of the chosen combination, and determines the winner.  Example     Alice has 7 and 10   Bob has 7 and K   On the board are 7, 7, 2, 3, 4   In that case, both have a three of a kind. But because Bob has a king and Alice only a 10, he wins.  Most of poker websites explaining the rules clearly mention the role of the kicker applying to three of a kind and double pairs. But much fewer say something about colors, straights and full houses, and I found many contradicting answers. I also asked the question to some used online poker players and they also gave me contradicting answers.  I have tried to search for official tournament rules, but most of them only explain what happens with bad behaviors, bad deals, incorrect or confusing betting, showing cards when you shouldn't, acting when it's not your turn, etc. without mentioning subtleties about combinations at all.  To simplify my question, I will take three examples; I think it's better to start with examples before getting to the general answer if one exists. So, what's happening in the following 3 examples? Could you give a more generalized answer?  Example 1 - Flushes     Alice has 2♣ and 3♣   Bob has 4♣ and 5♣   On the board are 6♣, 8♣, 10♣, 2♥, 5♦   Contradicting answer 1: it's a tie, because the highest card included in the flush is the 10, which everybody chooses to include in their 5 showdown cards. Contradicting answer 2: Bob wins, because he has the greatest private card that is part of the flush  Example 2 - Straight     Alice has 6 and K   Bob has 6 and J   On the board are 4, 5, 7, 8, 10   Contradicting answer 1: it's a tie, because the greatest card in the straight is the 8 for both Alice and Bob Contradicting answer 2: Alice wins, because she owns an extra king, compared to the jack of Bob  Example 3 - Full house     Alice has 3 and 7   Bob has 3 and 6   On the board are 3, 3, 2, 2, 5   Contradicting answer 1: it's a tie, because one is supposed to choose only five cards to make a combination, and a full house is already five cards. There couldn't be any kicker, and thus their showdowns are strictly equals. Contradicting answer 2: Alice wins because of her extra 7, compared to the 6 of Bob  Thank you very much for your answers.  Note: I'm unable to post next to you, so I edit my own post; strange not be able to answer to an answer.  Ok, So if I summarize what you are saying :   In the flush case, Bob wins because at some point, their hand differs. Technically, I can continue comparing the highest private card to decide who wins. I had it correct. In the straight case, if the highest card of the straight is public, then it's technically always a tie, no matter what the players had as second private card (asuming that only one of the two cards was part of the straight). In a full house if both players have the same triplet and the same pair, it's always a tie, no matter what the players had as second private card (assuming again that only one of the two was part of the full house).   Please confirm me that what I summarized is correct.  Thank you for your answer.


When should you use XML attributes and when should you use XML elements?  e.g.  <customData>   <records>     <record name="foo" description="bar" />   </records> </customData>   or  <customData>   <records>     <record>       <name>foo</name>       <description>bar</description>     </record>   </records> </customData>

At work we are being asked to create XML files to pass data to another offline application that will then create a second XML file to pass back in order to update some of our data. During the process we have been discussing with the team of the other application about the structure of the XML file.   The sample I came up with is essentially something like:  <INVENTORY>    <ITEM serialNumber="something" location="something" barcode="something">       <TYPE modelNumber="something" vendor="something"/>     </ITEM> </INVENTORY>   The other team said that this was not industry standard and that attributes should only be used for meta data. They suggested:  <INVENTORY>    <ITEM>       <SERIALNUMBER>something</SERIALNUMBER>       <LOCATION>something</LOCATION>       <BARCODE>something</BARCODE>       <TYPE>          <MODELNUMBER>something</MODELNUMBER>          <VENDOR>something</VENDOR>       </TYPE>    </ITEM> </INVENTORY>   The reason I suggested the first is that the size of the file created is much smaller. There will be roughly 80000 items that will be in the file during transfer. Their suggestion in reality turns out to be three times larger than the one I suggested. I searched for the mysterious "Industry Standard" that was mentioned, but the closest I could find was that XML attributes should only be used for meta data, but said the debate was about what was actually meta data.  After the long winded explanation (sorry) how do you determine what is meta data, and when designing the structure of an XML document how should you decide when to use an attribute or an element?


XnViewMP could be fine but how can I instal it? I can't understand the forums sort  of coding. I can't do it.

On Windows I really liked  as a basic image editor/manager. Some of the main features I liked were   great shortcut keys good batch conversion options ability to work with many image file formats easy viewing of images in a folder ability to open the program and paste the clipboard and do a quick save simple cropping   Though it did have a lot of features, they tended not to get in the way of simple tasks.  What would be a good replacement on Ubuntu?


I have no clue what's happening, so I will have to ask this here.  I have an Activity that returns a location as LatLng. I then check if it's null before I pass it to my moveCamera() method that's supposed to show it on a map.   if(location != null) {         mapActivity.moveCamera(location);     }else{         Toast.makeText(MainActivity.this, "Couldn't determine location",  Toast.LENGTH_SHORT).show();     }   But although I check for null, when i run it, i get:   java.lang.NullPointerException: Attempt to invoke virtual method 'void de.ratchetcoding.theotherside.MapsActivity.moveCamera(com.google.android.gms.maps.model.LatLng)' on a null object   Any help is appreciated. If you need the source code tell me, I can upload it to github.

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?


What is the integral of  $1/((1+x^2)^n)$?  I have tried adding and substracting $x^2$ from the numerator  $$ \int \frac{1}{(1+x^2)^2}\:dx = \int \frac{1}{(1+x^2)^{n-1}}\,dx − \int \frac{x^2}{(1+x^2)^n}\,dx $$  but can't see how to proceed from here.


Consider the following theorem: For every prime $p$ and all integers $a$, $b$, if $p\mid ab$, then $p\mid a$ or $p \mid b$. Use it to prove the following proposition: Prove: Let $x\in \mathbb{Z}$ and $w$, $y$ be distinct primes. Then $w\mid x$ and $y\mid x$ if and only if $wy\mid x$. I am confused even as to what this is asking, from my understanding is it like the $p\mid ab$ but reversed? How would this then be proven?

If $p$ and $q$ are distinct primes such that $p|c$ and $q|c$, prove that $pq|c$ ..  I start with this:   if $c=pk$  and $c=qt$ then $q|pk$ and $p|qt$  but a couldn't get the solution.  I need your help


How do I align the two equations and label them?  \begin{equation} \begin{split} \pd{EU}{\alpha} &= d(\theta) U'(\pi_{1}) [G_{\alpha}(\alpha, \theta, \epsilon) - \widebar{P} C_{\alpha}(\alpha, \theta)] \\                      &+ (1-d(\theta)) U'(\pi_{0}) [G_{\alpha}(\alpha, \theta, 0) -  C_{\alpha}(\alpha, \theta)] = 0,\\ \end{split} \end{equation} \begin{equation} \begin{split} \pd{EU}{\theta} &= h'(\theta)[U(\pi_{0}) - U(\pi_{1})] \\                 &+ d(\theta) U'(\pi_{1})[G_{\theta}(\alpha, \theta, \epsilon) - \widebar{P} C_{\theta}(\alpha, \theta)] \\                 &+(1-d(\theta))U'(\pi_{0})[G_{\theta}(\alpha, \theta, 0) -  1] = 0.\\ \end{split} \end{equation}

\begin{align} \begin{split} \pd{EU}{\alpha} &= d(\theta) U'(\pi_{1}) [G_{\alpha}(\alpha, \theta, \epsilon) - \widebar{P} C_{\alpha}(\alpha, \theta)] \\                      &+ (1-d(\theta)) U'(\pi_{0}) [G_{\alpha}(\alpha, \theta, 0) -  C_{\alpha}(\alpha, \theta)] = 0,\\ \pd{EU}{\theta} &= h'(\theta)[U(\pi_{0}) - U(\pi_{1})] \\                 &+ d(\theta) U'(\pi_{1})[G_{\theta}(\alpha, \theta, \epsilon) - \widebar{P} C_{\theta}(\alpha, \theta)] \\                 &+(1-d(\theta))U'(\pi_{0})[G_{\theta}(\alpha, \theta, 0) -  1] = 0.\\ \end{split} \end{align}     I want to label the equations 4 and 5 and then reference them. Here I only have the two equations labelled as one.   EDIT:  From the answer below, I was able to label the equations:  \begin{align} \begin{split} \pd{EU}{\alpha} &= d(\theta) U'(\pi_{1}) [G_{\alpha}(\alpha,   \theta, \epsilon) - \widebar{P} C_{\alpha}(\alpha, \theta)] \\                 &+ (1-d(\theta)) U'(\pi_{0}) [G_{\alpha}(\alpha, \theta, 0) - C_{\alpha}(\alpha, \theta)]=0 \end{split}\label{eqn:4}\\ \begin{split} \pd{EU}{\theta} &= h'(\theta)[U(\pi_{0}) - U(\pi_{1})] \\                 &+ d(\theta) U'(\pi_{1})[G_{\theta}(\alpha, \theta, \epsilon) - \widebar{P} C_{\theta}(\alpha, \theta)] \\                 &+(1-d(\theta))U'(\pi_{0})[G_{\theta}(\alpha, \theta, 0) -  1] = 0.\\ \end{split}\label{eqn:5}\ \end{align}     However, now the two equations are not aligned with each other, and I want them to be aligned. Any suggestions?


Since about 4:00 or 5:00 PM Eastern Time, I have noticed that the top bar hasn't been giving me notices about my reputation going up. This is extremely bothersome, as I thrive on those little numbers in green boxes. Has anyone else noticed this, or is it some setting I made?  <troll>  Quick! Upvote all my questions and answers to further test this hypothesis!  </troll>  So I'm guessing that this was because I placed a bounty for 50 points, and I haven't dug myself out of that hole since placing the bounty, but I still think that I should be getting the notices

Today I gave a .  This results of course in a negative score for today.   Since then I don't get any more notifications for new rep in the new top-bar on meta.    Only after resetting the rep indicator by clicking on it I get new notifications.


I was having a discussion with some friends about the built in camera of computer and what you can do with them, and I realized that my macbook has one of those. That got me thinking about how the camera and LED are connected; Are they connected to the same power supply or can they be turned on or off individually?  If it's not connected to the same power supply has Apple said anything to ensure my privacy against anyone looking at me without the LED turning on?

In light of stories about stories about secret monitoring over laptop webcams (such as  or ), I wonder about the reliability of the green LED next to the camera that indicates that it's in use.  Is there a known hard-wired link between the camera on a MacBook Pro and the indicator that is impossible to circumvent in software?  Would such a thing be possible given the hardware of the camera?


Find the form of the likelihood ratio test of $H_0 : \lambda = \lambda_0$ against $\lambda\neq\lambda_0$ when $X_1,X_2,...,X_n$ is a random sample from $Ex(\lambda)$. Simplify it as much as possible.   I've started as follows, where $\lambda_1$ is some alternative parameter  $$ \frac{L_0}{L_1}=\frac{\prod f(x;\lambda_0)}{\prod f(x;\lambda_1)} $$  I think the p.d.f. for an exponential is $\lambda e^{-\lambda x}$ so  $$ \frac{L_0}{L_1}=\frac{\prod \lambda_0 e^{-\lambda_0 x_i}}{\prod \lambda_1 e^{-\lambda_1 x_i}} $$  $$ =(\frac{\lambda_0}{\lambda_1})^n\frac{\prod e^{-\lambda_0 x_i}}{\prod e^{-\lambda_1 x_i}} $$  Which I think can be simplified like this by taking logs  $$ =n log(\frac{\lambda_0}{\lambda_1})\frac{e^{-\sum\lambda_0 x_i}}{e^{-\sum\lambda_1 x_i}} $$  Not sure about this but, I think that becomes  $$ =n log(\frac{\lambda_0}{\lambda_1}) e^{-\sum x_i ({\lambda_0}-{\lambda_1})} $$  Am I right so far? Not sure where to go from here. I think the critical region is where the above is less than some constant.

Let $X_1,X_2,...,X_n$ be i.i.d r.v's with common p.d.f.      $$ \mbox f(x)=\frac{x^5e^{-x/\theta}}{5!\theta^6} $$      where $\theta$ > 0. Show that the Neyman-Pearson lemma produces a test of $H_0: \theta=\theta_0$ against $H_1: \theta=\theta_1 (\theta_1>\theta_0)$ with critical region of the form $\sum^n_{i=1}x_i≥c$ where $i=1,2,...n,x_i$ is the observation on $X_i$ and $c$ is some constant.      Use the result "if $X_i$ are i.i.d with $X_i\sim Ga(\alpha,\beta)$, then $\sum^n_{i=1}X_i\sim Ga(n\alpha,\beta)$" to identify the distribution of $\sum^n_{i=1}X_i$. Hence find the equation which must be solved to find $c$.   My attempt:  $$ \frac{L(\theta_0)}{L(\theta_1)} =\frac{\prod^n_{i=1}\frac{x_i^5e^{-x_i/\theta_0}}{5!\theta_0^6}}{\prod^n_{i=1}\frac{x_i^5e^{-x_i/\theta_1}}{5!\theta_1^6}} $$ Which I think simplifies to: $$ =\prod^n_{i=1}\frac{e^{-x_i/\theta_0}\theta_1^6}{e^{-x_i/\theta_1}\theta_0^6} $$  $$ =(\frac{\theta_1}{\theta_0})^{6n}e^{-\sum x_i(\frac{1}{\theta_0}-\frac{1}{\theta_1})}  $$  $$ =(\frac{\theta_1}{\theta_0})^{6n}e^{-\sum x_i(\frac{1}{\theta_0}-\frac{1}{\theta_1})}  $$  $$ (\frac{\theta_1}{\theta_0})^{6n}e^{-\sum x_i(\frac{1}{\theta_0}-\frac{1}{\theta_1})} <c $$  Edit: attempted continuation assuming I'm right (which is a dangerous assumption)  $$ 6n log(\frac{\theta_1}{\theta_0})-\sum x_i(\frac{1}{\theta_0}-\frac{1}{\theta_1}) <c $$  $$ \sum x_i > \frac{6n log(\frac{\theta_1}{\theta_0})-c}{\frac{1}{\theta_0}-\frac{1}{\theta_1}} $$  $$ \sum x_i > c' $$


I am trying to use a very simple formula which is =SUM(B9:B11). However the cell doesn't compute for some reason.  I've used Excel for years and have never had this problem. Any idea why it may be failing to update the SUM?  I'm using Excel 2007 on Windows 7 Pro. I've opened the spreadsheet on multiple different machines with the same results so it appears to be an issue with the spreadsheet itself and not Excel or the computer.  Additional Note: If I recreate the =SUM formula it will recompute the total. However, if I change one of the number it still doesn't auto-recalculate.  Also, if I press F9 the SUM will recalculate being manually forced to.

I have a formula in a cell which counts the values in 2 other cells. Normally, after entering in the values in these 2 other cells, the formula cell updates automatically when Enter is pressed or when the cells are clicked out of.  However, for some reason, the value calculated by the formula does not update automatically. I am having to click on the formula bar, then I have to click enter for the formula cell to do its thing.  Why is this happening?


Here is the source   \documentclass[a4paper,12pt]{article} \usepackage{amsmath,amsfonts,amssymb,mathrsfs,mathtools} \usepackage{ebgaramond,newtxmath,ebgaramond-maths} \begin{document}  $\partial$  \end{document}

I am using the package EBGaramond-Maths.  This font is missing the symbols for these commands (from documentation):  \leftharpoonup \triangleright \flat \smile \leftharpoondown \triangleleft \natural \frown \rightharpoonup \star \sharp \vec \rightharpoondown \partial \t   The default way of loading this package (as per the documentation) is   \usepackage[cmintegrals,cmbraces]{newtxmath}  \usepackage{ebgaramond-maths}   When the above-mentioned missing symbols are used, the package prints nothing out at the command, which is to be expected. However, if we use only newtxmath without the ebgaramond-maths package, the symbols are correctly produced. Thus, we can surmise that newtxmath has those symbols, but  ebgaramond-maths does not.  However, this would suggest that when ebgaramond-maths is loaded, the compiler essentially "blanks out" the positions in the character map that the ebgaramond-maths lacks, rather than falling back on a previously loaded symbol. For example, although the \partial symbol is loaded by the newtxmath package and displays correctly when it is used without ebgaramond-maths, after loading ebgaramond-maths thereafter, the command does nothing.  1) Why does this happen?  2) If ebgaramond-maths just cancels whatever newtxmath does, then what is the point of loading newtxmath before?


To run a command as administrator (user "root"), use "sudo <command>". See "man sudo_root" for details.  andy@andy-Aspire-5750:~$ apt-get update Reading package lists... Done W: chmod 0700 of directory /var/lib/apt/lists/partial failed - SetupAPTPartialDirectory (1: Operation not permitted) E: Could not open lock file /var/lib/apt/lists/lock - open (13: Permission denied) E: Unable to lock directory /var/lib/apt/lists/ W: Problem unlinking the file /var/cache/apt/pkgcache.bin - RemoveCaches (13: Permission denied) W: Problem unlinking the file /var/cache/apt/srcpkgcache.bin - RemoveCaches (13: Permission denied) andy@andy-Aspire-5750:~$    Can you please help to decipher this?

I get this error whenever I try to install programs using the terminal:  home@ubuntu:~$ apt-get install myunity E: Could not open lock file /var/lib/dpkg/lock - open (13: Permission denied) E: Unable to lock the administration directory (/var/lib/dpkg/), are you root?   Also I'm unable to install updates using the terminal.


Hiesenberg's Uncertainty Principle states that inaccuracy in momentum and position will always be there and we will never ever be able to get it 100% accurate. Suppose in future millions of years from now, we have equipments that can measure potential and kinetic energy of any object without having to measure it at two different point of time and at only one point of time then simply we can have the position and momentum at the same time of an object. The formula doesn't makes any sense so why and how does it work ?

From what I understand, the  states that there is a fundamental natural limit to how accurately we can measure velocity and momentum at the same time. It's not a limit on equipment but just a natural phenomenon.  However, isn't this just an observational limit? There is a definite velocity and momentum, we just don't know it. As in, we can only know so much about the universe, but the universe still has definite characteristics.  Considering this, how do a wide range of quantum mechanical phenomena work? For example, quantum tunneling - its based on the fact that the position of the object is indefinite. But the position is definite, we just don't know it definitely. Or the famous light slot experiment? The creation of more light slots due to uncertainty of the photon's positions?  What I am basically asking is why is a limit on the observer, affecting the phenomenon he is observing? Isn't that equivalent to saying  because we haven't seen Star X, it doesn't exist? It's limiting the definition of the universe to the limits of our observation!


Extracting the contents of a (possibly compressed) archive file is a task I need to perform very often.  Depending on what method of compression and archive format the author of an archive file chose, I need to use one of the tar, unzip, gunzip, xz, or 7z commands (and there are probably others I haven't encountered, or that I have encountered but I can't think of right now), each with a slightly different command-line syntax.  It would be nice to have a single command that can handle all of these formats. Is there one?  Note that I don't necessarily expect a single tool to know about and handle all of the formats. I'd be perfectly happy with a tool that just provides a uniform interface, and plugins/connectors that provide support for the various formats.

At the moment, if I download a compressed file, it could be any of a .tar.gz archive, a tar.bz2 arhive, a .zip archive or a .gz archive. And each time I do so, I have to remember what the command line options for that program are.  Is there any CLI program where I can just go:  undocompression somefile.??  and let it figure out what format the archive is in? (overly long name used to avoid conflicting with any real program)


Is there a way to make Cycles Render the default in Blender instead of Blender Render? (I hope this hasn't been asked before.)

How can I change Blender from the default cube/lamp/camera default setup? Also, is it possible to change other features, such as the default view direction (Top, Side, etc) or the Editor type (3D View, Node Editor, Graph Editor, etc)?


I have to implement a multivariate analysis on  $n$ random variables with a sample of $m$ data points. I would like to get a matrix with the $\beta$ (as in $n$ $\beta$ vectors put together).   Is there an analytical formula for that or do I have to calculate each vector individually and put them back together ?  Also is there a formula that would give me directly a vector of the estimation error for each variable?

Is recasting a multivariate linear regression model as a multiple linear regression entirely equivalent?  I'm not referring to simply running $t$ separate regressions.   I have read this in a few places (Bayesian Data Analysis -- Gelman et al., and Multivariate Old School -- Marden) that a multivariate linear model can easily be reparameterized as multiple regression.  However, neither source elaborates on this at all.  They essentially just mention it, then continue using the multivariate model.  Mathematically, I'll write the multivariate version first,  $$ \underset{n \times t}{\mathbf{Y}} = \underset{n \times k}{\mathbf{X}} \hspace{2mm}\underset{k \times t}{\mathbf{B}} + \underset{n \times t}{\mathbf{R}}, $$ where the bold variables are matrices with their sizes below them.  As usual, $\mathbf{Y}$ is data, $\mathbf{X}$ is the design matrix, $\mathbf{R}$ are normally distributed residuals, and $\mathbf{B}$ is what we are interested in making inferences with.   To reparameterize this as the familiar multiple linear regression, one simply rewrites the variables as:  $$ \underset{nt \times 1}{\mathbf{y}} = \underset{nt \times nk}{\mathbf{D}}  \hspace{2mm} \underset{nk \times 1}{\boldsymbol{\beta}} + \underset{nt \times 1}{\mathbf{r}}, $$  where the reparameterizations used are $\mathbf{y} = row(\mathbf{Y}) $, $\boldsymbol\beta = row(\mathbf{B})$, and $\mathbf{D} = \mathbf{X} \otimes \mathbf{I}_{n}$.  $row()$ means that the rows of the matrix are arranged end to end into a long vector, and $\otimes$ is the kronecker, or outer, product.  So, if this is so easy, why bother writing books on multivariate models, test statistics for them etc.?  It is most effective to just transform the variables first and use common univariate techniques.  I'm sure there is a good reason, I just am having a hard time thinking of one, at least in the case of a linear model.  Are there situations with the multivariate linear model and normally distributed random errors where this reparameterization does not apply, or limits the possibilities of the analysis you can undertake?    Sources I have seen this: Marden - Multivariate Statistics: Old School.  See sections 5.3 - 5.5.  The book is available free from:   Gelman et al. - Bayesian Data Analysis.  I have the second edition, and in this version there is a small paragraph in Ch. 19 'Multivariate Regression Models' titled: "The equivalent univariate regression model"  Basically, can you do everything with the equivalent linear univariate regression model that you could with the multivariate model?  If so, why develop methods for multivariate linear models at all?  What about with Bayesian approaches?


This is an extended question of   I have a table "number" having a column "n" which is of type int. I inserted some values like,  n -- 1 3 5 9 11   i also have another table "num" having column "n" which is of type int. I inserted some values like,  n -- 7 12 15 23   Now I want the column n of "number" table as 1,2,3,5,6 and column n of "num" table as 4,7,8,9. That is 1 should be as 1, 3 as 2, 5 as 3, 7 from "num" table as 4 and 9 as 5 and so on. The values of column n should be reordered with the missing values on both the tables.

I have a table "number" having a column "n" which is of type int. I inserted some values like,  n -- 1 3 5   8   10  Now I want to the column n as 1,2,3,4,5. That is 3 should be changed as 2, 5 as 3, 8 as 4 and 10 as 5. The values of column n should be reordered with the missing values. How can I do it?


A quote from :     The principle, formulated in Patterson v. Colorado, (1907) was seemingly overturned with the "clear and present danger" principle used in the landmark case Schenck v. United States (1919), as stated by Justice Oliver Wendell Holmes, Jr..   Is the usage of two consecutive dots at the end of the sentence correct?

I always stumble when using abbreviations in a sentence, as they inherently contain a period in them. How do I use a comma or a semicolon after an abbreviation? How about a period?  E.g. (This is an example of my quandary)


Fount ddos attack on ubuntu server  netstat -nputw  given outout  Local Address       Foreign Address        State        PID/Program name  55.57.72.37:59792   123.166.137.95:25000    SYN_SENT    2890/ip6tablesu.sh   I found on internet that 123.166.137.95 is China's ip address  How should I block outbound traffic to that address?

This is a  about Server Security - Responding to Breach Events (Hacking)   See Also:                  Canonical Version I suspect that one or more of my servers is compromised by a hacker, virus, or other mechanism:   What are my first steps? When I arrive on site should I disconnect the server, preserve "evidence", are there other initial considerations? How do I go about getting services back online? How do I prevent the same thing from happening immediately again? Are there best practices or methodologies for learning from this incident? If I wanted to put a Incident Response Plan together, where would I start? Should this be part of my Disaster Recovery or Business Continuity Planning?   Original Version       2011.01.02 - I'm on my way into work at 9.30 p.m. on a Sunday because our server has been compromised somehow and was resulting in a    attack on our provider. The servers access to the Internet   has been shut down which means over 5-600 of our clients sites are now   down. Now this could be an FTP hack, or some weakness in code   somewhere. I'm not sure till I get there.      How can I track this down quickly? We're in for a whole lot of   litigation if I don't get the server back up ASAP. Any help is   appreciated. We are running Open SUSE 11.0.            2011.01.03 - Thanks to everyone for your help. Luckily I WASN'T the only person responsible for this server, just the nearest. We managed   to resolve this problem, although it may not apply to many others in a   different situation. I'll detail what we did.      We unplugged the server from the net. It was performing (attempting to   perform) a Denial Of Service attack on another server in Indonesia,   and the guilty party was also based there.      We firstly tried to identify where on the server this was coming from,   considering we have over 500 sites on the server, we expected to be   moonlighting for some time. However, with SSH access still, we ran a   command to find all files edited or created in the time the attacks   started. Luckily, the offending file was created over the winter   holidays which meant that not many other files were created on the   server at that time.      We were then able to identify the offending file which was inside the   uploaded images folder within a  website.      After a short cigarette break we concluded that, due to the files   location, it must have been uploaded via a file upload facility that   was inadequetly secured. After some googling, we found that there was   a security vulnerability that allowed files to be uploaded, within the   ZenCart admin panel, for a picture for a record company. (The section   that it never really even used), posting this form just uploaded any   file, it did not check the extension of the file, and didn't even   check to see if the user was logged in.      This meant that any files could be uploaded, including a PHP file for   the attack. We secured the vulnerability with ZenCart on the infected   site, and removed the offending files.      The job was done, and I was home for 2 a.m.            The Moral   - Always apply security patches for ZenCart, or any other CMS system for that matter. As when security updates are released, the whole   world is made aware of the vulnerability.   - Always do backups, and backup your backups.   - Employ or arrange for someone that will be there in times like these. To prevent anyone from relying on a panicy post on Server   Fault.


I'd like to know how to make in mathmode this fat 'E' as a symbol for expected value?

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


I've been trying to save up my money to buy the illegal gun parts, but their cost is 75 gold coins. Can someone please tell me how to easily get them? Thanks.

I want to buy the Mining Helmet from the Merchant, but it costs 8 Gold Coins, and I do not have any. How do I get Gold Coins?


Let $\mathcal{C}$ denote the unit circle in $\mathbb{C}$ centred at the origin taken anticlockwise. Compute the value of the integrtal $$\frac{1}{2\pi i}\int_\mathcal{C} |1+z+z^2|^2 dz$$   I don't recon we can use the residue theorem to compute this integral because the integrand is not analytic anywhere.  I then tried substituting $z=e^{i\theta}$ and integrating it the traditional way but cant make much of the integrated $|1+e^{i\theta}+e^{2i\theta}|^2$.  Any help would be much appreciated. Thanks.

Let $C$ denote the unit circle  centered at the origin in Complex Plane  What is the value of   $$ \frac{1}{2\pi i}\int_C |1+z+z^2 |dz,$$ where the integral is taken anti-clockwise along $C$?   0 1 2 3   What I have answered is 0 because it seems like $f(z)$ is analytic at 0 hence by Cauchy's Theorem.


I am coding a MVC 5 internet application and have a question in regards to JavaScript caching (and caching in general).  Currently, when I update a JavaScript file that is referenced in a view, when I browse to the view, the old JavaScript code is used. If I then refresh the browser, the updated JavaScript code is then used.  This is not ideal, as a user may often browse to a view that has an old JavaScript file, and as such, the view may not be displayed correctly.  I am currently referencing JavaScript files as follows:  @section Scripts{     <script src="~/Scripts/filename.js"></script> }   Is there a web.config setting that controls caching? Is there a NuGet package that can help with caching?  How can I resolve this situation?

CSS and Javascript files don't change very often, so I want them to be cached by the web browser. But I also want the web browser to see changes made to these files without requiring the user to clear their browser cache. Also want a solution that works well with a version control system such as Subversion.   Some solutions I have seen involve adding a version number to the end of the file in the form of a query string. Could use the SVN revision number to automate this for you:   Can you specify how you include the  variable of another file? That is in the HTML file I can include the Revision number in the URL to the CSS or Javascript file. In the  it says about Revision: "This keyword describes the last known revision in which this file changed in the repository".  Firefox also allows pressing CTRL+R to reload everything on a particular page.  To clarify I am looking for solutions that don't require the user to do anything on their part.


I want to use my own bibtex style (from a .bst file) in combination with the biblatex package (I want to use this package to have separate bibliographies for each part). Since the \bibliographystyle{} command cannot be used with the biblatex package, how do I import it?  \documentclass[b5paper, twoside, 11pt]{book} \usepackage{blindtext}  \usepackage[hmargin=2.5cm,vmargin=2.5cm]{geometry}  \usepackage[style=numeric,doi=false,isbn=false,eprint=false,url=false,firstinits=true,backend=bibtex,refsection=part]{biblatex} % used to make seperate references for each part \addbibresource{bibfile.bib} %\bibliographystyle{style} % <- want to include a style.bst file here  \begin{document} \cleardoublepage \part*{Introduction} \Blindtext \cite{...} \Blindtext \printbibliography  \part{Part I} \Blindtext \cite{...} \Blindtext \printbibliography  \end{document}

I'm new to LaTeX and have been trying to get my document to use a specified .bst bibliography style file, but to no avail. I downloaded my preferred .bst file (amnat.bst) from  into the same folder as my document. I've fruitlessly tried various combinations to try to get it to work (including \bibliographystyle{amnat}). I'm not sure if it's a matter of different libraries clashing or what, but I'm incredibly frustrated. I've also tried just setting the bibstyle to equal plain and it still doesn't work (also \bibliographystyle{plain}).  When I run:  pdflatex myTexDocument   I get the error message:   !Package biblatex Error: Style 'amnat' not found.   Also,   \RequireBibliographyStyle{\blx@bbxfile}   And (after pressing the Return key):   !Package biblatex Error: No driver found.   When I run the document without the extra bibstyle=amnat parameter for biblatex, I do not run into any errors.  Here is an abridged version of myTexDocument.tex:  \documentclass[12pt]{article} \usepackage[english]{babel} \usepackage{csquotes} \usepackage[style=authoryear,sorting=none,natbib=true,bibstyle=amnat]{biblatex} \usepackage[pagebackref=false,hidelinks]{hyperref}  %For cross-referencing papers to biliography \usepackage[pdftex]{graphicx}   %Add images \usepackage{setspace}   %Set line-spacing \usepackage[hmargin=2cm,vmargin=2.25cm]{geometry}   %Set document margins \usepackage{amsmath}    %For mathematic formulas \usepackage{appendix} \usepackage{pdflscape}  %For configuring page orientation \usepackage{varwidth,array,ragged2e}    %To adjust table row heights accordingly \usepackage{multirow} \usepackage{mathptmx}   %Set font so compatible with math font too \usepackage{titlesec}   %For adjusting section headings \usepackage{paralist}   %For lists \addbibresource{../../../../Bibtex/library.bib} %Load bibiliography  \titleformat{\section}[block] {\normalfont\bfseries\large} {}{0em}{}  \titleformat{\subsection}[runin] {\normalfont\itshape} {}{0em}{}[--- ] \titlespacing{\subsection}{0pt}{*2}{0pt}  \newcommand{\HRule}{\rule{\linewidth}{0.5mm}}  \begin{document}     \input{titlePage} %My title page document     \raggedright    %Left Justify document     \setlength{\parindent}{0.6cm}   %Set paragraph indent     \doublespacing     \renewcommand{\abstractname}{Summary}         \begin{abstract}             Blahblah \autocite{Webb2002,Graham2008}         \end{abstract}           \section{Conclusion}         Blah blah     \phantomsection %Create a hyperlink to the References section in Table of Contents     \addcontentsline{toc}{section}{References}     \printbibliography      \input{tables} %This is just a document with tables \end{document}


I try to convert my string data to float type. Conversion works but I need exact value.   Here is my code and output;  let myString = "2558.40"; let convertedToFloat = (myString as NSString).floatValue  // convertedToFloat is 2558.3999   So, I need exactly 2558.40 as float type. What should I do?

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


Currently I have everything on the left hand side of the page. But I would like to begin changing it to the middle (just horizontally). But as i'm a beginner, each time i try it doesn't turn out right. Could someone with more experience help?   html:

   css:     .iphonecontainer    {    width:100%;    float:left;    margin-top:6.5%;    }     .iphone {    display:block;    width: 400px;    margin: 0;    padding: 0;    }   Thanks for taking the time to help, have a good day!

How can I horizontally center a
 within another
 using CSS?

Foo foo


I want to find first character for example "A" if string have multiple A's i want only first one  Example : "bcAdeAnoA" i want only first "a" after bc  Dim test = "bcAdeAnoA" Dim regex = New Regex("A", RegexOptions.IgnoreCase) `then my code , replacing or do anything i want` sample = regex.Replace(sample, "#")   Note: Regex is not  necessary just giving a example

It seems the .NET Regex.Replace method automatically replaces all matching occurrences.  I could provide a MatchEvaluator delegate that returns the matched string after the first replacement, rendering no change, but that sounds very inefficient to me.  What is the most efficient way to stop after the first replacement?


I am currently building a program and want to sort data (called component in the code) by week number.   wList = [] thing = [] Wstart = 0  for component in list:      curDate = component[0]      year, month, day = (int(x) for x in curDate.split('-'))         currentWeek = int(datetime.date(year, month, day).strftime("%V"))      if Wstart == currentWeek or Wstart == 0:         wList.append([component, component, component, component])         Wstart == currentWeek     else:         thing.append(Wlist)         wList = []         wList.append([component, component, component, component])         Wstart == currentWeek   Basically I want to reset the Wlist when a new week is available, and store the Wlist in a list called thing, but when I run print(thing) I got "[]".  I appreciate all the help I can get!

What's the difference between the list methods append() and extend()?


I am building a simple logistic regression model on 2D data. Here is the input I use.    I built a logistic regression model using this data and it successfully is able to find the discriminating line between these two classes. Here is the separating line found by my program:    Also, just for debugging, I plotted number of iterations vs J(theta), which also looks fine:    Now, confusing part comes into play. I am investigating the cost surface of this model that the logistic regressions is doing the gradient descent on. I am considering three different loss functions. Sum-of-squared loss, hinge-loss, log-loss.  Hinge loss:    Log-loss:    Sum-of-squared loss:    As far as I know, both hinge loss, sum-of-squared loss and log-loss should produce a convex surface. When I look at my surfaces, however, sum-of-squared surface does not look convex to me. Why is that the case?  For convenience, here is the two critical functions from my code:  function retval = J(X, y, theta)     M = size(y, 1);     % sum of squared error     retval = (1/(2*M)) * sum((h(X, theta) - y).^2);  endfunction  function retval = h (X, theta)     % logistic     retval =  1 ./ (1+ exp(-1 * (X * theta))); endfunction

I am trying to use squared loss to do binary classification on a toy data set. I am using mtcars data set, use mile per gallon and weight to predict transmission type. The plot below shows the two types of transmission type data in different colors, and decision boundary generated by different loss function. The squared loss is $\sum_i (y_i-p_i)^2$ where $y_i$ is the ground truth label (0 or 1) and $p_i$ is the predicted probability $p_i=\text{Logit}^{-1}(\beta^Tx_i)$. In other words, I am replace logistic loss with squared loss in classification setting, other parts are the same. For a toy example with mtcars data, in many cases, I got a model "similar" to logistic regression (see following figure, with random seed 0).  But in somethings (if we do set.seed(1)), squared loss seems not working well.  What is happening here? The optimization does not converge? Logistic loss is easier to optimize comparing to squared loss? Any help would be appreciated.  Code d=mtcars[,c("am","mpg","wt")] plot(d$mpg,d$wt,col=factor(d$am)) lg_fit=glm(am~.,d, family = binomial()) abline(-lg_fit$coefficients[1]/lg_fit$coefficients[3],        -lg_fit$coefficients[2]/lg_fit$coefficients[3]) grid()  # sq loss lossSqOnBinary<-function(x,y,w){   p=plogis(x %*% w)   return(sum((y-p)^2)) }  # this random seed is important for reproducing the problem set.seed(0)  x0=runif(3) x=as.matrix(cbind(1,d[,2:3])) y=d$am opt=optim(x0, lossSqOnBinary, method="BFGS", x=x,y=y)  abline(-opt$par[1]/opt$par[3],        -opt$par[2]/opt$par[3], lty=2) legend(25,5,c("logisitc loss","squared loss"), lty=c(1,2))


Why is it that the below are true?  $\sum_{i=1}^n \hat{y}_ie_i= 0$  so far, I have, for the above: $\sum_{i=1}^n (\hat{y_i})(y_i-\hat{y_i})=0$ = $\sum_{i=1}^n \hat{y_i} y_i- \hat{y_i}^2$ so does the first term after the summation equal the squared $\hat{y_i}$ term? May be explained by some linear algebra, but not sure.  $\sum_{i=1}^nx_ie_i= 0$

In class we've seen that $a$ (the weights) must satisfy $$X^T (y-Xa) =0$$  Here $X$ is a $(n\times d)$ matrix (so we have $n$ samples in $\mathbb R^d$)  let's denote the residuals $r = y-Xa$. In our class notes, it is written that     The normal equations require the residuals to be orthogonal to each of the columns of $X$.   Why?     Therefore, the solution of the linear regression is a projection of $y$ onto the subspace spanned by $v_1 , \ldots , v_d$ (the columns of $X$)   Can you please explain this?


Consider following case.      List<Integer> listOne = new ArrayList<>();     List<Integer> listTwo = new ArrayList<>();     listOne.add(1);I think this happens due to      listOne.add(2);     listOne.add(3);     Collections.reverse(listOne);     listTwo = listOne;  //listTwo has same reference      Collections.reverse(listOne);     System.out.println(listOne);  //out put [1, 2, 3]      System.out.println(listTwo);  // same out put   Java is pass by value, where values (for non primitive types) happen to be references. I think this provide survival for java for this kind of scenario. To be honest why java try to avoid pass by reference and try to be different from some of other languages? while java still suffering from pass by reference behaviors?     Edit: additionally please some one explain what happen in above code

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


Recently I learned about open access and that there are many ways in which the publishers implement it. How do I find out if a paper is Diamond/Gold/Green access? I guess if the paper is listed in a journal but a pre-print is available on the authors' webpage/repository then it is Green access. Is that correct? Next how do I find out whether a paper appearing on the journal's website is gold access or diamond access? (Basically did the authors pay to make their paper open) Thanks

What is the difference between Green Open Access and Gold Open Access?  Are there other "flavors" of Open Access?


I am trying to write a function in Python that would return a colour value after evaluating to a user value. This what I have tried, however, I am not get what I expect, a single colour. I am getting a list of colours. I am new to programming.  uservalue = 100000  def colour(m,i):     if uservalue > (m + i):         clrs == "red"                       elif uservalue < (m - i):         clrs == "blue"                   else:         clrs == "white"              return clrs   to test I use this input:  colour(20000, 3000)     output:  ['red', 'red', 'red', 'white', 'white', 'white', 'white']   I was looking for one colour returned after evaluation.

My  has failed me.  In Python, are the following two tests for equality equivalent?  n = 5 # Test one. if n == 5:     print 'Yay!'  # Test two. if n is 5:     print 'Yay!'   Does this hold true for objects where you would be comparing instances (a list say)?  Okay, so this kind of answers my question:  L = [] L.append(1) if L == [1]:     print 'Yay!' # Holds true, but...  if L is [1]:     print 'Yay!' # Doesn't.   So == tests value where is tests to see if they are the same object?


It's just a self-assessment question as a result of curiosity; so please cope with it.             I know that in C we pass things by value. In case of arrays the scenario is different. We cannot pass them by their values and if we don't; a demotion from array type to pointer type will occur. We need to pass the value of the pointer to the first element of the array or pointer to the array itself. Yeah, this is what people call as array decay. As, the original type information of array is lost while passing we cannot obtain the size information of the passed array in the called routine unless we pass by reference.            Have a look at the following code:  #include <stdio.h> #include <stdlib.h>  void cal(int (*b)[3])  {     printf("%d",sizeof(*b)); }  int main() {     int a[3] = { 2,3,4 };     cal( &a );  }   Output:  12                                                               Okay, we got what we want. But what I concluded is that the number of elements in the array are always required when you declare a pointer to a non-variable array like this :  int a[] = { 3, 4, 5 }; // declaring an array of size 3 int (*p)[3]; // declaring a pointer to an array with length 3 p = &a ; // assignment   So, you are implicitly passing the length of the array to called function and there always exist a different way of doing it by passing an extra length argument to the called function in the case when you don't pass the reference of the array.  P.S. You always need to pass the length whether you do in an explicit manner or in implicit one and it is just like hardcoding things.  Is there exist an other techniques for having the size information of the passed array in the called function or I'm hitting right on the money? And, how will you deal with the dynamic ones'?

I've allocated an "array" of mystruct of size n like this:  if (NULL == (p = calloc(sizeof(struct mystruct) * n,1))) {  /* handle error */ }   Later on, I only have access to p, and no longer have n. Is there a way to determine the length of the array given just the pointer p?  I figure it must be possible, since free(p) does just that. I know malloc() keeps track of how much memory it has allocated, and that's why it knows the length; perhaps there is a way to query for this information? Something like...  int length = askMallocLibraryHowMuchMemoryWasAlloced(p) / sizeof(mystruct)   I know I should just rework the code so that I know n, but I'd rather not if possible. Any ideas?


Consider a wire of length $L$ hanging between two poles of the same height that are located a distance $d$ from one another, such that the mass density of the wire is constant, and at a fixed length (meaning, length along the wire) $l$ from the left hanging point, there is a point mass $M$. This is an adaption of the classical catenary problem in classical mechanics (and calculus of variations) which I find interesting. How would you write down the Lagrangian, end conditions and constraints for this problem? And how would you try to solve it? The action should be the total potential energy for the wire. Does this mean that the Lagrangian should have a delta function term where the point mass is located? How would you parametrize this in a way which will 'fit' well with the constraint for the total length of the wire? I'm quite new to this so I'd be happy to hear as many details as possible (or if there is a good source which addresses the problem, that would also be good).

The height of a string in a gravitational field in 2-dimensions is bounded by $h(x_0)=h(x_l)=0$ (nails in the wall)  and also $\int_0^l ds= l$. ($h(0)=h(l)=0$, if you take $h$ as a function of arc length) .  What shape does it take?  My try so far: minimise potential energy of the whole string,  $$J(x,h, \dot{h})=\int_0^l gh(x) \rho \frac{ds}{l}=\frac{g \rho }{l}\int_0^l h(x) \sqrt{1+\dot{h}^2} dx$$  With the constraint  $$\int_0^l \sqrt{1+\dot{h}^2} dx- l=0$$ If it helps, it's evident that $\dot{h}(\frac{l}{2})=0$.  Generally, this kind of equation is a case of a constrained variational problem, meaning that the integrand in  $$\int_0^l \frac{g \rho }{l}h(x) \sqrt{1+\dot{h}^2} +\lambda(\int_0^l \sqrt{1+\dot{h}^2} dx- l)dx$$  Must satisfy the Euler Lagrange equation. The constraint must also be satisfied.  But, in truth, by this point I am clueless. $\lambda$ is worked through $\nabla J  = \lambda \nabla(\int_0^l \sqrt{1+\dot{h}^2} dx- l)$. I have tried this , but get nonsensical answers.  Is this method the best? If so, in what ways am I going about it wrongly thusfar?


created a brand new mesh object, still can't use particles. I've tried every mode and such and it WONT let me use particles. Please help.

I am working on blender using a friend's computer, and I cannot find the materials tab. I circled the red area where it is usually located for me.


How can I prove $\int_0^{2\pi} \ln(1+a^2+2a\cos x)\, dx=0$, where $a<1$?  Thanks.

My problem is to integrate this expression:  $$\int_0^{2\pi}\log(1-2r\cos x +r^2)dx.$$ where $r$ is any constant in $[0,1]$.  I know the answer is zero. Can you explain you idea to me or just prove that? Maybe you will use the "Cauchy integral theorem ".


Suppose that ${a_n}$ is a convergent sequence of positive terms that converges to $L \geq 0$. Let $k \in \mathbb{N}$. Prove that $\lim_{n\to\infty} a_n^{1/k} = L^{1/k}$ .  I know I'll have $k \in \mathbb{N}$ and $a_n > 0$. I also know I'll have $|a^{1/k}_n - L^{1/k}| < \varepsilon$ and also $a_n - L = (a_n^{1/k})^k - (L^{1/k})^k$. This is as far as I have been able to get, any help is much appreciated!

Prove that $\displaystyle{\lim_{n \to \infty}a_n ^{1/k}}= a^{1/k}$ if $a_n \ge 0$ for all $n$ and $\displaystyle{\lim_{n \to \infty}a_n}= a$  The book tells me to use $x^k - y^k = (x-y)(x^{k-1}+x^{k-2}y+ \dots + y^{k-1})$ with $x= a_n ^{1/k}$ and $y= a^{1/k}$. I did that and I rearranged to get an expression for $|a_n ^{1/k}-a^{1/k}|$. After that I divided the problem into two cases: $a=0$ and $a>0$. If $a>0$ then there exist positive integers $m$ and $N$ such that $a_n >m$ for all $n>N$. Using this, we can find a lower bound $L$ for the denominator of the expression for $|a_n ^{1/k}-a^{1/k}|$ for $n > N$. Then  $|a_n ^{1/k}-a^{1/k}|< |a_n-a|\frac{1}{L}$ and the rest is easy. However, I can't deal with the case when $a=0$. How can I complete this proof?


i've installed a python software that allows to run javascript on the server  i've put the binary file (jsrunner) in this address   /usr/local/bin/jsrunner   so in the ssh when i try it it works fine   /usr/local/bin/jsrunner /home/domain/public_html/test.js   and i get some output from test.js   so i've put the same exact command in the cronjob   * * * * * /usr/local/bin/jsrunner /home/domain/public_html/test.js   but after a while i didn't get the expected result so i've enabled email report on cronjob and i got a email with this title   Cron <domain@CentOS-67-64-minimal> /usr/local/bin/jsrunner /home/domain/public_html/test.js   containig this error  /bin/sh: /usr/local/bin/jsrunner: No such file or directory   why there is /bin/sh: at the beginning of commend ? why it fails to find the file when i run it from cronjob ?   pleas note my cronjob works fine for other files like php using curl or binary , it's only this particular software/bin file that cuzing this error

This is a  about using cron & crontab.   You have been directed here because the community is fairly sure that the answer to your question can be found below. If your question is not answered below then the answers will help you gather information that will help the community help you. This information should be edited into your original question.  The answer for 'Why is my crontab not working, and how can I troubleshoot it?' can be seen below.  This addresses the cron system with the crontab highlighted.


Here the image I obtain:    Here are rendering options:

When I hit F12 to render an image and zoom in it is quickly pixelated. How can I render a higher res display? I have looked through the settings and couldn't find a solution.


I am trying to work out a special UNIQUE constraint: there are many columns in a Users table but only these two are relevant for the question:  id bigint, active boolean, ...   I want to allow multiple rows to have the same id - but only one of them may have active = true.  E.g. There can be many rows with id = 1 and active = false, but only one can have id = 1 and active = true.

Is it possible to have a custom unique constraint as follows? Suppose I have two cols, subset and type, both strings (though the data types probably doesn't matter). If type is 'true', then I want the combination of type and subset to be unique. Otherwise, there is no constraint. I'm using PostgreSQL 8.4 on Debian.


How do you consider an organism to be a new species? Can a new parthenogenetic organism be considered as a new species?

What determines speciation at a molecular level?  At what point does a scientist determine two lineages are different enough to be considered separate species?  Does it have a margin of error?


I answered a question, but after two days the question was deleted, so its answers deleted after also without any notification to me.  I found my deleted answer in Deleted Recent Answers list, then I found the deleted its question.  I expected it notify to me!  Also, what's the reason for deleting a question by the owner? I have spent a time and effort into answering that!    This is the deleted  that I'm complaining about it.

I poured my heart out to write a great answer to a question, and I earned a gold badge for it. I'm so proud of the answer that I've even linked to it on the web in several places.  To my surprise, I discovered that the question had been closed without notifying me, and that it had been deleted without notifying me.  Since there already is , this question is specifically about deletions.  Please could I be notified whenever a question that I posted an answer to is deleted? Especially if my answer is long, or earned lots of upvotes. I want to at least be able to fix any links to that question, and maybe convert that answer into a blog post or something, because I really do think it is making the Internet a better place.  Some high-rep users have already found the deleted question that caused me to discover this issue. But I want to be clear that I'm not trying to generate a discussion about whether the deletion was justified or not, I'm pointing out that I was never notified of the deletion, and I think I should have been.  My question is slightly different from , as I want to be notified when a question of my answer is deleted, not necessarily when my question has been deleted.


I tried to put null rows and do many another things. I can't test this catch. It writes System.QueryException: List has no rows for assignment to SObject.  public List<MyObject__c> getList(){     try{         myList = [SELECT Id, Name, Title__c FROM MyObject__c];     } catch(QueryException e){         ApexPages.addmessage(new ApexPages.message(ApexPages.severity.ERROR, 'Query error:  ' + e.getMessage()));       }     return myList; }

I have below line placed in controller that fires list has no row exception. I just need to show a custom message instead when the query returns no value.   Apex code:  Id CI=[select Compliance_Incident_abv__c from Compliance_Incident_Transaction_abv__c where Name=:selectedCIT].Compliance_Incident_abv__c ;  //**This line throws error**     system.debug('CI@@'+CI);         if(cond != '')             cond += ' and';           else             cond += ' where ';                                        if(CI!=null)          cond += ' Id = \'' + CI+ '\'';


When I tried to compile a c++ program in Ubuntu 14.04 LTS it said:  The program g++ is currently not installed but this package is not available    I also checked in /user/bin/ there was no file named as g++ or g++-4.8. What should I do?

I shifted to Ubuntu 10.10 now I am facing problem to have C/C++ compiler. What are the possible ways so that I can use C/C++ compiler using all the libraries (like graphic, math, conio, stdlib, etc) as in Microsoft Windows creating executable file?


I am struggling with increasing my stackoverflow reputation from one.  I coming at this with the assumption that the reputation system has been designed with the intention of making it possible to measure individuals' contributions to the community. I am completely in favour of such a mechanism.  As far as I can tell, at a reputation of one, the only options for my raising reputation is to either ask or answer a question.  Surely, it's not that hard to ask or answer a question? Actually I think it is because, unless I want to duplicate an existing question or answer, or to provide a rushed or incomplete answer, searching stackoverflow for existing content is usually sufficient.  I do want to contribute as I feel the urge to pay back to the community; however I am finding that my low reputation is preventing me from doing this. For instance, whenever I try to vote up an answer, I am told my reputation is too low.  So far I have been resisting asking bogus questions and getting friends to answer them; however, unless I find a legitimate way of increasing my reputation, I suspect that I will eventually fold.  So my question is, how do I raise my reputation in a way that does not abuse the intention behind reputations!  Thanks.  P.S. Ironically, moments after asking this question, a previous answer I had posted was accepted and I was launched to 11 rep. It looks like I am out of the bootstrapping zone and I can start to contribute to the community. Thanks for the answers and comments folks.

This question might not be a directly related to programming but more the culture around it, specifically Stack Overflow.  I recently stumbled onto , and read how you could create an online CV that links to your Stack Overflow reputation, thus allowing future employers to review your answers and questions.  Since Stack Overflow has become such a phenomenal success for developers, I realised that Stack Overflow Careers was going to be crucial when applying for software development jobs in the future. This would imply that a high reputation is needed to reflect well on your CV.  Now, I love Stack Overflow and think it’s a great resource for finding solutions to problems regarding software development. However, I cannot possibly sit on the site 24/7 and hope to be one of the first replies to a question to try and increase my reputation. Developers need to work, you know.  So my question is: How do you increase your reputation score on Stack Overflow in a realistic manner? There are users out there boasting reputations of 25,000 and higher. How do you do this? Suggestions, comments, tricks, etc. would be helpful.


I've been trying really hard to understand the construction of a logical circuit using only NAND while also trying to minimize the number of gates. The minimization of gates is what is really confusing me, so my thought process is like so.   1) Start with the desired expression of the end 2) Work backwards with the understanding that the output(s) were also derived from a NAND 3) Run intermediate expression through K-Map to get most simplified form 4) Attempt to convert to an AND if it isn't already using DeMorgans law  5) Rinse and repeat steps 2-5    I attempted this approach with XOR using only NAND and did indeed get 4 gates, but it's different than ones I see online and just wanted to validate if it's correct or not and if not, where my errors are.    I'm worried that the first NAND where I feed the output into two separate gates isn't valid, so looking for some confirmation on that as well.  Thanks.

I try to resolve a problem, how to implement a xor gate with nand's gate.  A xor B = A'B + AB'  So, this becomes :  A xor B = A'B + AB' + AA' + BB' = A(A' + B') + B(A' + B') = (A + B)(A' + B') =   (with De Morgan apllied on the second term)  = (A + B)(AB)' = ..... ?  In this point i am blocked. If someone can help me, please. Thank you.


I have made and uploded a dependency on the central repository, which can be accessed if you have this in your pom file <dependency>   <groupId>com.github.abejoy</groupId>   <artifactId>DtoConverter</artifactId>   <version>1.0.0</version> </dependency>  I am using Idea Intelij, and on a spring boot application if you have this in your pom.xml file as a dependency, when refresing maven idea downloads the jar of this depedancy My issue is that I can access a class of DtoConverter just in src>main>java>something.java class. But I cannot access that same class inside of a package eg. src>main>java>blabla>blabla>something.java

I'm working now together with others in a grails project. I have to write some Java-classes. But I need access to an searchable object created with groovy. It seems, that this object has to be placed in the default-package.   My question is: Is there a way to access this object in the default-package from a Java-class in a named package?


I want to run a shell script called start.sh on my Ubuntu 16.04 LTS server.  So I type ./start.sh and it wont run.  I'm new, just putting that out there.

./geany_run_script.sh: 5: ./geany_run_script.sh: ./Area_circumference: Permission denied   program exited with code: 126. This problem always occur when I try to execute my code. What might be the solution?


Let $X$ be a normed space. Prove that $X$ is complete if and only if $\Sigma_{n=1}^{\infty} x_n$ exists for any sequence $\{x_n\}$ that satisfies $\Sigma_{n = 1}^\infty \|x_n\| < \infty$. Here $\Sigma_{n=1}^{\infty} x_n$ means the limit of $\Sigma_{n=1}^{N} x_n $ as $N \rightarrow \infty$ I have started to learn Introduction to functional analysis, but I am not sure if I understand correctly. Could you give me some answers (or hints) to the question? Thank you.

Show that      A Normed Linear Space $X$ is a Banach Space iff every absolutely convergent series is convergent.   My try:  Let $X$ is a Banach Space .Let $\sum x_n$ be an absolutely convergent series .Consider $s_n=\sum_{i=1}^nx_i$. Now $\sum \|x_n\|<\infty \implies \exists N$ such that $\sum_{i=N}^ \infty \|x_i\|<\epsilon$ for any $\epsilon>0$  Then $\|s_n-s_m\|\le \sum _{i=m+1}^n \|x_i\|<\epsilon \forall n,m>N$  So $s_n$ is Cauchy in $X$ and hence converges $s_n\to s$ (say).  Thus $\sum x_i$ converges.  Conversely, let $x_n$ be a Cauchy Sequence in $X$. Here I can't proceed how to use the given fact.  Any help will be great.


I'm currently learning C in class and I'm having some confusion understanding volatile variables. My textbook defines them as this.  Volatile Variables     The volatile variables are those variables that are changed at any time by other external   program or the same program. The syntax is as follows.   volatile int d;   What is exactly the difference between the normal variables and volatile variables? If volatile variables can be changed by external programs, how can I change the value from another external program.  Thanks.

Why is volatile needed in C? What is it used for? What will it do?


I've spent a fair bit of time reading up on answers detailing exactly how blackbody radiation is created but I have seen two different explanations for how it is created.   The Kinetic Energy (KE) of the atoms causes them to move and collide with each other. This process causes acceleration and deacceleration of charges thus producing electromagnetic radiation. The atoms bumping around somehow smash electrons of other atoms into higher energy states and when they fall down they produce quantised photons.   Could someone please clarify for me which of the two is correct?

By conservation of energy, the solid is left in a lower energy state following emission of a photon.  Clearly absorption and emission balance at thermal equilibrium, however, thermodynamic equilibrium is a statement of the mean behaviour of the system, not a statement that the internal energy is constant on arbitrarily short timescales.  The energy has to come from somewhere during emission, and go somewhere during absorption.  Energy in a solid can be stored as kinetic and potential energy of electrons and nuclei, either individually or in collective modes such as phonons and plasmons.  In thermal equilibrium energy will be stored more or less in various forms depending on the temperature and material.  However, even if most of the thermal energy in a particular solid at temperature $T$ is stored in the form of phonons, it could be that phonons primarily interact with light indirectly via electrons, e.g. a phonon excites an electron in a phonon-electron interaction, which can interact with light via the EM field.  Given that light is an EM field, it makes sense to me that it is emitted and absorbed by charged particles.  The electron-photon interaction is probably dominant for visible and ultraviolet light, given that metals are opaque, while semiconductors and insulators are transparent to (visible and UV) light with energy lower than their bandgap. However, once you get into energies in the IR and below, or X-rays and above, other mechanisms apparently take over.  For example, on the high-energy end of the spectrum I've heard that gamma rays can interact directly with nuclear degrees of freedom, which is reasonable considering that gamma rays are emitted during a lot of nuclear reactions.  A review of  might give clues to important light-matter interactions over a broad range of wavelengths.  Whether all of the these processes are involved in blackbody emission is a somewhat different question.  What physical processes mediate energy transfer during blackbody emission, and in which energy ranges are the various processes dominant?


I have this code:  var image = button.getElementsByTagName("span")[0]; if (isEnabled) {     image.style.color = "#BBB" else {     image.style.color = "#AAA"   Can someone give me some advice on how instead of directly setting a color that I could set the button to have a 3rd class of enabled and then later set it to have a 3rd class of disabled?  Note that my button currently has classes like this:  class="fa fa-bold" class="fa fa-arrow"   etc.  So I would need the first two classes to be unchanged. Then I need to be able to set to like this:  class="fa fa-bold enabled" class="fa fa-bold disabled" class="fa fa-bold enabled"   etc.

I have an element that already has a class: <div class="someclass">     <img ... id="image1" name="image1" /> </div>  Now, I want to create a JavaScript function that will add a class to the div (not replace, but add). How can I do that?


I'm trying to run find . -name "binaries.tgz.*.gz" -exec gzip -d -k < {} \; (ultimately I'm trying to run find . -name "binaries.tgz.*.gz" -type f -exec gzip -d -k < {} \; | tar tzf - but I'm trying to figure out why the command before the pipe isn't working first), but I get the following error:     -bash: {}: No such file or directory:   [user@host:/data/dionaea]$ find . -name "binaries.tgz.*.gz" -type f -exec gzip -d -k < {} \; -bash: {}: No such file or directory [user@host:/data/dionaea]$ ls | grep binaries binaries binaries.tgz binaries.tgz.10.gz binaries.tgz.11.gz binaries.tgz.12.gz binaries.tgz.13.gz binaries.tgz.14.gz binaries.tgz.15.gz binaries.tgz.16.gz binaries.tgz.17 binaries.tgz.17.gz binaries.tgz.18.gz binaries.tgz.19.gz binaries.tgz.1.gz binaries.tgz.20.gz binaries.tgz.21.gz binaries.tgz.22.gz binaries.tgz.23.gz binaries.tgz.24.gz binaries.tgz.25.gz binaries.tgz.26.gz binaries.tgz.27.gz binaries.tgz.28.gz binaries.tgz.29.gz binaries.tgz.2.gz binaries.tgz.30.gz binaries.tgz.3.gz binaries.tgz.4.gz binaries.tgz.5.gz binaries.tgz.6.gz binaries.tgz.7.gz binaries.tgz.8.gz binaries.tgz.9.gz   What am I doing wrong?

I'm using find with the -exec option in console, on FreeBSD (for example, find . -exec sha1 {} \;).   How do I correctly place (and if needed, escape) redirect and other execution control symbols that could syntactically apply to either of the exec command or the find command, such as > >> | and &, where I might want the symbol to apply to the find or the exec commands on different occasions?  On the same theme, what is the syntax if I want to use tee to view the output of the -exec commands on the console (to watch progress) and also appended to a file (for later use)?   (I know shells vary but hopefully the most used shells such as sh/csh are quite similar?)  Update:  In part, I want to learn if nested find -exec can be done without scripting, as a simple command. Here is the use-case that prompted the questio :   outer find: find all subdirs matching DIR_MATCH_TEXT in DIR1  inner find: for each matching subdir found in the outer loop (call it DIR2), execute the commandfind DIR2 -name "FILE_MATCH_TEXT" -exec sha1 {} \; >> DIR1/DIR2_hashes.txt   The aim being to create a set of files, one for each matching subdir, containing the output of some find -exec action on that subdir.  By this I mean that, if /backups contains /jan2017 and /feb2017, the result will be two files at /backups/jan2017_hashes.txt and /backups/feb2017_hashes.txt, with jan2017_hashes.txt containing the output from sha1 for (say) all .pdf files in /backups/jan2017, and feb2017_hashes.txt containing the output from sha1 for all .pdf files in /backups/feb2017.  From replies so far I gather the outer find would have to use a shell call as the argument to -exec?


What's the best way to connect the Miniature Circuit Breakers ?   Is it when the Line is coming downward or upwards ? I am confused as I have seen two different wiring's.  I want to know where I should connect an incoming and outgoing supply ?

Just what the title states. The house, located in India, uses old-fangled . The typical domestic supply here in this part of the world is 250V AC at 50cps. I am in the middle of replacing the fuses with Miniature Circuit Breakers.   MCB appear to receive the line wire from the top connector, the bottom connector being the protected device/s. Is this universal/standard? Does the protected device connect to the top, or bottom of the MCB?


I want to remove the site contents link in sharepoint site.can anyone having idea to delete the sitecontents link in sharepoint 2010?

Ho can I remove the recycling bin and the 'All Site Content' link from the quick launch or remove the quick launch altogether


I want to compare the current date with the day before and the day next date. Here is how I get current date and upload to firestore: java.util.Date utilDate = new java.util.Date(); java.sql.Date sqlDate = new java.sql.Date(utilDate.getTime());  Map<String, Object> map = new HashMap<>(); map.put("time", sqlDate);  db.collection("users").document(user.getUid()).update(map);   Firestore screenshot:  To get date from firestore db.collection("users")                 .document(user.getUid())                 .get()                 .addOnCompleteListener(new OnCompleteListener<DocumentSnapshot>() {             @Override             public void onComplete(@NonNull Task<DocumentSnapshot> task) {                 if (task.isSuccessful()) {                     DocumentSnapshot document = task.getResult();                     assert document != null;                     if (document.exists()) {                         Date userDate = document.getDate("time");                                       }                 }             }         });  Format of date Sun Apr 26 17:59:05 GMT+05:00 2020 I want to get the next date and the previous date. Something like below:  Previous date: Sat Apr 25 17:59:05 GMT+05:00 2020 Today date: Sun Apr 26 17:59:05 GMT+05:00 2020 Next date: Mon Apr 27 17:59:05 GMT+05:00 2020  Any suggest me how to get previous and next date from firestore using current date(uploaded to firebase).

I'm working with a date in this format: yyyy-mm-dd.  How can I increment this date by one day?


currently we have a $(G,*)$ group, which order is $2k$. Prove existence of non $e$ item $a$ in the group,  such that $a^2 = e$. I am currently out of ideas, can you give me any hint. Thanks.

I was trying to prove this question.   Q. If G is a group of even order, prove that it has an element a, such that a$\neq$e satisfying $a^2$=e.   I tried solving it using Principle of mathematical induction.  So, Let O(G)=2m, where m$\in$ $N$.   We proceed by induction on m.   For m=1, O(G)=2, $\therefore$ G contains two elements.  G=$\{{e,a}\}$. Now, e has order 1. So, a can not have order 1. $\therefore$ a has order 2. So, it true for m=1.  Now, let it be true for m=k.  Then, we have a group G of order 2k, where $\exists$ an element a$\in$ G, whose order is 2.   We wish to prove it for m=k+1.   Then G has order 2k+2.   I don't know how to proceed further.


So I have two tables, one table is called stores which has the name of the store as well as the geom column that contains the coordinates for the stores. The other table is customers which has the coordinates of the customer's address.  I'm trying to create a new column in the customer table with the nearest store given the customer's coordinates. I've tried something like this but it doesn't work:  UPDATE customers SET storename =      SELECT storename      FROM stores      ORDER BY geom <-> ST_GeometryFromText('POINT(customers.geom)',4326) LIMIT 1 );

I need to obtain on each element on one table the closest point of another table. The first table contains traffic signs and the second one the Entrance Halls of the town. The thing is that I can't use ST_ClosestPoint function and I have to use ST_Distance function and get the min(ST_distance) record but I am quite stuck building the query.  CREATE TABLE traffic_signs (   id numeric(8,0) ),   "GEOMETRY" geometry,   CONSTRAINT traffic_signs_pkey PRIMARY KEY (id),   CONSTRAINT traffic_signs_id_key UNIQUE (id) ) WITH (   OIDS=TRUE );  CREATE TABLE entrance_halls (   id numeric(8,0) ),   "GEOMETRY" geometry,   CONSTRAINT entrance_halls_pkey PRIMARY KEY (id),   CONSTRAINT entrance_halls_id_key UNIQUE (id) ) WITH (   OIDS=TRUE );   I need to obtain the id of the closest entrnce_hall of every traffic_sign.  My query so far:  SELECT senal.id,port.id,ST_Distance(port."GEOMETRY",senal."GEOMETRY")  as dist     FROM traffic_signs As senal, entrance_halls As port        ORDER BY senal.id,port.id,ST_Distance(port."GEOMETRY",senal."GEOMETRY")   With this I am getting the distance from every traffic_sign to every entrance_hall. But how can I get only the minimun distance?  Regards,