User talk:Nils Grimsmo

Welcome!

Welcome to Wikipedia, Nils Grimsmo! My name is Ryan, aka Acetic Acid. I noticed that you were new and haven't received any messages yet. I just wanted to see how you were doing. Wikipedia can be a little intimidating at first, since it uses different formatting than other sites that use HTML and CSS. In the long run, though, you'll find that the WikiSyntax is a lot easier and faster than those other ways. Here are a few links to get you started:

There are a lot of policies and guides to read, but I highly recommend reading over those first. If you have any questions, feel free to leave me a message on my talk page. Please be sure to sign your name on Talk Pages using four tildes (~~~~) to produce your name and the current date, along with a link to your user page. This way, others know when you left a message and how to find you. It's easier than having to type out your name, right? :)

I hope you enjoy contributing to Wikipedia. We can use all the help we can get! Have a nice day. Sincerely, Ryan 09:59, August 3, 2005 (UTC)

A Norwegian as well, I presume?

Hi; welcome! I hope it's OK if I (re)add you to the WKPns in Norway cat---I think it's a patently Good Thing™ to have us Norwegians listed in that cat in addition to any 'regional' ones, so as to keep the overall picture. --Wernher 14:23, 21 August 2005 (UTC)[reply]

Wikicite

A while ago you made comments (in which you mentioned ISBNs) which suggest you might be interested in m:Wikicite. (SEWilco 17:12, 27 August 2006 (UTC))[reply]

Diagrams

Hi.

If you make diagrams with dia you can export them to SVG. They will not work correctly right after exporting, but you can easily convert them to be working well. To do that you will have to:

1. Add correct heading like the below (width & height should be in pixels):

<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 20010904//EN"
              "http://www.w3.org/TR/2001/REC-SVG-20010904/DTD/svg10.dtd">
<svg xmlns="http://www.w3.org/2000/svg"
	xmlns:xlink="http://www.w3.org/1999/xlink"
	width="396px" height="480px"
	viewBox="0 0 990 1200"
>

2. Add scaling to everything but text elements; like this:

<g transform="scale(100)">
<!-- all non-text elements -->
</g>

3. Multiply text coordianates and size by the number set above (I use 100).

You can also move some styles definitions, but this is not so nice&easy if don't know CSS.

You can have a look at Image:Suffix_tree_BANANA.svg - which I recreated in DIA and exported to SVG.

Best regards, Nux (talk) 01:17, 22 September 2006 (UTC).[reply]

Suffix tree diagram and definition

Hi!

I think the definition of the suffix links and the diagram are not correct. One or the other should be changed. I contacted Nux, which suggested that I should contact you. What do you think about it? I could also be wrong of course.

The link to the root is probably not needed. But should be there if you read the definition of suffix links.

Regards, Mitja

Yes, there should be a suffix link from the node with path "A" to the root. Since I can't get this SVG stuff right, I will ask Nux to fix it. Klem fra Nils Grimsmo 13:29, 21 October 2006 (UTC)[reply]

