January 2011 - Haskell

community.haskell.org down
by malcolm.wallace 26 Jan '11

26 Jan '11

The server community.haskell.org has been taken offline until further notice. There is a possibility the machine has been compromised. We were in any case planning to migrate from the current hosting provider to a new machine elsewhere. This event is simply forcing us to do so sooner than expected. We hope the service will be back online later this week. If anyone with linux sysadmin experience wishes to volunteer to help the migration, and hence to bring the new server up sooner, please make offers to haskell-infrastructure(a)community.galois.com. For obvious reasons, we will only accept offers if you are already reasonably well-known in the Haskell world. Regards, Malcolm

1 0

FW: For Haskell List: The F# Team are Hiring
by Simon Peyton-Jones 24 Jan '11

24 Jan '11

Dear Haskell'ers The F# team in Seattle/Redmond have an opening for a Senior Program Manager<https://careers.microsoft.com/JobDetails.aspx?ss=&pg=0&so=&rw=1&jid=33994&j…>. A demonstrated love for applied Haskell/OCaml/F# programming would be highly regarded background experience :) We also have positions open for software development engineers specializing in compilers and tools (see https://careers.microsoft.com/JobDetails.aspx?ss=&pg=0&so=&rw=3&jid=34078&j…) Kind regards & best wishes, Don Syme The F# Team are Hiring!!! * Do you have a love for modern, industry-leading programming technologies? * Can you help us take the F# language to the next level? * Do you have the vision to combine functional programming with technologies for data, cloud, web, finance and technical computing? * Do you have a passion for delivering great visual tools and a simple, clear end-to-end experience for F# programmers? * And do you want to work on a talented agile team that releases compiler sources on codeplex.com and has originated major innovations for C# and Visual Basic? If so, we have a great opportunity for you! The Visual Studio Pro team is looking for an experienced Program Manager to drive the F# area. Partnering with your engineering team in Redmond and Microsoft Research in Cambridge, you will define the F# developer experience for Visual Studio and out of band releases such as the F# PowerPack. As a strong customer advocate, you will drive changes into the F# language, libraries and tools. You will develop and update community programs that drive increased awareness and adoption of F#. Being responsible for delivering integrated solutions, you have experience in building strong cross-group partnerships, ensuring alignment of schedules and business goals, and the natural skill of getting things done. Specific responsibilities include: * Travelling to major conferences, user group meetings, and enterprises to get people excited about solving problems using F# * Defining the strategy for marketing F# to the developer community * Owning our content strategy and community engagement programs * Driving multiple concurrent projects for the F# team including Visual Studio and out of band releases * Working closely with groups within Microsoft such as Technical Computing, .NET Framework, SQL and Azure to deliver great experiences for F# developers * Contributing to the design of all aspects of F# from language & libraries to the tools that integrate with Visual Studio Basic Qualifications: * 3-5 years experience in Program Management or related experience, including a proven track record of delivering on challenging projects * A BS or equivalent degree in Computer Science, Electrical Engineering, or a related field. * Passionate for language and user experience design * Knowledge of Visual Studio, .NET & functional programming languages, and the ability to dig deep into technical challenges * Strong sense of teamwork, personal integrity, responsibility and accountability * Excellent verbal and written communication skills * Strong customer advocate, self-starter and problem solver * Strong knowledge of F# or language design on managed platforms is preferred If you'd would like more details, please either contact me (dsyme(a)microsoft.com<mailto:dsyme@microsoft.com>), or Sean Laberee (seanla(a)microsoft.com<mailto:seanla@microsoft.com>) directly. To apply immediately, please fill in the online forms<https://careers.microsoft.com/JobDetails.aspx?ss=&pg=0&so=&rw=1&jid=33994&j…> and drop us a note that you're applying. https://careers.microsoft.com/JobDetails.aspx?ss=&pg=0&so=&rw=1&jid=33994&j… don

1 0

Call for Submissions: Special Poetry and Fiction Edition of the Monad.Reader
by Brent Yorgey 20 Jan '11

20 Jan '11

