I have a matlab script that loads values by reading non-standard length bits.  For example:  [file, errmsg] = fopen(FileName,'r');  year = fread(file,1,'ubit12','ieee-le');  month = fread(file,1,'ubit4','ieee-le');  day = fread(file,1,'ubit5','ieee-le');  version = fread(file,1,'ubit11','ieee-le');   The values loaded are:  year =2016 month =7 day =21 version =0   While the binary version of the file is:   11100000 01110111 00010101 00000000   (as retrieved by doing '{0:08b}'.format(ord(byte)) in python)  In other words,  year -&gt; 4 lsb of byte 2 + byte 1 (011111100000) month -&gt; 4 msb of byte 2 (0111) day -&gt; 5 lsb of byte 3 (10101) version -&gt; 3 msb of byte 3 + byte 4 (00000000000)   Is there a pythonic way to achieve the same functionality?
I need a compact representation of an array of booleans, does Python have a builtin bitfield type or will I need to find an alternate solution?
Duplicates in sendable DE for MobileConnect Bionic - Group addition using usermod -aG doesn't take effect until the next reboot How to fix Finance::Quote to pull quotes in GnuCash I made the jump from Jumsoft's Money app to GnuCash a while back. It appealed to all my OCD tendencies. I don't know how to use Perl, or stuff of the sort, but with detailed instructions I manage to get things done... when I can find them.  I set up Finance::Quote to pull quotes after I set up GnuCash. I even managed to get it to pull quotes for Korean funds. And every thing had been working well, until tonight. I only get back a pop-up that states "There was an unknown error while retrieving the price quotes." That's where I need help. What can I do?  I dug around and found that it seems that it has something to do with Yahoo Finance ending it's API support. I also learned that Finance::Quote can pull data from many sources, so I don't really understand why one missing API would break it. I also saw that someone out there is trying to use AEX to pull the quotes instead for GnuCash specifically. I found Finance::Quote on cpan (I also first heard of cpan), but I don't understand what I'm looking at. But that's all beside the point. I don't know how to fix this.  Any help would be appreciated. I'm on Windows 10, GnuCash version 2.6.17, and have Strawberry Perl 5.18.2.2-32bit installed.  edit Thanks everyone who responded. It seems to be working more or less. The currency and Korean funds still haven't updated, but you've shown this horse to water. I'll do my best to drink it now. What's the best solution to check a users country? If you activated a free upgrade to Windows 10 or bought and activated   Windows 10 from the Microsoft Store, you have a digital license for   your device. This means you can reinstall the same edition of Windows   10 that your device has a digital license for without entering a   product key. During reinstallation, if you’re asked to enter a product   key, you can skip this step. Windows 10 will automatically activate   online after the installation is complete.   source:   Does MS digital license 'fingerprint' hardware information  during the free upgrade / activation and store it (at Microsoft) , so that the next re-install queries MS for the fingerprint and activates Windows 10?  Thought the disk drive may change, I expect that none of the other fingerprinted hardware will change. How do I create a public view from a private view It seems like I can't modify a private view to be public, or duplicate a private view to be public.  Am I restricted to copying by hand all the settings of my private view, then creating a fresh public view and selecting all the right columns in the same order with all the sort and filter options? How can I clear event subscriptions in C#? Take the following C# class:  c1 {  event EventHandler someEvent; }   If there are a lot of subscriptions to c1's someEvent event and I want to clear them all, what is the best way to achieve this? Also consider that subscriptions to this event could be/are lambdas/anonymous delegates.  Currently my solution is to add a ResetSubscriptions() method to c1 that sets someEvent to null. I don't know if this has any unseen consequences. Create veracrypt traveler disk in Ubuntu According to , it is possible to create a portable "Traveler Disk" in the application:      Tools -> Traveler Disk Setup      You can use this facility to prepare a   special traveler disk and launch VeraCrypt from there. Note that   VeraCrypt ‘traveler disk’ is not a VeraCrypt volume but an unencrypted   volume. A ‘traveler disk’ contains VeraCrypt executable files and   optionally the ‘autorun.inf’ script (see the section AutoRun   Configuration below). After you select Tools -> Traveler Disk Setup,   the Traveler Disk Setup dialog box should appear. Some of the   parameters that can be set within the dialog deserve further   explanation:   My problem is I can't seem to find Tools → Traveler Disk Setup.    Am I missing something? I want to be able to share files on this disk with people running MS Windows. Are The Lazarus Effect and Dune in the same universe? There are similar aspects between Dune, and the technology in The Lazarus Effect.   Noticeable similarities:   Lasguns - this weapon exists in both of the books, and has similar architecture in both books.   Merman and Ixians - are both technologically sophisticated in similar ways. Rely on mechanical technology as opposed to organics or similar.   Is this merely Herbert sticking to his original style? How can I find and replace specific words in a text file using command line? Difference between deportation and removal As I understand it, there are two mechanisms for throwing somebody out of the UK: deportation and removal. Informally, people seem to call both of these "deportation".  What are the differences between them? Who do they apply to? Do they have different effects on the person's ability to return to the UK later? Issue with particles in blender donut tutorial I have been recently doing the blender donut tutorial and ran into a problem regarding the sprinkle particles. The particles (hair) keep appearing on the underside of the icing. As seen in the image below, most of the hair particles only come out from the bottom of the icing. I tried to readjust the normals but I realised the normals were already correct. (Blue colour donut in image) Someone suggested following through the weight painting part of the tutorial. However, the sprinkles still remain on the underside of the icing. What is the actual problem and how do I solve this?  Particle settings below  Edit: @moonboots Thanks the hair particle problem has been solved. How do I prevent the submersion of the sprinkle particles? Group of order $8p$ is solvable, for any prime $p$ Consider the following question:     Show that a group $G$ of order $8p$ is solvable, for any prime $p$.   I am kind of stuck, but here are my first attempts:  I chose the series of subroups $G&gt;H_8&gt;H_4&gt;H_2&gt;H_1=\{e\}$ where $H_k$ has order $k$. All of these subgroups exist due to Sylow's Theorems. We have the quotients $H_8/H_4\cong H_4/H_2 \cong H_2/H_1 \cong \mathbb Z/2\mathbb Z$, so $G&gt;H_8\rhd H_4\rhd H_2\rhd H_1=\{e\}$. Only the factor $G/H_8 \cong \mathbb Z/p\mathbb Z$ is causing me a headache, because although its of prime order (and hence abelian) I don't know whether $H_8$ is normal in $G$ (unless $p=2$).  If $p\ne 2$, then the number $k$ of Sylow $2$-subgroups is $1$ mod $2$. Since $k$ divides $|G|$ we might have $k=1$ or $k=p$. If we had $k=1$ then $H_8$ would be the only Sylow $2$-subgroup (and hence normal in $G$). But how could we show this?  Or is there even an easier way to approach this problem?  $\ $  edit: I am going to try a different approach: The case $p=2$ is clear. When $p=3$ or $p=7$ the group has order 24 or 56 and since the smallest simple non-abelian group has order 60, the group must also be solvable in these exceptional cases (as Mariano pointed out).  In any other case we get a Sylow $p$-subgroup $H_p$ of order $p$, which is is normal in $G$. The quotient $G/H_p$ has order $8=2^3$; and prime power order implies solvable. So $G/H_p$ is solvable and $H_p$ is also solvable. And since the composition factors of $G$ are those of $H_p$ together with those of $G/H_p$, we conclude that $G$ is solvable iff $H_p$ and $G/H_p$ are solvable, which is the case. Hence $G$ is solvable if $|G|=8p$. I am trying to make a callout to AWS S3 using named credentials and Apex  The named credential is set up as follows  Label: AWS S3 Name: AWS_S3 URL: https://bucket-name.s3.amazonaws.com - Certificate: Identity Type: Named Principal Authentication Protocol: AWS Signature Version 4 AWS Access Key: AKIAxxxxxx AWS Secret Access Key: xxxxxx AWS Region: ap-southeast-2 AWS Service: s3 - Generate Authorization header: true Merge fields in header: false Merge fields in body: false   The Apex class is very simple  HttpRequest req = new HttpRequest(); req.setEndpoint('callout:AWS_S3'); req.setMethod('GET');                        Http http = new Http(); HTTPResponse res = http.send(req);                 System.debug(res.getBody()); return res.getBody();   The response body contains the following:     SignatureDoesNotMatchThe request signature we calculated does not match the signature you provided. Check your key and signing method.AKIAxxxxx   I have used the same bucket, endpoint and credentials using Postman and am able to successfully return the list of objects in the bucket so it is not an IAM permissions issue  There have been a couple of similar questions on stackexchange but unfortunately they do not provide any resolution or assistance in this case:    I've tried looking for code samples or further pointers in the Apex documentation but it doesn't really give any further guidance on how to proceed or correctly set this up so I'm a bit stuck Magic leaves "smudges" and a sorceress becomes a book I could use some help identifying a book I read some time in the last year or so. The book goes between two different stories:  1) A student of magic finds a book in a cave that turns out to be a person transformed into a book. The book talks to the student and they share thoughts. At some point, the student runs away, chase ensues, and at the very end of the book, he manages to travel to another plane.  2) A girl in a religious society where magic is forbidden. She is the daughter of painters. She discovers she can see magic. Falls in love with some random painter, risks performing magic to not be pregnant, does it again so she can, and is arrested and sent to some prison thing.  The common element between the stories is that magic use leaves behind a smudge of some kind that can be visible.  Any assistance is appreciated. I have a simple skull model, to which I applied the subdivision modifier. For the most part everything works as expected, except I keep getting these weird sharp vertices and I can't seem to figure out how to flatten them.    I'm using Blender 2.8. Is this some kind of feature I can disable/enable for particular vertices? The distance between the sharp vertices and the gray outline differ.    Any suggestions please? Thank you!  EDIT: I also tried selecting as both - vertexes and edges and then applied Edge->Clear Sharp, but nothing changed. Why is this true: The only orthogonal projection that is also unitary from $\Bbb C^n$ to $\Bbb C^n$ is the identity Can anyone explain me please how to see this statement: the only orthogonal projection that is also unitary from $\Bbb C^n$ to $\Bbb C^n$ is the Identity.  how can I prove formally that? or how can I see that only the Identity satisfy it? I'm using the 1-25-19 version of 2.8 beta. You have to double tap "a" every time you want to deselect something which is very annoying. Is there a way to make "a" work the old way where "a" selects all if nothing is selected and "a" deselects all if something is selected? ie. no double tap and no alt? Serial protocol delimiting/synchronization techniques As asynchronous serial communication is widely spread among electronic devices even nowadays, I believe many of us have encountered such a question from time to time. Consider an electronic device D and a computer PC connected with serial line (RS-232 or similar) and required to exchange information continuously. I.e. PC is sending a command frame each X ms, and D is replying with status report/telemetry frame each Y ms (The report can be sent as response to requests or independently - doesn't really matter here). The communication frames can contain any arbitrary binary data. Assuming the communication frames are fixed-length packets. The problem: As the protocol is continuous, the receiving side might loose the synchronization or just &quot;join&quot; in the middle of an ongoing sent frame, so it just won't know where the start of frame (SOF) is. A the data has different meaning based on its position relatively to the SOF, the received data will become corrupted, potentially forever. The required solution Reliable delimiting/synchronization scheme to detect the SOF with short recovery time (i.e. it shouldn't take more than, say 1 frame to resynchronize). The existing techniques I am aware (and using some) of: 1) Header / checksum - SOF as predefined byte value. Checksum in the end of frame.  Pros: Simple. Cons: Not reliable. Unknown recovery time.  2) Byte stuffing:  Pros: Reliable, fast recovery, can be used with any hardware Cons: Not that suitable for fixed-size frame-based communication  3) 9th bit marking - prepend each byte with additional bit, while SOF marked with 1 and the data bytes are marked with 0:  Pros: Reliable, fast recovery Cons: Requires hardware support. Not directly supported by most of PC hardware and software.  4) 8th bit marking - kind of emulation of the above, while using the 8th bit instead of 9th, which is leaving only 7bits for each data word.  Pros: Reliable, fast recovery, can be used with any hardware. Cons: Requires an encoding/decoding scheme from/to the conventional 8-bit representation to/from 7-bit representation. Somewhat wasteful.  5) Timeout based - assume the SOF as the first byte coming after some defined idle time.  Pros: No data overhead, simple. Cons: Not that reliable. Won't work well with poor timing systems like, say, Windows PC. Potential throughput overhead.  Question: What are the other possible techniques/solutions exist to address the problem? Can you point to the cons in the above list which can be easily worked around, thus removing them? How do you (or would you) design your systems protocol? I have a Microsoft XBOX 360 gamepad with the wireless adapter and I was wondering what I would have to install to use them with Ubuntu I do know that when using this on Windows I have to manually install the drivers for the wireless receiver (if that is relevant.)