User talk:Pat Palmer/Archive 3
This is Archive 3 for User_talk:Pat_Palmer
Tables of contents
We disagree about the use and placement of the TOC. Might we move this issue to the Forum or another venue? I don't want to get into revert wars about it. You presumably have your reasons and I have mine; I'll merely note that I often read a TOC to see if I want to read the intro. If the TOC is not on the first screen, I'm apt to skip the article. Howard C. Berkowitz 16:53, 19 February 2009 (UTC)
Languages using the .NET Framework
Pat, I have no idea if this is still relevant to you, so forgive the interruption if it's not; I'm still a little new around here. I just finished checking all the links to compilers on Talk:List of languages using the .NET Framework, and wondered what your original plan was for folding those into the main article, so I figured I'd ask to make sure, then boldly go ahead. :) — Nathan Tuggy 23:59, 21 March 2009 (UTC)
Hi, Pat. Do you have a few minutes to put on your Computers Editor hat and review the article on brute force attacks? Howard has nominated it for approval but I think it would be best if we had a second editor involved because Howard did make some minor contributions to that article. If you feel up to it, you might even do a single editor approval and we could let Howard step down so as to avoid any possible complaints about his involvement. Thanks much. --Joe Quick 03:28, 25 March 2009 (UTC)
I would like to nominate The Canterbury Tales for Article of the Week but ....
Pat, I see that you are a Literature Author. I would like to nominate The Canterbury Tales for Article of the Week but it doesn't have a Related Articles subpage and I believe that a Developed Article (Status 1) should have a populated "Related Links" subpage.
Email systems article needing approval
Howard Berkowitz suggested I contact you to get some additional editorial input on an article I'm submitting for approval in the Computers workgroup. He says you would be the most knowledgeable in this area. Email system is intended as a top-level introduction to how the email system works, with subtopics on each of various technologies and protocols. I got interested in writing this article in connection with some lectures I give each year at the University of Arizona. The textbook explanations of email systems are very poor. We can do much better, even without getting into to much technical detail. Email system is intended to be useful for non-technical readers as well.
Your help will be appreciated. --David MacQuigg 19:07, 23 September 2009 (UTC)
- Hello. Are you related to Robert Roswell Palmer, who authored the textbook A History of the Modern World? I used the textbook when I was in high school. I'm just curious. Thank you. (Chunbum Park 00:34, 7 December 2009 (UTC))
sorry, no relationPat Palmer 23:39, 9 December 2009 (UTC)
Cloud computing, etc.
(copy from my user talk page so you'd see this -- I'd rather keep the conversation there) With a number of Computers articles, I see a win-win approach as spinning off subarticles. DNS needs just a couple of fixes for Peter to nominate it. While I have a number of things to add to cloud computing, I will be doing at least some of that in subarticles; the main article is too long in its present form. I would like to get it to approval as the top of the tree. Clearly, I don't own it, but I am using some of the cloud computing material in discussions with people outside CZ -- I managed to get one old colleague to sign up at least to make a few edits. I'm also using it as a reference in several discussions, so I'd like to keep it at an expert-written level.
That said, I would be delighted to see some subarticles, with the Eduzendium tag, created, and I'd be happy to work with students. As a general EZ comment, Gareth and Celine seemed to get some very good results by having teams of students, rather than individuals, work on the articles. I, and I'm sure others, would be happy to work with students during the writing, guiding them but certainly not writing anything for them. Howard C. Berkowitz 18:59, 6 June 2010 (UTC)
- Since you've already read through cloud computing, how do you feel about moving it toward Approval? Perhaps that would make it more credible if you assign it for reading. There are a few updates I want to make, and also want to move some material to subarticles. Perhaps some subarticles might make sense as student assignments.
- I can continue my thinking on the article talk page. Howard C. Berkowitz 17:17, 7 June 2010 (UTC)
- I did respond to your email request -- if you didn't get it, my CZ email is enabled.
- As far as emerging topics, I want to give it some additional thought, but let me mention a few topics where I know I need to learn more, and was going to do articles as part of my own study. Hopefully, these aren't too advanced. If you like, I would be more than willing to mentor students on them, definitely without doing their work.
- Virtual machine deployment
- More comparisons of hypervisors and equivalents (e.g., VMware, Xen, MS Virtual PC)
- VM provisioning and management
- Security of paused VM images in a multi-user environment
- Side channel attacks on coresident VM instances
- Evolution of managed hosting versus PaaS clouds
- Data storage and management
- Federated data bases
- Physical separation of parts of files/databases as a physical security measure in cloud services
- Solid state disks
- Storage area networks vs. network attached storage
- Why is cut-through switching, once considered obsolete, a viable technique especially in SAN/NAS and with multigigabit links? This is something I've seen discussed mostly on mailing lists. The basis of all understanding is to do some simple but perhaps nonintuitive computations on why cut-through sometimes is very attractive for L2 switching between input and output links of the same speed, something that tended to go away with aggregating LANs at 100 Mbps and 1 Gbps
- Portable computers and storage media (e.g., thumb drives) -- managing security including physical theft
- Why is it a really, really bad idea to recharge your iPod battery from the USB port of a computer handling classified data?
- Federated data bases
- ISP security (actuallly an area where I've done a lot)
- Alternative BGP security architectures (some are complementary)
- Privacy vs. health care delivery efficiency with interconnected electronic medical records
- Marine electronics and computing (ok, this is very niche-ish, but good researchers should find things)
- Self-organizing networks in the real world -- the aforementioned AIS is one real application; lots of military apps
- Also see software-defined radio and discuss the more advanced technologies such as cognitive radio (and, for that matter, radar)
- Femtocells (see article locality of networks)
- Remotely operated vs. autonomous unmanned aerial vehicles, especially that shoot. Social aspects of remotely operated: Air Force officer #1 goes to one building at Creech Air Force Base in Nevada, gets a beer, and plays a video game, getting a high score. Air Force officer #2 goes to a different building, goes through essentially the same actions but without the beer, and kills hopefully bad guys in Pakistan with a MQ-9 Reaper. Both drive home for dinner. Required preparatory reading: Orson Scott Card's Ender's Game.
- Virtual machine deployment
- Howard C. Berkowitz 17:14, 9 June 2010 (UTC)
We have an article on Hash (cryptography) but it is woefully incomplete. In particular, it has inadequate coverage of the Advanced Hash Standard or SHA-3 contest currently being run by NIST. That is perhaps an "emerging technology", since the actual standard is not due until 2012 and the competition is underway now. Is it something some of your students might tackle?
In the parallel case of Block ciphers, I originally wrote one huge article, then split it up producing separate articles on the AES competition and a couple of dozen stubs on individual ciphers. The hash stuff is not nearly as far along, but probably needs a similar split as it develops. Sandy Harris 06:49, 26 June 2010 (UTC)
- Sandy makes some good points, perhaps taking us in even new directions. It is entirely reasonable, I think, for students to take on the policy and "black box" aspects of crypto competitions. How relevant this is for your course depends on whether problem analysis at this level is in scope, as opposed to analysis of the technology itself. To go into the hash algorithms beyond the level of a stub will take mathematical background the students may or may not have.
- Another issue is whether your ground rules might let students take a piece in an existing CZ article and substantially expand it into an article.
- I am involved in some other hash competitions, but they tend to turn on theological issues: oven vs. stovetop vs. broiler and timing sequences. There's even black iron vs. coated iron pan. Not appropriate for CS topics. :-) Howard C. Berkowitz 14:23, 26 June 2010 (UTC)
- My co-instructor and I seem to have converged on "concurrency" as the theme for this year's course. This is why I had asked about cloud computing...so the cryptography topics probably won't fly this year. Still, good ideas! Thanks so much for the input.Pat Palmer
...good luck with the course! John Stephenson 09:56, 8 July 2010 (UTC)
- John, thank you; it's gearing up quickly thanks to help from the CZ registrars
Amazingly high involvement
It's absolutely great -- unprecedented I believe -- that so many of your students are making quality contributions outside the course. Does this have anything to do with having thought-controlled devices within scope? :-) Howard C. Berkowitz 01:53, 19 July 2010 (UTC)
- Howard, you make me laugh. It has directly to do with the fact that I'm requiring them to do 2 edits per week (minimum) outside the article they are working on. I do hope some of them come to love this project as we do!Pat Palmer 18:15, 20 July 2010 (UTC)
- "Conscience is the still, small voice that says someone is watching." (Mark Twain)
- Isn't Dartmouth, though, "the small place, but we love it"?
- Nevertheless, of the edits outside the article, everything I've seen has been of high quality. You've got a good bunch. Howard C. Berkowitz
- Tis true, they are exceptional and we're loving it.Pat Palmer 18:57, 20 July 2010 (UTC)
- I think you've landed on a good idea with the 2 edit requirement outside their articles. That should be written somewhere ;-) D. Matt Innis 19:22, 21 July 2010 (UTC)
Could you take a look at that article? So far it has been only me writing & Howard commenting. A different viewpoint would be welcome. Sandy Harris 06:54, 26 September 2010 (UTC)
You've been Nominated!
Someone has nominated you for a position in the new Citizendium. They have noticed you're dedication to the project and like what they see. To be listed on the ballot for the position, it is necessary that you accept the nomination on the Nomination page. Just place accept next to your name along with the four tildes. The nomination period will close at midnight October 7 (UTC). Article 54 of the new charter details the requirements:
- In conjunction with the Declaration of the Editor-in-Chief regarding the effectivity of this Charter, there shall be a call for nominations for the following offices: Management Council (five seats), Editorial Council (seven seats), Managing Editor (one), Ombudsman (one). This shall be the effective date of the Charter.
- Any Citizen may nominate candidates for these positions.
- Nominations shall be collected and collated by the Chief Constable.
- Nominations shall be accepted no more than fourteen days after the effective date of the charter; the ballot shall be available starting on the twentieth day after the effective date of the charter; the election shall be completed no more than twenty-eight days after the effective date of the charter; all elected officials shall begin their term of office on the thirtieth day after the effective date of the charter.
- Only candidates who accept their nomination shall be eligible to appear on the ballot. Nominated candidates can accept nominations for no more than two official functions. Accepting a nomination serves as a declaration of commitment, in the case of being elected, to fulfill this function until the limit of the term.
- All positions shall be elected by a simple majority of the voting citizenry. In the case of a tie, an immediate run-off election shall be held.
- In the event that a candidate has been elected for two functions, the candidate shall declare which one he or she accepts within three days of announcement of the election results. In the event that such a declaration has not been made during this period, the candidate shall be considered elected for the position for which the nomination was accepted first. The same procedure applies to a reserve member that becomes elected by a seat being vacated this way.
If you would like to make a statement to help voters, click the "Statement" link to the right of your name.
Thanks again for the commitment you're making to assure that Citizendium becomes the premier quality online source we all have envisioned.
D. Matt Innis 13:03, 3 October 2010 (UTC)
New user Thomas W. Reynolds
Pat, this new user has just joined us as a Literature author and he is interested in our Eduzendium project. Perhaps you may wish to post a welcome on his Talk page and offer to help him with Eduzendium. Milton Beychok 19:07, 12 February 2011 (UTC)
Please review Los Alamos National Laboratory for spelling, grammar, and whatever
Pat, I would very much appreciate it if you would review Los Alamos National Laboratory for spelling, grammar, and whatever else you think may be needed. Let me have any comments on the article's Talk page. Thanks, Milton Beychok 20:33, 6 June 2011 (UTC)
- Pat, I have no problem whatsoever with your re-write of the intro to Los Alamos National Laboratory. It looks fine to me. Milton Beychok 03:43, 9 June 2011 (UTC)
Asking your help again
Anything you can do to make it more readable, more interesting, etc. would be appreciated. Milton Beychok 04:01, 21 June 2011 (UTC)
- Very busy at my day job this week; hopefully I can get to this over the weekend. Looks like a fun read.Pat Palmer 22:56, 23 June 2011 (UTC)
Thanks for the welcome
Pat thanks so much for the warm welcome. It's good to be back. Mary Ash 03:27, 28 November 2011 (UTC)
Thank you for remembering Andy
It was a quiet Christmas without our "Old Man" cat. We really missed his head butts and kitty kisses. We did not miss his 4:30 a.m. wake-up calls with his insistent meowing. I'm glad to know I am not the only one who considers cats her "people." Mary Ash 05:45, 4 January 2012 (UTC)
Regarding approval of Cypherpunk/Draft
Pat, regarding approval of Cypherpunk/Draft to replace the currently approved version, will you take a look at the Draft page and consider supporting the nomination for approval if you find it meritorious. Any comments you can make on the Talk page. If you think it merits approval, I'll put your name on the metadata page for your convenience.
Thanks. —Anthony.Sebastian 04:27, 29 February 2012 (UTC) (Approval Manager)
- Anthony, please do add my name. I'm sorry to be so slow, and glad to see you writing in here.Pat Palmer 10:35, 12 March 2012 (UTC)
- Thanks, Pat. I've added your name as supporting the nomination of Cypherpunk/Draft to replace the currently approved version.
- It would be very helpful if you could make a few comments on the Approvals subpage, at http://en.citizendium.org/wiki/Cypherpunk/Approval#Pat_Palmer. They needn't be extensive. I've extended the due date to 20 March 2012 to give you time to do that. —Anthony.Sebastian
- Thanks. —Anthony.Sebastian 23:10, 17 March 2012 (UTC)
Reminder: your reviews Passive attack, Active attack, Cryptology
Pat, again, no rush on these, just a reminder that they await your discerning reviews. —Approval Manager, Anthony.Sebastian 20:11, 23 May 2012 (UTC)
For your convenience, to reach 'comments' section:
—Anthony.Sebastian 20:31, 23 May 2012 (UTC)
Please check your email
I've a computer question for you, Pat, can you look for an email from me?
The matter needs to be attended to promptly, but is not an emergency.
- I did reply by email.Pat Palmer 02:48, 17 July 2012 (UTC)