Perl developers step up to Marvell Mobylize $100K Challenge?

Marvell Technology Group Ltd has announced a $100K challenge to developers interested in making creative, innovative, and engaging educational applications for their $99 Android based ARM tablet. Aka the Moby Reference Platform. Note: this is the same reference design which the OLPC intends to use as the basis for the XO-3.

Will Perl developers enter the fray? Is Perl support in the Android Scripting Environment ready for prime time?

Application submissions will be accepted from Oct. 11th thru Nov. 11th. Winners will be chosen and awards given during the 2011 International Consumer Electronics Show in Las Vegas, January 6-9, 2011.

[From the Marvell $100K Challenge website:]

Start thinking now of your most creative ideas on developing the best tablet app for teaching children any one or more of the following subjects:
  • Math
  • Science
  • Vocabulary
  • Geography
  • Social studies
  • Grammar
  • Spelling
  • Other curriculum most common to children in Kindergarten all the way up to and including the 12th grade.

Marvell is providing a few general rules2 below to help you get started on your winning app which, at a minimum:

  • Must be education related – teaching new skills and target the K-12 classes.
  • Should include multi-lingual options and features for use by English and foreign students.
  • Must run on an Android™ platform
  • Must have a connectivity aspect – the app needs to be connected to the web for premium experience and performance
  • Must leverage a multi-touch and user friendly interface
  • Be comprised of less than 512MB
  • App preferences welcomed, but not required, may include:
    • a "social network" learning aspects such as learn with your school buddies or challenge the students online
    • "plug and play" programs
    • apps that connect with current school based programs like Blackboard™ and Moodle™.

More information regarding the contest will be released in the coming weeks. Sign up here to receive breaking updates.

Comments

Post a Comment

Popular posts from this blog

Raku: Advent of Code 2020 - Day Twelve

Below are my Raku solutions to Day Twelve puzzles for the 2020 Advent of Code. No effort was put into making things cleverly concise.  #!/usr/bin/env raku use v6.d ; my $face = 'E' ; my $c = <E S W N> ; # compass my %c = ( E => 0 , S => 1 , W => 2 , N => 3 ); # reverse lookup my ( $x , $y ) = ( 0 , 0 ); # ship location 'input' . IO . lines . map ({ my ( $direction , $qty ) = ( ~. substr ( 0 , 1 ) , +. substr ( 1 )); $direction = $face if $direction eq 'F' ; given $direction { when 'N' { $y += $qty } when 'S' { $y -= $qty } when 'E' { $x += $qty } when 'W' { $x -= $qty } when 'L' { my $i = %c { $face }; $i -= $qty div 90 ; $i = $i mod 4 ; $face = $c [ $i ]; } when 'R' { my $i = %c { $face }; $i += $qty div 90 ; $i = $i mod 4 ; $face = $c [ $i ]; } } }); say "Part One: { abs ( $x ) + abs ( $y )} " ...
Read more

Raku: Advent of Code 2020 - Day Thirteen

Raku solutions to Day Thirteen of the 2020 Advent of Code. Today's puzzle involved bus routes. Part One requires you to figure out which route id will arrive closest to a timestamp. The answer to Part Two involves identifying when an alignment of departure times across route ids will occur. #!/usr/bin/env raku use v6.d ; my ( $depart , $line ) = 'input' . IO . slurp . split ( " \n " ); $depart .= Int ; say "Part One: " ~ [*] $line . split ( ',' ) . grep ( none 'x' ) ». Int . map ({ $_ , $_ - ( $depart ) mod $_ }) . min ({ . [ 1 ] }) . flat ; # index of @l is the offset from factor my @l = $line . split ( ',' ); my ( $r , $factor ) = ( 0 , @l [ 0 ] . Int ); for 1 ..^ @l -> $i { next if @l [ $i ] eq 'x' ; $r = ( $r , { $_ + $factor } ... -> $a { ( $a + $i ) mod @l [ $i ] . Int == 0 }) . tail ; $factor *= @l [ $i ]; } say "Part Two: $r " ; Part One Given the sample inpu...
Read more

Raku: Advent of Code 2020 - Day Ten

Today's Advent of Code 2020 puzzle involves getting power (measured in jolts) to Santa's computing device from an outlet that provides 0 jolts. Santa's has some very special joltage adapters which act as step-up transformers. Each adapter can increase the joltage by up to 3 jolts. The input for the puzzle is a list of numbers representing the maximum joltage of each of Santa's adapters. And Santa's computing device has its own final adapter which is 3 jolts higher than the highest adapter in the bag. Below are Raku solutions to Day Ten's puzzle. I had a lot of fun getting Part One down to a minimal (obfuscated) 66 character short form solution: say lines ». Int . sort .& {(( |@ $_ ,. max + 3 ) Z- ( 0 ,|@ $_ )) . Bag .& { . { 1 } *. { 3 }}} Other than some typical boilerplate, the full length solution which follows isn't much longer. Though it is formatted a bit better for comprehension. Part Two and its challenge to calculate the count of all ...
Read more