Hi. I've just updated the picture and the article. Sorry for the delay, but I'm on wiki-vacation and lost my dia file somewhere... Anyway if you want to be able to edit SVG in a non-text editor you can use Inkscape, which is free (but unfortunatly doesn't work on Win98 which I currently use). --Nux (talk) 20:50, 7 November 2006 (UTC)[reply]

Thanks for the tip on Inkscape. I just installed it, and it seems to produce SVGs just fine. In time I will update all my figures. Klem fra Nils Grimsmo 12:42, 9 November 2006 (UTC)[reply]

Multi-commodity flow problem

Hi,

I am referring to the definition of this problem which you gave in your article. I think in this version it should contain also some constraints involving the demands for the commodities, something like: $\sum _{w\in V}f_{i}(s_{i},w)=d_{i}$ Otherwise, the trivial solution ( $f_{i}(u,v)=0\;\forall i,u,v$ ) is always of minimal cost. What do you think ?

Thanks and regards, Michael.

It was kind of hidden in the text itself. Spelling the constraint out with the others was absolutely as improvement. Thanks! Klem fra Nils Grimsmo 22:00, 29 November 2006 (UTC)[reply]

Inline math tags

I'm not really sure what the problem is with plaintext — in the Max-flow min-cut theorem article, nearly all of the math tags I replaced were not "formulas", but all very simple variable names and expressions such as T and f ≤ c0. The only thing that the TeX rendering does is produce larger text that doesn't fit with the rest of the line. Unless there's a particular reason such as complicated syntax, it doesn't make sense to render the math-related text any differently. ~ Booya ^Bazooka 03:10, 5 December 2006 (UTC)[reply]

Algorithm implementations

Hello! I noticed your recent edits moving implementations to Wikibooks (Levenshtein distance, e.g.). I wouldn't have been so WP:BOLD myself, but somebody has to do it, I guess. :) I agree with those edits, because IMHO the pseudocode is much clearer than any of the removed examples. (That's not always true, though.) I'd like to point you at a proposal I made a few weeks ago, the idea being to figure out a handful of programming languages that would let us write clear and correct examples while still keeping pages "printable". What do you think? Comments at that Talk page are solicited. :)

Oh, and if you're looking for Wikibooks candidates, you might take a look at some of the articles with example Perl code, which tend to be Design Patterns patterns. --Quuxplusone 19:08, 12 December 2006 (UTC)[reply]

Thanks for your support! I really feel that a lot of pages have a lot of totally unnecessary implementations. It is my opinion that real code does not belong in algorithm articles at all. There is a lot of Python code on pages I have written, but that is because I didn't get to translating them to pseudo-code yet :) I will add my opinion to your proposal soon. Klem fra Nils Grimsmo 21:32, 12 December 2006 (UTC)[reply]

MfD nomination of User:Nils Grimsmo/Huskeliste Storaas

User:Nils Grimsmo/Huskeliste Storaas, a page you substantially contributed to, has been nominated for deletion. Your opinions on the matter are welcome; please participate in the discussion by adding your comments at Wikipedia:Miscellany for deletion/User:Nils Grimsmo/Huskeliste Storaas and please be sure to sign your comments with four tildes (~~~~). You are free to edit the content of User:Nils Grimsmo/Huskeliste Storaas during the discussion but should not remove the miscellany for deletion template from the top of the page; such a removal will not end the deletion discussion. Thank you. decltype (talk) 16:42, 12 May 2010 (UTC)[reply]

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) 13:04, 23 November 2015 (UTC)[reply]

Category:Flow network has been nominated for discussion

Category:Flow network, which you created, has been nominated for possible deletion, merging, or renaming. A discussion is taking place to see if it abides with the categorization guidelines. If you would like to participate in the discussion, you are invited to add your comments at the category's entry on the categories for discussion page. Thank you. BrownHairedGirl (talk) • (contribs) 06:09, 13 February 2018 (UTC)[reply]

Proposed deletion of Maximum cardinality matching

The article Maximum cardinality matching has been proposed for deletion because of the following concern:

Material is covered in Matching (graph theory), this represents a fork from that article

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. Bill Cherowitzo (talk) 05:23, 27 February 2019 (UTC)[reply]

Nomination of Strict (disambiguation) for deletion

A discussion is taking place as to whether the article Strict (disambiguation) is suitable for inclusion in Wikipedia according to Wikipedia's policies and guidelines or whether it should be deleted.

The article will be discussed at Wikipedia:Articles for deletion/Strict (disambiguation) until a consensus is reached, and anyone, including you, is welcome to contribute to the discussion. The nomination will explain the policies and guidelines which are of concern. The discussion focuses on high-quality evidence and our policies and guidelines.

Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion notice from the top of the article.

Clarityfiend (talk) 21:41, 3 April 2022 (UTC)[reply]

Never mind. I thought that only one entry was valid, but now I see that two are okay. Clarityfiend (talk) 21:44, 3 April 2022 (UTC)[reply]