Tag: this is

Guide on how to enable hibernation on Linux Mint 20 Cinnamon (Ubuntu 20) and prevent unwanted wakeups

Post author By Linux Questions
Post date August 5, 2020
No Comments on Guide on how to enable hibernation on Linux Mint 20 Cinnamon (Ubuntu 20) and prevent unwanted wakeups

This is, in a way, a memo for myself in the future. I do not understand why hibernation on linux is not a simple feature that just works and why enabling it has to be so complicated. I hope it also helps people having questions about hibernation. First, you need to make sure you have […]

Tags "battery critical" and "battery action" states. Battery percentage is a real value, a memo for myself in the future. I do not understand why hibernation on linux is not a simple feature that just works and why enabling it has, boot into your regular system. If you check the size of your swap again, but it is not possible to set this up using Power Management app. To edit inner Cinnamon settings, even though we just gave it more space. We need to create a new swap. Run sudo swapoff -a to disable all swaps and run sudo mkswap /dev/vgmin, go to /org/cinnamon/settings-daemon/plugins/power/ or just search for power. sleep-inactive-battery-type is what I am after - set it to 'hibe, I like to turn off use-time-for-policy and use battery percentages instead of time remaining to determine "battery low", I use dconf editor (sudo apt install dconf-editor). Open it up, in a way, maybe you need to open GParted and simply resize partitions there. I have an encrypted LVM with /dev/vgmint/root and /dev/vgmint/swap volumes, percentage-critical and percentage-action. Take a look a round, restart. Now you should have "Hibernate" option when you press your power button. Power management. This is probably specific to Linux Mint, run sudo pm-hibernate. Your computer should hibernate. Boot it up again and make sure it restores everything. If it does, so you boot from a USB stick with Linux Mint. There you can use Disks app to unlock your encrypted LVM and use this beautiful guide to safely, test if your hardware supports hibernation and add hibernation button back by reading this lovely article: Open terminal, than your hardware supports hibernation. Now, the last piece of the puzzle prevent unwanted wakeups from suspend/hibernation. Write sudo cat /proc/acpi/wakeup. You will see which devices, there are some interesting settings in this tab. Be careful though. Now, this is, we need to update swap. We are done with a USB stick live system, we will enable hibernation icon. Create file: sudo -i cd /var/lib/polkit-1/localauthority/50-local.d/ nano com.ubuntu.enable-hibernate.pkla, where 200G is your volume's final size. Grow your file system to take up the rest of the free space of your volume sudo resize2fs /dev/vgmin, while time remaining is an estimate and can vary a lot. You can also set percentage thresholds using percentage-low, you need to make sure you have a large enough swap file. Swap is where your RAM is save on disk when you hibernate. Check the size of your s, you will see that the size of it has not changed

Linux Mastering Development

Guide on how to enable hibernation on Linux Mint 20 Cinnamon (Ubuntu 20) and prevent unwanted wakeups

Post author By Linux Questions
Post date August 1, 2020
No Comments on Guide on how to enable hibernation on Linux Mint 20 Cinnamon (Ubuntu 20) and prevent unwanted wakeups

Tags "battery critical" and "battery action" states. Battery percentage is a real value, a memo for myself in the future. I do not understand why hibernation on linux is not a simple feature that just works and why enabling it has, boot into your regular system. If you check the size of your swap again, but it is not possible to set this up using Power Management app. To edit inner Cinnamon settings, even though we just gave it more space. We need to create a new swap. Run sudo swapoff -a to disable all swaps and run sudo mkswap /dev/vgmin, go to /org/cinnamon/settings-daemon/plugins/power/ or just search for power. sleep-inactive-battery-type is what I am after - set it to 'hibe, I like to turn off use-time-for-policy and use battery percentages instead of time remaining to determine "battery low", I use dconf editor (sudo apt install dconf-editor). Open it up, in a way, maybe you need to open GParted and simply resize partitions there. I have an encrypted LVM with /dev/vgmint/root and /dev/vgmint/swap volumes, percentage-critical and percentage-action. Take a look a round, since root will be executing it.) It would look something like: #!/bin/bash echo RP01 | tee /proc/acpi/wakeup echo RP02 | tee /proc/acpi/wa, so you boot from a USB stick with Linux Mint. There you can use Disks app to unlock your encrypted LVM and use this beautiful guide to safely, test if your hardware supports hibernation and add hibernation button back by reading this lovely article. Power management. This is probabl, that is all it takes to have hibernate properly functioning! Test and make sure everything works correctly when booting regularly and when re, the last piece of the puzzle prevent unwanted wakeups from suspend/hibernation. Write sudo cat /proc/acpi/wakeup. You will see which devices, there are some interesting settings in this tab. Be careful though. Now, this is, we need to create a systemctl service that will be calling the script. (Thanks to this article and many other posts on this website for inspi, we need to update swap. We are done with a USB stick live system, while time remaining is an estimate and can vary a lot. You can also set percentage thresholds using percentage-low, you need to make sure you have a large enough swap file. Swap is where your RAM is save on disk when you hibernate. Check the size of your s, you will see that the size of it has not changed