Submissions are now being accepted for a special POETRY AND FICTION edition of the Monad.Reader. Poems about Haskell, short stories about Haskell, poems about poems about Haskell, elaborate monad tutorial allegories, Haskell/Dinosaur Comics crossovers: all fair game! If you want a bit of inspiration, check out the links at the end of this message [1,2,3]. But you are a creative bunch, I'm sure you can come up with all sorts of fun ideas and formats. The submission deadline will be **Friday, February 18** but feel free to send submissions at any time between now and then. Questions That May Be Asked Frequently (QTMBAF) ----------------------------------------------- Q. Are you serious? A. Absolutely. Q. The deadline is only four weeks away! It will take me at least five weeks to write my incredible masterpiece! A. Are you serious? Q. Will you take every submission or will there be some sort of selection process? A. I hope to publish every submission, although not without going through a process of editing and suggested revisions. Ultimately, it depends on the number of submissions. Q. Can I submit the same poem multiple times to increase my chances? A. I have written a sophisticated, 5000-line Haskell program to detect this and alter your submission in a subtle yet highly embarrassing (for you) way. Q. Seriously, this is a dumb idea. A. Please try to phrase your question in the form of a question. Q. Seriously, is this a dumb idea? A. No, I'm pretty sure it is awesome. Submission Details ------------------ Submissions should be sent to (byorgey at cis.upenn.edu) Simple text submissions are fine for short submissions such as poetry. For longer submissions, LaTeX is appreciated. See the guidelines here to get started: http://themonadreader.wordpress.com/contributing/ If submitting in LaTeX is a hardship, text submissions will be accepted. Submissions in Microsoft Word format will be deleted and then overwritten fifty times with random bits. [1] http://haskell.org/haskellwiki/Humor/Poetry [2] http://haskell.org/haskellwiki/Haiku [3] http://www.cis.upenn.edu/~byorgey/haskell-alphabet/index.html

1 0

Haskell Weekly News: Issue 165 - January 19, 2011
by Daniel Santa Cruz 20 Jan '11

20 Jan '11

