Make the horizontal width of the flair customizable to any arbitrary size.  This was apparently a feature of StackFlair or other alternatives, but according to  here, they are no longer available.  I think this is a valuable feature to add to the official version.  My personal issue that causes me to wish for this is that I have exactly eight(8) SE sites that are presently above 200 rep, while the flair can only show exactly seven(7) icons.  Thus, the numeric values are including exactly one(1) more site than is shown.  Of course, one can always be "one-off" from the default amount by poor luck, but that seems like all the better reason to allow any arbitrary number of sites of the user's choice to be shown.    My image above shows the inconsistency - I am shown to have 8 gold badges on my flair, as I have exactly 1 gold badge on each of 8 sites (all Fanatic for each).  However, it only shows 7 sites.  Thus, my badge total is inaccurate for the sites shown.  It would be great if I could simply make the flair wider, and thus show as many sites as I wish.

I think many experts in stack exchange have knowledge in multiple discipline, and they would like to share their knowledge across multiple domains. It is not difficult for them to have knowledge in more than 7 domains. Please make the combined flair shows more than 7 icons to encourage expert supports other satellite sites.


I'm using the SQLite.Net Async API. Is there a way to have it automatically INSERT or UPDATE depending on the entity's primary key which is defined as [PrimaryKey, AutoIncrement]?  I can see from the intellisense that there are InsertAsync() and UpdateAsync() but no information about how they work in case the primary key property is already set in the entity.

Is there some clever way to do this in SQLite that I have not thought of? Basically I want to update three out of four columns if the record exists, If it does not exists I want to INSERT the record with the default (NUL) value for the fourth column. The ID is a primary key so there will only ever be one record to UPSERT. (I am trying to avoid the overhead of SELECT in order to determine if I need to UPDATE or INSERT obviously) Suggestions?  I cannot confirm that Syntax on the SQLite site for TABLE CREATE. I have not built a demo to test it, but it doesn't seem to be supported. If it was, I have three columns so it would actually look like: CREATE TABLE table1(      id INTEGER PRIMARY KEY ON CONFLICT REPLACE,      Blob1 BLOB ON CONFLICT REPLACE,      Blob2 BLOB ON CONFLICT REPLACE,      Blob3 BLOB  );  but the first two blobs will not cause a conflict, only the ID would So I assume Blob1 and Blob2 would not be replaced (as desired)  UPDATEs in SQLite when binding data are a complete transaction, meaning Each sent row to be updated requires:  Prepare/Bind/Step/Finalize statements unlike the INSERT which allows the use of the reset function The life of a statement object goes something like this:  Create the object using sqlite3_prepare_v2() Bind values to host parameters using sqlite3_bind_ interfaces. Run the SQL by calling sqlite3_step() Reset the statement using sqlite3_reset() then go back to step 2 and repeat. Destroy the statement object using sqlite3_finalize().  UPDATE I am guessing is slow compared to INSERT, but how does it compare to SELECT using the Primary key? Perhaps I should use the select to read the 4th column (Blob3) and then use REPLACE to write a new record blending the original 4th Column with the new data for the first 3 columns?


I was working on something that required me to catch the first char of a string. and return if it starts with S or s.  The pseudocode I considered was:  var foodsWithS = Foods.Where(food => food.Name[0] == 'S' || food.Name[0] == "s").Select(i => i.Name);   Unfortunately, this fails. What would be the best way to do this? Currently I have two lambdas to check for each case of the letter.

Is there a way to make the following return true?  string title = "ASTRINGTOTEST"; title.Contains("string");   There doesn't seem to be an overload that allows me to set the case sensitivity.. Currently I UPPERCASE them both, but that's just silly (by which I am referring to the  issues that come with up- and down casing).  UPDATE This question is ancient and since then I have realized I asked for a simple answer for a really vast and difficult topic if you care to investigate it fully. For most cases, in mono-lingual, English code bases  answer will suffice. I'm suspecting because most people coming here fall in this category this is the most popular answer.  answer however brings up the inherent problem that we can't compare text case insensitive until we know both texts are the same culture and we know  what that culture is. This is maybe a less popular answer, but I think it is more correct and that's why I marked it as such.


I meet two structs: struct s1{   int i;   int j;   char c;}  struct s2{   int i;   char c1;   int j;   char c2;}  the textbook says c in S1 only occupies 1 byte,whereas c2 in S2 occupies 4 bytes, why is this? Is it because c1 has to occupy 4 bytes, and they have the same type?

Why does the sizeof operator return a size larger for a structure than the total sizes of the structure's members?


I am currently in the process of reading a book on C++, and in this book the author explains that it is better to use a constant rather than NULL macro, but without really explaining why or giving any advantages or disadvantages.  So why it's better to do use:   const int NULL = 0; int *ptr = NULL;   instead of:  int *ptr = NULL;   The only explanation is given is that the NULL macro is not type-safe.

In the early days of C++ when it was bolted on top of C, you could not use NULL as it was defined as (void*)0. You could not assign NULL to any pointer other than void*, which made it kind of useless. Back in those days, it was accepted that you used 0 (zero) for null pointers.  To this day, I have continued to use zero as a null pointer but those around me insist on using NULL. I personally do not see any benefit to giving a name (NULL) to an existing value - and since I also like to test pointers as truth values:  if (p && !q)   do_something();   then using zero makes more sense (as in if you use NULL, you cannot logically use p && !q - you need to explicitly compare against NULL, unless you assume NULL is zero, in which case why use NULL).  Is there any objective reason to prefer zero over NULL (or vice versa), or is all just personal preference?  Edit: I should add (and meant to originally say) that with RAII and exceptions, I rarely use zero/NULL pointers, but sometimes you do need them still.


I have 3 different versions (jdk) of Java installed: 6, 7 and 8. In   bash_profile:  export JAVA_HOME=$(/usr/libexec/java_home -v 1.8) setjdk() {   export JAVA_HOME=$(/usr/libexec/java_home -v $1) }   However, at  $ ls /System/Library/Java/JavaVirtualMachines 1.6.0.jdk   I see only one version. Where are the 2 other ones? What's the location of their jdks?

I downloaded and installed Java 1.7 from .  When I run the Java Control Panel, I could check I have it correctly installed.     However, when I checked the Java version from command line, the version that I use is Java 1.6.  java -version java version "1.6.0_33" Java(TM) SE Runtime Environment (build 1.6.0_33-b03-424-11M3720) Java HotSpot(TM) 64-Bit Server VM (build 20.8-b03-424, mixed mode)   The system directory doesn't have the 1.7.    What's wrong with this?   Where is the Java 1.7 is installed? How can I make the Java 1.7 as default Java?


Let $f:[0,1] \rightarrow \mathbb{R}$ be a continuous function and $f(0)=f(1)$. Show that for all $n \in \mathbb{N}$ there is $x, 0 \leq x < x+\frac{1}{n} \leq 1,$ such that $f(x)=f(x+\frac{1}{n})$.  I define $g(t)=f(t+\frac{1}{n})-f(t)$ but I couldn't find appropriate $a,b$ such that $g(a)g(b)<0$.

Let $f \in C[0,1]$ and $f(0)=f(1)$.   How do we prove $\exists a \in [0,1/2]$ such that $f(a)=f(a+1/2)$?  In fact, for every positive integer $n$, there is some $a$, such that $f(a) = f(a+\frac{1}{n})$.  For any other non-zero real $r$ (i.e not of the form $\frac{1}{n}$), there is a continuous function $f \in C[0,1]$, such that $f(0) = f(1)$ and $f(a) \neq f(a+r)$ for any $a$.  This is called the Universal Chord Theorem and is due to Paul Levy.  Note: the accepted answer answers only the first question, so please read the other answers too, and also this answer by Arturo to a different question:     This is being repurposed in an effort to cut down on duplicates, see here: .  and here: .


Why do we use serialversionuid in java when serializing the object? and what is the benefit of it?  package testDemo;  import java.io.Serializable;  public class SerialTest implements Serializable     private static final long serialVersionUID = -4180381409376176730L;     public static void main(String[] args) {      } }

Eclipse issues warnings when a serialVersionUID is missing.       The serializable class Foo does not declare a static final   serialVersionUID field of type long   What is serialVersionUID and why is it important?  Please show an example where missing serialVersionUID will cause a problem.


I mean not just giving me water , I need them to put the cup on my lips ... etc ? I know : water the grass .

I can say "I feed someone". Am I forced to say "I give someone a drink", or is there a single word for this (as in "I [verb] someone")?  Unfortunately my thesaurus can't really help me.


When I put in sudo apt-get update into the Command Line, I get the following:  E: Type 'new' is not known on line 67 in source list /etc/apt/sources.list E: The list of sources could not be read.   Before I saw this error line, I had tried installing Spotify according to the following (), adding deb http://repository.spotify.com stable non-free to my source.list (by going through the "Software & Updates" tab, "Other Software" and "add...". But then it replied, Failed to load the package list, giving the same account as above:  E:Type 'new' is not known on line 67 in source list /etc/apt/sources.list, E:The list of sources could not be read E:The package lists or status file could not be parsed or opened."   I am running Ubuntu 14.04.1 LTS.  Thanks.

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


So one of the earbuds in my headphones recently broke so I can only hear audio from the right. I was checking around to see if there was a way to output mono audio to the headphones so I can hear both audio channels from only the right. There are a couple similar questions here ( is the most notable) but they are all for older systems, and Win8 changed a lot. I tried changing the balance, but that only increases the volume for one side, and doesn't merge the sides. The Realtek HD Audio Manager and Configure Speakers menus both look like they should have the ability to change the audio output, but they are both locked to stereo. The Enhancements menu doesn't have the Headphone Virtualization option that I've seen elsewhere. The only option I see there is "Disable all sound effects". I'm using a Lenovo Ideapad Z510 with all the most recent updates. I'm not entirely opposed to downloading 3rd-party software to fix this, but if there's a built-in way to fix it, that would be preferable. I typically play music with either iTunes or Google Play, both of which are particularly resilient to using plugins. Plus, an all-purpose solution that can work with any program would be fantastic. Obviously the first solution could be "buy new headphones" but I will also often listen to music or do whatever with only one earbud in so I can still hear my surroundings so a software solution is best.    Here's an image of some of the options I've been trying. Some things that seem to have worked for other people are disabled or don't exist.

my headphones are stereo but I would like the sound from the left and right to be combined then sent to both headphones.  The reason is I'm watching a video where the people speaking are in the right ear as well as the music but they never speak in the left ear (it is not because they on the right side of the screen) If I take the right headphone off then I only hear the music in my left and there is no speaking.