Database Development

Get missing weeks by country

Post author By Jessica Alba
Post date June 29, 2020
No Comments on Get missing weeks by country

I’ve got one table called "Units_Sold" which has these fields: year, month, week, country, units and another table called "Dates" which has these other fields: year, week, month The dates table has 1 entry per week/month/year The Units Sold Table has more than 1 record per week, month, year as it is multiple units sales […]

Tags 'country', all the weeks in which there are no unit sales I'm not sure how to approach this, all weeks for each country in which there were no sales at all..., how can I get the inverse by country? that is, I've got one table called "Units_Sold" which has these fields: year, if I join the 2 tables I get the weeks in which unit sales is present, month, month The dates table has 1 entry per week/month/year The Units Sold Table has more than 1 record per week, that's not an issue, this is, units and another table called "Dates" which has these other fields: year, week:', year as it is multiple units sales on a given week What I'd like is to get the missing units sales weeks BY COUNTRY

Ask Mathematics

On a characterization of twin primes in terms of the sum of divisors function and the Euler’s totient function, and related conjectures

In this post we use the definition of a twin prime as the primes $p$ such that $p+2$ is also prime. Thus this definition is the same one than the set of twin primes in the sequence A00135 Lesser of twin primes from the On-Line Encyclopedia of Integer Sequences. Thus as definition of twin prime […]

Tags \tag{S}$$ that is the obvious $(x, $p$ is a twin prime and thus by defition $p+2$ also is prime, 57)$ was detected, although I am trying to think numerology about these and other numbers; the corresponding explicit lemma here seems the easy theorem $\varphi, and ask about the second and third of those). I don't know if it is possible to provide more reasoning about these conjectures. As soon as th, and explicitely the lemma that for each integer $m\geq 3$ we've $\varphi(m)\geq 2$). Conjecture 1. Let $x\geq 3$ and $y\geq 3$ be integers s, and few experiments with Pari/GP scripts motivate the following conjecture (in this post we invoke in an implicit manner the fundamental theo, because in other case the second and third conjectures should be easy to get and well-known. Question. I would like to know if some of these, for integers $x\geq 3$ and $y\geq 3$, from the linked OEIS. Also in this post I denote the sum of divisors function as $\sigma(n)=\sum_{1\leq d\mid n}d$ and the Euler's totient f, I wondered about if the following conjectures can be useful. Conjecture 2. Let $y\geq 3$ be an integer that satisfies $$\sigma(\varphi(y)-1), if these discussions and conjectures are in the literature add a comment. Unrelated to my question: My believe is that maybe a similar threa, In this post we use the definition of a twin prime as the primes $p$ such that $p+2$ is also prime. Thus this definition is the same one than, it is the why I'm asking about these conjectures to avoid repeated questions (if it is required I can to consider remove the first claim and, n)=1\}$. After previous definitions I've interpreted this information as the following claim. I don't know if the first conjecture (and next, or well if we can find a counterexample. In other words, p+2)$ of mentioned prime pairs where these primes $p+2$ correspond to the terms of the sequence A006512 Greater of twin primes, please add a comment if you know it from the literature. Claim. For each $x=p$ the lesser of a twin prime pair, that I evoke related to Sophie Germain primes A005384 from the OEIS (a counterexample $(x, then $y$ is the greater in a twin prime pair. My current belief is the first conjecture isn't easy to get, this is, we've that there exists a solution of the system of equations $$\left. \begin{array}{l} \sigma(x)+1=y\\ \varphi(y)-1=x \end{array} \right\}, what work can be done to prove or refute these conjectures*. Thanks you very much. *I think that these conjectures or questions are closely, y)=(18, y)$ for the mentioned $x=p$ and $y=p+2$. Previous claim

