Brona

Hello, welcome to Wikipedia. Here are some useful links in case you haven't already found them:

• How to edit a page
• How to write a great article
• Naming conventions
• Manual of Style
• Wikipedia Policies and guidelines

If you made any edits before you got an account, you might be interested in assigning those to your username. If you have any questions, see the help pages, add a question to the village pump or ask me on my talk page. I hope you enjoy editing here and being a Wikipedian!

Tip: you can sign your name with ~~~~

snoyes 04:23, 15 Feb 2004 (UTC)

---

Hiya. In an edit summary on Dijkstra's algorithm you said "six degrees should be done by BFS, not Dijkstra". I agree with the edit (six degrees shouldn't be linked from a WP article), but I'd be interested to know why you think BFS would be more appropriate than Dijkstra's for this problem (I know very little about graph theory, so any suggestions are welcome :). Thanks — Kate Turner | Talk 03:24, 2004 Nov 10 (UTC)

You can use Dijkstra's algorithm for this purpose. However, Breadth-first search (BFS) can also be used to find shortest paths from a given source when all edges have the same weight. It is more efficient and simpler than Dijkstra's algorithm, thus more appropriate. BFS cannot be applied though for graphs with weighted edges. Then you need Dijkstra's algorithm. Article about BFS does not have much detail at this point but you can probably find more info on the web. I hope this helps. Brona 04:27, 10 Nov 2004 (UTC)

Article Licensing

Hi, I've started a drive to get users to multi-license all of their contributions that they've made to either (1) all U.S. state, county, and city articles or (2) all articles, using the Creative Commons Attribution-Share Alike (CC-by-sa) v1.0 and v2.0 Licenses or into the public domain if they prefer. The CC-by-sa license is a true free documentation license that is similar to Wikipedia's license, the GFDL, but it allows other projects, such as WikiTravel, to use our articles. Since you are among the top 2000 Wikipedians by edits, I was wondering if you would be willing to multi-license all of your contributions or at minimum those on the geographic articles. Over 90% of people asked have agreed. For More Information:

• Multi-Licensing FAQ - Lots of questions answered
• Multi-Licensing Guide
• Free the Rambot Articles Project

To allow us to track those users who muli-license their contributions, many users copy and paste the "{{DualLicenseWithCC-BySA-Dual}}" template into their user page, but there are other options at Template messages/User namespace. The following examples could also copied and pasted into your user page:

Option 1

I agree to [[Wikipedia:Multi-licensing|multi-license]] all my contributions, with the exception of my user pages, as described below:

{{DualLicenseWithCC-BySA-Dual}}

OR

Option 2

I agree to [[Wikipedia:Multi-licensing|multi-license]] all my contributions to any [[U.S. state]], county, or city article as described below:

{{DualLicenseWithCC-BySA-Dual}}

Or if you wanted to place your work into the public domain, you could replace "{{DualLicenseWithCC-BySA-Dual}}" with "{{MultiLicensePD}}". If you only prefer using the GFDL, I would like to know that too. Please let me know what you think at my talk page. It's important to know either way so no one keeps asking. -- Ram-Man (comment| talk)

EdHalstram thanks you

Thank you for putting that link in the Number theorists stub.

Category:Towns in Slovakia - Category:Towns in Slovakia