Welcome to issue 165 of the HWN, a newsletter covering developments in the [1]Haskell community. This release covers the week of January 9 to 15, 2011. Announcements Brent Yorgey [2]announced the release of issue 17 of The Monad.Reader, containing the following three articles: List Leads Off with the Letter Lambda by Douglas M. Auclair, The InterleaveT Abstraction: Alternative with Flexible Ordering by Neil Brown, and The Reader Monad and Abstraction Elimination by Petr Pudlak. Andy Stewart [3]sent an invite to anyone interested in joining the Manatee team. Manatee is a Haskell integrated environment written in Haskell. Follow the link to see some videos posted for a better idea of what the tool is. Niklas Broberg [4]announced the release of version 1.10.1 of haskell-src-extensions. Huibiao Zhu [5]sent a call for papers to the 13th International Conference on Formal Engineering Methods to be held in Durham, UK on October 25-28 2011. Read on to see what was hot in the Haskell community around the net... Quotes of the Week * ion: ddarius: Yeah, abstract concepts absolutely hate being anthropomorphized. * gwern: there are no beginnings or ends to the circular list; but a cons cell thunked in Amador... * tac-tics: If you wish to create the universe from scratch, you must first invent the continuation. * sproingie: hm. Â i can't remember how to use @remember * NOTE: Just say @remember :) I'm grepping the logs to find these things * Kaidelong: <Kaidelong> take 6 "bananas" <lambdabot> "banana" <Kaidelong> clearly lambdabot is keeping the bananas to itself and lying about it * hpc: functor and applicative are easy, since you can remember them as "those things what look like function application, sort of" Top Reddit Stories * RFC: migrating GHC development to git Domain: haskell.org, Score: 51, Comments: 66 On Reddit: http://www.reddit.com/r/haskell/comments/ezgvs/rfc_migrating_ghc_developmen… Original: http://www.haskell.org/pipermail/glasgow-haskell-users/2011-January/019752.… * [CCC] On how Haskell’s Arrows are NOT just function compositions with a fancier name Domain: ro-che.info, Score: 38, Comments: 4 On Reddit: http://www.reddit.com/r/haskell/comments/f3e06/ccc_on_how_haskells_arrows_a… Original: http://ro-che.info/ccc/12.html * foldl vs foldl', and why you should always use the latter Domain: reddit.com, Score: 35, Comments: 8 On Reddit: http://www.reddit.com/r/haskell/comments/f25iv/foldl_vs_foldl_and_why_you_s… Original: http://www.reddit.com/r/haskell/comments/f150x/whats_wrong_with_my_haskell_… * ~Haskell 2011 Domain: haskell.org, Score: 32, Comments: 5 On Reddit: http://www.reddit.com/r/haskell/comments/ezmzh/haskell_2011/ Original: http://www.haskell.org/pipermail/haskell/2011-January/022497.html * The Monad.Reader: Issue 17 Domain: themonadreader.wordpress.com, Score: 30, Comments: 10 On Reddit: http://www.reddit.com/r/haskell/comments/ezft9/the_monadreader_issue_17/ Original: http://themonadreader.wordpress.com/2011/01/09/issue-17/ * Painless NP-complete problems: an embedded DSL for SMT solving Domain: donsbot.wordpress.com, Score: 27, Comments: 2 On Reddit: http://www.reddit.com/r/haskell/comments/f3fp6/painless_npcomplete_problems… Original: http://donsbot.wordpress.com/2011/01/16/painless-np-complete-problems-an-em… * Oregon Programming Languages Summer School: Types, Semantics, and Verification Domain: lists.seas.upenn.edu, Score: 22, Comments: 20 On Reddit: http://www.reddit.com/r/haskell/comments/f15rm/oregon_programming_languages… Original: http://lists.seas.upenn.edu/pipermail/types-announce/2011/002241.html * Announcing Web Application Interface 0.3.0 (now with more speed) Domain: docs.yesodweb.com, Score: 20, Comments: 2 On Reddit: http://www.reddit.com/r/haskell/comments/f0e6f/announcing_web_application_i… Original: http://docs.yesodweb.com/blog/announcing-wai-0-3/ * A bran new functional programming (Haskell inter alia) jobs site (corrected link) Domain: functionaljobs.com, Score: 19, Comments: 11 On Reddit: http://www.reddit.com/r/haskell/comments/ezqst/a_bran_new_functional_progra… Original: http://functionaljobs.com/ * [PDF] Orthogonal Serialization For Haskell Domain: mathematik.uni-marburg.de, Score: 17, Comments: 3 On Reddit: http://www.reddit.com/r/haskell/comments/f1o8t/pdf_orthogonal_serialization… Original: http://www.mathematik.uni-marburg.de/~berthold/papers/mainIFL10-withCopyrig… Top StackOverflow Questions * Monads as adjunctions votes: 15, answers: 3 Read on SO: http://stackoverflow.com/questions/4697320/monads-as-adjunctions * What is a VM and why do dynamic languages need one? votes: 11, answers: 8 Read on SO: http://stackoverflow.com/questions/4640809/what-is-a-vm-and-why-do-dynamic-… * Is Haskell a Lisp? votes: 9, answers: 5 Read on SO: http://stackoverflow.com/questions/4696618/is-haskell-a-lisp * Are there any connections between Haskell and LINQ? votes: 8, answers: 4 Read on SO: http://stackoverflow.com/questions/4683506/are-there-any-connections-betwee… * Haskell newbie on types votes: 7, answers: 4 Read on SO: http://stackoverflow.com/questions/4664429/haskell-newbie-on-types * I can't seem to figure out type variables mixed with classes. votes: 5, answers: 2 Read on SO: http://stackoverflow.com/questions/4653102/i-cant-seem-to-figure-out-type-v… * Emacs align-regexp on = but not == votes: 5, answers: 1 Read on SO: http://stackoverflow.com/questions/4653575/emacs-align-regexp-on-but-not * Current status of automatic parallelism in Haskell [closed] votes: 5, answers: 3 Read on SO: http://stackoverflow.com/questions/4701207/current-status-of-automatic-para… About the Haskell Weekly News You can find an html version of this newsletter at: http://contemplatecode.blogspot.com/2011/01/haskell-weekly-news-issue-165.h… To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. I'm in dire need of finding good "quotes of the week". If you happen to come across any, please don't hesitate to send it along. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18419 3. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/85224 4. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18427 5. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18428

1 0

ANNOUNCE: accentuateus-0.9 (A Haskell implementation of the Accentuate.us API)
by Michael Schade 19 Jan '11

19 Jan '11