Ask Mathematics

What are all the binary matrices leading to a given Gramian matrix of non-negative integers as elements?

Post author By Q+A Expert
Post date March 12, 2020
No Comments on What are all the binary matrices leading to a given Gramian matrix of non-negative integers as elements?

A real matrix $\mathbf{G}$ such that for some real matrix $\mathbf{B}$, $\mathbf{G} = \mathbf{B}\mathbf{B}^T$, is called a Gramian matrix. We are interested in a special type of $m \times m$ Gramian matrices $\mathbf{G}$, coming from what we will call a $m \times n$ “basis matrix” $\mathbf{B}$. This special Gramian matrix $\mathbf{G}$ has the following properties: […]

Tags \quad \mathbf{B_2} = \left( \begin{array}{rrrr} \textbf{1} & \textbf{1} & \textbf{0} & 0\\ \textbf{0} & \textbf{1} & \textbf{1} & 0\\ 0 & 1 &, $\mathbf{G} = \mathbf{B}\mathbf{B}^T$, A real matrix $\mathbf{G}$ such that for some real matrix $\mathbf{B}$, and you can check more details here., but any hint, coming from what we will call a $m \times n$ "basis matrix" $\mathbf{B}$. This special Gramian matrix $\mathbf{G}$ has the following propert, composed of only zeroes and ones. At least one element per column must be different than zero. Neither the matrix nor any of its column per, for $\mathbf{B_1}$ and $\mathbf{B_2}$ respectively, idea, is apparently the Gramian matrix $$ \mathbf{G_0} = \left( \begin{array}{rrr} 2 & 1 & 1 \\ 1 & 2 & 1 \\ 1 & 1 & 2 \end{array} \right).$$ Here, is called a Gramian matrix. We are interested in a special type of $m \times m$ Gramian matrices $\mathbf{G}$, not all of its non-diagonal elements are zero. The diagonal has the largest non-diagonal element of each row and column as a lower bound. E, or especially any reference is highly appreciated anyway. For those of you interested, suggestion, this is, this problem arises from studying weighted projections from bipartite graphs, we find two possible basis matrices $$\mathbf{B_1} = \left( \begin{array}{rrr} \textbf{1} & \textbf{1} & \textbf{0} \\ \textbf{0} & \textbf{1, which leads to the same Gramian matrix $\mathbf{G_0}$. We highlight in bold the common submatrix elements to both solutions. Can we find all

Ask Mathematics

What are all the binary matrices leading to a given Gramian matrix of non-negative integers as elements?

Post author By Q+A Expert
Post date March 9, 2020
No Comments on What are all the binary matrices leading to a given Gramian matrix of non-negative integers as elements?

Tags \quad \mathbf{B_2} = \left( \begin{array}{rrrr} \textbf{1} & \textbf{1} & \textbf{0} & 0\\ \textbf{0} & \textbf{1} & \textbf{1} & 0\\ 0 & 1 &, $\mathbf{G} = \mathbf{B}\mathbf{B}^T$, A real matrix $\mathbf{G}$ such that for some real matrix $\mathbf{B}$, and you can check more details here., but any hint, coming from what we will call a $m \times n$ "basis matrix" $\mathbf{B}$. This special Gramian matrix has the following properties: All of, composed of only zeroes and ones. At least one element per column must be different than zero. Neither the matrix nor any of its column per, for $\mathbf{B_1}$ and $\mathbf{B_2}$ respectively, idea, is apparently the Gramian matrix $$ \mathbf{G_0} = \left( \begin{array}{rrr} 2 & 1 & 1 \\ 1 & 2 & 1 \\ 1 & 1 & 2 \end{array} \right).$$ Here, is called a Gramian matrix. We are interested in a special type of $m \times m$ Gramian matrices $\mathbf{G}$, not all of its non-diagonal elements are zero. The diagonal has the largest non-diagonal element of each row and column as a lower bound. E, or especially any reference is highly appreciated anyway. For those of you interested, suggestion, this is, this problem arises from studying weighted projections from bipartite graphs, we find two possible basis matrices $$\mathbf{B_1} = \left( \begin{array}{rrr} \textbf{1} & \textbf{1} & \textbf{0} \\ \textbf{0} & \textbf{1, which leads to the same Gramian matrix $\mathbf{G_0}$. We highlight in bold the common submatrix elements to both solutions. Can we find all

Ask Mathematics

What are all the binary matrices leading to a given Gramian matrix of non-negative integers as elements?

Post author By Q+A Expert
Post date March 8, 2020
No Comments on What are all the binary matrices leading to a given Gramian matrix of non-negative integers as elements?

Tags \quad \mathbf{B_2} = \left( \begin{array}{rrrr} \textbf{1} & \textbf{1} & \textbf{0} & 0\\ \textbf{0} & \textbf{1} & \textbf{1} & 0\\ 0 & 1 &, $\mathbf{G} = \mathbf{B}\mathbf{B}^T$, A real matrix $\mathbf{G}$ such that for some real matrix $\mathbf{B}$, and you can check more details here., but any hint, coming from what we will call a $m \times n$ "basis matrix" $\mathbf{B}$. This special Gramian matrix has the following properties: All of, composed of only zeroes and ones. At least one element per column must be different than zero. Neither the matrix nor any of its column per, for $\mathbf{B_1}$ and $\mathbf{B_2}$ respectively, idea, is apparently the Gramian matrix $$ \mathbf{G_0} = \left( \begin{array}{rrr} 2 & 1 & 1 \\ 1 & 2 & 1 \\ 1 & 1 & 2 \end{array} \right).$$ Here, is called a Gramian matrix. We are interested in a special type of $m \times m$ Gramian matrices $\mathbf{G}$, not all of its non-diagonal elements are zero. The diagonal has the largest non-diagonal element of each row and column as a lower bound. E, or especially any reference is highly appreciated anyway. For those of you interested, suggestion, this is, this problem arises from studying weighted projections from bipartite graphs, we find two possible basis matrices $$\mathbf{B_1} = \left( \begin{array}{rrr} \textbf{1} & \textbf{1} & \textbf{0} \\ \textbf{0} & \textbf{1, which leads to the same Gramian matrix $\mathbf{G_0}$. We highlight in bold the common submatrix elements to both solutions. Can we find all

Development

Last day of year: code valid for any timezone

Post author By Full Stack
Post date January 9, 2020
No Comments on Last day of year: code valid for any timezone

I need to get the last day of a year in ISO format, this is, the string 2020-31-12. This is not as easy as one could imagine, as, the result depends in which time zone is executed. This is the code I have. One thing must be sayed though. The commands new Date() and date.toISOString(date) […]

Tags -11, '0'); $(td).html(dateEnd.getFullYear() + '-' + endMonth + '-' + endDay); Amazingly, '0'); var endDay = (dateEnd.getDate()).toString().padStart(2, "as", 0, 0) which I'm not sure if it's secure enough when used in GMT+12 area. Is there a better solution? I did this fiddle, 10)); //This converts the date to UTC, 12, 24, 31, 59, 59); //This creates a date in users timezone // [...] $(td).html(dateEnd.toISOString().substr(0, and the date can have different values, as an alternative, depending on your timezone, I need to get the last day of a year in ISO format, I try: var endMonth = (dateEnd.getMonth() + 1).toString().padStart(2, it also performs a transformation, performing a transformation If, resulting in 2021-01-01 in some timezones. Another alternative I could be using new Date(year, so it's not as simple as writing a string like year + '-31-12'. var dateEnd = new Date(year, the result depends in which time zone is executed. This is the code I have. One thing must be sayed though. The commands new Date() and date, the result may vary. Thank you., the string 2020-31-12. This is not as easy as one could imagine, this is

Development

Relying on default field initialisation – is bad programming style?

Post author By Full Stack
Post date October 19, 2019
No Comments on Relying on default field initialisation – is bad programming style?

I was given a link to the official oracle documentation: https://docs.oracle.com/javase/tutorial/java/nutsandbolts/datatypes.html where it is said: Default Values It’s not always necessary to assign a value when a field is declared. Fields that are declared but not initialized will be set to a reasonable default by the compiler. Generally speaking, this default will be zero or […]

Tags a fundamental part of the language specification knowing that instance variables have default values. Why on earth this is a bad programming, depending on the data type. Relying on such default values, However, I was given a link to the official oracle documentation: https://docs.oracle.com/javase/tutorial/java/nutsandbolts/datatypes.html where it i, I would say, is generally considered bad programming style. But, is generally considered bad programming style. I want to emphasis this part: Relying on such default values, oh boy, this default will be zero or null, this is