• Halló Brona! I have seen that you are active about towns in Slovakia. I linked the categories I could find, made some new categories in more languages and put (now) all the romanian articles in ro:Categorie:Oraşe în Slovacia (a html link works allways). I correted at ro: some aricle names because the special characters ď ľ ť where misspelled as d', l' t' and linked all articles I could find too. I let you know more details when I am done. ro:Gangleri - Gangleri | Th | T 10:06, 2005 Jan 22 (UTC)
• Thank you for the answer and the note on the broken links to ro:. You may first go to a non UTF-8 Wikipedia as de:, eo:, sk:, sl: etc. and then to ro: .
• I left the message some days ago because I do not know many people involved on towns / places from Slovakio. I received a note about de:Portal Ostmitteleuropa/Slowakei, I found hu:User:Darinko/Szlovákia települései and was informed that the naming convention for categories like hu:Kategória:Szlovákiai települések will be changed. This is why this language is not linked jet.
• Do you know who can provide datas about the towns in a CSV format and what details would be available. I would like to generate some lists for eo:, ... as thouse from ro:Wikipedia:Proiectul localităţile din România/ghid judeţe. The data about the towns are in the background (Wikipedia namespace) and can be presented in different forms. I do not have the tools to sort special characters. Most work was done by hand / Word macros. Regards Gangleri | Th | T 23:57, 2005 Jan 22 (UTC)

Thanks for the answers Brona! I come with more questions when necessary. Regards Gangleri | Th | T 07:08, 2005 Jan 27 (UTC)

Thanks for your answers Brona! I stopped a while to have a clear mind. One question: Do you use in Slovakia (officialy or widly used) some abreviations for each kraj and ocres? Gangleri | Th | T 03:58, 2005 Jan 28 (UTC)

Euro-geo-stub problems

Dear Brona - I must apologise to both you and User:Juro for the extra work I caused you when i was putting stub messages on various Eastern European geography articles yesterday. My browser - even when set for Central European fonts - somehow glitches any diacriticals that are written in unsafe (i.e., non-unicode) characters. Usually I manage to catch them, but I was rushed for time yesterday and wasn' as careful in checking as I normally am - hence the problems with articles like Ruzomberok. Sorry again, and thanks for catching the glitches! Grutness|^hello? 23:23, 9 Feb 2005 (UTC)

You wrote: I will try to use HTML entities next time instead of unsafe characters, although they are much more difficult to edit. Do you know about any simple way?

Sadly no - what I did is I made up a WP document with the most used unicode codes on it for things like Ž - I keep it handy and cut and paste from it when doing Eastern European articles. I still haven't managed to find a way to do y+acute - that one glitches even when I use the unicode codes. Grutness|^hello? 05:27, 11 Feb 2005 (UTC)

Thanks!

Hi Brona, and thanks for watching the article about the Sicilian School. I think you got a point there. Probably that quote I put on top made me overlook it. I'm following a number of articles but this is the first I've written from scratch on the English Wiki. I'm writing that small intro now. Let me know how i'm doing. Have a good time on the 'pedia ;) --Wikipedius 19:57, 19 May 2005 (UTC)

Graph of entropy of benoulli process

Hi,

Could I get you to fix the graph for the article information entropy ? The entroy at the peak should be ln2 and not 1.0. After all, one has

H = p ln p + (1-p)*ln (1-p)

which for p=1/2 is ln 2. linas 04:17, 9 October 2005 (UTC)

Oops

It seems I accidentally listed the wrong year on all 150 references to CLRS. Makes me wish I'd used a template. I guess I'll go back and try to fix them all. Deco 03:17, 19 November 2005 (UTC)

Newspaper article

Deleted request for contact, at author's request. Brona 02:56, 23 November 2005 (UTC)

Slovak Wikipedians' notice board

Hi. You might be interested in checking out the brand new Wikipedia:Slovak Wikipedians' notice board. All Wikipedians interested in Slovakia or subjects somehow related to Slovakia are invited to use this noticeboard as a tool for better organizing their activities, making announcements to others with similar interests, and discussing any actual issues related to their work on Wikipedia. You are welcome to add this notice board to your watchlist, so that you could see when it is updated and thus take part in any projects, initiatives, and improvements relating to articles about Slovakia. Also, you are welcome to report your own articles here so they could be peer-reviewed and expanded by other contributors. Tankred 16:02, 24 September 2007 (UTC)

ArbCom elections are now open!

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) 22:15, 30 November 2015 (UTC)

ArbCom 2018 election voter message

Hello, Brona. 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)