Hey everyone, I'm extremely excited to have made my first upload to Hackage (http://hackage.haskell.org/package/accentuateus) It is an implementation of the Accentuate.us (http://accentuate.us/) API, which, using statistics, enables people to restore special characters ("diacritics") to otherwise plain text in over 100 languages. I have published it under BSD3 and am hosting it on GitHub (https://github.com/spearhead/hs-accentuateus) Unfortunately, even though I triple checked everything, I managed to mess up the part where it displays the Haddock documentation on Hackage, but I have discussed the overall usage in my the blog post (http://mschade.me/announcing-accentuateus-09-haskell-implementa) and in the README. I would love any feedback you guys have (though I understand that may need to be moved to blog comments or haskell-cafe). I have other Haskell projects underway, but I figured this would be a nice one to be a first release so that I can get some good feedback and improve both it and future projects. Thanks! Michael Schade http://mschade.me/

2 2

Mailing lists on projects.haskell.org?
by Erik de Castro Lopo 17 Jan '11

17 Jan '11

Hi all, I tried sending mail to the haskell-llvm mailing list (xxxx AT projects.haskell.org) several days ago and today I received a bounce message. Looking into the issue a little further, I find that DNS has no MX record for projects.haskell.org and projects.haskell.org doesn't seem to be listening on port 25. I would email the administrator, but that is also an @projects.h.o address and I doubt it would get through. Posting here in the hope that someone who sees this can fix it. Cheers, Erik -- ---------------------------------------------------------------------- Erik de Castro Lopo http://www.mega-nerd.com/

1 1

ANNOUNCE: Haskell binding to the ANTLR parser generator C runtime library
by Mark Wright 17 Jan '11

17 Jan '11

Hi, I'm pleased to announce the release of a Haskell binding to the ANTLR LL(*) parser generator C runtime library. The book on ANTLR is "The Definitive ANTLR Reference: Building Domain-Specific Languages" by Terence Parr: http://www.pragprog.com/titles/tpantlr/the-definitive-antlr-reference ANTLR is a very powerful parser generator. It has support for predicated parsing, where dis-ambiguating semantic predicates can be used to look up information in the symbol table to handle context sensitive programming languages. The lexing and parsing handled in C. The C parser actions call Haskell code to do things such as: - enter data into the symbol table - look up data in the symbol table to implement dis-ambiguating semantic predicates for parsing context sensitive programming languages. - create Abstract Symbol Table entries. The ANTLR parser generator site is at: http://antlr.org/ The Haskell binding to the ANTLR parser generator C runtime library is at: http://hackage.haskell.org/package/antlrc An example based on the implementation of arithmetic expressions example from "Types and Programming Languages" by Benjamin Pierce, chapter 4, is on github: https://github.com/markwright/antlrc-examples/tree/master/src/tapl/arith Building the example is somewhat challenging. I provide a Makefile, however it is specific to my system and will need to be customised. Documentation for the ANTLR C runtime library is at: http://www.antlr.org/wiki/display/ANTLR3/ANTLR3+Code+Generation+-+C Documentation for the ANTLR parser generator is at: http://www.antlr.org/wiki/display/ANTLR3/ANTLR+v3+documentation Thanks, Mark

1 0

[PAPP2011] Practical Aspects of High-Level Parallel Programming: last call for papers (deadline: January, 23)
by Frédéric Loulergue 16 Jan '11

16 Jan '11

