User talk:Gah4

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Subpages[edit]

My subpages

Twisted pair[edit]

Please respond SpinningSpark 20:24, 23 October 2008 (UTC)[reply]

Macintosh revert[edit]

According to the articles I see, the Intel Core processors are x86-based, not IA32. - Denimadept (talk) 06:24, 24 December 2010 (UTC)[reply]

x86 is the name for the instruction set architecture of the 8086 and its descendants. IA32 is the 32 bit extension of that architecture, and, as far as I know, the name preferred by intel. I am not quite up to going through all of wikipedia and changing all the x86's to IA32, though. The naming gets more complicated at 64 bits. The AMD x86-64 was adopted by Intel as EM64T and later Intel64, as IA64 is the Intel name for the architecture of the Itanium processor. Gah4 (talk) 12:59, 26 January 2011 (UTC)[reply]

If IA32 isn't based on the x86 set, I stand corrected. - Denimadept (talk) 16:15, 26 January 2011 (UTC)[reply]


Now you have me confused. IA32 is the Intel name for what most people mean when they say x86. Gah4 (talk) 00:08, 27 January 2011 (UTC)[reply]

Would you please provide a citation to support your assertion that IBM's ASLT used ECL? Jc3s5h (talk) 15:42, 14 April 2015 (UTC)[reply]

In "IBM's 360 and Early 370 Systems", p.108: "Circuit switching times of 4 to 5 nanoseconds were attained with ASLT through the use of current switch emitter-follower circuits and higher-density packaging." There might be other references, but that is the one I have here. Gah4 (talk) 01:43, 16 April 2015 (UTC)[reply]

More details are in "IBM Journal of Research and Development", Volume 11, p. 69 (1967). The PDFs used to be freely downloadable, but now they require an IEEE subscription. Gah4 (talk) 01:46, 16 April 2015 (UTC)[reply]

Would you please add the citations to the article. There is no requirement that sources be accessible on the web; printed journals or electronic journals that require a subscription are fine. But I can't add the citations because I'm not the one who read the articles. Jc3s5h (talk) 02:01, 16 April 2015 (UTC)[reply]


Tape speeds?[edit]

Gah4, I think your note about tape speeds might have come to me in error. I don't know from tape speeds, and I don't remember saying anything about them anywhere. Best wishes, Kotabatubara (talk) 23:30, 8 May 2015 (UTC)[reply]

Disambiguation link notification for August 8[edit]

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited IBM System/360 Model 20, you added a link pointing to the disambiguation page Register. Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 09:25, 8 August 2015 (UTC)[reply]

Counting[edit]

The waveform is sampled at equi-spaced points in time

I suppose some people haven't used Matlab and don't know that they have to start with 1. Or Fortran 77 programmers. Yes it is nicer to start at zero, but the FFT doesn't care. Gah4 (talk) 21:40, 10 August 2015 (UTC)[reply]

reply: BCD (character encoding)[edit]

Sorry it took me a while to get back to you. I just thought the sentence read better without "code", as this is used throughout the article and it sounded repetitious. Feel free to change it back if you don't agree. Peter Flass (talk) 00:45, 22 September 2015 (UTC)[reply]

You have a valid point. But can you add back an example or two from that handbook? Spike-from-NH (talk) 23:58, 13 November 2015 (UTC)[reply]

Hi,
You appear to be eligible to vote in the current Arbitration Committee election. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate, you are welcome to review the candidates' statements and submit your choices on the voting page. For the Election committee, MediaWiki message delivery (talk) 16:19, 23 November 2015 (UTC)[reply]

reply: re Properties of FFT data[edit]

Thank you for your comments on my additions to Fast Fourier transform. I am content that they should be moved elsewhere, if that is a general opinion.
I have no strong feelings on the matter but, personally, I think they should remain where they are for two reasons. Firstly, I do not think that an FFT article should be just about algorithms. I suspect that some people who look up 'FFT' aren't interested in algorithms, butterflies, etc., they just want to know what an FFT is and what it can do.
Secondly, although FFTs and DFTs are closely related, some of the added notes apply specifically to the FFT. Whereas the frequency data in the complex FFT is cyclic, the data in the DFT is periodic, and is displayed not only about zero frequency, but about fs, 2.fs, 3.fs and so on. In addition, the output of a DFT (but not an FFT) can be in analogue form, where it is especially useful in providing an approximate solution to a transform, by numerical methods, when the integral is hard to evaluate analytically. Regards D1ofBerks (talk) 11:01, 1 December 2015 (UTC)[reply]

Shadow Mask[edit]

Thanks for your comment! If you check the diff between my edit and the previous one, you'll notice that I didn't actually add any information: I actually removed information.

So the sentence you mentioned is not by me, and I won't be at all offended if you wish to delete it ; )

InternetMeme (talk) 05:10, 2 May 2016 (UTC)[reply]

Citation Needed tag in the twisted pair article[edit]

Greetings Gah4, I noticed that you are struggling with the Citation Needed tag in the twisted pair article regarding delay skew. The problem is not with SpinningSpark but with whomever put the tag up in the first place. When they do that, they are supposed to make an entry on the talk page as to exactly what needs a citation. They did not do that. Well, there is an entry, but it does not say clearly what needs a citation.

The way forward is to go to the talk page and make a new entry specifically about that paragraph. I have just done that. You can go there and say why you think the Citation Needed tag should be removed. The best case for removal would be by supplying a citation to a reliable secondary source, like a book published by a respected publisher. SpinningSpark is simply preventing the removal without a reason.

Cheers, Constant314 (talk) 01:27, 11 August 2016 (UTC)[reply]

Thanks. The problem is that some people seem to put in random Citation Needed tags. I put in a request for a Citation Not Needed tag, but I don't think we have one yet. One that I haven't figured out in this case, or in general is, does the tag apply to the specific statement, (that something is difficult) or the subject that is being discussed. That is, direct or indirect addressing, in CS terms. I can know that something is hard, without knowing how to do it. Gah4 (talk) 01:54, 11 August 2016 (UTC)[reply]
Thanks again for your interest in this discussion. As I now noted in the Talk page, there is another Citation Needed tag in the same section that I believe does need a citation. In many cases, it should be obvious enough that a citation is needed, and for those cases it doesn't bother me if there is no discussion in the Talk page. As they say for patents, "One knowledgable in the art" should know. The problem, to me, is that someone can in a few seconds add a tag that takes us many hours to work on, for no practical purpose. (That is, so far we don't know that anyone does what the tag I removed is attached to, even after many hours working on it.) There needs to be some process for faster removal of tags that really aren't needed. (Likely along with the paragraph attached to.) Gah4 (talk) 23:57, 11 August 2016 (UTC)[reply]

