Jump to content

Wikipedia:Reference desk/Computing: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Scsbot (talk | contribs)
edited by robot: adding date header(s)
Line 102: Line 102:


= January 9 =
= January 9 =

== If I put my HP Pavilion computer to "Sleep" will it protect it against malware? ==

If I put my HP Pavilion computer to "Sleep" will it protect it against malware? [[User:AboutFace 22|AboutFace 22]] ([[User talk:AboutFace 22|talk]]) 04:24, 9 January 2023 (UTC)

Revision as of 04:24, 9 January 2023

Welcome to the computing section
of the Wikipedia reference desk.
Select a section:
Want a faster answer?

Main page: Help searching Wikipedia

   

How can I get my question answered?

  • Select the section of the desk that best fits the general topic of your question (see the navigation column to the right).
  • Post your question to only one section, providing a short header that gives the topic of your question.
  • Type '~~~~' (that is, four tilde characters) at the end – this signs and dates your contribution so we know who wrote what and when.
  • Don't post personal contact information – it will be removed. Any answers will be provided here.
  • Please be as specific as possible, and include all relevant context – the usefulness of answers may depend on the context.
  • Note:
    • We don't answer (and may remove) questions that require medical diagnosis or legal advice.
    • We don't answer requests for opinions, predictions or debate.
    • We don't do your homework for you, though we'll help you past the stuck point.
    • We don't conduct original research or provide a free source of ideas, but we'll help you find information you need.



How do I answer a question?

Main page: Wikipedia:Reference desk/Guidelines

  • The best answers address the question directly, and back up facts with wikilinks and links to sources. Do not edit others' comments and do not give any medical or legal advice.
See also:

January 2

Google seems to have changed jts search results. How do I change back to multiple pages?

I don't like Facebook style software, which means as you go down the page, you keep everything above it, and eventually there is the potential for overloading the computer.— Vchimpanzee • talk • contributions • 22:57, 2 January 2023 (UTC)[reply]

I didn't notice any change. Can you be more specific about the perceived change?  --Lambiam 02:08, 3 January 2023 (UTC)[reply]
"Starting today, we’re bringing continuous scrolling to desktop in English in the U.S. so you can continue to see more search results easily. When you reach the bottom of a search results page, you'll now be able to see up to six pages of results." -- Google tweet from a month ago. I haven't figured out to disable it yet. --jpgordon𝄢𝄆𝄐𝄇 04:23, 3 January 2023 (UTC)[reply]
It hasn't been rolled out in the UK yet, but you could try the old method: Perform any search > Click the settings cog (top right) > Click "See all settings" > Adjust the "results per page" setting. Shantavira|feed me 09:21, 3 January 2023 (UTC)[reply]
I don't know if it worked. I still saw a rotating circle indicating more was being loaded.— Vchimpanzee • talk • contributions • 17:18, 3 January 2023 (UTC)[reply]


January 4

Google

How to download GOOGLE onto an HP computer? — Preceding unsigned comment added by MPEG4.O8 (talkcontribs) 17:16, 4 January 2023 (UTC)[reply]

Google is a company. You will need to be a lot more specific. Which Google product do you wish to download? Shantavira|feed me 17:55, 4 January 2023 (UTC)[reply]
Quite possible troll. Therapyisgood (talk) 23:35, 4 January 2023 (UTC)[reply]

January 5

Help with Chrome

Question and response moved from "Help with chrome" Mikenorton (talk) 13:17, 5 January 2023 (UTC)[reply]

So normally everyday I use my Windows Tablet for editing and doing general maintence. The past week or so, every time I user Chrome, I get it freezing up either trying to open wiki page, to type a response, or even run of the mill CU tasks. It doesn't matter how many tabs I have open, it's happening consitently now. I have tried to crash and burn Chrome (factory reset) - no change. I can switch over to firefox with the quick switch of windows. Firefox does not have similiar issues, and runs my IRCCloud. Any advice anyone can give? This is doubling the time to make my edits. -- Amanda (she/her) 12:05, 5 January 2023 (UTC)[reply]

