I have this problem, after my laptop wakes up from suspend, my wifi connection is treated and shown as wired.Internet still works but no wifi connection is detected just a wired one. Running sudo systemctl enable wifi-resume.service seems to work, but only the after the first suspend. If the laptop goes to sleep once more the only solution is a reboot. I am using the default ubuntu network manager.  lshw:  *-network    description: Wireless interface    product: Centrino Wireless-N 2230    vendor: Intel Corporation    physical id: 0    bus info: pci@0000:06:00.0    logical name: wlp6s0    version: c4    serial: 00:c2:c6:85:45:2b    width: 64 bits    clock: 33MHz    capabilities: pm msi pciexpress bus_master cap_list ethernet physical wireless    configuration: broadcast=yes driver=iwlwifi driverversion=4.4.0-47-generic firmware=18.168.6.1 ip=192.168.0.5 latency=0 link=yes multicast=yes wireless=IEEE 802.11bgn    resources: irq:35 memory:f7800000-f7801fff     Thanks in advance.
I tried to change network interfaces name on this new Ubuntu 16.04 LTS version but doesn't have the /etc/udev/rules.d/70-persistent-net.rules.  So, I tried to use /lib/udev/write_net_rules but it not exist.  Why do I need this modification? Because I'm using a tool to Simulate virtual platforms that use flex licensing and the authentication need to be in eth0 interface name.  Any suggestion?  The command ip link returns:  user@laptop:~$ ip link  1: lo: &lt;LOOPBACK,UP,LOWER_UP&gt; mtu 65536 qdisc noqueue state UNKNOWN mode DEFAULT group default qlen 1 link/loopback 00:00:00:00:00:00 brd 00:00:00:00:00:00 2: enp6s0: &lt;NO-CARRIER,BROADCAST,MULTICAST,UP&gt; mtu 1500 qdisc pfifo_fast state DOWN mode DEFAULT group default qlen 1000 link/ether b8:2a:xx:yy:xx:yy brd ff:ff:ff:ff:ff:ff 3: wlp7s0: &lt;BROADCAST,MULTICAST,UP,LOWER_UP&gt; mtu 1500 qdisc mq state UP mode DORMANT group default qlen 1000 link/ether 5c:e0:xx:yy:xx:yy brd ff:ff:ff:ff:ff:ff  user@laptop:~$ ifconfig  enp6s0    Link encap:Ethernet  HWaddr b8:2a:xx:yy:xx:yy   lo        Link encap:Local Loopback   wlp7s0    Link encap:Ethernet  HWaddr 5c:e0:xx:yy:xx:yy     (Some information were ignored and suppressed)  I already tried some links:
Book about a boy who travels to a parallel universe to get a book I can't remember the gender of the main character.  I remember bits and pieces from different books, but I think they're all part of the same series. The pieces may not be in order or from multiple books.   Boy somehow ends up in a mirror universe that's darker and seems to have no people. He has to travel to a certain office(?) building and steal a book. I think this is towards the end of the book (I can't remember the events leading up to it). I think he finds the portal in a forest or something behind his school. He goes into the ocean with mermaids or something and has to save the ocean from pollution. Aliens exist and are observing Earth, because they think it's undeveloped and are waiting for them to be advanced enough. His mother ends up in hospital and he does something to save her. He goes to Ireland(?) and enters a mountain or something to find a race of people. I can't remember who showed him how, but I'm pretty sure she used magic. He goes to Mars and saves a race from war with themselves(?). This place was hidden inside an illusion. He's also grouped with a linguist that learned their language. He travels to another world where there's a prince. I can't remember, but I think it might've been part of a tournament. His sister goes to a robot planet through a portal. I think the actual planet was a robot/AI and had lots of little robots on it. Can't remember what happens here, but he goes there and saves her from something.   It was set a few years ago, when computers weren't common (his family got one early in the first book, I think).  Thanks in advance if someone finds it. Clipping LAS data using shapefile polygons and open source software? I am trying to clip or filter lidar files (.las, .xyz) using a shapefile that contains multiple polygons.  Is there open source software that can do this spatial operation?  My .las files are enormous, and I should say that I am very new to DEM data and analysis so any help would be very welcome. " java.lang.IllegalArgumentException: uri.getScheme() == null! " error using JavaFX to play audio ng-options with simple array init Order of keys in dictionary Is there a way of installing Ubuntu (Windows Subsystem for Linux) on Win10 (v1709) without using the Store? The Microsoft Store app is disabled by Group Policy by my university. I have administrator rights on my computer and I was wondering if there was a way of installing Windows Subsystem for Linux (WSL) directly? Or maybe via Chocolatey or some other command line method? I would like to download and install the Ubuntu  on windows without using the Microsoft store.  Note that since version 1709 (Fall Creator's Upgrade), only enabling Developer Mode is no longer sufficient. I want to make Morrocan-stye pickled lemons, but I was only able to find , and it says:  In On Food and Cooking, Harold McGee suggests that a solution of five to 10% salt is needed to achieve a good North African-style preserved lemon  I make sauerkraut with 20 grams of salt per kilogram of cabbage, so 2%. So lemons taking much more salt than cabbage is surprising and confusing; since they start out acidic, I would expect them if anything to require less salt. I'm not worried about harmful microbes growing; I'm worried about the fermentation microbes not being able to grow. It's my understanding that higher salt concentrations with cabbage not only slow down fermentation, but actually .  had the same issues:  I've never quite understood the need for such excessive salting when making preserved lemons. They still ferment great at normal levels of salt, and you then need to worry less about them being overly salty to use in future recipes. As far as I can tell it's solely from tradition. Also, from checking out On Food and Cooking, it seems that McGee only points out that originally they are done with 5 to 10% salt content. I'm curious where you read/saw that he recommended such?  Does anyone have any text- and/or experience-based opinion agreeing or disagreeing with the &quot;5 to 10%&quot; figure? Is it possible in Ruby to get a reference to methods of an object ( I would like to know if this can be done without procs/lambdas ) , for example , consider the following code :   class X   def initialize     @map = {}     setup_map   end    private   def setup_map     # @map["a"] = get reference to a method     # @map["b"] = get reference to b method     # @map["c"] = get referebce to c method   end    public   def call(a)     @map["a"](a) if a > 10     @map["b"](a) if a > 20     @map["c"](a) if a > 30   end    def a(arg)      puts "a was called with #{arg}"   end    def b(arg)      puts "b was called with #{arg}"   end    def c(arg)     puts "c was called with #{arg}"   end end   Is it possible to do such thing ? I would like to avoid procs/lambdas because I want to be able to change the behaviour of A,B,C by subclassing . Where do I find out how a command/environment is defined? Say I want to redefine the itemize environment, or make a modified version of it. I want to know how it is currently defined. Where do I find this information? If it's some particular package command, I can just look at the .sty file for that package, but if it's something more basic, I don't know where to look...  Is there a reference manual of where all this stuff is explained? Or is there a file in the depths of my texmf tree I should poke around in? Why are integer GCDs positive? [unit normalization of GCDs] The definition in my text reads, An integer $d$ is said to be the greatest common divisor of two non-zero integers $a$ and $b$ iff,  $d|a$ and $d|b$ and if $k$ is any other common divisor of $a$ and $b$ then $k|d$  Now here's the thing, if $d|a$ and $d|b$ then surely $-d|a$ and $-d|b$ as well, also $k|-d$ What I take from this? GCD is not unique! That is if $\mathrm{gcd}(12,8)= 4$ then by the definition, $\mathrm{gcd}(12,8) = -4$ as well. Yet I never ever seen a negative gcd. Someone please explain. Maybe, $4&gt;-4$, and we want the &quot;greatest common factor&quot; so...? But that still doesn't justify the definition. gluten free hot cross buns Do file-extensions have any purpose (for the operating system)? iMessage doesn't say "delivered" or "not delivered" I sent an iMessage from my iPod touch to my friends iphone on Monday. It didn't say delivered or not delivered. It was just nothing. His phone is on (I know because my other friends are iMessaging him) and my friend said her messages don't say "delivered" at the bottom but they still talk. Mine always say delivered at the bottom. So is this an error, like it didn't go through, or is he just ignoring me? How to install PYPY3 on Ubuntu, for newbies? I want to install pypy3 in Ubuntu. I have read the answer for this question "How to install PyPy3 (2.1, beta) on Ubuntu?" and still have no idea what to do. Could some kind soul please explain it so that even I can understand it :)  Here's what I have done so far:  Went    Read that I had to go   Downloaded: pypy3-2.1-beta-linux_x86_64-portable.tar.bz2  Opened it with the Archive manager (because it seemed like a reasonable thing to do)  Extracted it to desktop/PYPY3  Then desperately tried all the shell commands I came across last night. I will not be able to give a clear account of what I tried and what errors came back, as it is kind of a blur to me at this point.  But I can tell you that I got the Tar thing unpacked at one point and that I have tried running the pypy executable from the command line from the folder containing it, but got this:   bash: /usr/bin/pypy: No such file or directory   Could someone please tell me what to do. (have read the readme, the install docs at pypy.org and lots of posts) Review of a proof for De Moivre's theorem using mathematical induction The following is a rigorous proof of De Moivre's theorem by means of mathematical induction. The theorem put simply is that:  Any complex number, $z = a+bi$, on a cartesian plane can be expressed in polar form, where $a=r\cos\theta$ and $b=r\sin\theta$ and $r$ is the absolute distance from the origin to the point $z$. In light of this, the expression for the complex number $z$ in polar form is $z=r(\cos\theta+i\sin\theta)$ In order to find the $n^{th}$ power of $z$, the following rule applies: $$\displaystyle z^n=(r(\cos\theta+i\sin\theta))^n=r^n(\cos n\theta+i\sin n\theta)$$ where $n\in\mathbb N$ (I have confined $n$ to the natural numbers given that I intend on using mathematical induction to prove the theorem.  Base step: We must prove that what is stated is true for $n=1$, hence $$z^1=r^1(\cos 1\cdot\theta+i\sin1\cdot \theta)$$ $$=r(\cos\theta+i\sin\theta)$$ which is true. Next we assume it is true for $n=k$, and therefore proceed to the inductive step. Inductive step: When calculating $z^{n+1}$, it's the same as calculating $z^nz$, hence $$z^{n+1}=(r^n(\cos n\theta + i\sin n\theta))(r(\cos \theta+i\sin \theta))$$ $$=r^nr(\cos n\theta+i\sin n\theta)(\cos\theta +i\sin \theta)$$ $$=r^{n+1}(\cos n\theta\cdot\cos\theta+\cos n\theta \cdot i\sin\theta+i\sin n\theta\cdot\cos\theta+i^2\sin n\theta\cdot\sin\theta)$$ from here, $i^2=-1$, and therefore $+i^2\sin n\theta\cdot\sin\theta$ becomes $-\sin n\theta\cdot\sin\theta$. In addition to this, the following trigonometric identities will be used: $$\sin(n\theta + \theta) = \sin n\theta\cdot\cos\theta+\cos n\theta\cdot\sin\theta$$ $$or$$ $$k\sin(n \theta+\theta)=k\sin n \theta\cdot\cos \theta + \cos n\theta\cdot k\sin\theta$$ $$and$$ $$\cos(n \theta + \theta)=\cos n\theta\cdot\cos\theta-\sin n\theta\cdot\sin\theta$$ by using these, the original equation has now become $$=r^{n+1}(\cos(n \theta + \theta) + i\sin(n \theta + \theta))$$ then, after factoring out $\theta$, the theorem becomes $$=r^{n+1}(\cos((n+1)\theta)+i\sin((n+1)\theta))$$ which completes the proof. Question: is this proof correct all the way through? Or have I missed any conditions? If all is well in the case of this proof, could somebody aid me in proving it for $\{n|n\in\mathbb R,n\geq1\}$ Diagram Software I study computing on an advanced level and I need a program that will make it easier to create flowcharts and other diagrams efficiently. I don't need too many features; I just want something that works! I'm aware that there are many website that do exactly what I need but most of the times when I need to draw diagrams I don't have access to the internet SOQL query for Multiselect picklist Potential difference across a zero resistance wire What component to use for audio signal switching? I'm looking to build a guitar pedal switcher based on a Raspberry Pi or Arduino (have not yet decided, but I have an unused Raspberry around and I lean towards that). Anyway, digital logic.  Now, I need to switch audio signal obviously and I need to do it quietly (both physical silence and electrical silence). Please note that the signal is line level throughout most of the build, except for the input which is much lower. I will probably have 2 or 3 loops before the preamp so those may not encounter line level signal.  From what I read and know, so far, mechanical relays are not really an option due to the clicking noise they make. I also read something about FETs, but that's a bit out of my league and I would appreciate any info on these.  PS: I will probably use different power rails for the digital and analog paths.  PS2: The whole thing will be mounted in a 1U rack enclosure, so please tell me if I should take into consideration any thermal issues. The cube of any number not a multiple of $7$, will equal one more or one less than a multiple of $7$ Yeah so I'm kind of stuck on this problem, and I have two questions.   Is there a way to define a number mathematically so that it cannot be a multiple of $7$? I know $7k+1,\ 7k+2,\ 7k+3,\ \cdots$, but that will take ages to prove for each case.  Is this a proof? $$(7k + a)^3 \equiv (0\cdot k + a)^3 \equiv a^3 \bmod 7$$    Thank you.