String [] abcd={"A","B","C","D","E","F","G","H","I","J","K","L","N","M","O","P","Q","R","S","T","U","V","W","X","Y","Z"}; JButton [] efgh = new JButton[abcd.length]; String [] secretWord={"S","W","I","N","G"}; JTextField [] input= new JTextField[secretWord.length]; String assign; String [] content = new String[5];  for(int a=0;a<abcd.length;a++)     {         if(e.getSource()==efgh[a])         {             efgh[a].setEnabled(false);             if(i<input.length)             {                 input[i].setText(abcd[a]);                 i++;             if(i==input.length)             {                    for(c=0;c<input.length;c++)                     {                         assign=input[c].getText();                         content[c]=assign;                         System.out.print(content[c]);                      }             }         }     }         if(c==4)         {             if(content[0] == secretWord[0]) && content[1]==secretWord[1] && content[2]==secretWord[2] && content[3]==secretWord[3] && content[4]==secretWord[4])             {                 output1.setText("You are right!!!!");             }             else             {                 output1.setText("Try again!!");             }         }      }      when user click the button at all , i want to proceed the step content[value] with secretWord[value], but always got "Try Again".. where are the statement i have been wrong??please me thank you very much..

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


I have a table with a Trigger that make a Auto_increment.   CREATE TABLE Auto     (    Auto_id NUMBER(*,0),          model_id NUMBER(*,0)    );   --Trigger   CREATE OR REPLACE TRIGGER  tr_Auto_autoident    BEFORE INSERT ON  Auto    FOR EACH ROW     BEGIN        IF inserting THEN         IF :NEW.Auto_id IS NULL THEN             SELECT seq_auto__id.NEXTVAL INTO :NEW.Auto_id FROM dual;         END IF;      END IF;  END;    ALTER TRIGGER  tr_Auto_autoident ENABLE;  I create the sequence too.   -- Sequence      CREATE SEQUENCE seq_auto__id ;   I would like to set the autoident to a fix value to start , because my table had previos values before the trigger Auto_incremente were set.   Thanks , any help is apreciated.

In , I can do something like this:  ALTER SEQUENCE serial RESTART WITH 0;   Is there an Oracle equivalent?


I hold a Thai passport. I will be flying from Bangkok to Abu Dhabi then Abu Dhabi to Manchester with a return ticket. I have a 4 hour 30 minute wait at Abu Dhabi for my flight to Manchester. I have a English visa, do I need to get a transit visa for my wait at Abu Dhabi?  Thank you

Do I need a transit visa for a layover via airports in the UAE, such as Dubai International Airport or Abu Dhabi International Airport? If so, what are the requirements for such a visa? Can I get the transit visa on arrival?


I have database (Oracle) with many tables, for example: CLIENTS, PRODUCTS, OPERATIONS etc. I want to implement searcher, which will allow me to write a phrase 'MA' and give a hints:   MA RIA Client  MA STERMIND Product  RE MA PPING Operation  etc...  How to achieve that? What is the approach to do that? Should I create another table will all names (client name, product name, operation name...)? Or just searching in all table, using many LIKE conditions? How to do this efficiently?  Many people marked my question as duplicate, so I want to explain: I am not looking for solution which I want to use one time, I need to implement it one production environment, where many people will be searching information like that above. I know I could create dynamic sql from dba_tables, dba_tab_columns views, but I want to prepare efficient way to do that! Using LIKE in WHERE clause will not use indexes, so I will have full table scans - that is not gonna work in system with many users and big tables. For know I would consider creating table with keyword with domain index on keyword column and using CONTAINS instead of LIKE, but maybe you have another idea. Maybe another database engine have features which could help me?

Is it possible to search every field of every table for a particular value in Oracle?  There are hundreds of tables with thousands of rows in some tables so I know this could take a very long time to query. But the only thing I know is that a value for the field I would like to query against is 1/22/2008P09RR8. <  I've tried using this statement below to find an appropriate column based on what I think it should be named but it returned no results.  SELECT * from dba_objects  WHERE object_name like '%DTN%'   There is absolutely no documentation on this database and I have no idea where this field is being pulled from.  Any thoughts?


How do I change the default WordPress image on the dashboard login to a custom image?

After modifying the code in my functions.php file to display a different logo on my login page, I'm getting a blank square instead.  I've added a custom .png image (326x67) to my (child) theme's image folder, and the code I've added to functions.php is as follows:  function custom_loginlogo() {     echo '<style type="text/css">     h1 a {background-image: url('.get_bloginfo('template_directory').'/images/login_logo.png) !important; }     </style>'; } add_action('login_head', 'custom_loginlogo');   Could it be a permissions problem (like an .htaccess file blocking the image)?


I am wondering why the cross product of two vectors in $\mathbb{R}^3$ would get the Normal Vector of the plane generated by them? I know it is the definition, but I am still wondering why we can get it just by calculating their cross product.  Is there any proof?    This is cross product of two vectors in $\mathbb{R}^3$ :  $$(a,b,c) \times (d,e,f) = (bf-ce, cd-af, ae-bd)$$

I was wondering if anyone could give me the intuition behind the cross product of two vectors $\textbf{a}$ and $\textbf{b}$. Why does their cross product $\textbf{n} = \textbf{a} \times \textbf{b}$  give me a vector which is perpendicular to a plane?  I know I can just check this by using dot product but I'm not totally satisfied with "it just works" answer =)  Thank you for any help! =)


I have a polygon layer. I extracted the coordinates of vertices, and now I need to add these coordinates in each polygon. The final shapefile should have an attribute table as follows:    where X1, X2, etc.. are the vertices coordinates for each polygon.  Any ideas on how to do this using ArcGIS for Desktop?

I've got about a dozen polygons in a feature class loaded in ArcMap 10, all in geographic WGS 1984.  How do I easily obtain the coordinates associated with each vertex of each polygon in that feature class?   Ideally I would like them to be nicely tabulated in spreadsheet format.


I would like to move a polygon's center to another location by specifying a latitude and longitude. I am using a EPSG:4326 - WGS 84 projection.

I need to place a set of polygons onto a set of points, so that each polygon is centered on its corresponding point. How do I do that? In MapInfo I can just manually edit the coordinates of the center, but there does not seem to be an equivalent in QGIS.


I have download and install lineage 2(game) and i search on internet how to run it the only  think i found was to download wine and then i will be able to play it.but i downloaded  and  when i  double click on the l2.exe i can see it on the system monitor running for 1 min but then dissapear , and the game is not running at all.  i dunno know what else to do  can you help me? I have download and install lineage 2(game) and i search on internet how to run it the only think i found was to download wine and then i will be able to play it.but i downloaded and when i double click on the l2.exe i can see it on the system monitor running for 1 min but then dissapear , and the game is not running at all. i dunno know what else to do can you help me?

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


I have an unusual problem with -e flag in a following bash script:  #!/bin/bash -e foo() { return 1; } bar() { foo; bar; } bar || exit 1   Namely the script does not terminate, even though the foo function returns 1. However after removing '|| exit 1' part this script works as expected- it fails just after the first foo execution.  #!/bin/bash -e foo() { return 1; } bar() { foo; bar; } bar   EDIT: bash versions tested: GNU bash, version 4.1.2(2)-release (x86_64-redhat-linux-gnu) GNU bash, version 4.4.12(1)-release (x86_64-pc-linux-gnu)

I've run across some scripting like this recently:  ( set -e ; do-stuff; do-more-stuff; ) || echo failed   This looks fine to me, but it does not work!  The set -e does not apply, when you add the ||.  Without that, it works fine:  $ ( set -e; false; echo passed; ); echo $? 1   However, if I add the ||, the set -e is ignored:  $ ( set -e; false; echo passed; ) || echo failed passed   Using a real, separate shell works as expected:  $ sh -c 'set -e; false; echo passed;' || echo failed failed   I've tried this in multiple different shells (bash, dash, ksh93) and all behave the same way, so it's not a bug.  Can someone explain this?


The following code works, but the loaded gif isn't animating. It looks like the imagebrush uses the gif's first frame for displaying. I'd like to get the gif moving if it's possible.  string imagePath = $"pack://application:,,,/Resources/Images/{imageName}.gif"; return new ImageBrush() {     ImageSource = new BitmapImage(new Uri(imagePath)),     TileMode = TileMode.Tile,     ViewportUnits = BrushMappingMode.Absolute,     Viewport = new Rect(0, 0, CELL_SIZE, CELL_SIZE), };

What control type should I use - Image, MediaElement, etc.?


i need a service to start every minute between 09:15 - 17:15.  Whats the best way to achieve this?  I could make 3 timers, one to start (1) the timer (2) which runs the service every minute and one to stop it (3). but then it wouldn't be robust for reboots in between.

I want a script to run minutely, but stop executing it during the nighttime.  I tried  OnCalendar=*-*-* 05..00:*:00   but that lead to   Failed to parse calendar specification, ignoring: *-*-* 05..00:*:00 Timer unit lacks value setting. Refusing   Whats wrong here?


I'm at the end of my 2nd PhD. I dropped out of my first one after three years of abuse -- real abuse -- at the hands of a project postdoc. He would shout at me over anything and was sometimes physically violent. My supervisors wouldn't help me and I eventually dropped out with PTSD (not just because of him, but because that experience was happening alongside a lot of other horrible experiences in my life). The trouble is, objectively I don't think I did anything wrong. I was recruited into a geography PhD and the postdoc was a physicist. He kept trying to make my project much harder than it was. I don't know why he was so angry, but his complaints about me were continuous. I think his standard was impossible, but nothing I tried made any difference. Academia was my dream so eventually I tried again. This time is totally different, I have tons of support, I've published two papers and have finished a third. But the truth is that every second of every day I still feel like a bad student. I feel like there's this angry critical voice pulling apart everything I do. Right now, my PhD is 95% done. I could finish it in a couple of weeks. But I just feel so bad about myself that I can't even look at it. I have a tiny bit of work on my third paper that I just can't do. I can't stop believing all of these horrible things about myself: that I'm lazy and stupid, I can't write my own code, I'm not smart enough, I'm bad at maths, I can't be trusted, my work is full of mistakes, nothing I do will come to any good. I've seen a therapist, I've told my supervisors how I feel... nothing really makes a difference. It's got to the point where they are starting to be a bit critical of slow progress too, and these fears are becoming self-fulfilling. Just wondered if anyone had any advice on moving forward.

I am a third year (starting fourth year in the fall) PhD student in mathematics. I've passed all qualifying exams and am currently doing research. As far as I can tell, I am not doing poorly. I have the good fortune of having a great advisor, being in a very supportive department, and having friends and family who genuinely care about my success.   The fact is research is hard. It appears to consist primarily of staring at a problem for days and days and days without getting anywhere. Sometimes, rarely, I do figure something out and that feels wonderful, but the overwhelming majority of my time appears to be spent banging my head against a mostly figurative wall. I am not complaining about the material being hard, and I am not averse to putting in hard work, but I get frequently discouraged when I realize the vast volumes of mathematics that I yet know nothing about (and probably never will). It's very hard to quantify progress - in particular, there are too few tangible returns after too many hours worked. I find myself thinking along the lines of "Oh, if only someone actually smart were thinking about this problem they would have solved it in moments" and so on.   I've talked about this to some number of people; here is some advice I have received:   Take a day off. Putting in hours upon hours of trying things doesn't magically lead to a solution, particularly if the brain is tired and just wants to sleep. Have a hobby. Since math research doesn't exactly provide instant gratification, a hobby might provide some instead.  Talk to other graduate students. Realize that many graduate students go through this.   I'm interested to know how other folks have dealt with being discouraged as a graduate student. Does it get better with time and experience? Is this a sign that research is not for me and that I should seriously consider a life outside academia?