@AmandaNP I had the same issue a couple of weeks ago and I was able to fix it by turning off "Enhanced spell check" in Settings → Languages. ಮಲ್ನಾಡಾಚ್ ಕೊಂಕ್ಣೊ (talk) 13:04, 5 January 2023 (UTC)[reply]
Something about Enhanced spell check on Chrome breaks any number of sites, extensions, and apps to not function Nosebagbear (talk) 14:20, 5 January 2023 (UTC)[reply]
@ಮಲ್ನಾಡಾಚ್ ಕೊಂಕ್ಣೊ and Nosebagbear: Thank you for the suggestions. I had actually turned off spell check completely a few days ago because of my own spell check software. Turned it back on today to basic spell check and it fixed the issue 100%. Dunno why Chrome is so adamant that we are forced to use only it's basic spell checker. -- Amanda (she/her) 00:44, 6 January 2023 (UTC)[reply]

Linux Two Monitors on One Card Problem

We have two video editing stations. They have one computer with one video card and two monitors. I am sure it is one card because on the back, there is a stack of rectangle slots and both monitors are plugged into the same slot. One is HDMI and the other is Display Port (I think, because it is like HDMI with one side squared off). On both computers, the Display Port monitor randomly turns black for a second and then turns back on. I switched the monitors and the problem stayed with the monitor connected to the Display Port using a Display Port to HDMI connector. The monitor using HDMI to HDMI never goes black. I've updated the drivers, which are NVidia drivers. I rebooted. I've been asking various Q&A websites and doing everything suggested, so the list of what I've done is very long. Most people ask what we are using. Using their instructions, I have this: It is an HP computer with an Intel I7 4 core CPU and 8 GB memory. The video card is NVidia GM204 GEForce GTX 970. Both monitors are set for 1920x1080 resolution at 60 Hz, which is the HP 22cwa monitor default. While the blinking off is an annoyance, the video editing stations are still used often. Our IT guy says we probably need a better video card, but we can't purchase that. We have to purchase entire computers. That is why I'm trying to figure out how to fix the problem without purchasing a new video card. 97.82.165.112 (talk) 14:35, 5 January 2023 (UTC)[reply]

I'm driving two 1920x1080 monitors, and a 1440x900, all off a GTX950 in Ubuntu Linux. Performance, including video playback and some light gaming, is fine. To configure them, I just have the nVidia proprietary driver v510 (I think I tried the recent v525 driver and it didn't work for me). To set up the monitors, I run nvidia-settings and look in the "X Server Display Configuration" tab. I've never needed to do anything fancier than that. -- Finlay McWalter··–·Talk 16:24, 5 January 2023 (UTC)[reply]
Thank you. From another help website, it was suggested that the cable may be inferior, which causes the monitor to randomly resync. I think that will be something cheap to check, so I've requested a new cable to try on one computer and, if it works, I will try it on another. I only just discovered that cables come with Hz ratings. Ours are 30 Hz and I'm ordering 60 Hz cables. 97.82.165.112 (talk) 13:18, 6 January 2023 (UTC)[reply]
Looking at mine, the three monitors are connected thus: the small one by DVI-I (directly), one by HDMI (using a cheap HDMI->VGA translator), and one by DisplayPort (using a cheap DP->VGA translator). Looking at the Amazon order, the translators cost £6 each. In previous years, the vertical refresh did cause issues (because the small monitor has a vertical rate of 59.89 Hz and the others 60Hz) - every few seconds the "slower" one would jump (presumably to catch back up). But later versions of the nVidia driver seem to have resolved this, and it's solid as a rock. -- Finlay McWalter··–·Talk 13:56, 6 January 2023 (UTC)[reply]

January 6

In your country, what month did flip phones surpass landlines phones, and what month did smartphone subscriptions surpass flip phones?

Even though I'm from USA I'm still curious to see the figures from countries around the world, and Googling seems to point to incomplete sources, so hoping people know the reliable source for their country. I feel like every carrier knows the answer to the 2nd question, but do carriers make that information public, or proprietary? 67.165.185.178 (talk) 13:41, 6 January 2023 (UTC).[reply]

I don't know the answer but I doubt the number of flip phones ever exceeeded the number of landline phones in the UK. I've never even seen a flip phone over here except in the movies. Shantavira|feed me 18:06, 6 January 2023 (UTC)[reply]
Among mobile phones, flip phones and smartphones do not form a dichotomy. Popular models in Europe like the Nokia 1011 and its successors were neither. Their first model with a clamshell form factor may have been the Nokia 6101.  --Lambiam 23:01, 6 January 2023 (UTC)[reply]


