Home | Read the Docs Creating Triangles in CSS « Jon Rohan’s Web Developer Field Guide I’ve come across a few techniques and tips in my career, while working at my last gig a co-worker pointed me to this technique. I believe this was originally discovered by the legendary Eric Meyer, but I couldn’t find much documentation about it on the web so I thought I would describe it here. How it works Few people realize when a browser draws the borders, it draws them at angles. As you can see there are triangles hidden in that square. With a little creativity and tweaking there are lots of shapes that can be made. Now for application: This is a classic chat bubble, no images used. 1 <div class="chat-bubble">2 Buongiorno! This technique doesn’t work in ie6 as is, mainly because ie6 doesn’t allow transparent borders, but there is a fix for that.
smspdu 1.0 SMS PDU encoding and decoding, including GSM-0338 character set. This library handles SMS-DELIVER and SMS-SUBMIT format PDUs, and includes full support for all data formats, flags and headers, and round-trips from PDU to object and back again. It also includes convenience APIs for constructing new PDUs from text or data. This library is very mature - it's been in production use for many years before the 1.0 release was made. The T39 functionality has been copied from the previous PyPI package with the same name as this library to provide some continuity. To decode a PDU on the command-line (using python2.7+), use: The first line re-displays the PDU with the various sections colourised. Users of versions of Python 2.6 will need to run "python -m smspdu.pdu". First the basics; encoding some text: >>> from smspdu import gsm0338 >>> c = gsm0338() >>> gsm_message = c.encode(u'test message') And decoding that message: The library also provides some functions for making text SMS-happy: gsm0338_safe
Chapter 11. Version Control System Git is a free & open source, distributed version control system designed to handle everything from small to very large projects with speed and efficiency. Every Git clone is a full-fledged repository with complete history and full revision tracking capabilities, not dependent on network access or a central server. Branching and merging are fast and easy to do. GitHub is a web-based hosting service for software development projects that use the Git revision control system. trick11.1.2. Download the binary: Git-1.7.9-preview20120201.exe [version 1.7.9]. Run this .exe file to install Git in P:\dev\apps\vcs\git with the following settings: Use Git Bash only. trickPress Windows Logo+Break keys to open the Windows System Properties. Verify the installation with git --version. Now mkdir P:\dev\data\repo\git where the new project repositories will be residing. trick11.1.2.1. Right-click on the shortcut for Git Bash and change → Start in from %HOMEDRIVE%%HOMEPATH% to W:\projects. Tip trick11.1.2.2. #!
"F**k It, Ship It" Robot Hall of Fame voting begins for class of 2012, Johnny 5 learns where BigDogs sit Robot Hall of Fame® Invites Public To Vote Online For Its Next Induction Class Induction Ceremony Will Be Oct. 23 at Pittsburgh's Carnegie Science Center PITTSBURGH, Aug. 20, 2012 /PRNewswire/ -- For the first time members of the general public will help select four robots for induction into the Robot Hall of Fame® from a slate of a dozen nominees. (Logo: ) The Robot Hall of Fame (RHOF), created in 2003 by Carnegie Mellon University, recognizes excellence in robotics technology. "The technology and art of robotics are advancing at an increasingly rapid rate and so the Robot Hall of Fame also must evolve," said Shirley Saldamarco, RHOF director and a faculty member at Carnegie Mellon's Entertainment Technology Center. People can vote for one robot in each of four categories: Education & Consumer; Entertainment; Industrial & Service; and Research. For Education & Consumer robots, the nominees are: In the Research category, the nominees are:
s 8 steps for fixing other people’s code Before or after you’re sharing your own code as open-source, you might find yourself itching to fix someone else’s code. Twelve months ago I made my first contribution to someone else’s project – I added some auto-generated tests to the AjaxScaffold project (now ActiveScaffold and no longer a rails generator). It was the first RubyGem I really investigated. Its always the same process Yesterday I created a patch for Merb : an update to their README file so it converted to RDoc nicely. The process was the same, I’m just better at it. Step-by-step So here’s how to fix other people’s code. 1. Open source software isn’t written by an army of coders, with a back up army of testers, documenters, and “Dummies Guide” book authors. So you find problems. 2. The modern Ruby community uses subversion/svn for their source repositories. The tricky part is “where is the repository?” Alternately, the project’s homepage/README file should tell you where the repository is. Finally, email the project owner.
NEPOMUK Ontologies The OSCAF ontologies derive from the contributions to a number of large-scale efforts, starting with the European project NEPOMUK (2006-2008), continuing with their adoption (and extension) by the KDE community (2009-2013), and their further extension by a second European project Digital.Me (2010-2013). NOTE: Specifications of all OSCAF ontologies and their versions are maintained. Accessing the specifications of an ontology below will lead you to the latest version, but earlier versions are accessible. The NEPOMUK project sought to realise a Social Semantic Desktop. Although designed to fulfill requirements for NEPOMUK, the first set of OSCAF ontologies were applied by other parties and communities. After 2009, reacting to a popular shift to an ubiquitous personal workspace brought on by an increase in smart and mobile devices, OSCAF ontologies were this time extended to move away from the desktop as the singular personal data source. Applications and Open-Source solutions
Music players of the next generation « thinkblobs I read this post and felt really inspired. It got me thinking about what music players of the next generation could look like. My first music player was iTunes 4 or maybe Winamp. My music collection could be counted on fingers and I never really used playlists (I still use them rarely). So my ideas for the next generation of music players: Someone implements rainct’s suggestion and it is also media player independent :)The volume goes up and down depending on how far you are from the computer (using some sort of algorithm which is used by say, blueproximity for locking the screen when you are away)Building on #1, sync popular tracks to the media player (hopefully players also get the same kind of stuff as #1).Remember the volume used for each track. And we need good speech recognition, soon. Like this: Like Loading...
Algorithm of the Week: Data Compression with Relative Encoding Overview Relative encoding is another data compression algorithm. While run-length encoding, bitmap encoding and diagram and pattern substitution were trying to reduce repeating data, with relative encoding the goal is a bit different. Indeed run-length encoding was searching for long runs of repeating elements, while pattern substitution and bitmap encoding were trying to “map” where the repetitions happen to occur. The only problem with these algorithms is that the input stream of data is not always constructed out of repeating elements. It is clear that if the input stream contains many repeating elements there must be some way of reducing them. It's hard to imagine how this stream of data can be compressed. Fortunately this isn’t true always. Here we have 39 characters and we can reduce them. Now we have a shorter string, but we can go even further by keeping only the first year. Now the volume of transferred data is reduced a lot (from 39 to 16 – more than 50%). Implementation 02.
Planet Mozilla Planète Xulfr.org