Mint 12 Tips & Tricks Guide (updated Jan 10) French version with additional tweaks at www.linuxmint-fr.org - maintained by Major Grubert. Thanks for all the tips in the thread, some good Gnome Shell tips haven't been added as that section is getting out of hand already and I gotta keep it down to the most useful (as far as I can guess what is useful to an average Minter) Please note: these tips are for - and tested in - MGSE, the default Linux Mint 12 login session, the one that looks like this. 1. 2. 3. 4. 1a. Code: Select all sudo sed -i 's/NoDisplay=true/NoDisplay=false/g' /etc/xdg/autostart/*.desktop (Command explanation: changes the line "NoDisplay=true" to "NoDisplay=false" in all .desktop files in the autostart directory.) Before: After: If the "GNOME Login Sound" entry isn't showing on your list (and you want it to), try opening "libcanberra-login-sound.desktop" as root: gksu gedit /usr/share/gnome/autostart/libcanberra-login-sound.desktop ... and change "NoDisplay=true" to "NoDisplay=false" manually. 1b. Success: 1c. 1d. 1e. 1f. #!
Learn Code The Hard Way -- Books And Courses To Learn To Code practicing-programming - steveyegge2 Back in October I wrote an essay in which I compared programming to other professions. In it, I made the unsubstantiated claim that programming is unusual, in that most programmers don't practice their craft -- at least, not in any disciplined or regular way. Those are, of course, fightin' words, so I figured I'd write a bit more about it. This essay is a sort of mini-manual about practicing to be a better programmer. What exactly does it mean to practice becoming a better programmer? Well, of course the boring dictionary definition is: "To do or perform something repeatedly in order to acquire or polish a skill." If you're still awake after that mind-numbing paragraph, then I think you're ready to give it a try! Incidentally, I toyed with the idea of coining a new word for "study and practice", like I did with servware. Contrary to what you might believe, merely doing your job every day doesn't qualify as real practice. Smarts vs. We hire for smarts and for skills. OK, got it.
TCP Operational Overview and the TCP Finite State Machine (FSM) TCP Operational Overview and the TCP Finite State Machine (FSM)(Page 2 of 3) The Simplified TCP Finite State Machine In the case of TCP, the finite state machine can be considered to describe the “life stages” of a connection. Each connection between one TCP device and another begins in a null state where there is no connection, and then proceeds through a series of states until a connection is established. It remains in that state until something occurs to cause the connection to be closed again, at which point it proceeds through another sequence of transitional states and returns to the closed state. The full description of the states, events and transitions in a TCP connection is lengthy and complicated—not surprising, since that would cover much of the entire TCP standard. Table 151 briefly describes each of the TCP states in a TCP connection, and also describes the main events that occur in each state, and what actions and transitions occur as a result. Tap tap… still awake?
You're crap and paid too much for the little work you actually do 3 Big data security analytics techniques you can apply now to catch advanced persistent threats You’re not getting paid as well as you should. I know this not only because you’re bothering to read this, but also because most techies are crap at extracting cash from their employers. It shouldn’t shock you too much to learn that I, as a City headhunter and former contractor, focus quite hard on money - so here's a few ideas that will help you even in tough times. Continuous Visible Productivity The first thing you get wrong is spending too much time on things no one sees. Plan your work in terms of things other people can see; forget agile dependency modelling, GANTT, etcetera and prioritise with respect to how many useful people see the result. The joy of CVP is that its cynicism is so pure you can openly share it with your boss – he is under constant attack for the cost of IT which to “the business” seems so rarely to actually produce anything. Why you are paid Screwing up to get more money
The TCP/IP Guide The TCP/IP Guide Welcome to the free online version of The TCP/IP Guide! My name is Charles and I am the author and publisher. Here are a few tips, links and reminders to help you out: Introduction: Newcomers to The TCP/IP Guide may wish to read the Introduction and Guide to the Guide, which will explain what the Guide is about and provide you with useful information about how to use it. Last but definitely not least: this site is provided as an online reference resource for casual use. If you like The TCP/IP Guide enough to want your own copy in convenient PDF format, please license the full Guide. Thanks again and enjoy the site! Charles Home - Table Of Contents - Contact Us resources - What is the single most influential book every programmer should read Wykłady PW struktury danych, grafy, algorytmy Najbardziej znanym i rozpowszechnionym algorytmem wyszukiwania najkrótszych ścieżek w grafie z jednym źródłem jest algorytm Dijkstry. Został on opracowany w roku 1959r. przez jednego z najsłynniejszych pionierów informatyki - zajrzyjcie od razu do Wikipedii. Algorytm Dijkstry wyznacza najkrótsze ścieżki z jednego wybranego węzła (źródła) do pozostałych węzłów grafu. Bardzo ważnym warunkiem koniecznym do poprawnego działania tego algorytmu jest to, by wszystkie krawędzie grafu posiadały nieujemne wagi. W naszych rozważaniach będziemy zajmowali się grafami spójnym i nieskierowanymi, jednakże metoda Dijkstry działa również dla skierowanych grafów (które są tak naprawdę nadzbiorem grafów nieskierowanych). Poniżej przedstawiamy przykładowy graf z wyznaczonymi najkrótszymi ścieżkami z węzła znajdującego się w lewym-górnym rogu (o wartości etykiety równej 0): Metoda Dijkstry polega na wprowadzeniu podziału zbioru wierzchołków grafu na trzy zbiory: Idea omawianego algorytmu jest następująca.
The demise of the low level Programmer. « #AltDevBlogADay When I started programming many of the elements we take for granted now, did not exist. There was no DirectX and not many compatible libs were available for the free compilers of the day. So I had to write my own code for most basic programs, keyboard handlers, mouse handlers, video memory accessors, rasterizers, texture mappers, blitters… the programs I wrote then were 100% my own code and I had to be able to handle anything and everything. Personally I’ve always been interested in what was going on under the hood so this suited me just fine. I always dug into the details and I almost always end up programming as close to the bone ON the hardware (or OS) as I possibly can both to eek out as much performance as possible AND to satisfy my own hunger for knowledge. Over the last decade I’ve been involved in the hiring process at many studios and in more recent years I’ve noticed a pattern. It depresses me that so much of what I consider to be essential is simply not being taught anymore.
university lectures computer science Whether your goal is to earn a promotion, graduate at the top of your class, or just accelerate your life, lectures can help get you there. Our archives of lectures cover a huge range of topics and have all been handpicked and carefully designed by experienced instructors throughout the world who are dedicated to helping you take the next step toward meeting your career goals. Lifelong learns can turn their free time turn into self-improvement time. The online lectures on this list are more than lecture notes or a slideshow on a topic -- they were designed for audiences like you, with carefully sequenced themes and topics taught by veteran educators, and often with additional resources for your own independent study. The lectures are available to anybody, completely free of charge. Lecture courses are a valid and vital learning tool, and may be one of the best methods of learning available.