Re. Cores[edit]

I see your point, but I still think it was correct that multiprocessor machines that didn't use multicore processors aren't described as such. "Core" means more than just "processor". It's assumed that processor means something that's standalone, which cores aren't. "Core" implies that there is sharing of something such as an L3 cache or a set of memory controllers. So to describe a processor as "single-core" doesn't make sense (and I think that the literature would simply just describe such processors as processors). Re. the use of modern n-core terminology to multiprocessor that predate multicore processors, I agree it sounds strange. And if it's of concern, I looked at the diff and I'm sure I didn't change the description of any entry that shouldn't have been changed. L9G45AT0 (talk) 14:26, 14 August 2016 (UTC

Signed Number Representations[edit]

Ah, thanks for the reminder. I forgot about that, I haven't taken comp sci but for the early courses required for engineering. I should've checked more thoroughly because part of my decision was based on that not only was it no where else in that article but it wasn't on the two's compliment article anywhere either. Anyway, good save. Penitence (talk) 22:43, 23 August 2016 (UTC)[reply]

Still, it could confuse others, so it should be explained somewhere. Gah4 (talk) 22:49, 23 August 2016 (UTC)[reply]

August 2016[edit]

Information icon Welcome to Wikipedia. Everyone is welcome to contribute constructively to the encyclopedia. However, talk pages are meant to be a record of a discussion; deleting or editing legitimate comments is considered bad practice, even if you meant well. Even making spelling and grammatical corrections in others' comments is generally frowned upon, as it tends to irritate the users whose comments you are correcting. Take a look at the welcome page to learn more about contributing to this encyclopedia. Thank you. Andy Dingley (talk) 09:19, 25 August 2016 (UTC)[reply]

Kodak Tri-X[edit]

Have you a source for this film being discontinued? - Denimadept (talk) 01:55, 30 October 2016 (UTC)[reply]

Good question. I just changed the formatting, I didn't add it. I think you are right, so it shouldn't be there.
I started discussion on the talk page. But note that the film now is 400TX, which isn't the same as old Tri-X. There are even different development times. Gah4 (talk) 02:35, 30 October 2016 (UTC)[reply]
All films change over time. If they're still calling it TX, which was the type pre-exposed on the film, then it's still Tri-X even if it's a different formulation. I don't know what the photochemists who worked on the film would say, but the name "Tri-X" and "400TX" is marketing. Tri-X has changed speeds over the time, but the basic concept remains the same. It's a fast B&W film requiring very simple processing. - Denimadept (talk) 03:15, 30 October 2016 (UTC)[reply]

ArbCom Elections 2016: Voting now open![edit]

Hello, Gah4. Voting in the 2016 Arbitration Committee elections is open from Monday, 00:00, 21 November through Sunday, 23:59, 4 December to all unblocked users who have registered an account before Wednesday, 00:00, 28 October 2016 and have made at least 150 mainspace edits before Sunday, 00:00, 1 November 2016.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2016 election, please review the candidates' statements and submit your choices on the voting page. MediaWiki message delivery (talk) 22:08, 21 November 2016 (UTC)[reply]

Share your experience and feedback as a Wikimedian in this global survey[edit]

References

  1. ^ This survey is primarily meant to get feedback on the Wikimedia Foundation's current work, not long-term strategy.
  2. ^ Legal stuff: No purchase necessary. Must be the age of majority to participate. Sponsored by the Wikimedia Foundation located at 149 New Montgomery, San Francisco, CA, USA, 94105. Ends January 31, 2017. Void where prohibited. Click here for contest rules.

Sign of R in Ohm's law[edit]

I have hatted the discussion with you on the coupling coefficient talk page as it is really tangential to the issues there. We can continue the discussion here. You wrote

This is obviously not true. If you use V=IR, and change the sign of one of V or I, and not both, the sign of R changes. I suspect, though, that people try harder to define V and I such that R is positive.

Let's take this example (please excuse the ugly ascii art)

         I
    o---->----|
              |
              |       /\
              _       |
            |  |      |
            |  | R    | V
            |  |      |
             -        |
             |        |
             |        
    o--------

By Ohm's law, V/I = R. So far so good. If I define I in the opposite direction then I have to write V/(−I) = R because I is no longer the current going into the resistor relative to the direction V has been defined in. This still results in a positive value for R because I will take on a negative value when V is positive. A similar results is obtained if the voltage is defined in the opposite direction. To write V/I = R for these situations is simply wrong. Ohm's law is not the ratio of any old voltage and current, it is the ratio of the applied emf and the current driven by the source. That is, the current has to come out of the source and in to the load. The fact that you obtain a negative result is itself enough to show that that is wrong because it is unphysical (before you point it out, I am aware of negative resistance, but that is a different thing from Ohm's law). SpinningSpark 12:03, 17 January 2017 (UTC)[reply]

I don't have much doubt that you understand. Yes, as you note not counting negative resistance, the result has to be physical. The case that I am indicating comes when you first write down the equations, and then put in the values. If, for example, you write a problem in matrix form, you might find that there are negative values in the matrix, though the resistance is positive. In your ascii art, if I ask for V/I then the result is "-R", a negative number representing a positive resistance. Gah4 (talk) 14:03, 17 January 2017 (UTC)[reply]
Well if you define a matrix in a random way, then of course you can get negative values, but that doesn't mean that a matrix element actually "represents" a positive resistance. You have just gone and defined something that has no physical reality (but obviously it is related to the physically real quantity). When we set up the matrix for a two-port we always define the currents in a consistent way – going in to the port. A one-port is an even simpler case of that (a resistor by itself is a one-port). Following this rule will always give the correct sign for the port driving point impedance. A result that contradicts Joule's law, conservation of energy, and the third law of thermodynamics just has to be an incorrect result. SpinningSpark 15:20, 17 January 2017 (UTC)[reply]

Xerox Alto and Category:Retrocomputing[edit]

Of course the Xerox Alto is a historically important machine, but is that what retrocomputing means? It's a vague term; usually the definition is somewhere in the vicinity of old computer hardware that people keep running for nostalgia reasons or develop for as a hobby. The Alto doesn't have much hobbyist support, as far as I can tell. Dgpop (talk) 03:47, 21 February 2017 (UTC)[reply]

It happens that I know some of them. The http://www.livingcomputermuseum.org has some actual machines, and some emulated machines, connected up to 3 Mb/s ethernet, through a bridge to the Internet. In its prime, the Alto wasn't produced in large numbers, but was very popular with those who had one. As I noted, it was one of the original GUI machines, but also where Ethernet originated. There are two emulators, SAlto, and ContrAlto. All the software was released to the computer history museum, which makes it much more useful for retrocomputing, but that was only a few years ago. I put a note in talk:Retrocomputing about it. Gah4 (talk) 04:24, 21 February 2017 (UTC)[reply]

Your feedback matters: Final reminder to take the global Wikimedia survey[edit]

SHA-1[edit]

Please see Talk:SHA-1#.22Announced_an_attack.22_vs_.22performed_an_attack.22. Smyth (talk) 14:30, 5 March 2017 (UTC)[reply]

Punched card citation[edit]

The IBM 1401's card reader could be used in Column Binary mode, which stored two characters in every column, or one 36-bit word in three columns when used as input device for other computers. However, most of the older card punches were not intended to punch more than 3 holes in a column.----------- this sentence is probably correct, and refers to machines such as the 514, not keypunches -so it need clarification. IBM didn't generate more than 3 punches/column thus no reason to build machines for lace cards- repeated firing of all 80 relays wasn't anticipated ------

The multipunch key is used to produce binary cards, or other characters not on the keyboard. -- Here's citation; ---- IBM OPerator's Guide, 22-8484-3 1955 Type 24 Card Punch, page 18. " Multiple digits may be punched manually in one column by holding the space bar down while the keys are depressed. On some machines, a multiple punch key is supplied for this purpose".....Enjoy, {{citation needed|date = March 2017 73.71.159.231 73.71.159.231 (talk) 06:15, 20 March 2017 (UTC) — Preceding unsigned comment added by 73.71.159.231 (talk) 06:10, 20 March 2017 (UTC)[reply]

April Fools' Day[edit]

You don't seem like the type who would do something like this for no apparent reason. Makes me wonder if your account has been compromised. -- ChamithN (talk) 06:53, 1 April 2017 (UTC)[reply]

PL/I(F)[edit]

I don't disagree with your edit, however I believe that in the compiler as distributed the phases were linked as overlays, so loading one overlayed the previous. Actually there were at least two layers of overlays, so there were main overlay phases and subphases that were also overlays of each other. I think it was a usermod to link the compiler as one executable without overlays. Peter Flass (talk) 08:04, 8 June 2017 (UTC)[reply]

Having not thought about this in detail for some years, I believe it uses LINK, LOAD and/or XCTL to do what IBM calls dynamic overlays. That is unlike the static overlay used, for example, by Fortran H. As well as I know it, again it is many years, with LINK the OS decides which to keep in memory and which not to. In 44K, I suspect that each one overwrites the previous, but with more memory it doesn't have to. (The article describes this along with the ability to run in 44K.) I suspect that you understand LINK better than I do. They are all separate load modules, maybe 100 of them, not just a single load module with overlays like Fortran H. Gah4 (talk) 15:20, 8 June 2017 (UTC)[reply]
Thinking about it some more I believe you're right. It pretended to be overlays. Once you got to larger memories and could putbthe modules in LPA I believe it ran much faster. Peter Flass (talk) 21:03, 8 June 2017 (UTC)[reply]
It does LINK and LOAD and DELETE. In some cases, it keeps the disk address for a module, to speed up access. Some might be only needed once, and so are DELETEd. Yes LPA should speed it up. Without them in LPA, I don't know how it does it. It sounds like it knows if it is small memory, and does things differently. What I forget is, with LINK, when the OS removes them from memory and when it doesn't. Gah4 (talk) 22:50, 8 June 2017 (UTC)[reply]

ArbCom 2017 election voter message[edit]

Hello, Gah4. Voting in the 2017 Arbitration Committee elections is now open until 23.59 on Sunday, 10 December. All users who registered an account before Saturday, 28 October 2017, made at least 150 mainspace edits before Wednesday, 1 November 2017 and are not currently blocked are eligible to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2017 election, please review the candidates and submit your choices on the voting page. MediaWiki message delivery (talk) 18:42, 3 December 2017 (UTC)[reply]

discontinued - continued.[edit]

Hello, Gah4. You have new messages at Nczempin's talk page.
You can remove this notice at any time by removing the {{Talkback}} or {{Tb}} template.

aho corasick algorithm page[edit]

Hi again,

https://en.wikipedia.org/wiki/User_talk:Matannnn#patterns Mathematically speaking, a word is also a pattern, but I think using the word "pattern" in the context of introducing aho-corasick is quite almost wrong or misleading.

I'm new to Wikipedia talk so sorry if my message here is posted against convention (the UX here is kind of IRC age quality...).

Matan

(you forgot to sign your message with four tildes)

As well as I know it, the convention in CS is to call it a pattern, and the field is called pattern matching. Word is a special case of pattern matching. The problem I was working on when I learned about Aho-Corasick uses DNA sequences and not words of human speech. The problem is general, though often used for actual words. More specifically, look up combinatorial pattern matching. Gah4 (talk) 12:14, 13 January 2018 (UTC)[reply]

Speed of Electricity Discussion Invitation[edit]

Greetings Gah4,

Hazyj and I are having a discussion about this topic on my talk page. Feel free to join. It is the last topic on the page, right now. Constant314 (talk) 23:33, 16 March 2018 (UTC)[reply]

Disambiguation link notification for April 14[edit]

Hi. Thank you for your recent edits. An automated process has detected that when you recently edited Electric charge, you added a link pointing to the disambiguation page Mole (check to confirm | fix with Dab solver). Such links are usually incorrect, since a disambiguation page is merely a list of unrelated topics with similar titles. (Read the FAQ • Join us at the DPL WikiProject.)

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 09:21, 14 April 2018 (UTC)[reply]

Thanks for "produces"[edit]

Thanks for "produces" heat in electric current -- better than "releases", which was there before. My longer version simply attempted to make the mechanism clear - but no problem with the shorter one.Sdc870 (talk) 09:23, 22 April 2018 (UTC)[reply]

FM invention[edit]

Hi... You reverted my change on the grounds that Armstrong invented "wide band FM" which is significantly different from Idzerda's invention. I disagree that it's significantly different. It's the same transmission scheme; wide vs. narrow is a difference in degree, wider bandwidth makes for greater signal quality at the expense of increased spectrum occupancy. But it's FM either way. In addition, as I noted in a comment on the FM modulation article where that same comment was made, I disagree that what Armstrong invented is specifically wide band FM. His earliest patents are clearly narrowband, given that they describe (in a somewhat muddled way) a modulation index near one. Paul Koning (talk) 19:02, 14 June 2018 (UTC)[reply]

I also changed the text so that it says that Armstrong invented wide-band FM, instead of just FM. Since wide-band FM is what we call FM today, it seems significant. I didn't try to trace back whether Armstrong knew about Idzerda, which might matter for patent rights. Greater signal quality, as far as I know, is the reason Armstrong wanted FM. I suspect that he didn't know about capture effect, though. The increased spectral width dilutes the effects of noise. Could Idzerda have invented wide-band? I don't know. Find some references about it. This was about the time that the ability to work with frequencies high enough became available. Discuss on the talk page (maybe you did) about this. I suspect, though, that a lot more sources credit Armstrong, even if they are technically wrong. (I have lost many discussions where I knew something was right, but the popular sources disagreed.) It would not have been politically popular to put a wide-band FM signal in place of the AM band. That would reduce the number of stations by a factor of about 20, besides forcing everyone to throw away their radios. Note that the initial band that Armstrong used was taken away, making the radios of early users worthless, but those were much fewer than outstanding AM receivers. As well as I understand it, though I didn't try all that hard, Idzerda relied on existing receivers detuned to demodulate his FM. But the FM advantage as we know it, was already lost. But discuss in talk to see what the consensus says. Gah4 (talk) 20:05, 14 June 2018 (UTC)[reply]
Note in addition that the page mentioned is FM broadcasting not Frequency modulation. Wide-band is specifically what is used in the former. You might see about changes to the latter. Gah4 (talk) 20:16, 14 June 2018 (UTC)[reply]
Thanks. I have some answers to some of the issues you mentioned; I'll bring them to the article talk page. On spectrum occupancy, remember that Idzerda was running what appears to be the world's first commercial broadcast station (starting 1919). So greater bandwidth was hardly an issue yet. He used existing radios; FM can be received (without the noise benefits, however) using slope detection.
As for popular sources, maybe, but that's not the Wikipedia way supposedly. The historic record is quite clear about what Idzerda did, for one thing he has both Dutch and US patents (from 1922 and 1927 respectively). The interesting question is what the differences are, and -- if it can be learned -- whether they knew of each other's work. So far I see no evidence that they knew. Paul Koning (talk) 01:29, 15 June 2018 (UTC)[reply]
I have noticed that many things are invented just a little bit earlier than they should have been. Before the technology was quite ready. Wide band FM below 1MHz might just not be obvious enough, and the available tubes likely didn't go high enough. Armstrong was specifically trying to reduce noise, and believe that a whole new system would be viable, along side the AM broadcast band. It is almost surprising today, to consider that the ancient technology AM band is still around. Why not dump it, the same way as analog TV was dumped? Exactly why Armstrong came up with wide-band, and Idzerda didn't, I don't know. Maybe you can find some WP:RS to explain it. It does seem that it might go into Frequency modulation, though you should probably discuss it in the talk page there. Gah4 (talk) 01:54, 15 June 2018 (UTC)[reply]

Search[edit]

Special:Search.


-Moxy (talk) 04:41, 19 June 2018 (UTC)[reply]

Edit-warring discussion re. User:FF-UK[edit]

Hello Gah, I thought it best to let you know that I have reported User:FF-UK for edit-warring on Mains electricity by country (see Wikipedia:Administrators'_noticeboard/Edit warring#User:FF-UK reported by User:CplDHicks2 (Result: )), but really this is encompassing all of his past behaviour. Please comment as you see fit. Thanks. CplDHicks2 (talk) 05:47, 9 July 2018 (UTC)[reply]

I have had various disagreements, and some have done sock-puppet investigations. Otherwise, I don't know. Gah4 (talk) 06:01, 9 July 2018 (UTC)[reply]
You've always been a peacemaker, Gah, which I appreciate; you don't have to comment if you don't want to. I just wanted to let you know that the discussion is there. :) Cheers, CplDHicks2 (talk) 06:07, 9 July 2018 (UTC)[reply]
Well, I have had some disagreements with you, too: [1] for example. Statements like As such I removed them, and they will stay removed. Isn't especially conducive to working together. Gah4 (talk) 07:18, 9 July 2018 (UTC)[reply]

ArbCom 2018 election voter message[edit]

Hello, Gah4. Voting in the 2018 Arbitration Committee elections is now open until 23.59 on Sunday, 3 December. All users who registered an account before Sunday, 28 October 2018, made at least 150 mainspace edits before Thursday, 1 November 2018 and are not currently blocked are eligible to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2018 election, please review the candidates and submit your choices on the voting page. MediaWiki message delivery (talk) 18:42, 19 November 2018 (UTC)[reply]

Double !vote[edit]

In the discussion at Alkali metal, you have changed your !vote from 'neutral' (timestamp 07:49) to 'oppose' (22:14). This may be confusing and contradicting. I suggest for clarity, you make clear below the first post that your !vote has changed, possibly with a reference to other posts. You could write, like:

Neutral changed to Oppose, see posts below re Dirac66. ~~~~ [rest of first post unchanged here]

-DePiep (talk) 06:57, 7 March 2019 (UTC)[reply]

Thanks. Since they were specifically not votes, I wasn't worried, but I will change as you say. Gah4 (talk) 08:03, 7 March 2019 (UTC)[reply]

Copylink vios at IEEE 754[edit]

Inserting WP:COPYLINKs can get you blocked from editing. Earlier editors, such as Dmcq have already opined that the link violates IEEE's copyright. Glrx (talk) 20:45, 8 March 2019 (UTC)[reply]

Well I'd certainly count links to the standard as that, they want to be payed for their copyright work and it should not be distributed for free. However I don't know if access to the working party drafts are supposed to be restricted, I think they may not be. People pay for the proper up to date standard rather than something which can differ at odd places from it. I believe Vincent Lefèvre is a participant in defining the IEEE floating point standards, he can probably check to give the definitive answer. Dmcq (talk) 21:10, 8 March 2019 (UTC)[reply]
I don't know about Vincent Lefèvre, I heard it from David Hough, [email protected], who is, or at least was, the chair of 754WG. I sent e-mail to the address on the SOA for ucbtest.org, and he replied. I also wrote to Kahan, but no reply from him. I suppose I could ask for a signed and notarized statement, but I don't think he would be too happy about doing that. Gah4 (talk) 21:25, 8 March 2019 (UTC)[reply]
It's normal for the authors to share a copy of the drafts even if IEEE claims exclusive copyright on the final version. As with preprints of academic papers, the authors often place a copy on their personal website but it's better to use an institutional repository for durability (the curators also check copyright status). I see he published as Oracle employee though, so he probably doesn't have one such repository and would need to use either a wider repository like Zenodo or arxiv or the institutional repository of some university co-author. Nemo 06:18, 10 April 2019 (UTC)[reply]
It seems that ucbtest.org is owned by either David Hough or 754WG. It looks like its purpose is to distribute IEEE754 test suites, which I suspect gave its name ucbtest. Sun used to have places to distribute public software. I don't know if Oracle kept up with that. Zenodo used to be on the blacklist, rumors are that it isn't any more. Gah4 (talk) 08:13, 10 April 2019 (UTC)[reply]

Community Insights Survey[edit]

RMaung (WMF) 16:38, 10 September 2019 (UTC)[reply]

Reminder: Community Insights Survey[edit]

RMaung (WMF) 15:39, 20 September 2019 (UTC)[reply]

A barnstar for you![edit]

The Original Barnstar
For contributions to technical articles ~Kvng (talk) 17:26, 20 September 2019 (UTC)[reply]

Reminder: Community Insights Survey[edit]

RMaung (WMF) 20:40, 3 October 2019 (UTC)[reply]

ArbCom 2019 election voter message[edit]

Hello! Voting in the 2019 Arbitration Committee elections is now open until 23:59 on Monday, 2 December 2019. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2019 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:08, 19 November 2019 (UTC)[reply]

A conundrum for you.[edit]

Following our discussion on units: I have put this here because it is completely irrelevant to the talk page discussion.

Which is heavier: a pound of gold or a pound of feathers?

Answer tomorrow or earlier if you answer and I see it. 86.164.61.122 (talk) 14:18, 23 November 2019 (UTC)[reply]

I knew about this one a long time ago, I believe in high school years, but had to look it up to see. From troy weight: The British Empire abolished the 12-ounce troy pound in the 19th century, though it has been retained (although rarely used) in the American system. If you read in more detail, the US Troy ounce has the same value (weight) as the British Imperial Troy ounce, but I don't believe the same name. That is, the US version isn't Imperial (in name), but just Troy. So, OK, the pound of feathers is heavier as long as you are in the US, or maybe your gold is more than 200 years old. Thank! Maybe there should be Fun with units! Gah4 (talk) 01:00, 24 November 2019 (UTC)[reply]
You got it! The troy system is still very much in use, so the pound of feathers is heavier. All precious metals are still weighed in troy pounds and ounces in places that do not weigh them in grammes (and there are quite a few metric countries that still weigh gold and silver in troy weight - Switzerland springs instantly to mind). I even have some electronic scales that weigh in both avoirdupois ounces and troy ounces (and troy pennyweight). I have little doubt that these same made in China scales are sold in the US, so they will weigh avoirdupois and troy ounces equally differently in the US.
Incidentally, not so well known is that explosives were also weighed in troy pounds and ounces unless you had a large enough quantity in which case you had to revert to avoirdupois tons as there is no troy measure larger than the pound. Nowadays, metric countries weigh them in metric units. 86.164.61.122 (talk) 13:53, 24 November 2019 (UTC)[reply]

Merry Christmas!![edit]

Hi Gah4, thanks for all you do on Wikipedia, and for all your help at lighting-related articles. My you have a wonderful Christmas and a Happy New Year. (and if you don't celebrate Christmas please feel free to take that as a Happy Hanukkah, a great Dhanu Sankranti, a blessed Hatsumode, or whatever holiday you want to insert there.) Zaereth (talk) 08:55, 25 December 2019 (UTC

Notice

The article Color Developing Agent 4 has been proposed for deletion because of the following concern:

Not notable.

While all constructive contributions to Wikipedia are appreciated, pages may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the {{proposed deletion/dated}} notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the page to address the issues raised. Removing {{proposed deletion/dated}} will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. Qono (talk) 04:27, 10 January 2020 (UTC)[reply]

Notice

The article Color Developing Agent 3 has been proposed for deletion because of the following concern:

Not notable.

While all constructive contributions to Wikipedia are appreciated, pages may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the {{proposed deletion/dated}} notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the page to address the issues raised. Removing {{proposed deletion/dated}} will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. Qono (talk) 04:27, 10 January 2020 (UTC)[reply]

Danger of IPv6[edit]

So, why did you remove chapter "Danger of IPv6" from IPv6 article? — Preceding unsigned comment added by Acbaile5 (talkcontribs) 22:06, 30 March 2020 (UTC)[reply]

Discuss on the talk page, hopefully others will also come along. And don't forget to sign with four tildes, talk page writing. Gah4 (talk) 22:09, 30 March 2020 (UTC)[reply]

Locate mode and Move mode input/output[edit]

Interesting, but is this enough for an article? It might be combined with discussion of other techniques such as memory-mapped I/O, Multics "everything is a segment", and any others. Peter Flass (talk) 17:03, 23 April 2020 (UTC)[reply]

Locate mode works both at low level and higher level. It is supported by PL/I, I believe COBOL, and, it seems, from CMS Pipelines. I don't know much about Multics at all. I suppose memory-mapped I/O, as it is visible from high-level languages. Gah4 (talk) 18:57, 23 April 2020 (UTC)[reply]
From what I know about Multics you don't open a file, you "initiate" the segment, and then after that it's strictly memory-mapped. I wish I had more time to play with Multics.Peter Flass (talk) 20:10, 23 April 2020 (UTC)[reply]
So this is the way they do it in high-level languages, or is this the low-level implementation? Since locate mode is visible to the user in high-level languages, it seems more reasonable to have its own page. Do we need a page on, for example, QSAM, which I believe also have an option for locate mode? Gah4 (talk) 08:53, 24 April 2020 (UTC)[reply]
OK, there is a page for QSAM but it doesn't mention locate mode. I suspect that locate mode is more interesting, this is, in need of an article, than QSAM. Gah4 (talk) 08:56, 24 April 2020 (UTC)[reply]

Maybe in Data buffer I could write something about buffering techniques in OS/360, and include this also. Peter Flass (talk) 13:22, 30 April 2020 (UTC)[reply]

I suppose that would be a good place. I was hoping to be more general than just OS/360, but it does seem to be a lot art. Well, it is a little harder with FBA disks, as the block boundaries don't match the record boundaries, but it should still be possible to arrange for one fewer copy operation. OS like Unix and Windows keep, somewhere, a buffer of disk blocks, and then copy data to/from those blocks before/after writing/reading them. And the user program, in the usual case, copies data to/from its own buffer. Gah4 (talk) 16:31, 30 April 2020 (UTC)[reply]
It also reminds me of a feature in IP networking that never caught on, called trailers. In the usual case of a TCP/IP stack, TCP fills up a buffer, which it puts a TCP header on. Then it passes it to IP, which puts the IP header on, usually copying. Since buffers usually have space at the end, but not the beginning, there was an idea to put the TCP and IP headers on at the end, instead of the beginning, which would save some copy operations. It might be that someone figured out a way around that, though. Similar in that it tries to avoid excessive data copying. Gah4 (talk) 16:31, 30 April 2020 (UTC)[reply]

Does Linux copy? It should be possible to just remap the buffer from kernel space to user space. I keep forgetting to look this up. The C RTL might copy data or just move the pointer, depending on the API. Peter Flass (talk) 21:00, 30 April 2020 (UTC)[reply]

I pretty much don't know the internal of Linux at all. You can only remap whole pages on page boundaries. C has the lower level I/O routines fread() and fwrite() which read or write a buffer of a given length. That pretty much implies copying it. At the system-call level, there are the unix (not C library) routines read() and write() that read/write data to/from a given buffer address. In the case of 9 track tape, and other tape systems that allow variable block size, read() and write() will read/write whole blocks. In the case of disks, other than raw disk I/O, they have to go through the file system buffer. There is no alignment requirement for the buffer. I suppose the system could be designed for page-aligned, page-length buffers to remap, and higher level systems that know about it could do that. I believe I remember systems from the 1970's where direct access I/O was always in multiples of 512 bytes, or in the case of the PDP-10, 128 36 bit words, but Unix and Windows allow direct access on arbitrary boundaries, so it must go through a disk block buffer. This is the big advantage of CKD disks. That you can make disk blocks any size you want, and read/write directly from/to disk. Gah4 (talk) 00:02, 1 May 2020 (UTC)[reply]
OK, I just found the page Zero-copy which seems to be the modern term for it. Mostly it seems to describe network I/O, and not disk I/O though. Maybe the appropriate description of locate-mode could go there, and a redirect to it? Gah4 (talk) 00:24, 1 May 2020 (UTC)[reply]
(aside) Zero-copy says " a program could instruct the channel subsystem to copy blocks of data from one file or device to another without the nucleus having to copy the data to an intermediate buffer." I'm not sure this was ever true. Peter Flass (talk) 16:19, 1 May 2020 (UTC)[reply]
I suspect that I don't know the details all that well, but as far as I know, the nucleus never copies data. Access methods run in user space and problem state, so they don't count as nucleus. To avoid as much as possible, consider a program with one buffer, use EXCP to read a block into it, and EXCP to write the block out somewhere else. Now put that into a loop. No copying by the nucleus or user. But I think mostly locate-mode is important, as it can be done at a higher level. Consider a Fortran program to copy some data from one file to another. A read/write loop will copy data from an input buffer into an array in the program, then, to an output buffer. A PL/I program could use locate-mode for one, and move-mode for the other, so only one copy. I believe Fortran uses BSAM and PL/I uses QSAM, if that matters. Does move-mode QSAM do a copy inside the access method routine? Gah4 (talk) 17:42, 1 May 2020 (UTC)[reply]

"Opteon" listed at Redirects for discussion[edit]

A discussion is taking place to address the redirect Opteon. The discussion will occur at Wikipedia:Redirects for discussion/Log/2020 May 18#Opteon until a consensus is reached, and anyone, including you, is welcome to contribute to the discussion. signed, Rosguill talk 18:35, 18 May 2020 (UTC)[reply]

Re LIGO[edit]

Yeah, no worries re the LIGO edit. It's complicated by both the lack of clarity in the LIGO article - reading deeply, it seems that the 1994 'start' was really several years of administrative wrangling rather than actual construction - as well as the lack of specific details on LIGO's own website. 1999 seems like a reasonable compromise, but a compromise it is. The precise date - or even year - really isn't that important in the overall scheme of things, I think. Cheers. Anastrophe (talk) 19:17, 25 June 2020 (UTC)[reply]

Either SLAC or LIGO people can change it. I had thought, from reading LIGO, that it was 1990-1994 building the building, and after that building the insides. (The latter takes longer.) I am in Seattle, and two years ago went out to see LIGO west. I have known about it for a long time, having actually gone to a Kip Thorne lecture about it once, but haven't thought about the building schedule. Gah4 (talk) 19:58, 25 June 2020 (UTC)[reply]

Delta transformers[edit]

Getting pretty far off topic for Talk:Three-phase electric power, but delta secondaries are commonly used in arc furnace transformers, rectifiers, and other places that take advantage of the lower winding current compared to terminal current of a delta connection. Sometimes power distribution transformers have a"buried" delta winding, used to control harmonic currents and to stabilize line to ground voltages on certain faults. But how much of all electrical engineering can we include in this one article? --Wtshymanski (talk) 00:20, 19 August 2020 (UTC)[reply]

The reason I thought about it was the mention of parallel transformers. Yes, I don't know how much is needed for the article, which is why I put it in the talk page to discuss. Gah4 (talk) 00:25, 19 August 2020 (UTC)[reply]

Neutralisation[edit]

Posted here as it irrelevant (like most of your discussion) to the Regency TR-1.

Neutralisation is a subject in which I have a good level of experience and design knowledge.

I had the job of designing a variable frequency oscillator operating from 1 to 36 GHz for the purposes of testing a radar for resistance to jamming. For this purpose a large klystron was required (solid state devices not being able to withstand the 2 kW transmitter pulse from the radar). A klystron in this application is fundamentally a disc seal triode operating in a variable sized cavity. It was necessary to neutralise the Miller capacitance, though the phase and magnitude of the signal on the klystron's anode varied widely as the cavity was tuned over the range. The design ended up with a number of cams on the tuning shaft which continuously varied the magnitude and phase of the neutralisation, not to mention the anode voltage and the oscillation mode of the klystron. Setting all this up was a nightmare. Luckily, only the one was required. 86.164.169.96 (talk) 14:44, 20 October 2020 (UTC)[reply]

If you are still interested in klystron design, you might see: https://accelconf.web.cern.ch/pac97/papers/pdf/9C004.PDF. Gah4 (talk) 04:04, 2 November 2020 (UTC)[reply]

Hamiltonian mechanics[edit]

Hi, this is totally random, but I happened to see your response to a question on the talk page at Talk:Hamiltonian where you said "so some say" qualifying it as an improved formulation of CM. Why did you put it that way? Just curious, everyone I know greatly prefers Lagrangian and Hamiltonian mechanics vs Newtonian, it is far simpler once you know what you're doing. The only argument I know of against it is that it is less intuitive. Again, just curious, thanks! Footlessmouse (talk) 02:43, 2 November 2020 (UTC)[reply]

Oh, mostly just trying to be WP:NPOV there. I suppose I believe that for many problems plain Newtonian methods are fine, but for some the other ones get the answer faster. Gah4 (talk) 03:56, 2 November 2020 (UTC)[reply]

ArbCom 2020 Elections voter message[edit]

Hello! Voting in the 2020 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 7 December 2020. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2020 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 01:31, 24 November 2020 (UTC)[reply]

December 2, 2020[edit]

The talk page at Industrial and multiphase power plugs and sockets is for discussing improvements to that article, which is about plugs and sockets. A digression on collections of light bulbs is off-topic there. A little thought and you may recall that a neutral connection is not required if no line-to-neural voltages are used; you could have three loads, say 1 ohm, 2 ohms, and 3 ohms, connected across each pair of A B C phases, the result would be unbalanced loads, different currents in each phase, but no requirement for a neutral at all. For example, I worked in an industrial plant with an abundance of 3-phase outlets which were used indifferently for cooling fans (nearly balanced motor load) or single-phase welding machines, bout as far from a balanced load as there is. No neutral was required as neither of these applications needed a phase to neutral voltage. --Wtshymanski (talk) 01:33, 3 December 2020 (UTC)[reply]

The Internet capitalisation proposal on the MoS talk page[edit]

Hi,

Just wondering – since you've commented in support of my proposal (I think?) would you mind adding something to the Survey section as well about it? If you don't want to give a formal response, that's fine, but so far the majority of text is in the Discussion section. I'd like it to be obvious to whomever (or should that be whoever?) is going to close it which option each person who participated was for :) Regards, DesertPipeline (talk) 05:05, 20 February 2021 (UTC)[reply]

Information icon Hello, Gah4. This is a bot-delivered message letting you know that Draft:Leakage current detector interrupter, a page you created, has not been edited in at least 5 months. Draft space is not an indefinite storage location for content that is not appropriate for article space.

If your submission is not edited soon, it could be nominated for deletion under CSD G13. If you would like to attempt to save it, you will need to improve it. You may request userfication of the content if it meets requirements.

If the deletion has already occured, instructions on how you may be able to retrieve it are available here.

Thank you for your submission to Wikipedia. FireflyBot (talk) 08:01, 20 March 2021 (UTC)[reply]

Did you really mean to edit Direct-access storage device?[edit]

Did you really mean to put And often enough the term is disk. Well, disk drive goes back to the days of mountable disk packs, where the storage was separate from the source of rotational power. In the earliest days of personal computers, including IBM, floppy disks and floppy disk drives were what people got to know. In any case, I suspect that disk is now the generic synonym for any non-sequential access storage device, and more specifically flash memory based devices. It might even be the WP:COMMONNAME by now. in Direct-access storage device rather than in Talk:Direct-access storage device?

BTW, disk goes back half a decade before mountable disk packs. Shmuel (Seymour J.) Metz Username:Chatul (talk) 00:46, 14 May 2021 (UTC)[reply]

Repository of IBM announcement letters[edit]

From a recent message on the IBM-MAIN listserv

IBM currently provides access to all IBM announcement letters starting from January 1, 1976, from this Web site:

https://ibm.com/common/ssi

As a random example, at that site you can find IBM U.S. Announcement #285-045 dated February 12, 1985, and entitled "VM/XA Migration Aid Release 2 Enhancements." You can search by product name, program number, or just about any keyword. There's also a link to a beta version of the site with a new user interface. The new UI seems to be a little easier to use for these purposes since it's easier to restrict a search to a particular date range.

Shmuel (Seymour J.) Metz Username:Chatul (talk) 10:04, 14 May 2021 (UTC)[reply]

hex dump[edit]

Please just give me a few minutes to finish up.DGerman (talk) 19:53, 25 June 2021 (UTC) Done ( for now anyway) DGerman (talk) 20:05, 25 June 2021 (UTC)[reply]

Looks good to me. I have been using od -x since before all the others existed. On this OS X system, od and hexdump are exactly the same program, with different names. It checks the name it was called and acts appropriately. On my FreeBSD system, they are hard links to the same file. (On OS X, two different files.) On linux, it seems that they are very different size. I don't know why that is. One thing, though. The default for any of them on unix-like systems is to print the values of 16 bit words (octal, hex, or other base). That makes the bytes backwards on little-endian machines. Oh well. Gah4 (talk) 22:13, 25 June 2021 (UTC)[reply]

Subnormal number[edit]

FYI, since you commented on it a while back: denormal number has been renamed to subnormal number Martin Kealey (talk) 01:35, 11 September 2021 (UTC)[reply]

Signature reminder[edit]

trout A small plip for forgetting to sign talk page messages (here and here). — LauritzT (talk) 11:35, 22 September 2021 (UTC)[reply]

A tag has been placed on Talk:List of Nobel laureates by university affiliation requesting that it be speedily deleted from Wikipedia. This has been done for the following reason:

WP:G8. You don't need the page to exist to see what links to it.

Under the criteria for speedy deletion, pages that meet certain criteria may be deleted at any time.

If you think this page should not be deleted for this reason, you may contest the nomination by visiting the page and clicking the button labelled "Contest this speedy deletion". This will give you the opportunity to explain why you believe the page should not be deleted. However, be aware that once a page is tagged for speedy deletion, it may be deleted without delay. Please do not remove the speedy deletion tag from the page yourself, but do not hesitate to add information in line with Wikipedia's policies and guidelines. If the page is deleted, and you wish to retrieve the deleted material for future reference or improvement, then please contact the deleting administrator, or if you have already done so, you can place a request here. RandomCanadian (talk / contribs) 00:07, 21 October 2021 (UTC)[reply]

  • If you want to coordinate removal of these, you can leave a message at a relevant Wikiproject, or maybe even make an AWB request (WP:AWBREQ). Or you can put the list in your userspace. As you can see, the WhatLinksHere is accessible even if the page or its talk page don't exist: [2] works without problem... RandomCanadian (talk / contribs) 00:11, 21 October 2021 (UTC)[reply]
    • I only made one edit to this page, and am not especially attached to it. I am also not especially interested in going through the 252 pages to change them. It would be nice if there was an automated way to change the articles, though I suspect that isn't so easy, depending on how well they integrate into the page. It would be nice of those who do decide to delete a page, to help change all the links. Gah4 (talk) 01:13, 21 October 2021 (UTC)[reply]

ArbCom 2021 Elections voter message[edit]

Hello! Voting in the 2021 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 6 December 2021. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2021 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:11, 23 November 2021 (UTC)[reply]

ArbCom 2022 Elections voter message[edit]

Hello! Voting in the 2022 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 12 December 2022. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2022 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:36, 29 November 2022 (UTC)[reply]

IPA[edit]

Since the Help desk topic you replied to is closed, let me answer you here. In your reply you repeated an aversion to IPA. (Even though it wasn't part of the question, as can be seen by the fact that the text in question included the “respell” “SHEE ...”).

So let me reply to your statement “note that IPA only works if you know how to pronounce the sample words.”. That is patently not true. We can even stay with the example: The sound of [ɕ] is one which I learned without any previously known sample word. Generally, if your statement were true, one could never learn any new sounds.

Of course, one can always try to use crutches like “respell” in an attempt to make one's life easier by only sticking to what one already knows and forcing anything else into the existing pattern. (My cousin did that as an infant once: For animals, they already knew “wauwau” (dog) and "gaga" (chicken, or maybe bird in general). So when there was a hedgehog in the garden, what did they call it? “Gaga-wauwau”!) We could cater to that mindset. But that, IMHO, would diametrically counter the purpose of an encyclopedia. ◅ Sebastian 14:18, 27 March 2023 (UTC)[reply]

OK, I mostly agree. The latter reminds me when our son was first learning words, he learned colors and shapes. Then would name things after their color and shape, so trash cans were blue rectangle, and diaper cream was blue circle.
If someone has a Boston accent, or southern accent, and then pronounces the sample words with that accent, it could be pretty far off.
In many cases, we learn the pronounced word first, and then later the written word, but not all of them. Especially for technical words, which we might not be in the place where they are needed.
Reminds me of the story of Michelle Yeoh, who learned the lines for Crouching Tiger, Hidden Dragon phonetically, before she learned any Mandarin. In any case, I suspect that SHEE isnt exactly right for Xi, but maybe close enough. Gah4 (talk) 21:35, 27 March 2023 (UTC)[reply]
Thank you for your nice reply. Sorry that I missed it for half a year, but luckily watchlists are patient. Did you mention Xi because I brought up the sound [ɕ], or is that just a funny coincidence? As for your son: Was ‘rectangle’ really one of the first words he learned? I would be curious how that influenced his further development, but I completely understand if you don't want to write that here for the whole world to see. ◅ Sebastian 16:46, 17 October 2023 (UTC)[reply]
I think it was because you mentioned it, but as you say, half a year ago. We did have much fun with our sun as he was growing up, and the things he would learn. And yes he learned rectangle very early. Not so much later, he learned letters, and was very interested in them. The only book we could read him was Dr. Seuss' ABC book. He didn't know about words, but just letters. He would read letters anyplace. His daycare had to have a rule that teachers couldn't wear shirts with letters, as he would keep reading the letters. And after not so long, he figured out words and reading. So, back to the subject. If the only one you learn is the written word, without anyone giving a pronunciation, you say it the way that seems right. I do remember this for hysteresis, which I pronounced wrong for a long time. Thanks! Gah4 (talk) 17:15, 17 October 2023 (UTC)[reply]
That's funny about the daycare rule! (Although I don't quite understand what the problem is with a kid reading the letters off a shirt. And I would contend that it's like the old adage with the hammer and the nail: Once you know how to read letters, you see letters everywhere.)
Thank you for explaining your original intention behind what I questioned in my first paragraph. Now I see what you meant, and I agree that there probably are many readers who just want a a rough pronunciation, for whom learning IPA requires a higher initial effort. (I'm avoiding the common misnomer “steep learning curve” here.) That said, I still doubt whether respelling does any good. It replaces one mistake that a naïve reader would make (“Ksee”) with another one that is about as bad. In addition, it is frustrating for readers if they have to clamber over three more words of gibberish before they get to the actual text about the man. (My move to a footnote hopefully improved that situation, but unfortunately introduced two other problems: Some readers who want the pronunciation will miss the footnote, while, conversely, others who don't want it will waste time looking up the footnote. BTW, IMHO, the text in parentheses still constitutes an obstacle, and I don't see why it has to be duplicated from the text in the box, but that's another question, and maybe there are accessibility reasons for that.) A better solution - which could unobtrusively remain in the main text - would be to include an OGG file with the pronunciation, which allows a learning experience we all got used to as toddlers. ◅ Sebastian 20:16, 17 October 2023 (UTC)[reply]

Thanks for your contributions to List of semiconductor materials/programs. Unfortunately, it is not ready for publishing because it has no sources. Your article is now a draft where you can improve it undisturbed for a while.

Please see more information at Help:Unreviewed new page. When the article is ready for publication, please click on the "Submit your draft for review!" button at the top of the page. BoyTheKingCanDance (talk) 05:23, 9 May 2023 (UTC)[reply]

Someone asked about making the table sort right on bandgap. That is an awk program that fixes the table so it sorts right. It doesn't have any source, as I wrote it. If someone wants to change the table sorting, they might find it useful. Is there a place where someone should put programs useful for editing a page, such as table making?
I also have awk programs to make Wikitables from IAEA tables, such as for fission fragment tables. I thought about posting them, but never did. Gah4 (talk) 05:37, 9 May 2023 (UTC)[reply]

Corrections to IEEE binary format pages[edit]

Hi, never did this before, so not sure I am doing this right. I played around with floating point formats and found that some of the entries in the tables must be slightly off and tried to change them. You changed them back. I'm happy to discuss. I have a libre office calc sheet that I could share if it helps? Nsmeds (talk) 14:54, 10 September 2023 (UTC)[reply]

Discuss in the talk page for the article. I suspect, though, that you aren't considering that the significand is between 1 and 2. Gah4 (talk) 15:58, 10 September 2023 (UTC)[reply]
I found the talk page and made my point there in more detail. Nsmeds (talk) 19:00, 10 September 2023 (UTC)[reply]

Information icon Hello, Gah4. This is a bot-delivered message letting you know that Draft:List of semiconductor materials/programs, a page you created, has not been edited in at least 5 months. Drafts that have not been edited for six months may be deleted, so if you wish to retain the page, please edit it again or request that it be moved to your userspace.

If the page has already been deleted, you can request it be undeleted so you can continue working on it.

Thank you for your submission to Wikipedia. FireflyBot (talk) 06:01, 9 October 2023 (UTC)[reply]

Hello, Gah4. It has been over six months since you last edited the Articles for Creation submission or Draft page you started, "programs".

In accordance with our policy that Wikipedia is not for the indefinite hosting of material deemed unsuitable for the encyclopedia mainspace, the draft has been deleted. When you plan on working on it further and you wish to retrieve it, you can request its undeletion. An administrator will, in most cases, restore the submission so you can continue to work on it.

Thanks for your submission to Wikipedia, and happy editing. Liz Read! Talk! 05:42, 9 November 2023 (UTC)[reply]

ArbCom 2023 Elections voter message[edit]

Hello! Voting in the 2023 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 11 December 2023. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2023 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:30, 28 November 2023 (UTC)[reply]