January 7

Hungarian algorithm: assignment step

... multiple rows ...
4 4 4 6 0 0 0 6 6 6 6 6 4 2 2 2 2 2
4 4 4 6 0 0 0 6 6 6 6 6 4 2 2 2 2 2
4 4 4 6 0 0 0 6 6 6 6 6 4 2 2 2 2 2
4 4 4 6 0 0 0 6 6 6 6 6 4 2 2 2 2 2
4 4 4 6 0 0 0 6 6 6 6 6 4 2 2 2 2 2

In various steps in the hungarian algorithm, one tries to assign rows to columns uniquely such that each (row, column) assignment has a 0. But this seems like a worst-case O(n!) problem, and it isn't explained how that would be done. Theoretically the article states that the hungarian algorithm is O(n^3)

Recently my code tried to process the above grid, but the O(n!) solution was so slow it caused a timeout. (There's no solution in the above grid and it's relatively hard to detect creating a worst case scenario.)  AltoStev (talk) 01:32, 7 January 2023 (UTC)[reply]

I don't know which description of the algorithm you are following, but when implemented correctly, it should take only steps, even if it is the original version. Following the procedure described in Hungarian algorithm § Matrix interpretation, Step 2, you should subtract, for each column, its minimum element from all elements in that column. If all rows are equal, the result is a zero matrix, meaning that any and all assignments are optimal. I hope this helps.
I must confess that I find both descriptions of the algorithm in our article impossible to follow. The description in terms of bipartite graphs mixes the algorithmic steps with their justification, which is confusing. The algorithm is complicated enough; clarity will be served by separating its justification from its description. Is it the case that the correspondence between and is an invariant, so that one of the two is superfluous? It also mixes a command mode, addressing a computing servant in the second person, with the first-person pluralis modestiae. So who is supposed to be executing the steps, the computer or "us"? The description in terms of a matrix mixes the algorithmic steps in a confusing way with their application to examples, or even only describes them by such applications.
--Lambiam 19:04, 7 January 2023 (UTC)[reply]
Sorry, should've clarified. Subtracting from columns doesn't work since the actual grid was
0 0 0 0 6 6 6 0 0 0 0 0 0 0 0 0 0 0 <-- all columns have zeroes (1)
0 0 0 0 6 6 6 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 6 6 6 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 6 6 6 0 0 0 0 0 0 0 0 0 0 0
2 2 2 0 6 6 6 2 2 2 2 2 2 0 0 0 0 0
0 0 0 0 6 6 6 0 0 0 0 0 0 0 0 0 0 0
2 2 2 0 6 6 6 2 2 2 2 2 2 0 0 0 0 0
2 2 2 0 6 6 6 2 2 2 2 2 2 0 0 0 0 0
4 4 4 6 0 0 0 6 6 6 6 6 4 2 2 2 2 2 <-- all columns have zeroes (2)
4 4 4 6 0 0 0 6 6 6 6 6 4 2 2 2 2 2
4 4 4 6 0 0 0 6 6 6 6 6 4 2 2 2 2 2
4 4 4 6 0 0 0 6 6 6 6 6 4 2 2 2 2 2
4 4 4 6 0 0 0 6 6 6 6 6 4 2 2 2 2 2
Meaning that every column has a minimum of 0
And yes, I was following the matrix algorithm. I also find this nice visual explanation: https://medium.com/@riya.tendulkar/the-assignment-problem-using-hungarian-algorithm-4f105729af18 but that doesn't show the part about selecting the zeroes either.
 AltoStev (talk) 21:58, 7 January 2023 (UTC)[reply]
The best description I've found thus far is here. It is still a tough read, but it gives me the impression I could write a program based on the pseudocode description. Also, here is an implementation in Python. I have not verified that it is correct, and also not looked at its complexity  --Lambiam 17:47, 8 January 2023 (UTC)[reply]


January 9

If I put my HP Pavilion computer to "Sleep" will it protect it against malware?

If I put my HP Pavilion computer to "Sleep" will it protect it against malware? AboutFace 22 (talk) 04:24, 9 January 2023 (UTC)[reply]