Please accept our apologies for multiple copies of this email ---------------------------------------------------------------- Eighth International Workshop on Practical Aspects of High-Level Parallel Programming (PAPP 2011) ---------------------------------------------------------------- part of The International Conference on Computational Science June 1-3, 2011, Tsukuba, Japan http://www.papp-workshop.org AIMS AND SCOPE Computational Science applications are more and more complex to develop and require more and more computing power. Sequential computing cannot go further. Major companies in the computing industry now recognise the urgency of re-orienting an entire industry towards massively parallel computing. Parallel and grid computing are solutions to the increasing need for computing power. The trend is towards the increase of cores in processors, the number of processors and the need for scalable computing everywhere. But parallel and distributed programming is still dominated by low-level techniques such as send/receive message passing. Thus high-level approaches should play a key role in the shift to scalable computing in every computer. Algorithmic skeletons, parallel extensions of functional languages such as Haskell and ML, parallel logic and constraint programming, parallel execution of declarative programs such as SQL queries, genericity and meta-programming in object-oriented languages, etc. have produced methods and tools that improve the price/performance ratio of parallel software, and broaden the range of target applications. Also, high level languages offer a high degree of abstraction which ease the development of complex systems. Moreover, being based on formal semantics, it is possible to certify the correctness of critical parts of the applications. The PAPP workshop focuses on practical aspects of high-level parallel programming: design, implementation and optimisation of high-level programming languages, semantics of parallel languages, formal verification, design or certification of libraries, middle-wares and tools (performance predictors working on high-level parallel/grid source code, visualisations of abstract behaviour, automatic hot-spot detectors, high-level GRID resource managers, compilers, automatic generators, etc.), application of proof assistants to parallel applications, applications in all fields of computational science, benchmarks and experiments. Research on high-level grid programming is particularly relevant as well as domain specific parallel software. The aim of all these languages and tools is to improve and ease the development of applications (safety, expressivity, efficiency, etc.). Thus the PAPP workshop focuses on applications. The PAPP workshop is aimed both at researchers involved in the development of high level approaches for parallel and grid computing and computational science researchers who are potential users of these languages and tools. Topics We welcome submission of original, unpublished papers in English on topics including: * applications in all fields of high-performance computing and visualisation (using high-level tools) * high-level models (CGM, BSP, MPM, LogP, etc.) and tools for parallel and grid computing * high-level parallel language design, implementation and optimisation * practical aspects of computer assisted verification for high-level parallel languages * modular, object-oriented, functional, logic, constraint programming for parallel, distributed and grid computing systems * algorithmic skeletons, patterns and high-level parallel libraries * generative (e.g. template-based) programming with algorithmic skeletons, patterns and high-level parallel libraries * benchmarks and experiments using such languages and tools PAPER SUBMISSION AND PUBLICATION Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers will go through a rigorous reviewing process. Each paper will be reviewed by at least three referees. The accepted papers will be published in the Procedia Computer Science series, as part of the ICCS proceedings. Submission must be done through the ICCS website. We invite you to submit a full paper of at most 10 pages describing new and original results, no later than January 23, 2011. Submission implies the willingness of at least one of the authors to register and present the paper. Accepted papers should be presented at the workshop. IMPORTANT DATES * January 23, 2011 (extended and firm): Full paper due * February 20, 2011: Notification * March 7, 2011: Camera-ready paper due PROGRAMME COMMITTEE * Marco Aldinucci (University of Torino, Italy) * Jost Berthold (University of Copenhagen, Denmark) * Kento Emoto (University of Tokyo, Japan) * Frederic Gava (University Paris-East, France) * Alexandros Gerbessiotis (NJIT, USA) * Clemens Grelck (University of Amsterdam, Netherlands) * Hideya Iwasaki (The University of Electro-communications, Japan) * Roman Leshchinskiy (Standard Chartered Bank, UK) * Frederic Loulergue, chair (University of Orleans, France) * Bruno Raffin (INRIA, France) * Aamir Shafi (NUST, Pakistan)

1 0

ANN: extcore 1.0
by Tim Chevalier 15 Jan '11

15 Jan '11

Hello, I've recently released version 1.0 of extcore, a library for processing code in GHC's text-based External Core format. extcore includes a parser, prettyprinter, typechecker, and interpreter for External Core, as well as modules for computing module dependencies and combining multiple Core modules into a single module. The library was originally written by Andrew Tolmach and was part of the GHC distribution. After becoming its maintainer, about a year ago I moved the library to Hackage. Since in the past year, the library has acquired some users but has received no fatal bug reports, I thought it was time for a 1.0 release. You might be interested in using this library if you're a compiler or tool writer who wants to write a tool that processes the output of GHC's front-end and simplifier -- that is, code in the Core intermediate language, a typed functional language in which many of Haskell's features have been desugared into a polymorphically typed lambda-calculus (extended with type coercions, as are necessary to support type system features such as GADTs). Such tools might include alternative back-ends or new program transformations. Using the extcore library allows tool writers to experiment with implementing new compiler features without modifying GHC itself. While the GHC API is also a route to adding new stages to the GHC pipeline, using extcore has the advantage that External Core is well-specified (read on) and less subject to change than GHC's internal Core format. The library has been tested on External Core produced by GHC 6.10.* and GHC 6.12.*. It has not yet been tested on External Core produced by GHC 7.*. Documentation for the External Core format itself lives at http://www.haskell.org/ghc/docs/latest/html/ext-core/core.pdf - but documentation for the library is limited, and I would welcome documentation or other patches. Currently the best source of documentation for the library is the README file, found in the distribution. To get the distribution, please visit http://hackage.haskell.org/package/extcore or cabal install extcore. Please direct replies to glasgow-haskell-users(a)haskell.org, with me CCed. Please make sure not to reply to haskell(a)haskell.org. Cheers, Tim Chevalier -- Tim Chevalier * http://cs.pdx.edu/~tjc/ * Often in error, never in doubt "an intelligent person fights for lost causes,realizing that others are merely effects" -- E.E. Cummings

