#partitions — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #partitions, aggregated by home.social.
-
Curious how common/popular it is to use #LVM partitions instead of standard #Partitions these days. I was just looking at the Arch Wiki page for [LVM](https://wiki.archlinux.org/title/LVM) and I was surprised by all of the disadvantages they called out. I feel like I had assumed it was mostly all advantages. I guess looking at the list of disadvantages, the only one I'm wondering about is the "potentially worse performance".
On your laptops or desktops, do you typically use:
-
Curious how common/popular it is to use #LVM partitions instead of standard #Partitions these days. I was just looking at the Arch Wiki page for [LVM](https://wiki.archlinux.org/title/LVM) and I was surprised by all of the disadvantages they called out. I feel like I had assumed it was mostly all advantages. I guess looking at the list of disadvantages, the only one I'm wondering about is the "potentially worse performance".
On your laptops or desktops, do you typically use:
-
Curious how common/popular it is to use #LVM partitions instead of standard #Partitions these days. I was just looking at the Arch Wiki page for [LVM](https://wiki.archlinux.org/title/LVM) and I was surprised by all of the disadvantages they called out. I feel like I had assumed it was mostly all advantages. I guess looking at the list of disadvantages, the only one I'm wondering about is the "potentially worse performance".
On your laptops or desktops, do you typically use:
-
Curious how common/popular it is to use #LVM partitions instead of standard #Partitions these days. I was just looking at the Arch Wiki page for [LVM](https://wiki.archlinux.org/title/LVM) and I was surprised by all of the disadvantages they called out. I feel like I had assumed it was mostly all advantages. I guess looking at the list of disadvantages, the only one I'm wondering about is the "potentially worse performance".
On your laptops or desktops, do you typically use:
-
Curious how common/popular it is to use #LVM partitions instead of standard #Partitions these days. I was just looking at the Arch Wiki page for [LVM](https://wiki.archlinux.org/title/LVM) and I was surprised by all of the disadvantages they called out. I feel like I had assumed it was mostly all advantages. I guess looking at the list of disadvantages, the only one I'm wondering about is the "potentially worse performance".
On your laptops or desktops, do you typically use:
-
#OEIS #Partitions
https://oeis.org/A334442
https://oeis.org/A334439How should integer partitions be listed in the OEIS, what offset should the sequences have, and how should the empty partition be handled?
As an example, let's consider A334439: Irregular triangle whose rows are all integer partitions of n sorted first by sum, then by length, ...
This sequence can also be interpreted as the following triangle, whose n-th row is itself a finite triangle with A000041(n) rows.
0
(1)
(2)(11)
(3)(21)(111)
(4)(31)(22)(211)(1111)
(5)(41)(32)(311)(221)(2111)(11111)The apex of this triangle is the empty partition, which, however, does not appear in the sequence as it is represented in the OEIS.
1, 2, 1, 1, 3, 2, 1, 1, 1, 1, 4, 3, ..
Probably therefore the index was set to 1. However, this is disputed; the original author had set it to 0. Which value do you consider correct? The same applies to A334301 and A334302.
And then there's also A334442: Irregular triangle whose reversed rows are all integer partitions sorted first by sum, then by length, ...
This sequence can also be interpreted as the following triangle:
0
(1)
(2)(11)
(3)(12)(111)
(4)(13)(22)(112)(1111)
(5)(14)(23)(113)(122)(1112)(11111)Listed as: 1, 2, 1, 1, 3, 1, 2, 1, 1, .
Here, the offset has been set to 0! Do you see any reason to set it differently in this case than in the other three? Or is it clear to you that A334442 has offset 0, and A334439 has offset 1?[Q 1] Don't you expect the same offset in all cases?
[Q 2] What offset do you expect? 0 or 1? -
#OEIS #Partitions
https://oeis.org/A334442
https://oeis.org/A334439How should integer partitions be listed in the OEIS, what offset should the sequences have, and how should the empty partition be handled?
As an example, let's consider A334439: Irregular triangle whose rows are all integer partitions of n sorted first by sum, then by length, ...
This sequence can also be interpreted as the following triangle, whose n-th row is itself a finite triangle with A000041(n) rows.
0
(1)
(2)(11)
(3)(21)(111)
(4)(31)(22)(211)(1111)
(5)(41)(32)(311)(221)(2111)(11111)The apex of this triangle is the empty partition, which, however, does not appear in the sequence as it is represented in the OEIS.
1, 2, 1, 1, 3, 2, 1, 1, 1, 1, 4, 3, ..
Probably therefore the index was set to 1. However, this is disputed; the original author had set it to 0. Which value do you consider correct? The same applies to A334301 and A334302.
And then there's also A334442: Irregular triangle whose reversed rows are all integer partitions sorted first by sum, then by length, ...
This sequence can also be interpreted as the following triangle:
0
(1)
(2)(11)
(3)(12)(111)
(4)(13)(22)(112)(1111)
(5)(14)(23)(113)(122)(1112)(11111)Listed as: 1, 2, 1, 1, 3, 1, 2, 1, 1, .
Here, the offset has been set to 0! Do you see any reason to set it differently in this case than in the other three? Or is it clear to you that A334442 has offset 0, and A334439 has offset 1?[Q 1] Don't you expect the same offset in all cases?
[Q 2] What offset do you expect? 0 or 1? -
#OEIS #Partitions
https://oeis.org/A334442
https://oeis.org/A334439How should integer partitions be listed in the OEIS, what offset should the sequences have, and how should the empty partition be handled?
As an example, let's consider A334439: Irregular triangle whose rows are all integer partitions of n sorted first by sum, then by length, ...
This sequence can also be interpreted as the following triangle, whose n-th row is itself a finite triangle with A000041(n) rows.
0
(1)
(2)(11)
(3)(21)(111)
(4)(31)(22)(211)(1111)
(5)(41)(32)(311)(221)(2111)(11111)The apex of this triangle is the empty partition, which, however, does not appear in the sequence as it is represented in the OEIS.
1, 2, 1, 1, 3, 2, 1, 1, 1, 1, 4, 3, ..
Probably therefore the index was set to 1. However, this is disputed; the original author had set it to 0. Which value do you consider correct? The same applies to A334301 and A334302.
And then there's also A334442: Irregular triangle whose reversed rows are all integer partitions sorted first by sum, then by length, ...
This sequence can also be interpreted as the following triangle:
0
(1)
(2)(11)
(3)(12)(111)
(4)(13)(22)(112)(1111)
(5)(14)(23)(113)(122)(1112)(11111)Listed as: 1, 2, 1, 1, 3, 1, 2, 1, 1, .
Here, the offset has been set to 0! Do you see any reason to set it differently in this case than in the other three? Or is it clear to you that A334442 has offset 0, and A334439 has offset 1?[Q 1] Don't you expect the same offset in all cases?
[Q 2] What offset do you expect? 0 or 1? -
#MercrediPromo Je vous offre toujours -10 % sur mes #partitions papier auto-éditées :
- #Debussy, Arabesques 1 & 2 (orchestration) (conducteur/matériel) + Prélude à l’après-midi d’un faune (piano)
- #Brahms, Symphonie 3 - 3e mvt (piano)
- ma Fantaisie op. 3 (alto, clarinette, piano)
https://nicolashussein.fr/?s=nicolas+hussein&post_type=product#myWork #musique #musiqueClassique #classicalMusic #music #newMusic
-
#MercrediPromo Je vous offre toujours -10 % sur mes #partitions papier auto-éditées :
- #Debussy, Arabesques 1 & 2 (orchestration) (conducteur/matériel) + Prélude à l’après-midi d’un faune (piano)
- #Brahms, Symphonie 3 - 3e mvt (piano)
- ma Fantaisie op. 3 (alto, clarinette, piano)
https://nicolashussein.fr/?s=nicolas+hussein&post_type=product#myWork #musique #musiqueClassique #classicalMusic #music #newMusic
-
#MercrediPromo Je vous offre toujours -10 % sur mes #partitions papier auto-éditées :
- #Debussy, Arabesques 1 & 2 (orchestration) (conducteur/matériel) + Prélude à l’après-midi d’un faune (piano)
- #Brahms, Symphonie 3 - 3e mvt (piano)
- ma Fantaisie op. 3 (alto, clarinette, piano)
https://nicolashussein.fr/?s=nicolas+hussein&post_type=product#myWork #musique #musiqueClassique #classicalMusic #music #newMusic
-
#MercrediPromo Je vous offre toujours -10 % sur mes #partitions papier auto-éditées :
- #Debussy, Arabesques 1 & 2 (orchestration) (conducteur/matériel) + Prélude à l’après-midi d’un faune (piano)
- #Brahms, Symphonie 3 - 3e mvt (piano)
- ma Fantaisie op. 3 (alto, clarinette, piano)
https://nicolashussein.fr/?s=nicolas+hussein&post_type=product#myWork #musique #musiqueClassique #classicalMusic #music #newMusic
-
Someone asked me about sexy cousins. I'll admit, I was briefly hopeful. Turns out they meant primes with gap 6 and gap 4 respectively.
Disappointed, I did what anyone would do and stayed up computing distinct-prime partitions of primes.
Define m_d<(p) as the minimum k such that prime p is a sum of k pairwise distinct primes, each strictly less than p. Set m_d<(p) = ∞ if no such decomposition exists.
For every prime p ≤ 10^8 (verified directly, ~30 seconds on commodity hardware):
• m_d<(11) = ∞, uniquely. 11 simply refuses to be built from smaller primes. Provable by exhaustion: the 11 subsets of {2,3,5,7} of size ≥ 2
sum to {5,7,8,9,10,12,14,15,17}. 11 is not invited.• m_d<(17) = 4, uniquely. 17 needed all four of its juniors (2+3+5+7) just to show up. Overachiever or socially awkward — you decide.
• m_d<(p) ∈ {2, 3} for every other prime in range. 5,761,448 tested. All well-adjusted.
I don't know if this object has a name. I don't know if this is trivially known, or trivially reducible to something known.
The repo has code, a writeup, verification prompts you can feed to any LLM to check the claims, and some other things I found along the way.
https://github.com/keeltremor/goldeen
https://doi.org/10.5281/zenodo.19542143If any of this rings a bell please let me know!
🐉 -
Someone asked me about sexy cousins. I'll admit, I was briefly hopeful. Turns out they meant primes with gap 6 and gap 4 respectively.
Disappointed, I did what anyone would do and stayed up computing distinct-prime partitions of primes.
Define m_d<(p) as the minimum k such that prime p is a sum of k pairwise distinct primes, each strictly less than p. Set m_d<(p) = ∞ if no such decomposition exists.
For every prime p ≤ 10^8 (verified directly, ~30 seconds on commodity hardware):
• m_d<(11) = ∞, uniquely. 11 simply refuses to be built from smaller primes. Provable by exhaustion: the 11 subsets of {2,3,5,7} of size ≥ 2
sum to {5,7,8,9,10,12,14,15,17}. 11 is not invited.• m_d<(17) = 4, uniquely. 17 needed all four of its juniors (2+3+5+7) just to show up. Overachiever or socially awkward — you decide.
• m_d<(p) ∈ {2, 3} for every other prime in range. 5,761,448 tested. All well-adjusted.
I don't know if this object has a name. I don't know if this is trivially known, or trivially reducible to something known.
The repo has code, a writeup, verification prompts you can feed to any LLM to check the claims, and some other things I found along the way.
https://github.com/keeltremor/goldeen
https://doi.org/10.5281/zenodo.19542143If any of this rings a bell please let me know!
🐉 -
Someone asked me about sexy cousins. I'll admit, I was briefly hopeful. Turns out they meant primes with gap 6 and gap 4 respectively.
Disappointed, I did what anyone would do and stayed up computing distinct-prime partitions of primes.
Define m_d<(p) as the minimum k such that prime p is a sum of k pairwise distinct primes, each strictly less than p. Set m_d<(p) = ∞ if no such decomposition exists.
For every prime p ≤ 10^8 (verified directly, ~30 seconds on commodity hardware):
• m_d<(11) = ∞, uniquely. 11 simply refuses to be built from smaller primes. Provable by exhaustion: the 11 subsets of {2,3,5,7} of size ≥ 2
sum to {5,7,8,9,10,12,14,15,17}. 11 is not invited.• m_d<(17) = 4, uniquely. 17 needed all four of its juniors (2+3+5+7) just to show up. Overachiever or socially awkward — you decide.
• m_d<(p) ∈ {2, 3} for every other prime in range. 5,761,448 tested. All well-adjusted.
I don't know if this object has a name. I don't know if this is trivially known, or trivially reducible to something known.
The repo has code, a writeup, verification prompts you can feed to any LLM to check the claims, and some other things I found along the way.
https://github.com/keeltremor/goldeen
https://doi.org/10.5281/zenodo.19542143If any of this rings a bell please let me know!
🐉 -
Someone asked me about sexy cousins. I'll admit, I was briefly hopeful. Turns out they meant primes with gap 6 and gap 4 respectively.
Disappointed, I did what anyone would do and stayed up computing distinct-prime partitions of primes.
Define m_d<(p) as the minimum k such that prime p is a sum of k pairwise distinct primes, each strictly less than p. Set m_d<(p) = ∞ if no such decomposition exists.
For every prime p ≤ 10^8 (verified directly, ~30 seconds on commodity hardware):
• m_d<(11) = ∞, uniquely. 11 simply refuses to be built from smaller primes. Provable by exhaustion: the 11 subsets of {2,3,5,7} of size ≥ 2
sum to {5,7,8,9,10,12,14,15,17}. 11 is not invited.• m_d<(17) = 4, uniquely. 17 needed all four of its juniors (2+3+5+7) just to show up. Overachiever or socially awkward — you decide.
• m_d<(p) ∈ {2, 3} for every other prime in range. 5,761,448 tested. All well-adjusted.
I don't know if this object has a name. I don't know if this is trivially known, or trivially reducible to something known.
The repo has code, a writeup, verification prompts you can feed to any LLM to check the claims, and some other things I found along the way.
https://github.com/keeltremor/goldeen
https://doi.org/10.5281/zenodo.19542143If any of this rings a bell please let me know!
🐉 -
Someone asked me about sexy cousins. I'll admit, I was briefly hopeful. Turns out they meant primes with gap 6 and gap 4 respectively.
Disappointed, I did what anyone would do and stayed up computing distinct-prime partitions of primes.
Define m_d<(p) as the minimum k such that prime p is a sum of k pairwise distinct primes, each strictly less than p. Set m_d<(p) = ∞ if no such decomposition exists.
For every prime p ≤ 10^8 (verified directly, ~30 seconds on commodity hardware):
• m_d<(11) = ∞, uniquely. 11 simply refuses to be built from smaller primes. Provable by exhaustion: the 11 subsets of {2,3,5,7} of size ≥ 2
sum to {5,7,8,9,10,12,14,15,17}. 11 is not invited.• m_d<(17) = 4, uniquely. 17 needed all four of its juniors (2+3+5+7) just to show up. Overachiever or socially awkward — you decide.
• m_d<(p) ∈ {2, 3} for every other prime in range. 5,761,448 tested. All well-adjusted.
I don't know if this object has a name. I don't know if this is trivially known, or trivially reducible to something known.
The repo has code, a writeup, verification prompts you can feed to any LLM to check the claims, and some other things I found along the way.
https://github.com/keeltremor/goldeen
https://doi.org/10.5281/zenodo.19542143If any of this rings a bell please let me know!
🐉 -
#MercrediPromo Le saviez-vous ? Entre autres activités, je vous propose différentes prestations liées aux #partitions de #musique : copie, transcription, #arrangement, #orchestration etc.
Plus d'infos et devis ➡️ https://nicolashussein.fr/prestations/
-
#MercrediPromo Le saviez-vous ? Entre autres activités, je vous propose différentes prestations liées aux #partitions de #musique : copie, transcription, #arrangement, #orchestration etc.
Plus d'infos et devis ➡️ https://nicolashussein.fr/prestations/
-
#MercrediPromo Le saviez-vous ? Entre autres activités, je vous propose différentes prestations liées aux #partitions de #musique : copie, transcription, #arrangement, #orchestration etc.
Plus d'infos et devis ➡️ https://nicolashussein.fr/prestations/
-
Un recueil de partitions bretonnes offert par la mère d'un ami — il était grand temps de lui rendre hommage ! Je ne joue pas (encore) de cornemuse, mais les airs traditionnels sont magnifiques. Venez écouter cette petite histoire et ces mélodies de Bretagne ! #Bretagne #cornemuse #musique #partitions #trad #culture #cadeau #French
https://video.dhamdomum.ynh.fr/videos/watch/7b0c7a10-c9bc-4b44-acb8-1826b3337631 -
Linux Partition Types
Primary: Bootable partitions, max 4 per disk
Extended: Special container that holds logical partitions
Logical: Reside inside extended, unlimited countMBR: Old standard, 2TB limit, 4 primary max
GPT: Modern, >2TB disks, 128+ partitions, UEFI-readyChoose GPT for new systems. Your future self thanks you. 💾
-
Linux Partition Types
Primary: Bootable partitions, max 4 per disk
Extended: Special container that holds logical partitions
Logical: Reside inside extended, unlimited countMBR: Old standard, 2TB limit, 4 primary max
GPT: Modern, >2TB disks, 128+ partitions, UEFI-readyChoose GPT for new systems. Your future self thanks you. 💾
-
#JeudiAutoEdition Redécouvrez aujourd'hui ma #transcription pour #piano de l'une des plus célèbres #partitions de #Brahms : le 3e mouvement de la 3e symphonie ➡️ https://nicolashussein.fr/produit/johannes-brahms-symphonie-n3-3e-mouvement/ (ebook / papier) 😍🎶🎹
-
#JeudiAutoEdition Redécouvrez aujourd'hui ma #transcription pour #piano de l'une des plus célèbres #partitions de #Brahms : le 3e mouvement de la 3e symphonie ➡️ https://nicolashussein.fr/produit/johannes-brahms-symphonie-n3-3e-mouvement/ (ebook / papier) 😍🎶🎹
-
#JeudiAutoEdition Redécouvrez aujourd'hui ma #transcription pour #piano de l'une des plus célèbres #partitions de #Brahms : le 3e mouvement de la 3e symphonie ➡️ https://nicolashussein.fr/produit/johannes-brahms-symphonie-n3-3e-mouvement/ (ebook / papier) 😍🎶🎹
-
#JeudiAutoEdition Redécouvrez aujourd'hui ma #transcription pour #piano de l'une des plus célèbres #partitions de #Brahms : le 3e mouvement de la 3e symphonie ➡️ https://nicolashussein.fr/produit/johannes-brahms-symphonie-n3-3e-mouvement/ (ebook / papier) 😍🎶🎹
-
Rennes : aux Gayeulles-Maurepas, le chantier des Partitions vient de démarrer
Dans un marché rennais où l’accès au logement reste un enjeu majeur, certains programmes cherchent à concilier emplacement,…
#Rennes #FR #France #Actu #News #Europe #EU #actu #Actualités #bretagne #chantier #démarrer #europe #gayeulles-maurepas #partitions #Républiquefrançaise #vient
https://www.europesays.com/fr/755492/ -
https://www.europesays.com/fr/755492/ Rennes : aux Gayeulles-Maurepas, le chantier des Partitions vient de démarrer #actu #Actualités #bretagne #chantier #démarrer #EU #europe #FR #France #GayeullesMaurepas #News #partitions #Rennes #RépubliqueFrançaise #vient
-
#OperatingSystems #Linux #Partitions I'm speculating about replacing this fading computer with a machine running both windows and linux. I'd use linux for the internet while i continue to learn its ways. I'd use windows as a platform to run Word Perfect (not Ford Prefect), and for other familiar programs. Visio, even a standalone MSWord, so I don't have to export .docs from LibreOffice or Word Perfect and hear, "Just send it in; we'll straighten out the formatting." I want to be more everyday-functional than I can if I rely on Libre Office, while I'm stumblingly learning its ways.
I'm familiar with lots of Word Perfect shortcuts, whereas all too often I have to figure out what LibreOffice function or shortcut I've turned on, and how to undo what it's created. Everything has a learning curve.
What I'm not clear about is whether I can keep Windows on my machine but disconnected from the internet, while Linux on the same machine talks to the world.
Have done what I'm contemplating? How did it work? What pitfalls do you see? -
#OperatingSystems #Linux #Partitions I'm speculating about replacing this fading computer with a machine running both windows and linux. I'd use linux for the internet while i continue to learn its ways. I'd use windows as a platform to run Word Perfect (not Ford Prefect), and for other familiar programs. Visio, even a standalone MSWord, so I don't have to export .docs from LibreOffice or Word Perfect and hear, "Just send it in; we'll straighten out the formatting." I want to be more everyday-functional than I can if I rely on Libre Office, while I'm stumblingly learning its ways.
I'm familiar with lots of Word Perfect shortcuts, whereas all too often I have to figure out what LibreOffice function or shortcut I've turned on, and how to undo what it's created. Everything has a learning curve.
What I'm not clear about is whether I can keep Windows on my machine but disconnected from the internet, while Linux on the same machine talks to the world.
Have done what I'm contemplating? How did it work? What pitfalls do you see? -
#OperatingSystems #Linux #Partitions I'm speculating about replacing this fading computer with a machine running both windows and linux. I'd use linux for the internet while i continue to learn its ways. I'd use windows as a platform to run Word Perfect (not Ford Prefect), and for other familiar programs. Visio, even a standalone MSWord, so I don't have to export .docs from LibreOffice or Word Perfect and hear, "Just send it in; we'll straighten out the formatting." I want to be more everyday-functional than I can if I rely on Libre Office, while I'm stumblingly learning its ways.
I'm familiar with lots of Word Perfect shortcuts, whereas all too often I have to figure out what LibreOffice function or shortcut I've turned on, and how to undo what it's created. Everything has a learning curve.
What I'm not clear about is whether I can keep Windows on my machine but disconnected from the internet, while Linux on the same machine talks to the world.
Have done what I'm contemplating? How did it work? What pitfalls do you see? -
#OperatingSystems #Linux #Partitions I'm speculating about replacing this fading computer with a machine running both windows and linux. I'd use linux for the internet while i continue to learn its ways. I'd use windows as a platform to run Word Perfect (not Ford Prefect), and for other familiar programs. Visio, even a standalone MSWord, so I don't have to export .docs from LibreOffice or Word Perfect and hear, "Just send it in; we'll straighten out the formatting." I want to be more everyday-functional than I can if I rely on Libre Office, while I'm stumblingly learning its ways.
I'm familiar with lots of Word Perfect shortcuts, whereas all too often I have to figure out what LibreOffice function or shortcut I've turned on, and how to undo what it's created. Everything has a learning curve.
What I'm not clear about is whether I can keep Windows on my machine but disconnected from the internet, while Linux on the same machine talks to the world.
Have done what I'm contemplating? How did it work? What pitfalls do you see? -
#MercrediPromo Je vous offre toujours -10 % sur mes #partitions papier auto-éditées :
- #Debussy, Arabesques 1 & 2 (orchestration) (conducteur/matériel) + Prélude à l’après-midi d’un faune (piano)
- #Brahms, Symphonie 3 - 3e mvt (piano)
- ma Fantaisie op. 3 (alto, clarinette, piano)
https://nicolashussein.fr/?s=nicolas+hussein&post_type=product#myWork #musique #musiqueClassique #classicalMusic #music #newMusic
-
#MercrediPromo Je vous offre toujours -10 % sur mes #partitions papier auto-éditées :
- #Debussy, Arabesques 1 & 2 (orchestration) (conducteur/matériel) + Prélude à l’après-midi d’un faune (piano)
- #Brahms, Symphonie 3 - 3e mvt (piano)
- ma Fantaisie op. 3 (alto, clarinette, piano)
https://nicolashussein.fr/?s=nicolas+hussein&post_type=product#myWork #musique #musiqueClassique #classicalMusic #music #newMusic
-
#MercrediPromo Je vous offre toujours -10 % sur mes #partitions papier auto-éditées :
- #Debussy, Arabesques 1 & 2 (orchestration) (conducteur/matériel) + Prélude à l’après-midi d’un faune (piano)
- #Brahms, Symphonie 3 - 3e mvt (piano)
- ma Fantaisie op. 3 (alto, clarinette, piano)
https://nicolashussein.fr/?s=nicolas+hussein&post_type=product#myWork #musique #musiqueClassique #classicalMusic #music #newMusic
-
Video of #supermicro #x11 #bios flashing update #bmc #firmware via #efishell & bios using #msdos . Setup of #proxmox . Detailed video https://youtu.be/z6JsDy1YC6w
#x11ast2400 2017 Mainboard setup using setup utility #ipmi . Setup & useful background info #remoteshell #html5 #remotecontrol bmc network configuration to failover #ubuntu for hardware stress testing using #cryptohash #xeonE3_1240 3.7GHz #fan #proxmox #gui #iso #templates #partitions #spice #remotedesktop https://www.youtube.com/shorts/rmhnG48P8Rw -
Video of #supermicro #x11 #bios flashing update #bmc #firmware via #efishell & bios using #msdos . Setup of #proxmox . Detailed video https://youtu.be/z6JsDy1YC6w
#x11ast2400 2017 Mainboard setup using setup utility #ipmi . Setup & useful background info #remoteshell #html5 #remotecontrol bmc network configuration to failover #ubuntu for hardware stress testing using #cryptohash #xeonE3_1240 3.7GHz #fan #proxmox #gui #iso #templates #partitions #spice #remotedesktop https://www.youtube.com/shorts/rmhnG48P8Rw -
Video of #supermicro #x11 #bios flashing update #bmc #firmware via #efishell & bios using #msdos . Setup of #proxmox . Detailed video https://youtu.be/z6JsDy1YC6w
#x11ast2400 2017 Mainboard setup using setup utility #ipmi . Setup & useful background info #remoteshell #html5 #remotecontrol bmc network configuration to failover #ubuntu for hardware stress testing using #cryptohash #xeonE3_1240 3.7GHz #fan #proxmox #gui #iso #templates #partitions #spice #remotedesktop https://www.youtube.com/shorts/rmhnG48P8Rw -
Video of #supermicro #x11 #bios flashing update #bmc #firmware via #efishell & bios using #msdos . Setup of #proxmox . Detailed video https://youtu.be/z6JsDy1YC6w
#x11ast2400 2017 Mainboard setup using setup utility #ipmi . Setup & useful background info #remoteshell #html5 #remotecontrol bmc network configuration to failover #ubuntu for hardware stress testing using #cryptohash #xeonE3_1240 3.7GHz #fan #proxmox #gui #iso #templates #partitions #spice #remotedesktop https://www.youtube.com/shorts/rmhnG48P8Rw -
Video of #supermicro #x11 #bios flashing update #bmc #firmware via #efishell & bios using #msdos . Setup of #proxmox . Detailed video https://youtu.be/z6JsDy1YC6w
#x11ast2400 2017 Mainboard setup using setup utility #ipmi . Setup & useful background info #remoteshell #html5 #remotecontrol bmc network configuration to failover #ubuntu for hardware stress testing using #cryptohash #xeonE3_1240 3.7GHz #fan #proxmox #gui #iso #templates #partitions #spice #remotedesktop https://www.youtube.com/shorts/rmhnG48P8Rw -
#MercrediPromo Le saviez-vous ? Entre autres activités, je vous propose différentes prestations liées aux #partitions de #musique : copie, transcription, #arrangement, #orchestration etc.
Plus d'infos et devis ➡️ https://nicolashussein.fr/prestations/
-
#MercrediPromo Le saviez-vous ? Entre autres activités, je vous propose différentes prestations liées aux #partitions de #musique : copie, transcription, #arrangement, #orchestration etc.
Plus d'infos et devis ➡️ https://nicolashussein.fr/prestations/
-
#MercrediPromo Le saviez-vous ? Entre autres activités, je vous propose différentes prestations liées aux #partitions de #musique : copie, transcription, #arrangement, #orchestration etc.
Plus d'infos et devis ➡️ https://nicolashussein.fr/prestations/
-
#JeudiAutoEdition Redécouvrez aujourd'hui ma #transcription pour #piano de l'une des plus célèbres #partitions de #Debussy : le Prélude à l'après-midi d'un faune ➡️ https://nicolashussein.fr/produit/claude-debussy-prelude-a-lapres-midi-dun-faune/ (ebook / papier) 😍🎶🎹
-
#JeudiAutoEdition Redécouvrez aujourd'hui ma #transcription pour #piano de l'une des plus célèbres #partitions de #Debussy : le Prélude à l'après-midi d'un faune ➡️ https://nicolashussein.fr/produit/claude-debussy-prelude-a-lapres-midi-dun-faune/ (ebook / papier) 😍🎶🎹
-
#JeudiAutoEdition Redécouvrez aujourd'hui ma #transcription pour #piano de l'une des plus célèbres #partitions de #Debussy : le Prélude à l'après-midi d'un faune ➡️ https://nicolashussein.fr/produit/claude-debussy-prelude-a-lapres-midi-dun-faune/ (ebook / papier) 😍🎶🎹
-
Script para crear automáticamente una SD de AGS para PiStorm
El usuario Matt Alexander ha publicado un script que automatiza la preparación de una tarjeta SD para AGS (Amiga Game Selector) en configuraciones con PiStorm. La herramienta está pensada para simplificar un proceso que normalmente requiere varios pasos manuales, especialmente en la parte de particionado y copia de datos.
Al ejecutarlo, el script solo solicita dos datos: la ubicación de la tarjeta SD y la ruta donde se encuentra la instalación de AGS usada en WinUAE. A partir de esa información, realiza el trabajo completo de forma automática. Entre sus funciones se incluye la descarga de una copia de HST Imager, la creación de las particiones necesarias y la copia de los datos a la tarjeta. Además, también coloca el archivo ROM en su ubicación correspondiente utilizando el que el usuario ya tenga disponible, evitando pasos adicionales de búsqueda y configuración manual.
Con este enfoque, el script permite generar una SD lista para usar con AGS en PiStorm de forma más rápida y repetible, reduciendo el margen de error típico al preparar particiones y copiar archivos a mano.
Más info en breve.
-
Script para crear automáticamente una SD de AGS para PiStorm
El usuario Matt Alexander ha publicado un script que automatiza la preparación de una tarjeta SD para AGS (Amiga Game Selector) en configuraciones con PiStorm. La herramienta está pensada para simplificar un proceso que normalmente requiere varios pasos manuales, especialmente en la parte de particionado y copia de datos.
Al ejecutarlo, el script solo solicita dos datos: la ubicación de la tarjeta SD y la ruta donde se encuentra la instalación de AGS usada en WinUAE. A partir de esa información, realiza el trabajo completo de forma automática. Entre sus funciones se incluye la descarga de una copia de HST Imager, la creación de las particiones necesarias y la copia de los datos a la tarjeta. Además, también coloca el archivo ROM en su ubicación correspondiente utilizando el que el usuario ya tenga disponible, evitando pasos adicionales de búsqueda y configuración manual.
Con este enfoque, el script permite generar una SD lista para usar con AGS en PiStorm de forma más rápida y repetible, reduciendo el margen de error típico al preparar particiones y copiar archivos a mano.
Más info en breve.
-
Script para crear automáticamente una SD de AGS para PiStorm
El usuario Matt Alexander ha publicado un script que automatiza la preparación de una tarjeta SD para AGS (Amiga Game Selector) en configuraciones con PiStorm. La herramienta está pensada para simplificar un proceso que normalmente requiere varios pasos manuales, especialmente en la parte de particionado y copia de datos.
Al ejecutarlo, el script solo solicita dos datos: la ubicación de la tarjeta SD y la ruta donde se encuentra la instalación de AGS usada en WinUAE. A partir de esa información, realiza el trabajo completo de forma automática. Entre sus funciones se incluye la descarga de una copia de HST Imager, la creación de las particiones necesarias y la copia de los datos a la tarjeta. Además, también coloca el archivo ROM en su ubicación correspondiente utilizando el que el usuario ya tenga disponible, evitando pasos adicionales de búsqueda y configuración manual.
Con este enfoque, el script permite generar una SD lista para usar con AGS en PiStorm de forma más rápida y repetible, reduciendo el margen de error típico al preparar particiones y copiar archivos a mano.
Más info en breve.