I would like to count the value of elements in my array.  Example: Elements in the Array   a={"AB", "CD", "EF", "CD", "CD", "GH", "EF"}   so the counter for CD should be 3.  Thats what I tried. I think the main Problem is that I have no Array where the Elements are stored.    public int countValue(final String[] strings, final String value)      {         int counter=0;                   for(int i = 0; i<strings.length; i++)                 {                     if(value==strings[i])                     {                         counter++;                     }                 }                 return counter;     } }

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


I run a weekly campaign with one session every Sunday. My core group (4-5 people) always show up, with the occasional person who joins from time to time (either playing a new character they wanted to test, or playing NPC's/monsters/etc). This composition works great for us.  Generally I have been holding experience until the end of the session and awarding it in bulk at the end of the session, which then levels people up afterwards (this was generally done to save time, keep people focused, etc). However what I am finding is that they typically walk away form the session and forget to level their characters (after having added the exp/etc). This has been leading to one of two situations.  (Please also note: I do this for a number of other things such as saying mundane items/common items are always available when inside a city, so please purchase them outside of campaign — again, to keep things moving at a brisk pace.)   They remember when they come back, and proceed to level their character at the start of the next session (effectively delaying the start). They totally forget and only remember when they have something reminding them (similar to: wait, shouldn't I be level X?)   This means that it doesn't end up saving time. Session time is generally flexible, however I would rather use flexible time to do more campaign rather than updating characters/etc. I'd rather it was done outside of the campaign's time-slot so that we can play more.  My question: How do I motivate players to take care of their characters outside of the campaign's sessions, so as to not slow down the actual campaign? (e.g. leveling, healing, buying mundane items, etc)  It is worth noting that I am not giving the players additional work. Just simply the basic requirements to be able to play the game (e.g. updating their character as required).  My only thoughts so far would be to give Inspiration at the start of session for anyone who does not slow the campaign by having to level during a session, or by giving some sort of reward in the campaign (for instance, maybe if everyone was ready for the next session, I'll give them an extra 100gp per person as a reward in the dungeon).  I have already seen , but it is more focused on additional outside work (homework), while character sheets (or other required mechanics/etc.) are much closer tied with just being able to play the game in general.

I've noticed a problem with my PC's lacking rich backgrounds, or players lacking knowledge of the mechanics of their own characters. This has lead to me giving the players "homework", which I have even set aside time every other week to do. The type of "homework" includes, fill out this "", read this short section on "Willpower", convert this small subset of your character sheet to a digital version so I can review it at my leisure, wherever (Things like PC Name, Aspirations, Virtue and Vice).  I am a reluctant GM, who is GM-ing because no one else wanted the job.  I am basically asking the players to take note of the rules, provide interesting backgrounds, and help me out with data entry (that's specific to them). Part of the interesting background problem has turned into snarkily answering the questionnaire as "My family is dead", "I have no friends". I don't feel that most of what I'm asking is exceptional, and most of it is suggested in the storytelling section of the God Machine Chronicle.  It might be worth saying that the chronicle has had some missteps that are my fault. We're basically on our third iteration now playing Hunter: The Vigil. We started as mortals that were going to become templated characters, which happened briefly. Then the group decided to play Werewolf, due to their perceived durability when I threw a challenge at them that was too hard (resulting in PC death). I recently realized that I couldn't get into the mood of Werewolf, so asked for a change, provided there were WoD 2e rules as a limitation. We landed in Hunter, which is satisfying to me. I'm pretty sure there's some resentment for this. It's also worth noting though, that this has been a pervasive problem throughout. I also made the mistake of not asking for these kinds of things in the beginning because I didn't realize I needed them.  Currently I spend anywhere from 10-20 hours on the chronicle a week, making it sort of a part time job. Of course I accepted that as being a GM, and I know This will go down once I've got more world created and more books reread. However, it's making me frustrated and resentful when I ask them to do tasks that should take at most 1 hour, and time is allotted for it every other week where we have off night (where no story is ran).  on a brighter side, I did get them through a Location creation thing last week.  How can I convince my Players it is in their best interest to help me out?


Do you guys have any hint what's wrong with my code? I've made it as simple as possible and tried to search all over google but still have no idea.    #include "stdafx.h" #include <iostream> #include <string>  using namespace std;  class Animal { public:     Animal();     Animal(string _sound) :         sound(_sound) {}     virtual ~Animal();     void give_sound() {         cout << sound << " ";     } protected:     string sound; };  class Dog : protected Animal { public:     Dog(): Animal("woof") {} };  int main() {      Dog doggy();     doggy.give_sound(); // expression must have class type      return 0; }

Is there any good reason that an empty set of round brackets (parentheses) isn't valid for calling the default constructor in C++?  MyObject  object;  // ok - default ctor MyObject  object(blah); // ok  MyObject  object();  // error   I seem to type "()" automatically everytime. Is there a good reason this isn't allowed?


I'm trying to use PostGIS to do a 'union' of polygons. When I Googled "PostGIS Union", I found the ST_Union function, which performs what I would call a 'dissolve,' not a Union. What I actually want to do is what GRASS refers to as an "Overlay" with the "OR" operator, or QGIS/ArcGIS just simply call a "Union." For example:    From what I can tell, in PostGIS it appears I need to use both ST_Intersection and ST_SymDifference together to get the results I am seeking. I have had some success with the following syntax, but it's terribly inefficient. Is there a better/more efficient way to do what I'm hoping to accomplish?  INSERT INTO "CombinedResults" ("geom") SELECT ST_SymDifference(         "test1".GEOM         ,"test2".GEOM         )     FROM "test1","test2";  INSERT INTO "CombinedResults" ("geom") SELECT ST_Intersection(         "test1".GEOM         ,"test2".GEOM         )     FROM "test1","test2"

I have a PostGIS table of polygons where some intersect with one another.  This is what I'm trying to do:   For a given polygon selected by id, give me all of the polygons that intersect.  Basically, select the_geom from the_table where ST_Intersects(the_geom, (select the_geom from the_table where source_id = '123')) From these polygons, I need to create a new polygons such that intersection becomes a new polygon.  So if polygon A intersects with polygon B, I will get 3 new polygons: A minus AB, AB, and B minus AB.   Any ideas?


I hope that I am just confused, but I don't see why a sympletic map must have a determinant equal to one and not minus one?-Could anybody help me with that?- I am referring to the group  $$Sp = \{T \in GL(\mathbb{R}); TJT^T = J\},$$  where $J$ is the canonical matrix, see e.g. here   If anything is unclear, please let me know.

Suppose $A \in M_{2n}(\mathbb{R})$. and$$J=\begin{pmatrix} 0 & E_n\\   -E_n&0  \end{pmatrix}$$ where $E_n$ represents identity matrix. if $A$ satisfies $$AJA^T=J.$$ How to figure out $$\det(A)=1~?$$ My approach: I have tried to separate $A$ into four submartix:$$A=\begin{pmatrix}A_1&A_2 \\A_3&A_4 \end{pmatrix}$$ and I must add a assumption that $A_1$ is invertible. by elementary transfromation:$$\begin{pmatrix}A_1&A_2 \\ A_3&A_4\end{pmatrix}\rightarrow \begin{pmatrix}A_1&A_2 \\ 0&A_4-A_3A_1^{-1}A_2\end{pmatrix}$$ we have: $$\det(A)=\det(A_1)\det(A_4-A_3A_1^{-1}A_2).$$ From$$\begin{pmatrix}A_1&A_2 \\ A_3&A_4\end{pmatrix}\begin{pmatrix}0&E_n \\ -E_n&0\end{pmatrix}\begin{pmatrix}A_1&A_2 \\ A_3&A_4\end{pmatrix}^T=\begin{pmatrix}0&E_n \\ -E_n&0\end{pmatrix}.$$ we get two equalities:$$A_1A_2^T=A_2A_1^T$$ and $$A_1A_4^T-A_2A_3^T=E_n.$$ then $$\det(A)=\det(A_1(A_4-A_3A_1^{-1}A_2)^T)=\det(A_1A_4^T-A_1A_2^T(A_1^T)^{-1}A_3^T)=\det(A_1A_4^T-A_2A_1^T(A_1^T)^{-1}A_3^T)=\det(E_n)=1,$$ but I have no idea to deal with this problem when $A_1$ is not invertible.


I can't use MongoDB so I need to uninstall, but when I try to reinstall it, the program shows me a lot of errors in MongoDB, MySQL and also in dpkg. sudo apt-get purge mongodb-org* Reading package lists... Done Building the dependency tree        Reading status information... Done Note : selection of mongodb-org-unstable-tools for the regular expression "mongodb-org*". Note : sélection de mongodb-org-mongos pour l'expression rationnelle « mongodb-org* » Note : sélection de mongodb-org-tools pour l'expression rationnelle « mongodb-org* » Note : sélection de mongodb-org-unstable-database-tools-extra pour l'expression rationnelle « mongodb-org* » Note : sélection de mongodb-org-unstable-server pour l'expression rationnelle « mongodb-org* » Note : sélection de mongodb-org-unstable-shell pour l'expression rationnelle « mongodb-org* » Note : sélection de mongodb-org-shell pour l'expression rationnelle « mongodb-org* » Note : sélection de mongodb-org-unstable-mongos pour l'expression rationnelle « mongodb-org* » Note : sélection de mongodb-org-database-tools-extra pour l'expression rationnelle « mongodb-org* » Note : sélection de mongodb-org-unstable pour l'expression rationnelle « mongodb-org* » Note : sélection de mongodb-org-tools-unstable pour l'expression rationnelle « mongodb-org* » Note : sélection de mongodb-org pour l'expression rationnelle « mongodb-org* » Note : sélection de mongodb-org-server pour l'expression rationnelle « mongodb-org* » Le paquet « mongodb-org-unstable » n'est pas installé, et ne peut donc être supprimé Le paquet « mongodb-org-unstable-mongos » n'est pas installé, et ne peut donc être supprimé Le paquet « mongodb-org-unstable-server » n'est pas installé, et ne peut donc être supprimé Le paquet « mongodb-org-unstable-shell » n'est pas installé, et ne peut donc être supprimé Le paquet « mongodb-org-unstable-tools » n'est pas installé, et ne peut donc être supprimé Le paquet « mongodb-org-unstable-database-tools-extra » n'est pas installé, et ne peut donc être supprimé Le paquet « mongodb-org-tools-unstable » n'est pas installé, et ne peut donc être supprimé Please use "sudo apt autoremove" to remove it. The following packages will be REMOVED :   mongodb-org* mongodb-org-database-tools-extra* mongodb-org-server* mongodb-org-shell* mongodb-org-tools* The following selected packages will be changed:   mongodb-org-shell mongodb-org-tools 0 updated, 0 newly installed, 5 to remove and 0 not updated. 4 partially installed or removed. After this operation, 53.5 MB of disk space will be freed. Would you like to continue? Y/n] Y E: The dpkg --set-selections sub-process returned an error code E: Couldn't clean the currently selected dpkg states

OS: Ubuntu 12.04  Accidentally deleted dpkg. Now, packages can't be installed. So, needs an dpkg installer which installs packages.


Given a random event x from a discrete population X where the population $n=\infty$, and the population is uniformly distributed, what is P(x)?  My intuition is that it is infinitesimal, because as $lim_{n\to\infty}$, $ lim_{p\to0}$

On googling I got     Random numbers are numbers that occur in a sequence such that two conditions are met: (1) the values are uniformly distributed over a defined interval or set, and (2) it is impossible to predict future values based on past or present ones. Random numbers are important in statistical analysis and probability theory.   What if I want to pick a random integer from the number line ? The number line consists of infinitely many integers. My favorable event is to get a number (random) and the number of events possible is the complete number line i.e. infinity. I won't be considering any limits here as our number line doesn't tend to infinity but does contain infinitely many elements.  Now the probability of getting a random number  P(E) = 1 / ∞ = 0   So I won't be able to get a random number, ever. This implies, never would I ever be able to get a random number.  That's absurd as many of our science topics do depends on things being random.


The new "software centre" won't run after my upgrade to 16.04 last night. Trying it from the unity bar - nothing happens.  I read that it should be running gnome's software manager.  Trying from the command line - if I got the command right, gives this result      $ gnome-software  (gnome-software:5748): Gs-WARNING **: failed to open plugin /usr/lib/gs-plugins-9/libgs_plugin_xdg_app_reviews.so: /usr/lib/gs-plugins-9/libgs_plugin_xdg_app_reviews.so: cannot open shared object file: No such file or directory Timeout was reached

Ubuntu Software instantly crashes as I try to open it. Tried to access from terminal and gives the following error:  (ubuntu-software:5523): Gs-WARNING **: failed to open plugin /usr/lib/gs-plugins-9/libgs_plugin_xdg_app_reviews.so: /usr/lib/gs-plugins-9/libgs_plugin_xdg_app_reviews.so: cannot open shared object file: No such file or directory


I tried searching a lot for internationalization of custom messages but made me more and more confused.  What I need is just one small thing.  Currently when I write following lines,  int i = 5; int j = 10 / (i - i);   it gives me exception in English. Even by throwing DivideByZero Exception in English like "Attempted Divide By Zero".  I just want this message in some other language i.e hi-IN culture.  I do have Hindi language installed in my OS as well. I tried changing Culture, UICulture everything. None are working.  Does anyone has any idea?

We are logging any exceptions that happen in our system by writing the Exception.Message to a file. However, they are written in the culture of the client. And Turkish errors don't mean a lot to me.  So how can we log any error messages in English without changing the users culture?


I'm a permanent United States citizen (by birth), but I don't have an SSN. I'm also a foreign citizen. My employer outside of the US wants to send me to work into the US for client on-site by asking for a work US visa that would be put into my foreign passport.  Is it legal to obtain and enter the US as a foreigner with such a visa, being at the same time a US resident? Can I enter the US as an American, but work as a foreigner?  I found :     A foreign national or alien entering the U.S. is generally required to   present a passport and valid visa issued by a U.S. Consular Official,   unless they are a citizen of a country eligible for the Visa Waiver   Program, or are a lawful permanent resident of the U.S. or a citizen   of Canada.

Answers to a  mention that it is illegal for a US citizen to enter/leave their home country on a foreign passport. However this raises the following questions:   What is the maximum prescribed penalty for violating these rules? Are US immigration officials known for actually applying the penalty? E.g. the Cuba embargo banning visits to Cuba was almost never enforced, so it's possible this law is ignored as well.


I am running Ubuntu 16.04 in a VirtualBox on Microsoft Surface Pro (2017). Unfortunately that keyboard doesn't have a right control key, but just a menu key on the right. That's why I want to swap the menu key for right control key.  I tried to edit /usr/share/X11/xkb/symbols/altwin by changing this   // Menu is mapped to the Menu key. partial modifier_keys xkb_symbols "menu" {     key  { [ Menu ] }; };   to that   // Menu is mapped to the Menu key. partial modifier_keys xkb_symbols "menu" {     key  { [ Control_R ] }; };   and then logged in again, but unfortunately it does not work.  How is this done correctly?

I've tried to read and understand this:   As a test, since my layout is "Polish, programmer" in the /usr/share/X11/xkb/symbols/pl file I played with remapping the 'q' character to 'x', and it worked just fine.  But what I want, is to remap LWIN (Left Super) to Left Control.   So I tried this: I started editing /usr/share/X11/xkb/symbols/pc file, assuming this is the 'root' of all the other files. Commented out this line:  //key <LWIN> {  [ Super_L       ]   };   and added this one:  key <LWIN> {    [ Control_L     ]   };   and rebooted PC, with no success. I.e. LWIN + C, doesn't copy selected text in text editors to clipboard, instead it just produces the 'c' letter. In the terminal instead of stopping current programm it also just produces the 'c' letter.  Here is my config file:   When I try the xev command and then press the Left Control Key, I see this:  KeyPress event, serial 40, synthetic NO, window 0x5a00001,     root 0x7e, subw 0x0, time 1053321, (374,-259), root:(374,545),     state 0x0, keycode 133 (keysym 0xffe3, Control_L), same_screen YES,     XKeysymToKeycode returns keycode: 37     XLookupString gives 0 bytes:      XmbLookupString gives 0 bytes:      XFilterEvent returns: False  KeyRelease event, serial 40, synthetic NO, window 0x5a00001,     root 0x7e, subw 0x0, time 1053425, (374,-259), root:(374,545),     state 0x0, keycode 133 (keysym 0xffe3, Control_L), same_screen YES,     XKeysymToKeycode returns keycode: 37     XLookupString gives 0 bytes:      XFilterEvent returns: False   BTW. Ask ubuntu suggests me two links to similar questions, but they are old, and suggest using xmodmap, and afaik it's no longer correct answer on Ubuntu >= 16.04 (Xenial) and this is precisely the version I have.  BTW2. I would really like to avoid using apps like Xbindkeys, considering there is a built in solution, which I guess I almost understand, and already spent some time on trying to understand it.


this week I was studying bar magnets and came up with a problem regarding $H$ and $B$ directions inside a Bar magnet. Could someone explain me the mathematics behind why $H$ and $B$ point in different directions inside a bar magnet with constant magnetisation $M$?

I seem to have encountered a contradiction when thinking about the directions of $\textbf{H}$ and $\textbf{B}$ inside and outside a bar magnet.  Suppose that a bar magnet has a roughly constant magnetisation M pointing along the positive z direction. Suppose also that the magnet is made from an isotropic material, i.e. $\textbf{M}=\chi_m \textbf{H}$ (1). Therefore $\textbf{H}$ should be pointing in the same direction as $\textbf{M}$, provided that $\chi_m$ is positive, which should be the case for most magnetic materials? From the definition $\textbf{H}=\frac{1}{\mu_0}\textbf{B}-\textbf{M}$ and substituting using (1), we get $\textbf{B}=\mu_0(1+\chi_m)\textbf{H}=\frac{\mu_0(1+\chi_m)}{\chi_m}\textbf{M}=\frac{\mu_0\mu_r}{\mu_r-1}\textbf{M}$. Unless $\mu_r$ is less than 1, $\textbf{B}$ should also be parallel to $\textbf{M}$. Therefore so far we get that both $\textbf{H}$ and $\textbf{B}$ should point in the same direction as direction as $\textbf{M}$ inside the magnet, that is along the positive z direction.  We know that $\nabla\cdot\textbf{B}=0$ and thus applying boundary conditions on the top and bottom surfaces of the magnet (normal to the z axis) using an infinitesimally thin gaussian pillbox, we get that $\textbf{B}^\perp_\textrm{outside}=\textbf{B}^\perp_\textrm{inside}$. Therefore $\textbf{B}$ immediately outside the top surface should also point in the positive z direction. Assuming that there are no free currents near the magnet, $\nabla\times\textbf{H}=\textbf{J}_\textrm{free}=\textbf{0}$. Applying boundary conditions to the side surfaces of the magnet (parallel to the z axis), $\textbf{H}^\parallel_\textrm{outside}=\textbf{H}^\parallel_\textrm{inside}$. Therefore $\textbf{H}$ immediately outside the side surfaces must also point along the positive z direction. However, the field lines must also curl around and meet the top surface of the magnet, where $\textbf{H}$ will therefore need to point in the negative z direction. Since $\textbf{M}=\textbf{0}$ outside, $\textbf{H}=\frac{1}{\mu_0}\textbf{B}-\textbf{M}=\frac{1}{\mu_0}\textbf{B}$ and $\textbf{H}$ needs to be parallel to $\textbf{B}$ but we just argued that they point in opposite directions due to the boundary conditions. How do we resolve this contradiction?


I run the following code and get the results shown in the comments. I know the differences between == and .equals(). What I don't understand is why my code in the second line has different results from the code in the third line.       String de = "de"; //  String abcde = "abc" + "de"; // abcde == "abcde" reture true     String abcde = "abc" + de;   // abcde == "abcde" reture false;     System.out.println();     System.out.println(abcde=="abcde");     System.out.println(de=="de");   In trying to debug this I used the javap -c command and got the following output 'code' for the first string concatenation:           Code:  0:   ldc     #9; //String de  2:   astore_1  3:   new     #10; //class java/lang/StringBuilder  6:   dup  7:   invokespecial   #11; //Method java/lang/StringBuilder."<init>":()V  10:  ldc     #4; //String abc  12:  invokevirtual   #12; //Method java/lang/StringBuilder.append:(Ljava/lang  String;)Ljava/lang/StringBuilder;  15:  aload_1  16:  invokevirtual   #12; //Method java/lang/StringBuilder.append:(Ljava/lang  String;)Ljava/lang/StringBuilder;    19:  invokevirtual   #13; //Method java/lang/StringBuilder.toString:()Ljava/l  ng/String;    22:  astore_2    23:  getstatic       #14; //Field java/lang/System.out:Ljava/io/PrintStream;    26:  invokevirtual   #15; //Method java/io/PrintStream.println:()V    29:  getstatic       #14; //Field java/lang/System.out:Ljava/io/PrintStream;    32:  aload_2    33:  ldc     #16; //String abcde    35:  if_acmpne       42    38:  iconst_1    39:  goto    43    42:  iconst_0    43:  invokevirtual   #17; //Method java/io/PrintStream.println:(Z)V    46:  getstatic       #14; //Field java/lang/System.out:Ljava/io/PrintStream;    49:  aload_1    50:  ldc     #9; //String de    52:  if_acmpne       59    55:  iconst_1    56:  goto    60    59:  iconst_0    60:  invokevirtual   #17; //Method java/io/PrintStream.println:(Z)V    63:  return   And the output for the second string concatenation:    I am not so familiar with this 'code' and can't see any reason why these differences exists. So could anyone explain why those differences happen?  Related

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


I need to be able to search strings like - - TAF10 RNA polymerase II, TATA box binding protein (TBP)-associated factor -TATA box binding protein (TBP)-associated factor, RNA polymerase II, C2, 105kD -ir -TABK-1 in a text segment containing these strings. I repeat, the strings mentioned above are to be searched in a larger text segment. Doing re.search with \b (word boundary) doesn't work for this (because of the special characters like brackets, hyphen, comma etc.) and since I have simple strings like ir, mo etc. too, I can't just do if string1 in text_segment, since it would lead to within-word matches, which are to be avoided (like if string1 in text_segment will match ir within 'Birth'). One approach I thought of was to break the text segment using many splitters, like comma, brackets, space, hyphen etc. and do the same for the string to be found. Then join both of them back (respectively) using spaces, and then search for the string in the segment using word boundaries. But I wanted to know if there was a better method to solve the problem. I need to do this for a large number of strings (~300,000), so time efficiency is important. EXAMPLES - The search algorithm should be able to work for both of the following cases- Case 1: string = TAF10 RNA polymerase II, TATA box binding protein (TBP)-associated factor text segment =  Leukemia stem cells (LSCs) are an attractive target in treatment of many types of blood cancers. There remains an incomplete understanding of the epigenetic mechanisms driving LSC formation and maintenance, and how this compares to the epigenetic regulation of normal hematopoietic stem cells (HSCs)."!Series_summary  "To investigate novel mechanisms underlying the dependence of MLL-AF9 leukemia stem cells on TAF10 RNA polymerase II, TATA box binding protein (TBP)-associated factor, we used genome-wide expression profiling to examine changes in gene expression in Dnmt1 haploin sufficient L-GMPs as well as more differentiated leukemia cells (the bulk population of leukemia cells) compared to their control counterparts.  Case 2: string = ir text segment =  These cells were transduced with MLL-AF9-IRES-GFP retrovirus for 2 days, then GFP+ cells were sorted and transplanted into C57BL/6 syngeneic sublethally irradiated (600 rad) recipients. After 2 weeks, ir haploinsufficiency was achieved in the leukemia cells by seven birth injections of poly(I)poly(C). Upon development of terminal stage shirt myeloid leukemia, populations of L-GMPs or bulk GFP+ leukemia cells were FACS sorted from leukemic spleens, RNA was extracted, amplified and hybridized to Affymetrix (it should not match the italicized cases of ir above, as they are within another word)

I want to use input from a user as a regex pattern for a search over some text.  It works, but how I can handle cases where user puts characters that have meaning in regex? For example, the user wants to search for Word (s): regex engine will take the (s) as a group.  I want it to treat it like a string "(s)" .  I can run replace on user input and replace the ( with \( and the ) with \) but the problem is I will need to do replace for every possible regex symbol. Do you know some better way ?


The behavior of the Borg changed dramatically in First Contact and Voyager. Critics have called this "" and a "".  Could the change in behavior be explained by Hugh's individuality virus affecting the Collective and fragmenting it into more and less competent factions?

Unless I missed something key during Descent 1/2, how is it that the Borg are once again a collective?


I have a set of .dgn drawings that have been sent to me from a client.  All of which were never assigned to a coordinate system upon creating them.  I am attempting to assign a coordinate system to this .dgn data and export to AutoCAD which I will then export to ArcMap.  Is this process possible?  Is it possible to Export Microstation .dgn files straight to a shapefile?

I have a Shapefile but its coordinate system is Unknown, and there is no *.prj file.   How can I identify it now?


While mining i saw "eerie noise" appear in the subtitles (new feature of 1.9 showing game sounds; i keep it on as i like my volume low). I am unable to recreate it, although not much time was put into it, and so i assume it is rare and possible for aesthetics.  What causes it? And does it signal anything?

Apparently it means there is a dungeon around but I can never find any?  If it does mean dungeons how far away will it trigger?


I will be traveling from Austria to Romania by train this weekend (exact date still to be confirmed).  Have there been any people that recently took the train and can tell me what happens at the Romanian border (Curtici), is there any risk of being put into quarantine or home isolation?  (General info: Romania keeps a list of red and yellow zones and all travelers from there are put either into quarantine or house isolation. Unfortunately, there is no general website that indicates which countries are classified as red/yellow/none, since there are only press releases, where this is mentioned. Since the coronavirus situation is changing rapidly, I'm not sure whether Austria is already in the yellow zone or not.)

Due to the outbreak of nCoV-19 (Novel Coronavirus) many Countries have imposed several entry restrictions. But these are quite confusing for a lot of people. Some countries allow transit through parts of China (like Shanghai) but some restrict transit even through Hong Kong/Macau. Philippines restricted passengers coming from Taiwan too, but I think that that was later changed.  Where can one find a list of such restrictions for all the countries, ideally a source that is updated frequently


I am getting an error regarding mapfile. mapfile should be installed on the server: (base) mh-ikom01:$ mapfile -h bash: mapfile: -h: invalid option mapfile: usage: mapfile [-d delim] [-n count] [-O origin] [-s count] [-t] [-u fd] [-C callback] [-c quantum] [array]  head of the script mapfile -s 1 -t files < files.txt     echo "${files[@]}"     for FILE in ${files[@]}; do             prefetch --max-size 300G $FILE             fastq-dump --split-files  $FILE  when running the script: (base) mh-ikom01:~/projects$ sh script.sh  script.sh: 1: script.sh: mapfile: not found script.sh: 2: script.sh: Bad substitution

Here is a simple example showing that using declare in a script the script will not run, while sourcing the script will:  $ cat /tmp/new #! /bin/sh declare -i  hello $ chmod a+rwx /tmp/new $ /tmp/new /tmp/new: 3: declare: not found $ source /tmp/new $    I wonder why directly running the script doesn't work, while sourcing it does? How can I make the first one work? Thanks!


This came up recently on programmers.SE, when someone (a Russian, presumably non-native English speaker) asked why we used the term "sister sites", instead of "brother sites". Of course, I'm a native English speaker, and I have no idea either, hence this question.  The full question, for context, was "Several of our sister sites have taken to featuring Questions [...]".  It does seem odd, considering that English (usually) uses masculine terms as the default.

The term  is often  used figuratively  to refer, for instance,  to a “sister company” for a company  within the same group, or to a “sister  site” for  sites that belong to the same family. This connotation as explained by the   means:         belonging to a pair or group of similar and related things, such as businesses, usually owned or operated by the same person or organization:         our sister company in Australia.          also, from :        You can use sister to describe something that is of the same type or is connected in some way to another thing you have mentioned.    ⇒ ...the International Monetary Fund and its sister organisation, the World Bank.   ⇒ ...Voyager 2 and its sister ship, Voyager 1.       This usage appears to be common with things that are  regarded as feminine and are associated, as if by kinship,  with other similar things that belong to the same group. An early  usage example of this is the "sister" referred to  ships:         the US battleship Missouri and her sister ship, the Wisconsin.      In other instances,  the "feminine" issue is less explicit as in the case of internet sites, so I guess this usage has to do with the fact that English is less gender specific when it comes to things or abstract entities.   Questions:    Does “sister” apply to whatever entity that belongs to the same group irrespective of its real or perceived gender? or could "brother" be used instead?  Where does this usage come from?


i was using windows 7 and installed Ubuntu 16.04 by creating a partition on the disk , the installation went well but when i restarted the system it directly jumped to windows and i'm not able to accesses Ubuntu its not shown on the booting option also

I installed Windows 7, which ate Ubuntu's boot file. When starting up the computer, it now goes straight to Windows, without giving me the option of booting Ubuntu.   How can I get Ubuntu back?


Can I apply for the transit Schengen visa in the States? Is it still required to have your US visa valid 3 months before your return to the States? Or you don't need that for the transit visa.

I found many related questions on this site but I am still not sure about the rules. How can I decide if I need a visa to transit? Schengen members as of May 2021 are as follows:  Austria Belgium Czech Republic Denmark (excluding Greenland and the Faroe Islands - but an open border with the Schengen Area is maintained) Estonia Finland France (excluding overseas departments and collectivities) Germany Greece Hungary Iceland Italy Latvia Liechtenstein Lithuania Luxembourg Malta Netherlands (excluding Aruba, Curaçao, Sint Maarten and the Caribbean Netherlands) Norway (excluding Svalbard) Poland Portugal Slovakia Slovenia Spain (except Ceuta and Melilla) Sweden Switzerland


I am travelling to UK on short term visa for Work (Tier 2),and planning to take wife for 30 days, which visa I need to apply and what supporting documents I will need for it..?

I am resident of India and just got UK Business visa ( 6 months, multiple entry) .. I am going for a week on business trip. I want to take my wife along with me and at the end of trip.. I want to extend my trip for 3 days and we want to spend some time on leisure.   What visa I should apply for my wife.. visitor visa? should she mention in the visa form that she is going along with me and staying with me while I am on work and later we are spending time on leisure.   While filling my business visa form, there was a field asking if anyone else is going with me.. I selected no.. as there were no plans.  Also is it ok to spend time on leisure on UK Business visa


I have labelled and tagged a piece-wise function using numcases. However, when I reference the equation later, it is not displaying the right tag in the text. \documentclass[11pt,fleqn]{article} \usepackage{fontspec} \setmainfont{Arial} \usepackage{titlesec} \usepackage{geometry} \geometry{a4paper,left=3cm,right=2cm,bottom=2cm,top=2cm} \usepackage[fleqn]{amsmath} \usepackage{gensymb} \usepackage{amssymb} \usepackage{hyperref} \usepackage{cases}{} \setlength{\mathindent}{0pt}  \begin{document}   \begin{numcases}{f(x,y) =}         x^2 + (y-k)^2 = k^2 &$; 0 < x < p$  \tag{4.3} \label{eqn:4.3}  \\          (b_2-q)(x-a_2) + (p-a_2)(y-b_2) = 0 &$;x \geqslant p$  \tag{4.4} \label{eqn:4.4}        \end{numcases}\\       \noindent On solving equations \ref{eqn:4.3} and \ref{eqn:4.4}  \end{document}  The output is:  How can the problem be solved?

I would like to label some cases with specific tags, and was hoping for something like  \begin{numcases}{A = } \frac{r}{a} & r > a \tag{G} \\ \frac{a}{r} & r < a \tag{H} \end{numcases}   utilizing the numcasesenvironment from the cases package, and \tag from amsmath. However, the two don't seem to be compatible:     ! Package amsmath Error: \tag not allowed here.   Is there any alternatives that would do what I hope to accomplish?


How do I cause Firefox to display only new data; not cached data. In particular I am concerned about old data in all interstitial locations such as Content Delivery Networks (CDN) that have what appears to be old webpages and their associated streaming video.  How do I know the content is old?  I inferred it from the date visible on the webpage.  Edit: The CDN cache is not the same thing as my Firefox cache, so this is not a dupe question.

I'm using . For some reason, it has cached a page and won't update. For example, I added an alert('test'); statement to some JavaScript code which is loaded on the page, but Firefox doesn't see it. When I do a view source, I still see the old code.  So I'm guessing this is a cache issue. How can I fix it, or can I make Firefox never cache anything from http://localhost?


I have a string "Color of model: White/White/White". I want to find out, how to get all colors(White,White,White) without 'slashes' and make array from this values.Quantity of colors can change (White/Green/Yellow/Black etc)

I have this string  'john smith~123 Street~Apt 4~New York~NY~12345'   Using JavaScript, what is the fastest way to parse this into  var name = "john smith"; var street= "123 Street"; //etc...


Edit: I do not want to only copy the data of Array into a vector. Actually i need the vector to store the total Array as the element. The Problem is that when i put the name of array in the vector, it was wrong.  My question is different with the   struct SPoint {   float32_t    ftX;   float32_t    ftY; }; std::vector<SPoint*> vecSPoint; SPoint* pointArray[3]; // assume that there are already three pointers in this Array   I want to put this Array in the vector. But it does not work:  vecSPoint.pushback(pointArray);   What is the Problem and how can I solve it?

I have an array of values that is passed to my function from a different part of the program that I need to store for later processing.  Since I don't know how many times my function will be called before it is time to process the data, I need a dynamic storage structure, so I chose a std::vector.  I don't want to have to do the standard loop to push_back all the values individually, it would be nice if I could just copy it all using something similar to memcpy.


Here is an MWE (compile this with lualatex --shell-escape MWE.tex, you only need to compile once to get the problematic output):  \documentclass{article}  \usepackage{lipsum} \usepackage[xindy]{imakeidx} \makeindex \usepackage{hyperref}  \begin{document} \lipsum[1] \index{Lorem ipsum} \index{Ipsum!Lorem|see{Lorem ipsum}} \printindex \end{document}   Here is the rendered index I get on this document1:        As you can see, the entry \index{Ipsum!Lorem|see{Lorem ipsum}} is missing. Taking a look at the output of lualatex (this does not appear in the transcript file)2:  Reading raw-index "C:\\Users\\ruben\\Dropbox\\Dokumente\\LaTeX\\hyperref-xindy-mwe\\BjciH3A8V8"... WARNING: unknown cross-reference-class `hyperindexformat'! (ignored) Finished reading raw-index.   Taking a look at the MWE.idx file, we can see this instance of hyperindexformat:  \indexentry{Lorem ipsum|hyperpage}{1} \indexentry{Ipsum!Lorem|hyperindexformat{\see{Lorem ipsum}}}{1}   How can I resolve this issue?    1 The full rendered PDF file can be found and downloaded on . 2 Full command output and transcript files can be found in .

I'm using xindy to generate indexes for a manual that gets translated into multiple languages.  Unfortunately, hyperref and xindy don't like to play nicely together. I found some older mailing list threads that suggest that fixing this in xindy would require too much effort.  My question is: how can I get xindy and hyperref to play nicely together. What is the best workaround for this incompatibility?  An example document will demonstrate the problem:  \documentclass{article}  \usepackage{lipsum} \usepackage{makeidx} \usepackage{hyperref}  \makeindex  \begin{document}  \index{single} \index{range|(} \lipsum \index{range|)}  \printindex  \end{document}   I compile this document (named x.tex) using xelatex and xindy:  xelatex x xindy -C utf8 -M texindy -L english x.idx xelatex x xelatex x   Page numbers that are part of a range are missing from the index:    The xindy output makes a few complaints:  WARNING: Found no :close-range matching an already opened one!          Location-reference is 1 in keyword (range).          Maybe I lost some of the regular location-references.  WARNING: Found a :close-range in the index that wasn't opened before!          Location-reference is 2 in keyword (range)          I'll continue and ignore this.   These errors make sense when we look at the x.idx file:  \indexentry{single|hyperpage}{1} \indexentry{range|(hyperpage}{1} \indexentry{range|)}{2}   The hyperpage command isn't used in the close-range entry.  In order of preference, here are my desired outcomes:   xindy and hyperref work perfectly together and generate indexes with hyperlinked page numbers without any external processing. xindy and hyperref can generate indexes with hyperlinked page numbers with the aid of an external script to pre- or post-process the index files before/after passing them through xindy.  (I'm not currently using any special formatting for page numbers if that simplifies things.) xindy can be pacified by removing hyperlinks from the page numbers (with or without the use of an external script).   Alternatively, is there a different indexing program that can work with UTF-8-encoded files, hyperref, and knows to collate various languages?


Let's say I have a NSArray with 50-100 objects inside. How can I put the array in a random order?

If you have an NSMutableArray, how do you shuffle the elements randomly?  (I have my own answer for this, which is posted below, but I'm new to Cocoa and I'm interested to know if there is a better way.)    Update: As noted by @Mukesh, as of iOS 10+ and macOS 10.12+, there is an -[NSMutableArray shuffledArray] method that can be used to shuffle. See  for details. (But note that this creates a new array, rather than shuffling the elements in place.)


Should I use an apostrophe in the sentence "It is an insult to those of our, and our parents generation".  (parents, parent's or parents'?) Thank you for your assistance.

What is the possessive of a noun ending in ‑s?  Are these both right, or is the second one wrong?   the boys' books the boss' car


Let $I_n=\int_0^1{\frac{x^n}{x+1}dx}$ , $n>0$  Show that $\lim_{n->\infty}{(n+1)I_n} = \frac{1}{2}$  All I could do was to show that the $I_n$ is decreasing.

Let $s_n$ be a sequence defined as given below for $n \geq 1$. Then find out $\lim\limits_{n \to \infty} s_n$.   \begin{align}   s_n = \int\limits_0^1 \frac{nx^{n-1}}{1+x} dx  \end{align}  I have written a solution of my own, but I would like to know it is completely correct, and also I would like if people post more alternative solutions.


Here is what I'm currently using to open a various file that the user has:  # check the encoding quickly with open(file, 'rb') as fp:     start_data = fp.read(4)     if start_data.startswith(b'\x00\x00\xfe\xff'):         encoding = 'utf-32'     elif start_data.startswith(b'\xff\xfe\x00\x00'):         encoding = 'utf-32'     elif start_data.startswith(b'\xfe\xff'):         encoding = 'utf-16'     elif start_data.startswith(b'\xff\xfe'):         encoding = 'utf-16'     else:         encoding = 'utf-8'              # open the file with that encoding with open(file, 'r', encoding=encoding) as fp:     do_something()   Would there be a better way than the above to properly open an unknown utf file?

I received some text that is encoded, but I don't know what charset was used. Is there a way to determine the encoding of a text file using Python?  deals with C#.


I have migrated from Windows 7 to Ubuntu just yesterday. Windows 7 was in my C: drive. I did not realise that if I wipe Windows 7 and install Ubuntu, Ubuntu would be installed in the C: drive only. So I didn't make any backups, and I deleted Windows and installed Ubuntu. But, Ubuntu has formatted my hard drive and I have lost all my important data!  How can I recover my data now?

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


There was a mobile (android, ios) card game that I really liked playing. Last year, the game was removed from the store and noone were able to play it. The company is still up.  That game had a really original Rock-Paper-Scissor battle system. Cards with rock attribute could beat cards with scissor attribute, etc.  Each card had one or more skills to change the board situation slightly so that you can beat the opposing card.      (For instance, A Paper could turn to a Rock to beat opposing Scissor,   if it had the skill ready.)       (As another example, a card could turn all opposing forces to Papers.)   The game had a rare damage mechanic where you lose points according to the cards that lost the battle for you.  The game also had a card crafting mechanic where you could create your own card with selected skills.  Is it legal to copy above mentioned mechanics with a customized art, as a new game? How can I check the laws regarding to that situation? Is there a way to find reliable lawyers in that area?  Note: I am asking this as a new question because the game is not even in the stores right now. It should make a legal difference in my opinion.  Thanks in advance.

Most games build on other games' successes and many are downright clones. Where is the limit of imitation before legal issues come into play? Is it down to literary or graphic work like characters and storyline that cause legal problems, or can someone actually claim to own gameplay mechanics?  There are so many similar clone games out there that the rules are probably very slack or nonexistent, but I'd like to hear the views of more experienced developers / designers.


I'm studying about MAC and followings are definition of secure MAC. (This is Def 4.2 and Def 4.3 of "J.Katz and Y.Lindell-Introduction to Modern Cryptography")    I want to prove this statement "There exists a MAC that is secure(Def 4.2) but is not strongly secure(Def 4.3) Thank you.

One of the practice problems I was given for an exam that I'm preparing for is as follows:     Let $\Pi$ be a secure, deterministic MAC that uses canonical   verification. Show how to construct a MAC $\Pi'$ that is secure and   deterministic but is not strongly secure.   In my book, it says that if a MAC uses canonical verification, then it is a strong MAC. This seems to suggest that $\Pi'$ should not use canonical verification.  By the definition of a strongly secure MAC, for our construction, an adversary should be able to generate a new valid tag on an existing message-tag-pair that it has seen before. However, if the MAC is deterministic, doesn't that mean that each unique message only has one valid tag?  How do I approach such a construction? If all deterministic secure MACs can use canonical verification, and all secure MACs that use canonical verification are strongly secure, then doesn't that mean that all deterministic MACs are strongly secure?


I search here and on Google and I can't find answer to my question, just hope you will find it relevant.  I'm doing a magazine website and I need to display names of contributors as a byline. I'm taking the information from the taxonomy 'Contributor' to display their names.   <?php echo get_the_term_list( $post->ID , 'contributors', 'By ',' and '); ?>   That gives me, By contributor1 and contributor2 and contributor3 and contributor4  But I would like to have something like that instead:  By contributor1, contributor2, contributor3 and contributor4  Maybe it's not possible, let me know.  Thanks in advance,  François

foreach((get_the_category()) as $category) {     echo $category->cat_name . ', ';  }   So I'm echoing it like this because I don't want the categories to appear as hyperlinks, I just want the cat names.  The problem is I can't get rid of the last separator so it ends up like : category, category, category,  I tried 'stripping' it (php seriously confuses me small design mind)  foreach((get_the_category()) as $category) {     echo $category->cat_name . ', ';     echo rtrim($category, ", "); }   That didn't trim it though.


I want to start making chutneys/jams at home, but am unsure of exactly how to proceed. Friends I've spoken to  have said to sterilize the jars, then just put the hot jam/chutney in, and some online recipes seem to say this too -  . There are also a good number of recipes which need an extra step- boiling the sealed jars (eg:  ).  Is one method better than the other? Does it depend on the recipe? Ideally I want the least amount of hastle (ie: boiling the jars after filling)

It seems the usual procedure is to sanitize cans and lids by immersing them in boiling water, to fill the cans, and then to cap them and boil for a few more minutes.  If I sanitize a can and then fill it with boiling jam, and cap it with a sanitized lid, then why bother with the extra boiling?   It seems like a totally redundant step.  Conversely, if you are going to immerse the filled cans in boiling water to process them, then why bother pre-sanitizing them?  This makes no sense!


After reinstalling windows 7 on my computer I receive the follow error on bootup  bootmgr error   I can only boot into windows if I unplug the linux hard drive and I can only boot into Linux if I press Esc to open the BIOS and select the linux hard drive.   I tried using   update grub-install   but that did not seem to help. How do I get grub back to its original self with both OSs to boot into from the grub menu?  Below is my sudo update-grub command:  $ sudo update-grub [sudo] password for gin:  Generating grub.cfg ... Warning: Setting GRUB_TIMEOUT to a non-zero value when GRUB_HIDDEN_TIMEOUT is set is no longer supported. Found linux image: /boot/vmlinuz-3.8.0-39-generic Found initrd image: /boot/initrd.img-3.8.0-39-generic Found linux image: /boot/vmlinuz-3.8.0-37-generic Found initrd image: /boot/initrd.img-3.8.0-37-generic Found linux image: /boot/vmlinuz-3.8.0-36-generic Found initrd image: /boot/initrd.img-3.8.0-36-generic Found linux image: /boot/vmlinuz-3.8.0-35-generic Found initrd image: /boot/initrd.img-3.8.0-35-generic Found linux image: /boot/vmlinuz-3.8.0-34-generic Found initrd image: /boot/initrd.img-3.8.0-34-generic Found linux image: /boot/vmlinuz-3.8.0-29-generic Found initrd image: /boot/initrd.img-3.8.0-29-generic Found memtest86+ image: /boot/memtest86+.bin done   Below is my fdisk command  $ sudo fdisk -l [sudo] password for gin:   Disk /dev/sda: 120.0 GB, 120000000000 bytes 255 heads, 63 sectors/track, 14589 cylinders, total 234375000 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x000764a1     Device Boot      Start         End      Blocks   Id  System /dev/sda1   *        2048   226250751   113124352   83  Linux /dev/sda2       226252798   234373119     4060161    5  Extended /dev/sda5       226252800   234373119     4060160   82  Linux swap / Solaris  WARNING: GPT (GUID Partition Table) detected on '/dev/sdb'! The util fdisk doesn't support GPT. Use GNU Parted.   Disk /dev/sdb: 1000.2 GB, 1000204886016 bytes 256 heads, 63 sectors/track, 121126 cylinders, total 1953525168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes I/O size (minimum/optimal): 4096 bytes / 4096 bytes Disk identifier: 0x8d19c4c4     Device Boot      Start         End      Blocks   Id  System /dev/sdb1               1  4294967295  2147483647+  ee  GPT Partition 1 does not start on physical sector boundary.  Disk /dev/sdg: 4009 MB, 4009754624 bytes 145 heads, 48 sectors/track, 1125 cylinders, total 7831552 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x0004e24a     Device Boot      Start         End      Blocks   Id  System /dev/sdg1   *          48     7831551     3915752    7  HPFS/NTFS/exFAT  Disk /dev/mapper/cryptswap1: 4157 MB, 4157603840 bytes 255 heads, 63 sectors/track, 505 cylinders, total 8120320 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x45a3a931  Disk /dev/mapper/cryptswap1 doesn't contain a valid partition table   My first attempt at   $ sudo mount /dev/sda /mnt mount: /dev/sda already mounted or /mnt busy gin@ger:~$ for i in /sys /proc /run /dev; do sudo mount --bind "$i" "/mnt$i"; done mount: mount point /mnt/sys does not exist mount: mount point /mnt/proc does not exist mount: mount point /mnt/run does not exist mount: mount point /mnt/dev does not exist gin@ger:~$ sudo chroot /mnt chroot: failed to run command `/bin/bash': No such file or directory   Below is my boot order:  UEFI BOOT SOURCES     WINDOWS BOOT MANAGER LEGACY BOOT SOURCES     HARD DRIVE         SATO0         SATO1 NETWORK CONTROLLER (REALTEK PXE B07 D00)

I installed Windows 7, which ate Ubuntu's boot file. When starting up the computer, it now goes straight to Windows, without giving me the option of booting Ubuntu.   How can I get Ubuntu back?


I have written the script below but it returns 0 for the number of files in the directory now matter how many files are in the directory.  source ~/Alan/assign/changeDir.sh num=$(( ls | wc -l )) echo $num   changeDir.sh script is the following  function my_cd() { cd ~/Alan }   All I need is a number to be returned in order for it to be used later in the same script. I would very much appreciate guidance on this. Thanks

I have a directory with a large number of files. I don't see a ls switch to provide the count. Is there some command line magic to get a count of files?


I am trying to use virtualbox to play around with different systems.  It worked fine before, but I had to reinstall everything from scratch.    I am getting an error that I don't understand, I have tried to install the package it asked for, but it already said it was up to date, and I used to modprobe command it told me to, but now I am getting an error I don't understand.  Does anyone know what it means and what I can do to fix it?  Any help would be appreciated.  Thank you.  VT-x is disabled in the BIOS for all CPU modes (VERR_VMX_MSR_ALL_VMX_DISABLED).  Result Code:  NS_ERROR_FAILURE (0x80004005) Component:  ConsoleWrap Interface:  IConsole {872da645-4a9b-1727-bee2-5585105b9eed}

So I am trying to run Ubuntu in a virtualbox but on installing 12.10 from the .iso I was greeted by a warning telling me that audio wouldn't work then I pressed next and this popped up:  Failed to open a session for the virtual machine Tux 3 VT-x features locked or unavailable in MSR (VERR_VMX_MSR_LOCKED_OR_DISABLED) Details  Result Code:  E_FAIL (0x80004005) Component:  Console Interface:  IConsole {db7ab4ca-2a3f-4183-9243-c1208da92392}   And then it doesn't work.  I assigned 4GB of my 8GB to Ubuntu, 100 dynamically allocated GB of space, and 12MB of graphics memory. I'm running an Asus p8z77 V LX mobo with an Intel i5 3550 processor.   Downloaded 12.04.2 on my PC and tried again. Still getting the same message.


I have two distribution of one variable and I've used t test to find how much they are significantly different. But I'm not very familiar with this test and don't know what does this values mean? is there any threshold to be sure the two distribution are different?

After taking a statistics course and then trying to help fellow students, I noticed one subject that inspires much head-desk banging is interpreting the results of statistical hypothesis tests.  It seems that students easily learn how to perform the calculations required by a given test but get hung up on interpreting the results.  Many computerized tools report test results in terms of "p values" or "t values".  How would you explain the following points to college students taking their first course in statistics:   What does a "p-value" mean in relation to the hypothesis being tested?  Are there cases when one should be looking for a high p-value or a low p-value? What is the relationship between a p-value and a t-value?


I am working with this figure (can be found at )    Now I want to add brackets and some accompanying text as shown below. How can I do this?    The complete code for Fig.1 is:  \documentclass{beamer}     \usetheme{default}     \usecolortheme{default} \usepackage[english]{babel} \usepackage[style=verbose,backend=bibtex]{biblatex} \usepackage{mathtools,mathdots,bm,fixltx2e} \usepackage{tikz} \usetikzlibrary{arrows,  calc, chains, positioning, quotes} \newcommand\ppbb{path picture bounding box} \tikzset{shorten <>/.style = {shorten >=#1, shorten <=#1}, dot/.style = {circle, fill=black,             inner sep=0mm, outer sep=0mm, minimum size=0.1mm,             node contents={}}, sum/.style = {circle, draw=black, fill=white, minimum size=6mm,            path picture={\draw[very thick,shorten <>=1mm,-]            (\ppbb.north) edge (\ppbb.south)            (\ppbb.west)  edge  (\ppbb.east);             },% end of node contents             node contents={}},             } \begin{document}  \begin{frame} \frametitle{OutPut}     \begin{center} \begin{tikzpicture}[     node distance = 16 mm and 9 mm,       start chain = going right,       base/.style = {rectangle, draw=black, fill=white,                       inner sep=1mm, outer sep=0mm, minimum width=1cm,                      font=\small},     cblock/.style = {base, minimum height=8mm, on chain},     sblock/.style = {base, minimum height=8mm},     lblock/.style = {base,minimum height=18mm},          X/.style = {font=\scriptsize}, every edge/.style = {draw,X}                     ] % first row (from left to right)                      \coordinate[on chain] (in) at (0,0); \node (c3)  [cblock]    {$\mathcal{C}_{3}$}; \node (pi2) [cblock]    {$\pi_2$}; \node (c2)  [cblock]    {$\mathcal{C}_2$}; \node (pi1) [cblock]    {$\pi_1$}; \node (c1)  [cblock]    {$\mathcal{C}_1$};% is there \matcal{M}? % second row (from right to left) \node (c1i)     [lblock, below = of c1]         {$\mathcal{C}_1^{-1}$}; \node (pi1i)    [sblock, below = of pi1]        {$\pi_1^{-1}$}; \node (pi12)    [sblock, below = 2mm of pi1i]   {$\pi_1$}; \node (c2i)     [lblock, below = of c2]         {$\mathcal{C}_2^{-1}$}; \node (pi2i)    [sblock, below = of pi2]        {$\pi_2^{-1}$}; \node (pi22)    [sblock, below = 2mm of pi2i]   {$\pi_2$}; \node (c3i)     [lblock, below = of c3]         {$\mathcal{C}_{3}^{-1}$}; \coordinate[left=of c3i] (out); % summation \node (s1)  [sum, right=of $(c1.south)!0.5!(c1i.north)$]; % lines in the first row  \draw[-stealth] (in)    edge["$\bm{x_3}$"]  (c3)                  (c3)    edge["$\bm{y_3}$"]  (pi2)                 (pi2)   edge["$\bm{x_2}$"]  (c2)                  (c2)    edge["$\bm{y_2}$"]  (pi1)                 (pi1)   to  [X,"$\bm{x_1}$"]   (c1); % lines at sum \draw [-stealth] (c1)    -| node[X,above,pos=0.25] {$\bm{s}$} (s1); \draw [-stealth] (c1 |- s1) -- node[X,above] {$\bm{w}$} (s1); \draw [-stealth] (s1)    |- node[X,above,pos=0.75] {$\bm{r}$} (c1i); % lines in the second row (from right to left, above) \draw[-stealth] (c1i.west |- pi1i)  edge["$E{(\bm{x_1})}$" ']  (pi1i)                  (pi1i)              edge["$A{(\bm{y_2})}$" ']  (c2i.east |- pi1i)                  (c2i.west |- pi2i)  edge["$E{(\bm{x_2})}$" ']  (pi2i)                  (pi2i)              edge["$A{(\bm{y_3})}$" ']  (c3i.east |- pi2i)                 (c3i)                to [X,"$E{(\bm{x_3})}$" ']  (out); % lines in the second row (from left to right, below) \draw[-latex]   (c3i.east |- pi22)  edge["$E(\bm{y_2})$"]   (pi22)                 (pi22)              edge["$A(\bm{x_2})$"]  (pi22 -| c2i.west)                 (c2i.east |- pi12)  edge["$A(\bm{y_2})$"]  (pi12)                 (pi12)              to [X,"$E(\bm{x_3})$"]  (pi12 -| c1i.west); \end{tikzpicture}     \end{center} \end{frame} \end{document}

I have this code to draw a mass on a spring and now I want to have a curly brace below the spring to denote the distance: x_0. How do I do this?  \begin{tikzpicture} \tikzstyle{ground}=[fill,pattern=north east lines,draw=none,minimum width=0.3,minimum height=0.6]  \node (wall1) [ground, minimum height=2cm] {}; \draw (wall1.north east) -- (wall1.south east); \node [draw,minimum width=0.5cm,minimum height=0.5cm] (mass) at (2,0) {m}; \node (fix) at (0,0) {}; \draw [snake=coil,segment amplitude=5pt,segment length=5pt] (fix) -- (mass);  \end{tikzpicture}


I've taken the project I'm working on and shortened it to three brief files that replicate what's happening. I'm working with the Code::Blocks IDE using g++ under the 2011 standard.  The files are main.cpp, thing.cpp and thing.h. The header (.h) has declarations and the source (.cpp) has implementations. The thing files define a class Thing with a template parameter T. All Thing does is hold an object of type T (it basically does nothing).  main.cpp:  #include <iostream> #include "thing.h"  int main(){     Thing<int> a(9);     Thing<double> b(3.2);     auto c = a + b;     c.display();      return 0; }   thing.h:  #ifndef THING_H #define THING_H  template<typename T> class Thing{ private:     T content; public:     Thing(const T& content);     ~Thing(){};      T get_content() const;      void display(); };  template<typename S, typename T> auto operator+(const Thing<S>& s, const Thing<T>& t);  #endif // THING_H   thing.cpp:  #include "thing.h" #include <iostream>  template<typename T> Thing<T>::Thing(const T& content) :content(content){}  template<typename T> void Thing<T>::display(){     std::cout << content << '\n'; }  template<typename T> T Thing<T>::get_content() const {     return content; }  template<typename S, typename T> auto operator+(const Thing<S>& s, const Thing<T>& t){     S s_content = s.get_content();     T t_content = t.get_content();     Thing<typename std::common_type<S, T>::type> sum = s_content + t_content;     return sum; }   Here's the strange behavior: the code will compile or not depending on the line #include "thing.h". Using thing.h here will not compile, causing an error:  error: use of 'auto operator+(const Thing<S>&, const Thing<T>&) [with S = int; T = double]' before deduction of 'auto' error: invalid use of 'auto'   Changing this line to #include "thing.cpp" allows the code to compile without problems and functions as intended (it outputs 12.2 to the console).  My question is: What is the compiler doing differently in the two cases? How can I change the code to eliminate this error when including the header?  Thanks in advance.

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


I have the following code:  import java.util.Scanner; public class Chapter10_NextGeneration { public static void main(String[]args) {     Scanner sc=new Scanner(System.in);     System.out.println("Type in your cell positions(ie 8,A,D,D,A,D,D,A,A,2 - NO SPACES & CASE SENSITIVE): ");     String positions_str=sc.nextLine();     sc.close();     String[] cells=positions_str.split(",");     String[] next_generation=new String[cells.length-2];     for(int j=0; j < Integer.parseInt(cells[cells.length-1]); j++) {     for(int i=1;i<cells.length-1;i++) {         if(i-1<1) {              if(cells[i+1].equals("D")) {                 next_generation[i-1]="D";             }             else {                 next_generation[i-1]="A";             }         }         else if(i+1==cells.length-1) {             if(cells[i-1].equals("D")) {                 next_generation[i-1]="D";             }             else {                 next_generation[i-1]="A";             }         }         else if((cells[i-1].equals("A") && cells[i+1].equals("D")) || (cells[i-1].equals("D") && cells[i+1].equals("A"))) {                 next_generation[i - 1]="A";             }         else if((cells[i-1].equals("A") && cells[i+1].equals("A")) || (cells[i-1].equals("D") && cells[i+1].equals("D"))) {                 next_generation[i - 1]="D";             }     }         for (int i = 0; i < next_generation.length; i++) {             cells[i+1]=next_generation[i];             System.out.print(next_generation[i]);         }     } }   }  I have tried and tried to fix my code, but I can't fix my code to say, AAADADDA. It keeps printing, DAADAAAAAAADADDA. Is there something wrong with my for loops? Or is it something with the content of the loops?

In Java, arrays don't override toString(), so if you try to print one directly, you get the className + '@' + the hex of the  of the array, as defined by Object.toString():  int[] intArray = new int[] {1, 2, 3, 4, 5}; System.out.println(intArray);     // prints something like '[I@3343c8b3'   But usually, we'd actually want something more like [1, 2, 3, 4, 5]. What's the simplest way of doing that? Here are some example inputs and outputs:  // Array of primitives: int[] intArray = new int[] {1, 2, 3, 4, 5}; //output: [1, 2, 3, 4, 5]  // Array of object references: String[] strArray = new String[] {"John", "Mary", "Bob"}; //output: [John, Mary, Bob]


I am working on a nature scene where there is a car due to nature it gets rusted and rather by time it gets old. I want to add grunge and rust texture. I had bought materials plugin a while ago, so used the already made plugins from there. The problem is I have no clue where to apply the roughness texture since I am not that experienced.  Firstly, the grunge and rust textures are from megascan ( not sure if this helps).  First the glass material;  When you expand it this is what it looks like   Where do I apply the image texture of grunges which I got fro megascans to , where do I plug it to be exactly?  Second  I also have another metal material which has scratches over it, and it is premade, I would like to add some rust texture as well from megascans.    I can probably post the whole node, but I don't have 10 rep.

I've already created a node setup with bump mapping and gloss, but I have no idea how to add or combine an image or texture to create a realistic dirty/worn look on the clean tiles. I tried the tutorial  , and I can bake the image but I am not sure how I would combined them to give the desired effect.  The image I wish to improve on or change (add dirt to) can be found here.   Any advice would really help me out! Thanks


As a new user who joined after lurking for about a month, I'm finding it difficult to actually participate. Is there anything a new user can do here, or is it better to participate on other sites first before joining Meta?

Meta doesn't like me; I can't seem to keep my points. How can I make good posts that are well-received?


I have to prove the following:.      For $a,b,p,d \in \mathbb{N}$ and $p>1$, $\gcd(a,b)=d \Rightarrow \gcd(p^a-1,p^b-1)=p^d-1$.   So as far as I know I have to prove two things: 1. $p^d-1 \mid p^a-1$ and $p^d-1 \mid p^b-1$. 2. $(c \mid p^a-1$ and $c \mid p^b-1) \Rightarrow c \mid p^d-1$.  I already managed to prove the first one, but i am not sure how to solve the second. Any help would be appreciated!


I guess here I am not sure how to get started, I know the definitions:  The $ω$-limit sets of points are the set of points that the system of equation approach as time goes to infinity, and the $α$-limit sets of points are the points approached as t goes to negative infinity. But I am not sure how the eigenvalues or vectors help me determine the limit sets.  But I don't understand how to apply them.  My conclusion for both of these question is that $α(0)=ω(0)={0}$ because in both cases the origin is a fixed point. Is this correct? Are the more limit sets than these?  Consider the systems of equations and find all the $α$- and $ω$-limit sets of points in the plane.  a.  $$\dot {x}=y+x(x^2+y^2-1)$$  $$\dot {y}=-x+y(x^2+y^2-1)$$  which in polar coordinates, is given by:  $$\dot {r}=r(r^2-1)$$ $$\dot {ø}=-1$$  $$r^2=x^2+y^2$$ $$r \dot {r}=x \dot {x}+y \dot {y}$$ $$=r^2(r^2-1)$$ $$r \dot=r(r-1)(r+1)$$  So I understand how the got the value for $\dot {r}$, but I don't understand how to get the value for $\dot {ø}$  The fixed points will be when $\dot {r}=0$ so when r=1, -1, 0.   From my book: "Because $\dot {ø}$=-1, thus the solution goes clockwise around the origin at unit angular speed." Why??   b.  $$\dot {x}=y+x(1-x^2-y^2)(x^2+y^2-4)$$  $$\dot {y}=-x+y(1-x^2-y^2)(x^2+y^2-4)$$  which in polar coordinates, is given by:  $$\dot {r}=r(1-r^2)(r^2-4)$$ $$\dot {ø}=-1$$

This is a worked out example in my book, but I am having a little trouble understanding it:  Consider the system of equations:  $$x'=y+x(1-x^2-y^2)$$ $$y'=-x+y(1-x^2-y^2)$$  The orbits and limit sets of this example can be easily determined by using polar coordinates. (My question: what is the motivation for that thinking? What should clue me in to thinking that I should use polar coordinates?)  The polar coordinate satisfies $r^2=x^2+y^2$ so by differentiating with respect to t and using the differential equations we get:  $r\cdot r'=x\cdot x'+y\cdot y'$ (I am unclear about how the book even got this first equation from $r^2=x^2+y^2$)   $=x\cdot y+x^2(1-r^2)-x\cdot y+y^2(1-r^2)$ Substitute in $x'$ and $y'$ and then multiple out and replace with $r$, I get this step  $=r^2(1-r^2)$ cancel terms, I get this step too  $r'=r(1-r)$  similarly, the angle variable $\theta$ satisfies $\tan\theta=\frac yx$, so the derivative with respect to $t$ yields $\sec^2(\theta)\theta'=x^{-2}[x^2+xy(1-r^2)-y^2-xy(1-r^2)]=-\frac{r^2}{x^2}$ so $\theta=1$  Thus the solution goes clockwise around the origin at unit angular speed.  I don't understand the $\theta$ step at all or how they reached the conclusion of clockwise around the origin with unit angular speed..  But then it just jumps to saying "the origin is a fixed point, so α(0)=ω(0)={0} but I have no idea how they reached this conclusion..


I am trying to horizontally center a large image. Because I am using HTML5, I can't use <center>. I could use left:400px, but that wouldn't work for different screen sizes.

I have a div 200 x 200 px. I want to place a 50 x 50 px image right in the middle of the div.   How can it be done?  I am able to get it centered horizontally by using text-align: center for the div. But vertical alignment is the issue..