1 1

Call for Papers (TASE 2011)
by Huibiao Zhu 15 Jan '11

15 Jan '11

**************************************************************************** ********* TASE 2011 5th IEEE International Conference on Theoretical Aspects of Software Engineering *** Call For Papers *** August 29-31, 2011 Xi'an, China http://ictt.xidian.edu.cn/TASE2011/ **************************************************************************** ********* The 5th IEEE International Conference on Theoretical Aspects of Software Engineering (TASE 2011), sponsored by IEEE CS and IFIP, will be held in Xi'an, China in August, 2011. Large scale software systems and the Internet are of growing concern to academia and industry. This poses new challenges to the various aspects of software engineering, for instance, the reliability of software development, web-oriented software architecture and aspect and object-orientation techniques. As a result, new concepts and methodologies are required to enhance the development of software engineering from theoretical aspects. TASE 2011 is a forum for researchers from academia, industry and government to present ideas, results, and ongoing research on theoretical advances in software engineering. TASE 2011 is the fifth in a series of conference, sponsored by IEEE CS and IFIP. The first TASE conference was held in Shanghai, China, in June 2007. The second TASE conference was held in Nanjing, China, in June 2008. The third TASE conference was held in Tianjin, China, in June 2009, and the fourth TASE conference was held in Taipei, China, in October 2010. TASE 2011 will be held in Xi'an, China. Xi'an, the eternal city, records the great changes of the Chinese nation just like a living history book. So far, Xian enjoys equal frame with Athens, Cairo, and Rome as one of the four major ancient civilization capitals. It has many places of interest, such as Terra-cotta Warriors and Horses, City Wall, Bell Tower, Big Wild Goose Pagoda and so on. International Horticultural Exposition will be held in Xi'an in 2011. Topics of Interest Authors are invited to submit high quality technical papers describing original and unpublished work in all theoretical aspects of software engineering. Topics of interest include, but are not limited to: * Requirements Engineering * Embedded and Real-Time Systems * Program Analysis * Software Architectures and Design * Component-Based Software Engineeringg * Reverse Engineering and Software Maintenance * Aspect and Object Orientation * Type System and Theory * Dependable Concurrency * Automata and Temporal/Modal Logic * Petri Nets * Domain Theory * Type Theory * Process Algebra and Concurrency * Specification and Verification * Software Testing * Model-Driven Engineering * Software Processes and Workflows * Software Safety, Security and Reliability * Service-Oriented Computing * Semantic Web and Web Services * Program Logics and Calculus * Software Model Checking * Probability and Randomization * Game Theory * Theorem Proving * Static Analysis and Model Checking * Testing, Simulation and other Dynamic Analyses Submission Submission should be done through the TASE 2011 submission page, handled by the EasyChair conference system. The authors are requested to submit the abstract (100-300 words) by March 21, 2011, and the paper (up to 8 pages) by March 28, 2011. To do submission, visit EasyChair and register as a new member. A password will be sent by e-mail shortly. Using that password, log-in and proceed to the New Submission page, where the detailed instructions can be found. When submitting the abstract, tick the "Abstract Only" box nearly at the end of the page. After submission, the authors can update abstracts and papers as well as the authors' information using the EasyChair system until the deadline. The proceedings of the conference will be published by the IEEE Computer Society Press. Papers must be written in English and not exceed 8 pages in Two-Column IEEE format. Authors should use the IEEE latex style fyles for the two-column pro- ceedings format. The style files and instructions for using them is at http://www.ctan.org/tex-archive/macros/latex/contrib/IEEEtran/. (The file bare_conf.tex at http://www.ctan.org/tex-archive/macros/latex/contrib/IEEEtran/ may be used as a template). Submissions not accepted to the proceedings may be considered for poster presentation. Important Dates March 21, 2011: Title and abstract submission deadline March 28, 2011: Paper submission deadline April 25, 2011: Acceptance/rejection notification May 16, 2011: Final version due August 29 - 31, 2011: TASE 2011 Co-Chairs Luke Ong (Oxford University, UK) Zhenhua Duan (Xidian University, China)

1 0